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.

Highlights

  • In Mobile Ad hoc Network (MANET) position-based routing protocols such as distance routing effect algorithm for mobility (DREAM), location aided routing (LAR), and greedy perimeter stateless routing (GPSR) [1], the data packet routing decision is based purely on the local geographical position information knowledge of the node’s neighbors

  • Violation of any of these assumptions under actual conditions can result in destruction of the GPSR protocol mechanism itself [19] as well as the prediction model

  • For the neighbor wireless link break prediction (NWLBP) prediction model, under actual conditions, as long as the node can receive a beacon packet from its neighbors, it can predict the future position of its neighbor and assist the GPSR protocol to forward the data packet to the best candidate neighbor in the direction of its destination

Read more

Summary

Introduction

In Mobile Ad hoc Network (MANET) position-based routing protocols such as DREAM, LAR, and GPSR [1], the data packet routing decision is based purely on the local geographical position information knowledge of the node’s neighbors. Each node needs to maintain accurate geographical position information on its immediate neighbors to make effective routing decisions. For this purpose, each node within a determined time interval, periodically broadcasts a short beacon packet to announce its presence and geographical. This greedy forwarding process is repeated by nodes y, k, z, and w until the data packet reaches the destination node D

Objectives
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call