On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks
Top Cited Papers
- 1 March 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Communications and Networks
- Vol. 4 (1) , 59-70
- https://doi.org/10.1109/jcn.2002.6596934
Abstract
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. Wu and Li [1] proposed a simple and efficient distributed algorithm for calculating connected dominating set in ad hoc wireless networks, where connections of nodes are determined by geographical distances of nodes. In general, nodes in the connected dominating set consume more energy in order to handle various bypass traffics than nodes outside the set. To prolong the life span of each node, and hence, the network by balancing the energy consumption in the network, nodes should be alternated in being chosen to form a connected dominating set. In this paper, we propose a method of calculating power-aware connected dominating set. Our simulation results show that the proposed approach outperforms several existing approaches in terms of life span of the network.Keywords
This publication has 17 references indexed in Scilit:
- Energy-efficient communication protocol for wireless microsensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Routing and channel assignment for low power transmission in PCSPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Topology control of multihop wireless networks using transmit power adjustmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the construction of energy-efficient broadcast and multicast trees in wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- ON LOCALITY OF DOMINATING SET IN AD HOC NETWORKS WITH SWITCH-ON/OFF OPERATIONSJournal of Interconnection Networks, 2002
- Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networksIEEE Transactions on Parallel and Distributed Systems, 2002
- Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networksIEEE Communications Magazine, 2001
- Dynamic power management in wireless sensor networksIEEE Design & Test of Computers, 2001
- Power-aware routing in mobile ad hoc networksPublished by Association for Computing Machinery (ACM) ,1998
- The ARPA network design decisionsComputer Networks (1976), 1977