STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
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
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
SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
Extended Multipoint Relays to Determine Connected Dominating Sets in MANETs
IEEE Transactions on Computers
Hi-index | 0.00 |
Motivated by reducing communication overhead and prolonging network lifetime in wireless ad hoc and sensor 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 has a theoretical approximation factor of at most 9, and has O(n) message complexity and O(n) time complexity. Due to the low message complexity, EEDTC performs well on energy consumption. The energy-aware ranking technique introduced can also balance energy consumption in the network, and hence reduce the probability of network failures caused by energy depletion of backbone nodes.