Connected dominating sets in wireless sensor networks

Authors:
Lili Zhang;Chengming Li;Yingchi Mao;Lizhong Xu;Huibin Wang
Affiliations:
College of Computer Science and Inforrmation Engineering, Hohai University and State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, P.R.China;College of Computer Science and Inforrmation Engineering, Hohai University, Nanjing, P.R.China;College of Computer Science and Inforrmation Engineering, Hohai University, Nanjing, P.R.China;College of Computer Science and Inforrmation Engineering, Hohai University, Nanjing, P.R.China;College of Computer Science and Inforrmation Engineering, Hohai University, Nanjing, P.R.China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 6
Cited 0

Class Steiner trees and VLSI-design

Discrete Applied Mathematics - Special volume on VLSI
On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
System architecture directions for networked sensors

ACM SIGPLAN Notices
Virtual backbone construction in multihop ad hoc wireless networks: Research Articles

Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
Minimum connected dominating sets and maximal independent sets in unit disk graphs

Theoretical Computer Science
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Since there is no fixed infrastructure or centralized management in wireless sensor networks, a Connected Dominating Set(CDS) has been proposed to serve as a virtual backbone. The CDS of a graph representing a network has a significant impact on the efficient design of routing protocols in wireless sensor networks. This problem has been studied extensively, in which all nodes have the same transmission ranges and the size of the dominating sets are considered. In this paper, by the method of constructing the steiner tree, we model a network as an undirected graph and present the CDS which has smaller size. The performance ratio of these algorithms is constant. Furthermore, we show a size relationship between a maximal independent set and a CDS as well as a bound of the maximum number of independent neighbors of a node. The theoretical analysis and simulation results are also presented to verify our approaches.