Abstract
We study tree-based routing protocols for wireless sensor networks. The existing tree-based algorithm has a few shortcomings; (1) it may take a long path since sensor node must transmit packets via either its parent or its children nodes and (2) it is vulnerable to a link failure since the tree has to be reconstructed in case of a single link failure. We propose Plus-Tree, a routing protocol, which overcomes the shortcomings and improves the performance of the existing protocol. A node in Plus-Tree may have neighbor links other than tree links that can be used for alternative path. Simulation results show that Plus-Tree performs better than the existing tree-based protocol with respect to hop counts.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Perkins, C., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. Computer Communications Review, 234–244 (1994)
Clausen, T., Jacquet, P., Laouiti, A., Minet, P., Muhlethaler, P., Qayyum, A., Viennot, L.: (Op-timized Link State Routing Protocol (OLSR)) IETF MANET, Internet Draft
Murthy, S., Garcia-Luna-Aceves, J.J.: An Efficient Routing Protocol for Wireless Networks. MONET 1, 183–197 (1996)
Perkins, C., Royer, E.M., Das, S.R.: (Ad Hoc On-Demand Distance Vector Routing (AODV)) IETF 3561
Johnson, D.B., Maltz, D.: Dynamic Source Routing in Ad-Hoc Wireless Networking. Mobile Computing (1996)
Haas, Z.J., Pearlman, M.R.: Providing Ad-hoc Connectivity with the Reconfigurable Wireless Networks. In: ACM SIGCOMM (1998)
Liang, B., Haas, Z.J.: Hybrid Routing in Ad Hoc Networks with a Dynamic Virtual Back-bone. IEEE Transactions on Wireless Communicaitons 5 (2006)
Kulik, J., Heinzelman, W.R., Balakrishnan, H.: Negotiation-Based Protocols for Disseminat-ing Information in Wireless Sensor Networks. Wireless Networks 8, 169–185 (2002)
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks. In: Mobile Computing and Networking (MOBICOM’2000) (2000)
Braginsky, D., Estrin, D.: Rumor Routing Algorithm for Sensor Networks. In: Workshop on Sensor Networks and Applications (WSNA) (2002)
Karp, B., Kung, H.T.: GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. In: Mobile Computing and Networking (MOBICOM’2000), pp. 243–254 (2000)
Xu, Y., Heidemann, J., Estrin, D.: Geography-informed Energy Conservation for Ad Hoc Routing. In: Mobile Computing and Networking (MOBICOM’2001), pp. 70–84 (2001)
Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-Efficient Communication Protocol for Wireless Microsensor Networks. In: IEEE Hawaii In-ternational Conference on System Sciences (2000)
Lindsey, S., Raghavendra, C.S.: PEGASIS: Power-Efficient Gathering in Sensor Information Systems. In: IEEE Aerospace Conference, vol. 3, pp. 1125–1130 (2002)
Hester, L., Huang, Y., Allen, A., Andric, O., Chen, P.: neuRFon Netform: A Self-Organizing Wireless Sensor Network. In: IEEE ICCCN Conference (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, Y., Jung, ES. (2007). Plus-Tree: A Routing Protocol for Wireless Sensor Networks. In: Szczuka, M.S., et al. Advances in Hybrid Information Technology. ICHIT 2006. Lecture Notes in Computer Science(), vol 4413. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77368-9_62
Download citation
DOI: https://doi.org/10.1007/978-3-540-77368-9_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77367-2
Online ISBN: 978-3-540-77368-9
eBook Packages: Computer ScienceComputer Science (R0)