TITLE

Data Aggregation Tree Approach in AODV Protocol to Select Dynamic Route for Sensor Network

AUTHOR(S)
Subha, M.; Srividhyaprabha, S.
PUB. DATE
July 2012
SOURCE
International Journal of Computer Applications;7/15/2012, Vol. 50, p29
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
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.
ACCESSION #
79748159

 

Related Articles

  • Energy-Efficient and Reliable Routing Protocol for Wireless Sensor Networks. Kumar, Arvind; Sahu, Ravi Kant; Chauhan, Siddhartha // International Journal of Computer Applications;Apr2012, Vol. 43, p33 

    In WSNs routing of data consumes a lot of energy due to excessive flooding of packets. In the proposed EERP scheme routing is done on the basis of intensity of received signals. Unlike REEP, information packet is forwarded by only one source sensor node. The information packets are forwarded by...

  • An Energy-Heterogeneous Clustering Scheme to Avoid Energy Holes in Wireless Sensor Networks. Bencan, Gong; Jiang Tingyao; Xu Shouzhi; Chen Peng // International Journal of Distributed Sensor Networks;2013, p1 

    Clustering techniques can reduce energy consumption of nodes and increase the scalability of the network. However, in uniformly deployed clustering wireless sensor networks, the uneven distribution of communication loads often causes the energy-hole problem, which means that the energy of the...

  • Comparative Analysis of QoS-Aware Routing Protocols for Wireless Sensor Networks. Kumar, V. Naveen; Sankar, K. Siva; Rao, L. Srinivasa; Prabha, I. Santhi // Innovative Systems Design & Engineering;2012, Vol. 3 Issue 3, p100 

    The main ability of wireless sensor networks (WSNs) is communicating and sensing between nodes, which are deployed in a wide area with a large number of nodes. Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless...

  • Ant Colony Optimization Based Routing in Wireless Sensor Networks. Fathima, K. Syed Ali; Sindhanaiselvan, K. // International Journal of Advanced Networking & Applications;2013, Vol. 4 Issue 4, p1686 

    Wireless Sensor Networks consisting of nodes with limited power are deployed to gather useful information from the field. In WSNs it is critical to collect the information in an efficient manner. It is applied in routing and difficult power supply area or area that cannot be reached and some...

  • Long-Term Vibration Monitoring of Cable-Stayed Bridge Using Wireless Sensor Network. Khac-Duy Nguyen; Jeong-Tae Kim; Young-Hwan Park // International Journal of Distributed Sensor Networks;2013, p1 

    Wireless sensor networks provide a lot of advantages for vibration monitoring of bridges. The installation time and implementation cost of the monitoring system are greatly reduced by the adoption of this innovative technology. This paper presents a long-term vibration monitoring of the Hwamyung...

  • Research on Routing Protocol for Large-scale Wireless Sensor Networks. Zhang, Kai; Jin, Min // Applied Mechanics & Materials;2014, Issue 511-512, p146 

    Aimed at the application characteristics of the large-scale WSN, a new clustering routing protocol LEACH_CHMST is proposed in this paper. The multi-hop strategy for cluster-heads communication has been introduced instead of the one-hop strategy in LEACH, and a minimum spanning tree of...

  • Adaptive Scheduling and Routing Scheme for Delay Guarantee in Wireless Sensor Networks. Yan Sun; Cong Chen; Hong Luo // International Journal of Distributed Sensor Networks;2013, p1 

    In wireless sensor networks (WSNs), periodical sleeping scheme on sensor nodes is an effective way to save energy. However, it will hinder the capability of the network to provide real-time data reporting due to relay node being sleep. Motivated by this, we propose an adaptive scheduling and...

  • New Trends in Secure Routing Protocols for Wireless Sensor Networks. El-Semary, Aly Mohamed; Abdel-Azim, Mohamed Mostafa // International Journal of Distributed Sensor Networks;2013, p1 

    Recently, Wireless Sensor Networks (WSNs) have been deployed into a variety of applications including homeland security, military systems, and health care. Sensor nodes deployed in such networks are subject to several attacks such as sinkhole and select forwarding, wormhole, Hello flood, and...

  • PERFORMANCE ANALYSIS OF AN IMPROVED GRADED PRECISION LOCALIZATION ALGORITHM FOR WIRELESS SENSOR NETWORKS. Sarangi, Sanat; Kar, Subrat // International Journal of Computer Networks & Communications;Jul2010, Vol. 2 Issue 4, p150 

    In this paper an improved version of the graded precision localization algorithm GRADELOC, called IGRADELOC is proposed. The performance of GRADELOC is dependent on the regions formed by the overlapping radio ranges of the nodes of the underlying sensor network. A different region pattern could...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics