A distributed algorithm for constructing energy-balanced connected dominating set in wireless sensor networks

Authors:
Zeng Yuanyuan;Jia Xiaohua;He Yanxiang
Affiliations:
Computer School, Wuhan University, Hubei Province, China.;Department of Computer Science, City University of Hong Kong, Hong Kong, China.;Computer School, Wuhan University, Hubei Province, China
Venue:
International Journal of Sensor Networks
Year:
2007

Citing 10
Cited 3

Unit disk graphs

Discrete Mathematics - Topics on domination
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
Wireless integrated network sensors

Communications of the ACM
On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Distributed Algorithm for Power Aware Minimum Connected Dominating Set for Routing in Wireless Ad Hoc Network

ICPPW '05 Proceedings of the 2005 International Conference on Parallel Processing Workshops
On greedy construction of connected dominating sets in wireless networks: Research Articles

Wireless Communications & Mobile Computing - RRM for Next-Generation Wireless and Mobile Communication Systems
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks

Journal of Global Optimization
Approximation Algorithms for Connected Dominating Sets

Algorithmica
A survey on sensor networks

IEEE Communications Magazine

Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy consumption considerations in dynamic wireless sensor networks with nodes and base stations mobility

International Journal of Sensor Networks
A survey of communication/networking in Smart Grids

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

One important characteristic of wireless sensor networks is stringent energy of sensor nodes. Constructing a Connected Dominating Set (CDS) as the backbone has been widely used as a topology control strategy to reduce the network communication overhead for wireless ad hoc and sensor networks. Previous methods are mostly designed to minimise the size of the backbone. However, the backbone nodes are easy to fall short of power and fail due to the heavy communication load. In this paper, we present a distributed energy-balanced CDS algorithm to balance energy consumption of the sensor nodes and prolong the network lifetime. The algorithm is with O(n) time complexity and O(n) message complexity. The simulation results show that our algorithm outperforms several existing algorithms in terms of network lifetime and CDS performance.