Approximation Algorithm for Relay Node Placement in Singled-Tiered Wireless Sensor Networks

2019 IEEE 4TH INTERNATIONAL CONFERENCE ON ADVANCED ROBOTICS AND MECHATRONICS (ICARM 2019)(2019)

引用 1|浏览4
暂无评分
摘要
Relay node placement in wireless sensor networks has potential application value in terms of establishing connected topologies, reducing data latency, and prolonging network life time. This paper studies the relay node placement problem which opts to deploy the optimum number of relay nodes into single-tiered WSN to meet network connectivity. We firstly draw on ideas of Delaunay Triangle and Voronoi Graph to construct neighbor components, then optimize the placement algorithm by means of Spanning tree and Steiner heuristic, finally combine all connected components for connectivity. The experiments show that our proposed algorithm can outperform other algorithms in terms of the number of relay nodes and average hop count with a reasonable time complexity.
更多
查看译文
关键词
connectivity, relay node placement, Steiner tree, wireless sensor network
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要