International Journal of Technology Enhancements and Emerging Engineering Research (ISSN 2347-4289)

IJTEEE >> Volume 2 - Issue 5, May 2014 Edition

International Journal of Technology Enhancements and Emerging Engineering Research  
International Journal of Technology Enhancements and Emerging Engineering Research

Website: http://www.ijteee.org

ISSN 2347-4289

Packet Attribute Data Aggregation In Wireless Sensor Networks Using Potential Based Dynamic Routing

[Full Text]



Suganya M.S, Sahaya Stalin Jose G.



Index Terms: Wireless sensor Networks, Data Aggregation, Dynamic routing



Abstract: Data sampled by sensor nodes have huge redundancy,data aggregation becomes an valuable technique to remove redundancy, reduce the number of transmission, and then to save power. The packets from distinctive applications can be aggregated by, introducing the idea of packet attribute, which is used to recognize the packets from distinctive applications according to particular necessities. Then propose an attribute aware data aggregation (ADA) which can create the packets with the related attribute convergent as much as possible. Potential Based Dynamic Routing(PBDR) is elaborated to put up with an ADA strategy shortest path. There is a chance for path crash in PBDR. Caching Based Dynamic Routing is designed for recover consistency. CBDR achieves availability by incorporating not only an inventive content file available in storage space but also every copies in caches into the routing process. Especially, it adaptably takes into relation copies in caches which tend to have a superior volatile performance due to a replacement scheme. Thus Caching Based Dynamic Routing (CBDR) provides consistent move of the aggregated packets to the sink node along the shortest path.



[1]. Ahmed E., Abdulla,Jie Yang(2012)”HYMN: A Novel Hybrid Multi-Hop Routing Algorithm to Improve the Longevity of WSNs” IEEE transactions on wireless communication vol:11,No:6,pp:2531-2542.

[2]. Chiara Petrioli(2013) ”ALBA-R:Load Balancing Geographic Routing Around Connectivity Holes”. IEEE transaction on parallel and distributed systems.vol:33 no:6

[3]. Degan Zhang, Guang Li(2013)”An Energy-Balanced Routing Method Based on Forward aware Factor for WSNs” IEEE transaction on sensors vol:14,no.6,pp:888-899.

[4]. Jin Woo Jung and Mary Ann Weitnauer (2012) “On Using Cooperative Routing for Lifetime Optimization of Multi-Hop Wireless Sensor Networks”. IEEE transaction on communication vol 45 no.9 pp 1-11.

[5]. Lei Shah and Sajal J.Das(2013)”R3E Reliable Reactive Routing Enhancement for Wireless Sensor Networks”.IEEE transaction on sensors.vo:6 no:7,pp:34-78.

[6]. Park S. and Sivakumar R.(2008) “Energy Efficient Correlated Data Aggregation for Wireless Sensor Networks,” IEEE transactions on communication ,pp 1-14.

[7]. Regina Borges(2013)”DRINA: A Lightweight and Reliable Routing approach for In-Network aggregation in Wireless Sensor Networks” .IEEE transactions on computers vol. 62, no. 4 ,pp 676-690.

[8]. Rodrigo Palucci, Pantoni,Dennis Brand(2013)”A gradient based routing scheme for street lighting wireless sensor networks”. IEEE transaction on system vol 9,no:8

[9]. Sheng-Shih Wang, and Ze-Ping Chen(2013) “LCM: A Link-Aware Clustering Mechanism for Energy-Efficient Routing in Wireless Sensor Networks” IEEE SENSORS JOURNAL, VOL. 13, NO. 2 pp 728-737.

[10]. Xiao Chen, Zanxun Dai(2013)”ProHet: A Probabilistic Routing Protocol with Assured Delivery Rate in Wireless Heterogeneous Sensor Networks” IEEE transactions on wireless communications,vol:12,no:4,pp:1524-1532.

[11]. Xiumin Wang, Jianping Wang(2013) “GKAR: A Novel Geographic K-Any cast Routing for Wireless Sensor Networks “IEEE transaction on parallel and distributed systems, VOL. 24, NO. 5,pp 916-934.`