Energy Efficient Dynamic Cluster Algorithm for Ad-Hoc Sensor Networks

DSpace/Manakin Repository

Search OPUS

Advanced Search


My Account

Show simple item record Wei, Dali. en_AU Chan, H. Anthony. en_AU 2007-03-12T22:05:39Z 2012-12-15T02:29:47Z 2007-03-12T22:05:39Z 2012-12-15T02:29:47Z 2007-03-12T22:05:39Z
dc.description.abstract Power consumption is a crucial problem for energy-constrained ad hoc sensor networks. This paper proposes a new scheme called energy distributed algorithm to improve the energy efficiency of ad hoc sensor networks, in which all data is usually sent to data sink for further analysis. In this algorithm, the network is divided into many circles with a data sink in the center of all circles other than the first layer circle around the data sink, creating a cycle, and each circle is divided into many sub-sections called sectors. Energy distributed algorithm improves energy efficiency using three methods. (1) In each sector, only one node is active at any time. Energy is then saved by putting other nodes in the sector into sleep state. (2) Only one route from the source to the destination is available. Energy is then saved by reducing floods in route discovery and avoiding duplicated data transmission by multiple routes. (3) Each circle has the same lifetime. Power consumption is then completely distributed in the entire network and all energy in the network can be efficiently used. One-dimensional and two-dimensional scenarios show that energy distributed algorithms improve energy efficiency for ad hoc sensor networks. en_AU
dc.format.extent 500119 bytes
dc.format.mimetype application/pdf
dc.language.iso en_AU
dc.title Energy Efficient Dynamic Cluster Algorithm for Ad-Hoc Sensor Networks en_AU
utslib.copyright.status Open Access

Files in this item

This item appears in the following Collection(s)

Show simple item record