Fast track article: EEDTC: Energy-efficient dominating tree construction in multi-hop wireless networks

Authors:
Ruiyun Yu;Xingwei Wang;Sajal K. Das
Affiliations:
Computing Center, Northeastern University, Shenyang 110004, China;College of Information Science and Engineering, Northeastern University, Shenyang 110004, China;Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX 76013, USA
Venue:
Pervasive and Mobile Computing
Year:
2009

Citing 16
Cited 2

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
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
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Spine routing in ad hoc networks

Cluster Computing
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
Propagation and Leader Election in a Multihop Broadcast Environment

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
A Timer-based Protocol for Connected Dominating Set Construction in IEEE 802.11 Multihop Mobile Ad Hoc Networks

SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
On Constructing k-Connected k-Dominating Set in Wireless Networks

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs

IEEE Transactions on Computers
Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges

IEEE Transactions on Mobile Computing
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges

IEEE Transactions on Mobile Computing
On approximation algorithms of k-connected m-dominating sets in disk graphs

Theoretical Computer Science
Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks

IEEE Transactions on Computers

FEED: fault tolerant, energy efficient, distributed clustering for WSN

ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Network capacity analysis for code propagation in Wireless Sensor Networks

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by reducing communication overhead and prolonging network lifetime in multi-hop wireless networks, we propose an energy-efficient dominating tree construction (EEDTC) algorithm to construct a dominating tree that can serve as a communication backbone in wireless infrastructures. The algorithm uses k-hop neighbors' information (k@?[1,D"G], where D"G is the diameter of graph G). EEDTC has a theoretical approximation factor of at most 9. When k is equal to 1, it has O(n) message complexity and O(@?n^1^-^1^/^D^"^G@?-1) time complexity. Due to the low message complexity, EEDTC performs well on energy consumption. The energy-aware ranking technique that is introduced can also balance energy consumption in the network, and hence reduce the probability of network failures caused by energy depletion of backbone nodes.