Power-Aware Broadcasting and Activity Scheduling in Ad Hoc Wireless Networks using Connected Dominating Sets

J. Wu, B. Wu (USA), and I. Stojmenovic (Canada)

Keywords

Abstract

In ad hoc mobile wireless networks, broad casting by flooding is usually very costly and will result in sub stantial redundancy and more energy consumption. Power consumption is an important issue since most mobile hosts operate on battery. Broadcasting based on a connected dom inating 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 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 connec tions of nodes are determined by their geographical distances. In general, nodes in the connected dominating set consume more energy to handle various bypass traffics than nodes out side the set. To prolong the life span of each node and, hence, the network by balancing the energy consumption in the sys tem, nodes should be alternated in being chosen to form a con nected dominating set. Activity scheduling deals with the way to rotate the role of each node among a set of given operation modes (dominating nodes versus dominated nodes). In this paper, we propose to apply power-aware connected dominat ing set notions to broadcasting and activity scheduling. The effectiveness of the proposed method in prolonging the life span of the network is confirmed through simulation.

Important Links:



Go Back


IASTED
Rotating Call For Paper Image