| Abstract |
Background: A Wireless Sensor Network (WSN) consists of a large number of sensor nodes deployed randomly over an area that can sense the surrounding environment to gather some data and interconnect over a wireless channel to share the information with neighboring nodes or with some users over the internet. WSN has a wide range of applications in the field of military, healthcare, industry, agriculture, livestock farming, and smart cities. The pertinence of WSN in healthcare, de-fense, agriculture, and industry is discussed in detail in the background section of this paper.Objective: The objective of this paper is to examine and simulate Dijkstra’s Algorithm, Bellman Ford’s Algorithm, and Floyd-Warshall’s Algorithm applied for routing in WSN. Methods: Simulation is completed on CupCarbon U-one 4.2 simulator for these algorithms to com-pute the shortest distance between a randomly deployed source node and a destination node in different sized networks. Simulation of the three algorithms is carried out considering the vital simulation parameters including sensor radius, radio range, and traffic. Also, Simulation is carried out to show the implementation of Floyd Warshall’s algorithm in the field of smart mobility. Results: The obtained results show that the simulation time for the calculation of the shortest route from source to destinations for the three algorithms is the same which is also suitable for various applications of smart mobility, smart accident management, and smart traffic management. Conclusion: The simulation results are also examined to measure the performance of each algorithm and its suitability in the context of WSN. The epilogue of this paper is provided in the conclusion section. © 2022 Bentham Science Publishers. |
