Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

Autor: Julian Monteiro, Afonso Ferreira, Alfredo Goldman
Přispěvatelé: Algorithms, simulation, combinatorics and optimization for telecommunications (MASCOTTE), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Instituto de Matemática e Estatística (IME), Universidade de São Paulo (USP), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), Universidade de São Paulo = University of São Paulo (USP)
Jazyk: angličtina
Rok vydání: 2010
Předmět:
Routing protocol
Dynamic Source Routing
Computer Networks and Communications
Computer science
Distributed computing
Wireless Routing Protocol
0102 computer and information sciences
02 engineering and technology
Network topology
01 natural sciences
Network simulation
ACM: C.: Computer Systems Organization/C.4: PERFORMANCE OF SYSTEMS
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]
Ad hoc On-Demand Distance Vector Routing
0202 electrical engineering
electronic engineering
information engineering
Computer Science::Networking and Internet Architecture
Destination-Sequenced Distance Vector routing
Electrical and Electronic Engineering
Ad hoc routing
WIRELESS
Static routing
Adaptive quality of service multi-hop routing
business.industry
ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS
020206 networking & telecommunications
Ad hoc wireless distribution service
ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS
Distance-vector routing protocol
Link-state routing protocol
Optimized Link State Routing Protocol
Routing domain
010201 computation theory & mathematics
Multipath routing
business
Wireless sensor network
Information Systems
Computer network
Zdroj: Wireless Networks
Wireless Networks, Springer Verlag, 2010, 16 (3), pp.627-640. ⟨10.1007/s11276-008-0158-6⟩
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Wireless Networks, 2010, 16 (3), pp.627-640. ⟨10.1007/s11276-008-0158-6⟩
ISSN: 1022-0038
1572-8196
DOI: 10.1007/s11276-008-0158-6⟩
Popis: International audience; The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks' dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model -- the evolving graphs -- was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad-hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.
Databáze: OpenAIRE
Externí odkaz: