Mobile Ad-hoc Networks |
Foundation of Computer Science USA |
MANETS - Number 4 |
None 2010 |
Authors: S.Anandamurugan, C.Venkatesh |
8c64b1da-a276-4493-ae3a-020adb59967a |
S.Anandamurugan, C.Venkatesh . Increasing the Lifetime of Wireless Sensor Networks by using AR (Aggregation Routing) Algorithm. Mobile Ad-hoc Networks. MANETS, 4 (None 2010), 180-186.
In this paper, We identified several advantages of a heterogeneous archi¬tecture for wireless sensor networks (WSNs) .It consists of some re¬source rich mobile relay nodes and a many number of simple undynamic nodes. The mobile relays have high energy than the undynamic nodes. The mobile relays can dynamically move around the entire network and help relieve sensors that are highly burdened by heavy network traffic, thus improving the lifetime. We first analyze the performance of a large dense network with one mobile relay and show that network lifetime improves over that of a purely undynamic network by up to a factor of five. Also, the mobile relay needs to stay only within a two-hop radius of the sink. We then construct a AR (Aggregation Routing) Algorithm which gives a network lifetime close to the maximum limit. The benefit of this algorithm is that it only re¬quires a minimum number of nodes in the network to be known of the location of the relay. Our simulation results show that one mobile relay can at least improve the network lifetime in a randomly deployed WSN. By comparing the mobile relay approach with var¬ious undynamic energy-provisioning methods, we explain the im¬portance of node mobility for resource provisioning in a WSN.