Affiliation:
1. University of Manouba, Tunisia
Abstract
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.
Subject
Computer Networks and Communications,Management Information Systems
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献