.png){kind=icon}
.png){kind=icon}
Return
Correlation Distance Based Greedy Perimeter Stateless Routing Algorithm for Wireless Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.22937/IJCSNS.2022.22.1.20.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Research into wireless sensor networks (WSNs) is a trendy issue with a wide range of applications. With hundreds to thousands of nodes, most wireless sensor networks interact with each other through radio waves. Limited computational power, storage, battery, and transmission bandwidth are some of the obstacles in designing WSNs. Clustering and routing procedures have been proposed to address these concerns. The wireless sensor network's most complex and vital duty is routing. With the Greedy Perimeter Stateless Routing method (GPSR), an efficient and responsive routing protocol is built. In packet forwarding, the nodes' locations are taken into account while making choices. In order to send a message, the GPSR always takes the shortest route between the source and destination nodes. Weighted directed graphs may be constructed utilising four distinct distance metrics, such as Euclidean, city block, cosine, and correlation distances, in this study. NS-2 has been used for a thorough simulation. Additionally, the GPSR's performance with various distance metrics is evaluated and verified. When compared to alternative distance measures, the proposed GPSR with correlation distance performs better in terms of packet delivery ratio, throughput, routing overhead and average stability time of the cluster head.
Keywords:
Complete Weighted Directed Graph
Clustering
Greedy Perimeter Stateless Routing
Packet Delivery Ratio
Wireless Sensor Network
Journal
I
IF:
0
Papers:
14
Citations:
0