3.8 Proceedings Paper

Assessment of Different Algorithms to Solve the Set-Covering Problem in a Relay Selection Technique

出版社

IEEE

关键词

Relay selection; Set-covering problem; Wireless sensor network

资金

  1. CAPES, The Brazilian Agency for Higher Education, under the project PrInt CAPES-UFSC Automation 4.0
  2. CNPqBrazil [870048/2007-4]
  3. FCT/Portugal [UIDB/50022/2020]

向作者/读者索取更多资源

The use of adequate relay selection techniques is crucial to improve the behavior of cooperation based approaches in Wireless Sensor Networks (WSN). The Optimized Relay Selection Technique (ORST) is a relay selection technique that may be reduced to the application on classic set-covering problem (SCP) to WSN. The SCP seeks to find a minimum number of sets that contain all elements of all data sets. The SCP can be solved with different types of algorithms. This paper assesses the performance and quality of three different algorithms to solve the SCP generated by the previously proposed ORST technique, considering performance metrics relevant within WSNs context. The analysis was performed by simulation using the OMNeT++ tool and the WSN framework Castalia. The simulation results show that the branch and bound algorithm excels when compared to other state-of-the-art approaches.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据