Abstract
Routing in Wireless Sensor Networks contains challenges, including limited energy constraints, network density, wireless channel errors. Different approaches exist in literature to overcome these challenges, such as data centric, location based and hierarchical routing. Most routing protocols in Wireless Sensor Networks are dealing with energy efficiency and network lifetime. In this paper, we present a shortest path routing algorithm based on Chandy-Misra’s distributed shortest path algorithm regarding both node weight and edge weight. X percent of edge’s weight and (100 - X) percent of node’s weight form a total cost between neighbor and source node which is used in order to generate the shortest paths and construct a spanning tree. Variation of X percent, node weight and edge weight provide resilience for shaping needed paths and change the spanning tree’s structure. When at least one node is close to critical energy level or a fault occurs, the routing algorithm is re-executed and new paths are generated. In order to obtain energy efficient paths, high network lifetime and finding out the overheads, we analyze the simulation results by assigning the battery level to node weight, communication cost to edge weight and %10, %30, %60 and %80 to X separately.
This is a preview of subscription content, log in via an institution to check access.
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
Bharathidasan, A., Ponduru, V.A.S.: Sensor Networks: An Overview. IEEE Potentials 22(2), 20–23 (2003)
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Elsevier Computer Networks (2001)
Akkaya, K., Younis, M.: A Survey on Routing Protocols for Wireless Sensor Networks. Elsevier Ad Hoc Network Journal (2005)
Chatzigiannakisa, I., Kinalisa, A., Nikoletseas, S.: Fault-tolerant and efficient data propagation in wireless sensor networks using local, additional network information. Journal of Parallel and Distributed Computing (2006)
Boukerche, A., Martirosyan, A., Pazzi, R.: An Inter-cluster Communication based Energy Aware and Fault Tolerant Protocol for Wireless Sensor Networks. Mobile Network and Applications (2008)
Heinzelman, W., Kulik, J., Balakrishnan, H.: Adaptive protocols for information dissemination in wireless sensor networks. In: Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 1999), Seattle, WA (August 1999)
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000), Boston, MA (August 2000)
Xu, Y., Heidemann, J., Estrin, D.: Geography-informed energy conservation for ad hoc routing. In: Proceedings of the 7th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2001), Rome, Italy (July 2001)
Rodoplu, V., Ming, T.H.: Minimum energy mobile wireless networks. IEEE Journal of Selected Areas in Communications 17(8), 1333–1344 (1999)
Li, L., Halpern, J.Y.: Minimum energy mobile wireless networks revisited. In: Proceedings of IEEE International Conference on Communications (ICC 2001), Helsinki, Finland (June 2001)
Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: Energy-efficient communication protocol for wireless sensor networks. In: Proceeding of the Hawaii International Conference System Sciences, Hawaii (January 2000)
Lindsey, S., Raghavendra, C.S.: PEGASIS: power efficient gathering in sensor information systems. In: Proceedings of the IEEE Aerospace Conference, Big Sky, Montana (March 2002)
Chang, J.-H., Tassiulas, L.: Maximum lifetime routing in wireless sensor networks. In: Proceedings of the Advanced Telecommunications and Information Distribution Research Program (ATIRP 2000), College Park, MD (March 2000)
Ye, F., et al.: A scalable solution to minimum cost forwarding in large scale sensor networks. In: Proceedings of International Conference on Computer Communications and Networks (ICCCN), Dallas, TX (October 2001)
Chandy, K.M., Misra, J.: Distributed Computation on Graphs: Shortest Path Algorithms. Communications of ACM (November 1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yilmaz, O., Erciyes, K. (2010). Distributed Weighted Node Shortest Path Routing for Wireless Sensor Networks. In: Özcan, A., Chaki, N., Nagamalai, D. (eds) Recent Trends in Wireless and Mobile Networks. WiMo 2010. Communications in Computer and Information Science, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14171-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-14171-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14170-6
Online ISBN: 978-3-642-14171-3
eBook Packages: Computer ScienceComputer Science (R0)