Performance evaluation of three GPSR-based routing protocols in a military setting

Al-Roqi, Yasser; Papanastasiou, Stylianos; Peytchev, Evtim

doi:10.1109/iisa.2013.6623700

Cited by 3 publications

(5 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the same context, GPSR protocol ( Figure 5) has obtained more enhancing achievements with notes a side effect in simulation processes; this protocol employed the home regional geo-information in order to guarantee data packet delivery, but this comes with more algorithm computational complexity. These observations came compatible with other research studies outcomes that suggested the GPSR protocol as a solution for more stability and reliability of geographically based ad hoc models [34]. Figure 6 we can point out that the delay times for sending data packets in DREAM and GPSR protocols have obtained fine results, especially in DREAM due to the reliability coming from the global style of pro-active design, while, LAR protocol has lacked to achieve.…”

Section: Resultssupporting

confidence: 90%

Network size variation of geographical aided routing protocols in MANET

Al-Bayram

Abdullah

2021

IJEECS

View full text Add to dashboard Cite

<p><span>In position-based or geo-casting ad hoc networking applications, the data packets flooded in a limited area of the expected region toward the destination node. In such networks, a multi-hop routing is to followed when the position of the destination node is residing off-range the wireless transmission of the source node. Scientific literature references in this concept have been conducted depended on the diversity of quantitative metrics-tests regarding the size of the assigned networks so that this space is intended to be the variation in the density of the moving nodes (the number of nodes per unit of measurement). In this work, we studied the impact of the change in the size (area) of the ad hoc network with the concept of variation in the network's area while remaining the total number of nodes as a constant volume. In this paper, three of the position-based routing protocols have evaluated in terms of a network size variation. These routing protocols are: locations aided routing LAR, the distance routing effect algorithm for mobility DREAM, and the greedy perimeter stateless routing GPSR. With each simulation test, a quantitative metrics evaluation determined the most efficient protocol and the most efficient accessibility with the network environment changes in terms of actual workspace. </span></p>

show abstract

Section: Resultssupporting

confidence: 90%

Network size variation of geographical aided routing protocols in MANET

Al-Bayram

Abdullah

2021

IJEECS

View full text Add to dashboard Cite

show abstract

“…The use of ferry nodes in this case increases the delivery ratio from 1 % [2] to more than 10%, in case of 50 nodes, without affecting the duty of the patrol nodes (ferry) and the activities of soldiers who participate in the packet forwarding process. The confidence interval values show that the worst case performance of the FA-GPSR algorithm is better than the best case performance of GPSR and its variants.…”

Section: A Simulation Environmentmentioning

confidence: 94%

“…We conducted simulations using NS-3 v3.16 to evaluate the performance of GPSR, GPSR-DP, GPSR-BZGFS and FA GPSR over the battalion-level military topology described in our previous work [2]. The implementation used for GPSR is derived from the fourth patch set of GPSR under code review for inclusion in NS-3.…”

Section: A Simulation Environmentmentioning

confidence: 99%

“…The recovery mode, instead, uses the perimeter of a network area to forward packets around a connectivity gap in view of finding, through circumnaviga tion, a viable route towards the destination node. In previous work [2] we have evaluated the performance of GPSR and two of its variants, namely the Divisional Perimeter Routing (GPSR-DP) and the Buffering Zone Greedy Forwarding Strat egy (GPSR-BZGFS), in an actual military scenario setting and found several issues with the standard version of these protocols.…”

Section: Introductionmentioning

confidence: 99%

“…We describe the FA-GPSR routing protocol in Section 0.3. In Section 0.4 we evaluate the performance of FA-GPSR, present simulation results and discuss their implications in view of our previous work [2]. Section 0.5 concludes the paper and offers suggestions for future work.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Ferry-assisted greedy perimeter stateless routing protocol for mobile ad hoc networks (FA-GPSR)

Al-Roqi

Papanastasiou

Peytchev

2014

2014 IEEE Symposium on Computers and Communications (ISCC)

Self Cite

View full text Add to dashboard Cite

In modern warfare combatants may be equipped with computing devices to report on changes in the battlefield situation and communicate important observations to operational planners and commanders on the field. To reach such a vision by connect all the loosely coupled scenario elements, it is important to support and develop effective routing algorithms operating in a MANET environment, which are a natural fit for military purposes. Greedy Perimeter Stateless Routing (GPSR) is a well known routing algorithm in MANETs that does not need to maintain a routing table and performs well in a free open space scenario with regularly distributed nodes. In this work we show that GPSR does not perform adequately in military-scenarios due to frequent network disconnections, which occur as a consequence of the large, battalion-sized, deployment area. We have shown in previous work that this problem extends to existing proposed optimisations and have suggested that a new approach is needed.In this paper we propose a novel optimisation to GPSR targeted at battalion level topologies that includes techniques drawn from delay-tolerant network research to enhance performance by using knowledge derived from the application itself and the topology.We demonstrate the advantages of the new technique, termed FA GPSR, against both vanilla GPSR and two of its optimisations and outline the trade-offs involved.

show abstract