Correlation Distance Based Greedy Perimeter Stateless Routing Algorithm For Wireless Sensor Networks

Wireless sensor networks (WSNs) are a popular study topic because of the extensive range of potential applications they have. A WSN is made up of a few hundred to tens of thousands of sensor nodes from anywhere, all of which interconnect via radio signals. Restrictions on computing power, storage, battery life, and transmission bandwidth are all factors to consider while designing a WSN. Clustering and routing procedures have been proposed to deal with these problems. Wi-Fi sensor network routing is a critical but tough task. A Greedy Perimeter Stateless Routing (GPSR) algorithm, an effectual and receptive routing system is developed. Packet forwarding decisions are based on node placements. When transferring messages, the GPSR always takes the shortest route possible between the source and destination nodes. Using distance measurements including Euclidean, city block, cosine, and correlation, the complete weighted directed graph is constructed in this study. Rigorous simulation has been executed using NS-2. Also, the GPSR performance with different distance measures is compared and validated. The results show that the proposed GPSR with correlation distance provides better performance in terms of packet delivery ratio, throughput, routing overhead and average stability time of cluster head, when compared to other distance measures.