Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Position-based ad hoc routes in ad hoc networks
The handbook of ad hoc wireless networks
Comparative Study of Reactive and Proactive Routing Protocols Performance in Mobile Ad Hoc Networks
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02
On Route Lifetime in Multihop Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Autonomic Self Tunable Proactive Routing in Mobile Ad Hoc Networks
WIMOB '09 Proceedings of the 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Suitability Analysis of Probabilistic Proactive Routing for Dynamic Multi-hop Ad Hoc Networks
WIMOB '09 Proceedings of the 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Organizing a global coordinate system from local information on an ad hoc sensor network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Functional enhancements of proactive routing in mobile ad hoc networks
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
| Hi-index | 0.00 |
In this paper, the authors propose a novel routing protocol driven by an asynchronous distributed cartography gathering algorithm. Each node senses its own dynamics and chooses locally an appropriate routing period size. As such stationary nodes generate little signaling traffic; fast moving nodes choose small routing periods to mitigate the effect of their mobility. Moreover, every node integrates a self regulating process that dynamically and constantly calibrates the chosen routing period to track changes in its dynamics. The performances of this proposed routing protocol are evaluated and compared to the known Optimized Link State Routing OLSR protocol through extensive simulations. The paper shows that the collected network cartography maintains a validity ratio near 100% even for high node speeds. The authors illustrate that the proposed routing protocol provides around 97% routing validity while the OLSR can hardly deliver more than 60% at moderate to high speeds and workloads. Finally, the protocol provides better throughput than OLSR, reaching a 50% increase at moderate to high speeds and workloads far less end-to-end delays.