Abstract
Communication systems have been progressed tremendously in the past two decades. A large part of this success can be attributed to the discovery of various new algorithms in the wireless sensor networks. This paper proposes three new algorithms for routing by modifying the existing algorithm known as A-star algorithm to find the optimal path between the source and the destination nodes. This paper places a special emphasis on reducing the path length between the source and destination nodes which in turn reduce the execution time as well as the resource spent in finding the optimal path between the source and the destination node. The new algorithms proposed are named as diagonal A-star (DA*) which gives the diagonal path search ability to the existing A-star (A*) algorithm, bidirectional A-star (BIDA*) which gives the ability of traversing from both source and destination nodes at the same time hence reduces the execution time and the third algorithm known as diagonal-bidirectional combined which combines the ability of both; the above newly proposed algorithms propose a more optimized routing solution between the source and destination nodes.
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
References
Shankar T, Shanmugavel S, Rajesh A (2016) Hybrid HSA and PSO algorithm for energy efficient cluster head selection in wireless sensor networks, swarm and evolutionary computation. Elsevier Publisher, vol 30, pp 1–10, October 2016 (Article in Press)
Shankar T, Shanmugavel S (2014) Energy optimization in cluster based wireless sensor networks, Journal of Engineering Science and Technology, School of Engineering, Taylor’s University, vol 9, no 2, pp 246–260. ISSN 18234690
Rana K, Zaveri M (2011) A-star algorithm for energy efficient routing in wireless sensor network, trends in network and communications. Springer, Berlin, pp 232–241
AlShawi IS, Yan L, Pan W, Luo B (2012) Lifetime enhancement in wireless sensor networks using fuzzy approach and A-star algorithm. Sens J IEEE 3010–3018
Eappen G, Shankar T (2020) Hybrid PSO-GSA for energy efficient spectrum sensing in cognitive radio network. Phys Commun 101091
Eappen G, Shankar T (2018) Energy efficient spectrum sensing for cognitive radio network using artificial bee colony algorithm. Int J Eng Technol 7(4):2319–2324
Eappen G, Shankar T (2018) Optimization of two area AGC based power system using PSO tuned fuzzy PID controller and PSO trained SSSC and TCPS. Int J Eng Technol 7(4.10):163–168
Yao J, Lin C, Xie X, Wang A, Hung C-C (2010) Path planning for virtual human motion using improved A* star algorithm. In: 2010 Seventh International Conference on Information Technology: New Generations (ITNG), pp 1154–1158
Cui SG, Wang H, Yang L (2012) A simulation study of A-star algorithm for robot path planning. 16th international conference on mechatronics technology, pp 506–510
Shankar T, Shanmugavel S (2013) Hybrid approach for energy optimization in cluster based wireless sensor networks using Energy balancing clustering protocol. J Theor Appl Inf Technol (JTAIT) 49(3):906–921, 31 Mar 2013. ISSN: 1992-8645
Shankar T, Shanmugavel S, Karthikeyan A (2013) Modified harmony search algorithm for energy optimization in WSN. J Int Rev Comput Softw (IRECOS) 8(6)
Yao J, Lin C, Xie X, Wang AJ, Hung C-C (2010) Path planning for virtual human motion using improved A* star algorithm. In: 2010 Seventh International Conference on Information Technology: New Generations (ITNG), pp 1154–1158, 12–14 Apr 2010
Khantanapoka K, Chinnasarn K (2009) Pathfinding of 2D & 3D game real-time strategy with depth direction A* algorithm for multi-layer. SNLP ‘09. Eighth International Symposium on Natural Language Processing, 2009, pp 184–188, 20–22 Oct 2009
Zeng W, Church RL (2009) Finding shortest paths on real road networks: the case for A*. Int J Geogr Inf Sci 23(4):531–543
Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern SSC4. 4(2):100–107
Ye X, Han S-P, Lin A (2010) A note on the connection between the primal-dual and the A* Algorithm. Int’l J Oper Res Inf Syst 1(1):73–85
Likhachev M, Gordon G, Thrun S (2003) ARA*: Anytime A* search with provable bounds on sub-optimality. In: Thrun S, Saul L, Schölkopf B (eds), Proceedings of conference on Neural Information Processing Systems (NIPS), Cambridge, MA, 2003. MIT Press
Shankar T, Eappen G, Suresh V, Rajesh A, Mageshvaran R (2019) Contrast enhancement using quantile separation and Bi-Histogram equalization. In 2019 innovations in power and advanced computing technologies (i-PACT), vol 1. IEEE, pp 1–4
Shankar T, Karthikeyan A, Sivasankar P, Rajesh A (2017) hybrid approach for optimal cluster head selection in wsn using leach and monkey search algorithms. Journal of Engineering Science & Technology (JESTEC). The paper has been reviewed and accepted for publication in volume 12, issue 2 (February 2017)
Shankar T, Shanmugavel S, Karthikeyan A (2013) Hybrid approach for energy optimization in wireless sensor networks using PSO. Int Rev Comput Softw (IRECOS) 8(6)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Shankar, T., Eappen, G., Rajalakshmi, S. (2021). Optimized Routing Algorithm for Wireless Sensor Networks. In: Nalim, M.R., Vasudevan, R., Rahatekar, S. (eds) Advances in Automotive Technologies. Lecture Notes in Mechanical Engineering. Springer, Singapore. https://doi.org/10.1007/978-981-15-5947-1_8
Download citation
DOI: https://doi.org/10.1007/978-981-15-5947-1_8
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-5946-4
Online ISBN: 978-981-15-5947-1
eBook Packages: EngineeringEngineering (R0)