Valérie Alandzi et Alejandro Quintero
Article de revue (2007)
|
Libre accès au plein texte de ce document Version officielle de l'éditeur Conditions d'utilisation: Creative Commons: Attribution (CC BY) Télécharger (169kB) |
Abstract
Most of the existing routing protocols for ad hoc networks are designed to scale in networks of a few hundred nodes. They rely on state concerning all links of the network or links on the route between a source and a destination. This may result in poor scaling properties in larger mobile networks or when node mobility is high. Using location information to guide the routing process is one of the most often proposed means to achieve scalability in large mobile networks. However, locationbased routing is difficult when there are holes in the network topology. We propose a novel positionbased routing protocol called Proximity Aware Routing for Ad-hoc networks (PARA) to address these issues. PARA selects the next hop of a packet based on 2-hops neighborhood information. We introduce the concept of “proximity discovery”. The knowledge of a node's 2-hops neighborhood enables the protocol to anticipate concave nodes and helps reduce the risks that the routing protocol will reach a concave node in the network. Our simulation results show that PARA's performance is better in sparse networks with little congestion. Moreover, PARA significantly outperforms GPSR for delivery ratio, transmission delay and path length. Our results also indicate that PARA delivers more packets than AODV under the same conditions.
Mots clés
Mobile ad hoc networks, location-based routing, AODV
Sujet(s): |
2700 Technologie de l'information > 2700 Technologie de l'information 2700 Technologie de l'information > 2721 Systèmes et réseaux multimédias |
---|---|
Département: | Département de génie informatique et génie logiciel |
URL de PolyPublie: | https://publications.polymtl.ca/4742/ |
Titre de la revue: | Journal of Computer Science (vol. 3, no 7) |
Maison d'édition: | Science Publications |
DOI: | 10.3844/jcssp.2007.533.539 |
URL officielle: | https://thescipub.com/abstract/jcssp.2007.533.539 |
Date du dépôt: | 07 déc. 2020 13:43 |
Dernière modification: | 10 avr. 2024 21:00 |
Citer en APA 7: | Alandzi, V., & Quintero, A. (2007). Proximity aware routing in ad hoc networks. Journal of Computer Science, 3(7), 533-539. https://thescipub.com/abstract/jcssp.2007.533.539 |
---|---|
Statistiques
Total des téléchargements à partir de PolyPublie
Téléchargements par année
Provenance des téléchargements
Dimensions