Result: QoS Preserving Topology Advertising Reduction for OLSR Routing Protocol for Mobile Ad Hoc Networks

Title:
QoS Preserving Topology Advertising Reduction for OLSR Routing Protocol for Mobile Ad Hoc Networks
Contributors:
Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), System and Networking for Portable Objects Proved to be Safe (POPS), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Centre Inria de l'Université de Lille, Institut National de Recherche en Informatique et en Automatique (Inria), INRIA, INSA Lyon, IFIP, Alcatel
Source:
WONS 2006 : Third Annual Conference on Wireless On-demand Network Systems and Services. :196-202
Publisher Information:
CCSD, 2006.
Publication Year:
2006
Collection:
collection:UNIV-LILLE3
collection:CNRS
collection:INRIA
collection:WONS2006
collection:IRCICA
collection:INRIA-LILLE
collection:LIFL
collection:INRIA_TEST
collection:TESTALAIN1
collection:INRIA2
Original Identifier:
HAL:
Document Type:
Conference conferenceObject<br />Conference papers
Language:
English
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edshal.inria.00001028v1
Database:
HAL

Further Information

Mobile ad hoc networks (MANET) are formed by mobile nodes with a limited communication range. Routing protocols use a best effort strategy to select the path between a source and a destination. Recently, mobile ad hoc networks are facing a new challenge, quality of service (QoS) routing. QoS is concerned with choosing paths that provide the required performances, specified mainly in terms of the bandwidth and the delay. In this paper we propose a QoS routing protocol. Each node forwards messages to their destination based on the information received during periodically broadcasts. It uses two different sets of neighbors: one to forward QoS compliant application messages and another to disseminate local information about the network. The former is built based on 2-hop information knowledge about the metric imposed by the QoS. The latter is selected in order to minimize the number of sent broadcasts. We provide simulation results to compare the performances with similar QoS protocols.