Routing in aeronautical ad-hoc networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année :

Routing in aeronautical ad-hoc networks

(1) , (2) , (2) , (3)
1
2
3
Quentin Vey
Alain Pirovano

Résumé

Routing is one of the main challenges that Aeronautical Ad-hoc NETworks (AANETs) are facing, mostly because of the mobility of the nodes, the geographic size of the network and the number of nodes. To handle this problem, we propose in this paper an innovative routing algorithm called NoDe-TBR (Node Density-TBR), derived from Trajectory-Based Routing (TBR). In this routing algorithm, each aircraft computes a geographic path between itself and the destination of its message. In order to improve delivery probability, this path takes into account the actual aircraft density in each area. The performances of this algorithm have been assessed through simulations, with replayed aircraft trajectories over the North Atlantic Tracks (NATs). They are compared to the performances of classic routing algorithms designed for Mobile Ad-hoc NETworks (MANETs). Our solution exhibits better performances than classic routing protocols, but for a fraction of the signalization traffic volume. This is particularly desirable in resource-constraint networks such as AANETs.
Fichier non déposé

Dates et versions

hal-01466822 , version 1 (13-02-2017)

Identifiants

  • HAL Id : hal-01466822 , version 1

Citer

Quentin Vey, Stéphane Puechmorel, Alain Pirovano, José Radzik. Routing in aeronautical ad-hoc networks. DASC 2016 IEEE/AIAA 35th Digital Avionics Systems Conference, Sep 2016, Sacramento, United States. ⟨hal-01466822⟩
72 Consultations
0 Téléchargements

Partager

Gmail Facebook Twitter LinkedIn More