Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Distributed Algorithm for Power Aware Connected Dominating Set for EfCcient Routing in Mobile Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Bhattacharjee, S. ; Indian Stat. Inst., Kolkata ; Tripathi, J. ; Mistry, O. ; Dattagupta, J.

Efficient routing in ad hoc mobile environment with an economic use of battery power is an important problem and conventional routing protocols are unsuitable there due to static choice of routing paths without consideration of remaining battery power of the nodes. In this paper, we propose a simple and efficient distributed algorithm for calculating power aware connected dominating set for Ad hoc wireless networks. To enhance the lifetime of each node, which will in turn enhance the lifetime of the network, energy consumption here is balanced among different nodes of the network. Nodes are alternated in being selected to become a member of connected dominating set, which would enhance the lifetime of the network. In our approach each node select another node as its dominating neighbor depending on the status vector of its neighbor set. The status of a node is calculated based on its node degree and remaining battery power. The algorithm has 0(Δ2) time complexity and O(m) message complexity, where Δ is the maximum node degree and m is the number of edges in the topology graph. The dominating sets we obtain are in general comparable in size to that obtained in [1]. We ensured mobility support in our algorithm and our simulation result shows that, under the condition of mobility better lifespan is obtained using our approach as compared to other power aware approach.

Published in:

Ad Hoc and Ubiquitous Computing, 2006. ISAUHC '06. International Symposium on

Date of Conference:

20-23 Dec. 2006