An Efficient LWSP Technique in WSN with Shortest Path Routing for Less Latency in Data Transmission

Abstract

Wireless network is an established connection for data transformation from one node to another node and the biggest issue in the data transformation is congestion and latency which destroys the transmitting function. In wireless sensor networks (WSNs), Shortest path routing can find multiple paths from source node to destination node for achieving high responsibility and high energy-efficiency. However, most of the existing Shortest path routing protocols in the literature construct multiple paths with long latency and high over head and it is a common issue. In this paper, a fiction Shortest path routing protocol in WSNs is proposed named LWSP [Shortest path without Latency], which can discover shortest paths with short latency and low command processing overhead time. Performance analyses and simulation results shows that our proposed protocol has much better performance than the existing ones in terms of both latency and command processing overhead time.

Keywords: shortest path routing, latency, fiction protocol, overhead time