Open AccessImproving routing in networks of Unmanned Aerial Vehicles: Reactive‐Greedy‐Reactive
Author(s) -
Li Yi,
Shirani Rostam,
StHilaire Marc,
Kunz Thomas
Publication year - 2012
Publication title -
wireless communications and mobile computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.42
H-Index - 64
eISSN - 1530-8677
pISSN - 1530-8669
DOI - 10.1002/wcm.2333
Subject(s) - computer science , zone routing protocol , wireless routing protocol , computer network , link state routing protocol , optimized link state routing protocol , dynamic source routing , routing protocol , distributed computing , destination sequenced distance vector routing , routing (electronic design automation)
Because of their specific characteristics, Unmanned Aeronautical Ad‐hoc Networks (UAANETs) can be classified as a special kind of mobile ad hoc networks. Because of the high mobility of Unmanned Aerial Vehicles, designing a good routing protocol for UAANETs is challenging. Here, we present a new protocol called Reactive‐Greedy‐Reactive (RGR) as a promising routing protocol in high mobility and density‐variable scenarios. RGR combines features of reactive MANET routing protocols such as Ad‐hoc On‐demand Distance Vector with geographic routing protocols, exploiting the unique characteristics of UAANETs. In addition to combining reactive and geographic routing, the protocol has a number of features to further improve the overall performance. We present the rationale and design of the protocol, discuss the specific performance improvements in detail and provide extensive simulation results that demonstrate that RGR outperforms purely reactive or geographic routing protocols. The results also demonstrate the impact of the various protocol modifications. Copyright © 2012 John Wiley & Sons, Ltd.