| Abstract |
A large number of sensor nodes are deployed in the wireless sensor network (WSN) to sense physical or environmental conditions such as humidity, pressure, sound, temperature, and mobility. WSN has an extensive span of applications in the military, biodiversity, agriculture, machine surveillance, and smart city (Zhao and Guibas, Wireless sensor networks, an information processing approach. Morgan Kaufmann Publishers, pp 9–15, 2004 [1]). This paper focuses on smart mobility, which is one of the important features of smart cities. In WSN, there are various limitations and challenges such as limited battery life, limited bandwidth for communication, less space for processing and storage of data, and QoS provisioning (Akyildiz and Vuran, Wireless sensor networks, 1st edn. Wiley, New York, pp 37–40, 2010 [2]). In this paper, an energy-efficient network is designed by considering the battery level of sensor nodes the shortest route is found between the source node and destination node to overcome a few above-mentioned problems in WSN. The technique used is adaptive Dijkstra’s algorithm which is simulated in CupCarbon U-One 4.2 simulator (CupCarbon Homepage, http://www.cupcarbon.com/cupcarbon_ug.html [3]). © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. |
