By Topic

Power-aware dominating set calculations in mobile ad hoc wireless networks with unidirectional links

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
$33 $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

2 Author(s)
H. Mahmoud ; Fac. of Eng., Ain Shams Univ., Cairo, Egypt ; A. Fahmy

A wireless network is composed of a set of autonomous mobile hosts. Each host has a transmission radius and energy level that are combined to determine its ability to transmit (receive) messages to (from) other peers in the network. Many algorithms have been proposed for dominating set calculations in Ad hoc wireless networks. In this paper we present an algorithm that could be applied to a network with unidirectional links taking power consumption, recharging, failures to recharge, and mobility into consideration. Since power consumption in nodes forming the dominating set is higher than in other nodes, our algorithm uses a selection scheme based on the energy level of each node and therefore changes the dominating set dynamically. This of course aims at extending the life span of a node, therefore extending the life span of the whole network. Our dominating set only consists of nodes that act as gateways for the network. This is done in order to minimize the selected dominating set and as a consequence minimize the consumed energy.

Published in:

Electronics, Circuits and Systems, 2003. ICECS 2003. Proceedings of the 2003 10th IEEE International Conference on  (Volume:3 )

Date of Conference:

14-17 Dec. 2003