Enhanced Memory and Routing Management in Wireless Sensor Network Using ETR

G. Devika, Dr.vS. Ravimaran

Abstract


A packet not needs any routing table and route discovery operating cost to send a packet to the destination.The ZigBee tree routing has the primary drawback that a packet follows the tree topology.shortcut tree routing procedure that provides the near best routing path as well as maintains.The shortcut tree routing is to evaluate remaining hops from an chance source to the destination using the hierarchical addressing method in ZigBee.shortcut tree routing is totally circulated and compatible with ZigBee.It only utilizes addressing method and neighbor table with no any changes of the condition.ETR also uses links to other one-hop neighbors,if it is decided that this will lead to a shorter path. It is shown that such a decision can be made with minimum storage and computing cost by utilizing the address structure.

Keywords


Shortcut tree routing,Zigbee tree routing,Enhanced tree routing.

References


D.S.Johnson,J.K.Lenstra,and H.G.R. Kan,“The complexity of the network design problem” Networks, vol. 8, pp.279-285, 1978.

J.Ko,etal.,“Connecting low-pothis paper r and lossy networks to the internet,”IEEE Communications Magazine,pp. 96-101. [3]O.Gnawali,R.Fonseca,K.Jamieson,D.Moss,andP.Levis,“Collection tree protocol,”The 7th ACM Conference onEmbedded Networked Sensor Systems (SenSys),Berkeley,CA, 2009.[4]M.S.Pan,C-H.Tsai,and Y.C.Tseng,“The Orphan Problem in ZigBee Wireless Networks,” IEEE Transactions on Mobile Computing,vol. 8,2009,pp.1573-1584. [5]T.Kim,D.Kim,N.Park,S.Yoo,andT.S.Lopez,“Shortcut Tree Routing in ZigBee Networks,”The International Symposium on Wireless Pervasive Computing (ISWPC),San Juan,Puerto Rico, 2007.

C.E.Perkins and P.Bhagwat,“Highly dynamic Destination-SequencedDistance-Vectorrouting (DSDV)formobilecomputers,”SIGCOMM Computer Communications Review,vol. 24, 1994, pp.234-244. [7]D.B.Johnson and D.A.Maltz,“Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing,vol. 353,1996,p. 153–181.

V.D.Park,M.S.Corson,“A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” INFOCOM '97, Japan, 1997.

S.Chen,et al,“A Reliable Transmission Protocol forZigBee-BasedWirelessPatientMonitoring,”IEEE Transactions,vol. 16, no.1,pp. 6-16, 2012.

K.Akkaya,M.Younis,A survey on routing protocols for wireless sensor networks,Ad Hoc Networks,vol.3,Elsevier,2005. pp.325–349.

D.Braginsky,D.Estrin,Rumor routing algorithm for sensor networks, in: Proceedings of the First ACMInternational Workshop,Atlanda,GA,2002,pp. 22–31.

S.Lindsey,C.S.Raghavendra, PEGASIS: pothis paper r efficient gathering in sensor information systems, in: Proceedings of the IEEE Aerospace Conference, Big Sky, Montana, vol. 3, 2002, pp. 1125–1130.

K.Sohrabi et al, Protocols for self-organization of a wireless sensor network,IEEE Personal Communications 7(5) (2000)16–27.

K. Taehong,K.Daeyoung,P.Noseong,Y. Seong-eun,T.S. Lopez, Shortcut Tree Routing in ZigBee Networks,in:Proceedings of the Second International Symposium on Wireless Pervasive Computing,February2007.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




 


All Rights Reserved © 2012 IJARCSEE


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.