One-Hop Neighbor Transmission Coverage Information Based Distributed Algorithm for Connected Dominating Set
Parallel Architectures, Algorithms and Programming, International Symposium on (2010)
Dalian, Liaoning China
Dec. 18, 2010 to Dec. 20, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2010.64
Broadcast is very important for delivering messages in wireless sensor networks. In order to improve the efficiency of broadcast and re¬duce energy consumption, it is necessary to con¬struct a virtual backbone within the entire net¬work. Constructing a virtual backbone is identi¬cal with calculating connected dominating set. 1-hop neighbor node transmission coverage infor¬mation is used to calculate the minimum forwarding set distributively on each node of the network, and then the method of broadcasting information of minimal forwarding set is used to construct a connected dominating set. 1-hop neighbor transmission coverage information based distributed algorithm for connected domi¬nating set is designed to get a small connected dominating set, while minimizing the cost of en¬ergy and time in the implementation of the algo¬rithm. The simulation results show that the algo¬rithm has achieved its purpose, fast convergence, low transmission traffic and reasonable con¬nected dominating set.
Wireless Sensor Networks, 1-hop, Transmission Coverage, Connected Dominating Set
Y. Xiang, J. Zhang, T. Yang, Y. Tang and W. Wang, "One-Hop Neighbor Transmission Coverage Information Based Distributed Algorithm for Connected Dominating Set," Parallel Architectures, Algorithms and Programming, International Symposium on(PAAP), Dalian, Liaoning China, 2010, pp. 15-21.