Research Article
Data Aggregation Tree Approach in Aodv Protocol to Select Dynamic Route for Sensor Network
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 50 - Issue 17 |
| Published: July 2012 |
| Authors: M. Subha, S. Srividhyaprabha |
10.5120/7865-1146
|
M. Subha, S. Srividhyaprabha . Data Aggregation Tree Approach in Aodv Protocol to Select Dynamic Route for Sensor Network. International Journal of Computer Applications. 50, 17 (July 2012), 29-31. DOI=10.5120/7865-1146
@article{ 10.5120/7865-1146,
author = { M. Subha,S. Srividhyaprabha },
title = { Data Aggregation Tree Approach in Aodv Protocol to Select Dynamic Route for Sensor Network },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 50 },
number = { 17 },
pages = { 29-31 },
doi = { 10.5120/7865-1146 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A M. Subha
%A S. Srividhyaprabha
%T Data Aggregation Tree Approach in Aodv Protocol to Select Dynamic Route for Sensor Network%T
%J International Journal of Computer Applications
%V 50
%N 17
%P 29-31
%R 10.5120/7865-1146
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Design an energy efficient data aggregation tree approaches sensor network using localized power efficient data aggregation protocols. Using LMST and RNG topologies approximate minimum spanning tree and calculate position and distance information of one hop neighbors. A new node is added or fails route maintenance procedure is executed. The shortest weighted path – based approaches, can achieve 90 percent of the upper bound on lifetime. AODV proposed algorithm to assess the node lifetime and link lifetime utilizing the dynamic nature of energy drain rate and relative mobility estimation rate of nodes. Using node lifetime and link lifetime algorithm select least dynamic route with the longest lifetime. On prediction AODV protocol is a loop – free routing and has self – starting in network behavior as node mobility, link fail and packet losses.
References
- Huseyin Ozgur Tan, Ibrahim Korpeoglu, Ivan Stojmenovic," Computing Localized Power-Efficient Data Aggregation Trees for Sensor Networks", IEEE Transaction on Parallel and Distributed Systems, Volume 22, No. 3, 2011.
- I. S. -J. Park and I. -R. Sivakumar, "Energy Efficient Correlated Data Aggregation for Wireless Sensor Networks," Int'l J. Distributed Sensor Networks, vol. 4, no. 1, pp. 13-27, 2008.
- Y. Wu , S. Fahmy, and N. B Shroff, "On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: Npcompleteness and Approximation Algorithm," Proc. IEEE INFOCOM, pp. 356-360, 2008.
- Xin Ming Zhang, Feng Fu Zou, En Bo Wang and Dan Keun Sung(2010). , " Exploring Dynamic Nature of Mobile Nodes For Predicting Route Lifetime in Mobile Ad Hoc networks", IEEE Transaction on Vehicular Technology, Volume 59,Number. 3,pp. 1567-1572.
Index Terms
Keywords