An Improved GPSR Algorithm Based on Energy Gradient and APIT Grid

Abstract

We investigate GPSR algorithms of WSN and propose an improved routing algorithm based on energy gradient and APIT grid to solve the problem of high and unbalanced energy consumption of GPSR. In GPSR, network uses greedy algorithm and right-hand rule to establish routing paths, and the path keeps running till some nodes within the path are invalid because energy is exhausted, which would lead to the high energy consumption of some nodes in the path and the low energy consumption of others nearby the nodes not in the path as well as bringing high and unbalanced energy consumption of the network. Regarding these problems, we use APIT localization algorithm and APIT grid to query and establish routing paths and establish the corresponding energy gradient when messages are transmitted along the routing paths. When some nodes are approaching the threshold status, we use right-hand rule and recursion greedy algorithm in advance to plan a new routing path towards the target area. When query messages arrive at the event area, the network uses a different method to transmit data according to the density of sensor nodes. Simulation experiments show that the improved routing algorithm is capable of reducing the energy consumption of network and extending the lifecycle of network.

Three-Dimensional DV-Hop Localization Algorithm Based on Hop Size Correction and Improved Sparrow Search

“…Without additional complex equipment, the positioning accuracy is lower than that of the algorithm based on the range-based method. The typical localization methods based on the range-free algorithm include the centroid algorithm [10], approximate triangle interior point test algorithm [11,12], and DV-hop localization algorithm [13].…”

Congestion-aware and Predictive Geo-Casting Routing Mechanisms for Mobile ad hoc Network

“…However, GPSR-FLDB does not retain the direction of the node and as a result neighbor nodes may move in the opposite direction to the destination node, resulting in frequent link breakages. In addition, the protocol does not consider the link reliability which is required in highly dynamic environments [32], and is based on a greedy mechanism to select the next hop, which may increase packet loss. In [9], a routing protocol called Self-Adaptive On-Demand Geographic Routing with a Hybrid Reactive (SOGR-HR) protocol is presented.…”

Improved DV-Hop Location Algorithm Based on Mobile Anchor Node and Modified Hop Count for Wireless Sensor Network

“…e typical range-free location methods include Centroid method [15], Approximate Point in Triangulation Test (APIT) method [16,17], and DV-Hop method [18]. e Centroid method utilizes anchor nodes of surrounding the unknown node to form a geometric figure, and if the unknown node is in the range of geometric figure, the mean coordinate of these anchor nodes will be used as unknown node's estimated coordinate.…”