Power‐aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets

Publisher Website
Google Scholar
Abstract
In ad hoc mobile wireless networks, owing to host mobility, broadcasting is expected to be more frequently used to find a route to a particular host, to page a host, and to alarm all hosts. A straightforward broadcasting by flooding is usually very costly and will result in substantial redundancy and more energy consumption. Power consumption is an important issue since most mobile hosts operate on battery. Broadcasting based on a connected dominating set is a promising approach, where only nodes in the dominating set need to relay the broadcast packet. A set is dominating if all the nodes in the system are either in the set or are neighbors of nodes in the set. Wu and Li proposed a simple and efficient distributed algorithm for calculating connected dominating set in ad hoc wireless networks, where connections of nodes are determined by their geographical distances. In general, nodes in the connected dominating set consume more energy to handle various bypass traffic than nodes outside the set. To prolong the life span of each node and, hence, the network by balancing the energy consumption in the system, nodes should be alternately chosen to form a connected dominating set. Activity scheduling deals with the way of rotating the role of each node among a set of given operation modes (e.g. dominating nodes versus dominated nodes). In this paper, we propose to apply the notion of power‐aware connected dominating set to broadcasting and activity scheduling. The effectiveness of the proposed method in prolonging the life span of the network is confirmed through simulation. Copyright © 2003 John Wiley & Sons, Ltd.

This publication has 16 references indexed in Scilit: