Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets
نویسندگان
چکیده
In ad hoc mobile wireless networks due to host mobility broadcasting is expected to be more frequently used to nd a route to a particular host to page a host and alarm all hosts A straight forward broadcasting by ooding 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 neighbors of nodes in the set Wu and Li proposed a simple and e cient 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 tra cs 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 alternated in being chosen to form a connected 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 In this paper we propose to apply power aware connected dominating set notions to broadcasting and activity scheduling The e ectiveness of the proposed method in prolonging the life span of the network is con rmed through simulation
منابع مشابه
A Transmission Range Reduction Scheme for Power-Aware Broadcasting in Ad Hoc Networks Using Connected Dominating Sets
In ad hoc wireless networks, due to node mobility, broadcasting is expected to be more frequent to update global route/network information. A straightforward broadcasting by flooding is usually very costly and will result in substantial redundancy and large energy consumption. Power consumption is an important issue since most mobile hosts operate on battery. Broadcasting based on a connected d...
متن کاملBroadcasting and Topology Control in Wireless Ad Hoc Networks
Network wide broadcasting in Mobile Ad Hoc Networks (MANET) provides important control and route establishment functionality for a number of unicast and multicast protocols. We present an overview of the recent progress of broadcasting and multicasting in wireless ad hoc networks. We discuss two energy models that could be used for broadcast: one is non-adjustable power and one is adjustable po...
متن کاملDistributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of Unit Disk Graphs which are known to realistically model wireless networks. Our distributed algorithms take into account the loss of messages due to contention from simultaneous interfering transmissions in the wireless medium. W...
متن کاملFast Distributed Well Connected Dominating Sets for Ad Hoc Networks
We present the first distributed algorithms for computing connected dominating sets (CDS) for ad hoc networks that break the linear-time barrier. We present two algorithms which require O(∆ log n) and O(log n) running time respectively, where ∆ is the maximum node degree and n is the size of the network. This is a substantial improvement over existing implementations, all of which require Ω(n) ...
متن کاملDepth First Search-based and power-aware geo-routing in ad hoc and sensor wireless networks
Depth First Search (DFS) and position-based routing algorithms were proposed in literature. These are localised algorithms that guarantee the delivery for connected ad hoc and sensor wireless networks modelled by arbitrary graphs, including inaccurate location information for a destination node. This article first optimises an existing DFS-based routing scheme by eliminating from the candidate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Wireless Communications and Mobile Computing
دوره 3 شماره
صفحات -
تاریخ انتشار 2003