Adaptive Probabilistic Proactive Routing for Dense MANETs
Conventional proactive routing protocols, due to their inherent nature based on shortest paths, select longer links which are amenable to rapid breakages as nodes move around. In this paper, we propose a novel adaptive probabilistic approach to handle routing information in dense mobile ad hoc netwo...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Journal of Computer Networks and Communications |
| Online Access: | http://dx.doi.org/10.1155/2012/234824 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832558581352759296 |
|---|---|
| author | Abdelfettah Belghith Mohamed Amine Abid Adel Ben Mnaouer |
| author_facet | Abdelfettah Belghith Mohamed Amine Abid Adel Ben Mnaouer |
| author_sort | Abdelfettah Belghith |
| collection | DOAJ |
| description | Conventional proactive routing protocols, due to their inherent nature based on shortest paths, select longer links which are amenable to rapid breakages as nodes move around. In this paper, we propose a novel adaptive probabilistic approach to handle routing information in dense mobile ad hoc networks in a way to improve the proactive routing pertinence as a function of network dynamics. We first propose a new proactive routing framework based on probabilistic decisions and a generic model to compute the existence probabilities of nodes and links. Then, we present a distributed algorithm to collect the cartography of the network. This cartography is used to instantiate the existence probabilities. Conducted simulations show that our proposal yields substantially better routing validity. Nonetheless, it amounts to much longer routes. We proposed then a bounding technique to adapt and overcome this side effect and defined two probabilistic proactive routing variants. Conducted simulations show that our proposed bounded probabilistic proactive routing schemes outperform conventional routing protocols and yield up to 66 percent increase in throughput. |
| format | Article |
| id | doaj-art-4249ffee001244dea01bd7870c6498ee |
| institution | Kabale University |
| issn | 2090-7141 2090-715X |
| language | English |
| publishDate | 2012-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Computer Networks and Communications |
| spelling | doaj-art-4249ffee001244dea01bd7870c6498ee2025-02-03T01:32:02ZengWileyJournal of Computer Networks and Communications2090-71412090-715X2012-01-01201210.1155/2012/234824234824Adaptive Probabilistic Proactive Routing for Dense MANETsAbdelfettah Belghith0Mohamed Amine Abid1Adel Ben Mnaouer2HANA Research Group, Ecole Nationale des Sciences de l'Informatique (ENSI), University of Manouba, La Manouba 2010, TunisiaHANA Research Group, Ecole Nationale des Sciences de l'Informatique (ENSI), University of Manouba, La Manouba 2010, TunisiaCollege of Computer Engineering and IT, Dar Al Utoum, Al Mizan, Al Falah, Riyad 13314, Saudi ArabiaConventional proactive routing protocols, due to their inherent nature based on shortest paths, select longer links which are amenable to rapid breakages as nodes move around. In this paper, we propose a novel adaptive probabilistic approach to handle routing information in dense mobile ad hoc networks in a way to improve the proactive routing pertinence as a function of network dynamics. We first propose a new proactive routing framework based on probabilistic decisions and a generic model to compute the existence probabilities of nodes and links. Then, we present a distributed algorithm to collect the cartography of the network. This cartography is used to instantiate the existence probabilities. Conducted simulations show that our proposal yields substantially better routing validity. Nonetheless, it amounts to much longer routes. We proposed then a bounding technique to adapt and overcome this side effect and defined two probabilistic proactive routing variants. Conducted simulations show that our proposed bounded probabilistic proactive routing schemes outperform conventional routing protocols and yield up to 66 percent increase in throughput.http://dx.doi.org/10.1155/2012/234824 |
| spellingShingle | Abdelfettah Belghith Mohamed Amine Abid Adel Ben Mnaouer Adaptive Probabilistic Proactive Routing for Dense MANETs Journal of Computer Networks and Communications |
| title | Adaptive Probabilistic Proactive Routing for Dense MANETs |
| title_full | Adaptive Probabilistic Proactive Routing for Dense MANETs |
| title_fullStr | Adaptive Probabilistic Proactive Routing for Dense MANETs |
| title_full_unstemmed | Adaptive Probabilistic Proactive Routing for Dense MANETs |
| title_short | Adaptive Probabilistic Proactive Routing for Dense MANETs |
| title_sort | adaptive probabilistic proactive routing for dense manets |
| url | http://dx.doi.org/10.1155/2012/234824 |
| work_keys_str_mv | AT abdelfettahbelghith adaptiveprobabilisticproactiveroutingfordensemanets AT mohamedamineabid adaptiveprobabilisticproactiveroutingfordensemanets AT adelbenmnaouer adaptiveprobabilisticproactiveroutingfordensemanets |