Abstract
The greedy perimeter stateless routing (GPSR) protocol is a well-known position-based routing protocol. Data packet routing in position-based routing protocols uses the neighbors' geographical position information, which is stored in the sender's neighbors list, and the destination's position information stored in the routing data packet header field to route the packet from source to destination. In the GPSR protocol, the sender routes the packets to a neighboring node, whose geographical position is the closest to the destination of all the sender's neighbors. However, the selected neighbor is closer to the edge of the maximum of the sender's transmission range and thus has a higher likelihood of leaving the transmission range of the sender. Thus, the wireless link between the sender node and its routing neighboring node may break down, which degrades the performance of the routing protocol. In this study, we identify and study the effects of network parameters (beacon packet interval-time, node speed, network density, transmission range, and network area size) on wireless link breakage, identified as the neighbor wireless link break (NWLB) problem, in the GPSR protocol. To overcome the NWLB problem, we propose a neighbor wireless link break prediction (NWLBP) model. The NWLBP model predicts the accurate position of a routing neighboring node in the sender's neighbors list before routing the data packet to that neighbor. The simulation results show the ability of the NWLBP model to overcome the observed problem and to improve the overall performance of the GPSR protocol.