Use ’em or lose ’em: On unidirectional links in reactive routing protocols
Autor: | Yuichi Igarashi, Thomas Clausen, Juan Antonio Cordero, Jiazi Yi |
---|---|
Přispěvatelé: | Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), École polytechnique (X), Hitachi, Ltd |
Jazyk: | angličtina |
Rok vydání: | 2018 |
Předmět: |
Routing protocol
Loop (graph theory) Computer Networks and Communications business.industry Computer science ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS 020206 networking & telecommunications Topology (electrical circuits) 02 engineering and technology ad hoc network unidirectional links [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] Hardware and Architecture routing 0202 electrical engineering electronic engineering information engineering reactive protocol Overhead (computing) 020201 artificial intelligence & image processing Routing (electronic design automation) Unicast business Software Computer network |
Zdroj: | Ad Hoc Networks Ad Hoc Networks, Elsevier, 2018, 73, pp.51-64. ⟨10.1016/j.adhoc.2018.02.004⟩ |
ISSN: | 1570-8705 |
DOI: | 10.1016/j.adhoc.2018.02.004⟩ |
Popis: | International audience; In reactive unicast routing protocols, Route Discovery aims to include only bidirectional links in discovered routing paths. This is typically accomplished by having routers maintain a "blacklist" of links recently confirmed (through Route Reply processing) to be unidirectional-which is then used for excluding subsequent Route Discovery control messages received over these links from being processed and forwarded. This paper first presents an analytical model, which allows to study the impact of unidirectional links being present in a network, on the performance of reactive routing protocols. Next, this paper identifies that despite the use of a "blacklist", the Route Discovery process may result in discovery of false forward routes, i.e., routes containing unidirectional links-and proposes a countermeasure denoted Forward Bidi-rectionality Check. This paper further proposes a Loop Exploration mechanism, allowing to properly include unidirectional links in a discovered routing topology-with the goal of providing bidirectional connectiv-ity even in absence of bidirectional paths in the network. Finally, each of these proposed mechanisms are subjected to extensive network simulations in static scenarios. When the fraction of unidirectional links is moderate (15-50%), simulations find Forward Bidi-rectionality Check to significantly increase the probability that bidirectional routing paths can be discovered by a reactive routing protocol, while incurring only an insignificant additional overhead. Further, in networks with a significant fraction of unidirectional links (≥ 50%), simulations reveal that Loop Exploration preserves the ability of a reactive routing protocol to establish bidirectional communication (pos-sibly through non-bidirectional paths), but at the expense of a substantial additional overhead. |
Databáze: | OpenAIRE |
Externí odkaz: |