Improved trustworthy, speed, and energy-efficient GPSR routing algorithm in large-scale WSN

Kumar, M.V.N.R. Pavan; Hariharan, R.

doi:10.1016/j.measen.2022.100576

Cited by 3 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this particular scheme, every node carries out regular monitoring of its own receiving queue length and remaining energy level, and during each step the node checks for the proximity of a failed node, also known as a routing hole, and increases its distance from the sink to circumvent the hole and keep forwarding packets to the sink. In [ 28 ], the modified Greedy Perimeter Stateless Routing (GPSR) algorithm was proposed to determine the optimal path based on energy usage, and it avoids malicious activity. During the process of forwarding packets to the sink, considering the presence of routing holes, the algorithm can forward packets reliably by directing data through incident surveillance nodes to event-detecting networks, thereby producing an energy-efficient routing mechanism.…”

Section: Related Workmentioning

confidence: 99%

PAtCH: Proactive Approach to Circumvent Holes in Wireless Sensor Networks

Lima,

Sardinha,

Balico

et al. 2023

Sensors

View full text Add to dashboard Cite

The occurrence of hole regions in Wireless Sensor Networks is a significant challenge when applying a greedy technique in a geographic routing approach. The local minimum phenomenon is commonly attributed to physical obstacles, energy depletion of the nodes, failures in communication between neighbors, or even the incorrect deployment of the nodes in the sensing field. To address the problem of hole regions, most approaches choose to abandon the traditional greedy forwarding mechanism to temporarily adopt the well-known perimeter routing scheme applied to nearby nodes or along the edge of a region of a hole. However, this mechanism does not satisfy the network load balance requirement, because it imposes too much traffic to the nodes in the hole’s edge, making them overloaded when compared to other network nodes more distant from holes. In this work, we propose a novel location-free geographic routing technique called PAtCH (Proactive Approach to Circumvent Holes in Wireless Sensor Network) to avoid routing holes in WSNs. Our solution can circumvent hole regions and create routing paths toward the destination. We consider that our sink has a higher communication range, and the Received Signal Strength Indicator (RSSI) is used to assist the construction of the routing paths. Our results show the efficiency achieved by our proposed solution in scenarios with hole regions, also maintaining all the benefits of a classic greedy forwarding technique.

show abstract

Section: Related Workmentioning

confidence: 99%

PAtCH: Proactive Approach to Circumvent Holes in Wireless Sensor Networks

Lima,

Sardinha,

Balico

et al. 2023

Sensors

View full text Add to dashboard Cite

show abstract

“…An improved GPSR algorithm is proposed in [19]. It uses surplus energy to send a signal to a distant node instead of transmitting a message.…”

Section: Packet Routingmentioning

confidence: 99%

ECKN: An Integrated Approach for Position Estimation, Packet Routing, and Sleep Scheduling in Wireless Sensor Networks

Bertanha

Pazzi

El-Khatib

2023

Sensors

View full text Add to dashboard Cite

Network lifetime and localization are critical design factors for a number of wireless sensor network (WSN) applications. These networks may be randomly deployed and left unattended for prolonged periods of time. This means that node localization is performed after network deployment, and there is a need to develop mechanisms to extend the network lifetime since sensor nodes are usually constrained battery-powered devices, and replacing them can be costly or sometimes impossible, e.g., in hostile environments. To this end, this work proposes the energy-aware connected k-neighborhood (ECKN): a joint position estimation, packet routing, and sleep scheduling mechanism. To the best of our knowledge, there is a lack of such integrated solutions to WSNs. The proposed localization algorithm performs trilateration using the positions of a mobile sink and already-localized neighbor nodes in order to estimate the positions of sensor nodes. A routing protocol is also introduced, and it is based on the well-known greedy geographic forwarding (GGF). Similarly to GGF, the proposed protocol takes into consideration the positions of neighbors to decide the best forwarding node. However, it also considers node residual energy in order to guarantee the forwarding node will deliver the packet. A sleep scheduler is also introduced in order to extend the network lifetime. It is based on the connected k-neighborhood (CKN), which aids in the decision of which nodes switch to sleep mode while keeping the network connected. An extensive set of performance evaluation experiments was conducted and results show that ECKN not only extends the network lifetime and localizes nodes, but it does so while sustaining the acceptable packet delivery ratio and reducing network overhead.

show abstract

Improvement of Node Level Data Protection Against Malicious Node by Data Aggregation Based Routing Protocol for WSN

Tyagi,

Deshpande

2023

2023 IEEE 4th Annual Flagship India Council International Subsections Conference (INDISCON)

View full text Add to dashboard Cite

Improved trustworthy, speed, and energy-efficient GPSR routing algorithm in large-scale WSN

Cited by 3 publications

References 17 publications

PAtCH: Proactive Approach to Circumvent Holes in Wireless Sensor Networks

PAtCH: Proactive Approach to Circumvent Holes in Wireless Sensor Networks

ECKN: An Integrated Approach for Position Estimation, Packet Routing, and Sleep Scheduling in Wireless Sensor Networks

Improvement of Node Level Data Protection Against Malicious Node by Data Aggregation Based Routing Protocol for WSN

Contact Info

Product

Resources

About