2008
Thomas Clausen; Christopher Dearlove; Brian Adamson
RFC5148: Jitter Considerations in Mobile Ad Hoc Networks (MANETs) Miscellaneous
2008, (http://tools.ietf.org/html/rfc5148).
@misc{Clausen2008,
title = {RFC5148: Jitter Considerations in Mobile Ad Hoc Networks (MANETs)},
author = {Thomas Clausen and Christopher Dearlove and Brian Adamson},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc5148.txt.pdf},
doi = {10.17487/RFC5148},
year = {2008},
date = {2008-02-01},
publisher = {RFC},
organization = {The Internet Engineering Task Force},
abstract = {This document provides recommendations for jittering (randomly modifying timing) of control traffic transmissions in Mobile Ad hoc NETwork (MANET) routing protocols to reduce the probability of transmission collisions,},
note = {http://tools.ietf.org/html/rfc5148},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document provides recommendations for jittering (randomly modifying timing) of control traffic transmissions in Mobile Ad hoc NETwork (MANET) routing protocols to reduce the probability of transmission collisions,
2007
Thomas Clausen; Ulrich Herberg
AUTOCONF - Stating the Problem Technical Report
2007.
@techreport{LIX-NET-RR-17,
title = {AUTOCONF - Stating the Problem},
author = {Thomas Clausen and Ulrich Herberg},
year = {2007},
date = {2007-11-01},
publisher = {Inria Research Report RR-6376},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Emmanuel Baccelli; Thomas Clausen; Philippe Jacquet; Dang Nguyen
Integrating VANETs in the Internet Core with OSPF: the MPR-OSPF Approach Proceedings Article
In: International Conference on ITS Telecommunications (ITST), Sophia Antipolis, France, June 2007, 2007.
@inproceedings{Clausen2007,
title = {Integrating VANETs in the Internet Core with OSPF: the MPR-OSPF Approach},
author = {Emmanuel Baccelli and Thomas Clausen and Philippe Jacquet and Dang Nguyen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2007-ITST-Integrating-VANETs-in-the-Internet-Core-with-OSPF-the-MPR-OSPF-Approach.pdf},
doi = {10.1109/ITST.2007.4295864},
year = {2007},
date = {2007-06-01},
publisher = {International Conference on ITS Telecommunications (ITST), Sophia Antipolis, France, June 2007},
abstract = {Solutions for mobile ad hoc routing have matured over the last decade. Building atop these foundations, new challenges are set for MANETs, such as integration in the Internet core. On this topic, this paper designs and evaluates MPR-OSPF, an extension of the OSPF protocol enabling its operation on networks that may include both MANET nodes and usual fixed routers. Automatic integration of different types of vehicular ad hoc networks (VANETs) in the IP infrastructure is then possible using the classic OSPF framework. Techniques used therefore are derived from OLSR, the MANET routing protocol that is the most compatible with traditional IP environments.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Solutions for mobile ad hoc routing have matured over the last decade. Building atop these foundations, new challenges are set for MANETs, such as integration in the Internet core. On this topic, this paper designs and evaluates MPR-OSPF, an extension of the OSPF protocol enabling its operation on networks that may include both MANET nodes and usual fixed routers. Automatic integration of different types of vehicular ad hoc networks (VANETs) in the IP infrastructure is then possible using the classic OSPF framework. Techniques used therefore are derived from OLSR, the MANET routing protocol that is the most compatible with traditional IP environments.
Thomas Clausen
A MANET Architectural Model Technical Report
2007.
@techreport{LIX-NET-RR-3,
title = {A MANET Architectural Model},
author = {Thomas Clausen},
year = {2007},
date = {2007-01-01},
publisher = {INRIA Research Report RR-6145},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
2005
Emmanuel Baccelli; Thomas Clausen; Julien Garnier
Duplicate Address Detection in OLSR Networks Proceedings Article
In: IEEE Conference on Wireless Personal Multimedia Communications (WPMC), Aalborg, Denmark, Sept. 2005, 2005.
@inproceedings{Clausen2005,
title = {Duplicate Address Detection in OLSR Networks},
author = {Emmanuel Baccelli and Thomas Clausen and Julien Garnier},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2005-WPMC-Duplicate-Address-Detection-in-OLSR-Networks.pdf},
year = {2005},
date = {2005-09-01},
publisher = {IEEE Conference on Wireless Personal Multimedia Communications (WPMC), Aalborg, Denmark, Sept. 2005},
abstract = {Commonly, duplicate address detection is performed when configuring network interfaces in order to ensure that unique addresses are assigned to each interface in the network. Such mechanisms commonly operate with the premises that a node ”intelligently” selects an address which it supposes to be unique, followed by a duplicate ad- dress detection cycle, through which it verifies that no other active interfaces on the same network has been or is in the process of being configured with the same address. Even as- suming that such a mechanism is present in a MANET, al- lowing MANET nodes to initially configure their interfaces with addresses unique within the network, additional com- plications arise: two or more MANETs may merge to form a single network, and a formerly connected MANET may partition. Thus, unless it is ensured that all MANET in- terfaces are assigned globally unique addresses, addressing conflicts may at any point – not just during initial network configuration.
In this paper, we investigate the task of performing dupli- cate address detection when otherwise independent OLSR networks merge. We benefit from the information already exchanged by OLSR, and identify a number of mechanisms through which a node may detect a conflict between the ad- dress assigned to one of its interfaces, and an address as- signed to an interface on another node. The mechanisms proposed are, thus, entirely passive, creating no additional information exchange on the network.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Commonly, duplicate address detection is performed when configuring network interfaces in order to ensure that unique addresses are assigned to each interface in the network. Such mechanisms commonly operate with the premises that a node ”intelligently” selects an address which it supposes to be unique, followed by a duplicate ad- dress detection cycle, through which it verifies that no other active interfaces on the same network has been or is in the process of being configured with the same address. Even as- suming that such a mechanism is present in a MANET, al- lowing MANET nodes to initially configure their interfaces with addresses unique within the network, additional com- plications arise: two or more MANETs may merge to form a single network, and a formerly connected MANET may partition. Thus, unless it is ensured that all MANET in- terfaces are assigned globally unique addresses, addressing conflicts may at any point – not just during initial network configuration.
In this paper, we investigate the task of performing dupli- cate address detection when otherwise independent OLSR networks merge. We benefit from the information already exchanged by OLSR, and identify a number of mechanisms through which a node may detect a conflict between the ad- dress assigned to one of its interfaces, and an address as- signed to an interface on another node. The mechanisms proposed are, thus, entirely passive, creating no additional information exchange on the network.
In this paper, we investigate the task of performing dupli- cate address detection when otherwise independent OLSR networks merge. We benefit from the information already exchanged by OLSR, and identify a number of mechanisms through which a node may detect a conflict between the ad- dress assigned to one of its interfaces, and an address as- signed to an interface on another node. The mechanisms proposed are, thus, entirely passive, creating no additional information exchange on the network.
Thomas Clausen; Emmanuel Baccelli; Philippe Jacquet
Partial Topology in an MPR-based Solution for Wireless OSPF on Mobile Ad Hoc Networks Technical Report
2005.
@techreport{LIX-NET-RR-4,
title = {Partial Topology in an MPR-based Solution for Wireless OSPF on Mobile Ad Hoc Networks},
author = {Thomas Clausen and Emmanuel Baccelli and Philippe Jacquet},
year = {2005},
date = {2005-07-01},
publisher = {INRIA Research Report RR-5619},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Thomas Clausen; Cedric Adjih; Emmanuel Baccelli; Philippe Jacquet
On the robustness and stability of Connected Dominating Sets Technical Report
2005.
@techreport{LIX-NET-RR-5,
title = {On the robustness and stability of Connected Dominating Sets},
author = {Thomas Clausen and Cedric Adjih and Emmanuel Baccelli and Philippe Jacquet},
url = {https://www.thomasclausen.net/wp-content/uploads/2022/05/RR-5609.pdf},
year = {2005},
date = {2005-06-01},
urldate = {2005-06-01},
publisher = {INRIA Research Report RR-5609},
abstract = {We investigate in this paper the effect of mobility, collisions and obsolete informations on the performance of connected dominating set (CDS). In particular we show that neighbor-designated CDS such as multipoint relay (MPR) are in general more robust than self-selected CDS such as rule 𝑘 CDS. This is particularly crucial in application such as wireless OSPF where third party topology informations may take arbitrary delay.},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
We investigate in this paper the effect of mobility, collisions and obsolete informations on the performance of connected dominating set (CDS). In particular we show that neighbor-designated CDS such as multipoint relay (MPR) are in general more robust than self-selected CDS such as rule 𝑘 CDS. This is particularly crucial in application such as wireless OSPF where third party topology informations may take arbitrary delay.
Emmanuel Baccelli; Thomas Clausen
A Simple Address Autoconfiguration Mechanism for OLSR Proceedings Article
In: IEEE International Symposium on Circuits and Systems (ISCAS), Kobe, Japan, May 2005, 2005.
@inproceedings{Clausen2005b,
title = {A Simple Address Autoconfiguration Mechanism for OLSR},
author = {Emmanuel Baccelli and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2005-ISCAS-A-Simple-Address-Autoconfiguration-Mechanism-for-OLSR.pdf},
doi = {10.1109/ISCAS.2005.1465251},
year = {2005},
date = {2005-05-01},
publisher = {IEEE International Symposium on Circuits and Systems (ISCAS), Kobe, Japan, May 2005},
abstract = {In this paper, we develop a simple autoconfiguration mechanism for OLSR networks. The mechanism aims at solving the simple, but common, probem of one or more new nodes emerging in an ex- isting network. We propose a simple solution, which allows these new nodes to acquire an address and participate in the network. Our method is simple, both algorithmically and in the require- ments to the network. While we recognize that this is a partial so- lution to the general autoconfiguration problem, we argue that the mechanism described in this paper will satisfy the requirements from a great number of real-world situations.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we develop a simple autoconfiguration mechanism for OLSR networks. The mechanism aims at solving the simple, but common, probem of one or more new nodes emerging in an ex- isting network. We propose a simple solution, which allows these new nodes to acquire an address and participate in the network. Our method is simple, both algorithmically and in the require- ments to the network. While we recognize that this is a partial so- lution to the general autoconfiguration problem, we argue that the mechanism described in this paper will satisfy the requirements from a great number of real-world situations.
Emmanuel Baccelli; Thomas Clausen; Ryuji Wakikawa
Route Optimization in Nested Mobile Networks (NEMO) using OLSR Proceedings Article
In: International Conference on Networks and Communication Systems (NCS), Krabi, Thailand, April 2005, 2005.
@inproceedings{Clausen2005c,
title = {Route Optimization in Nested Mobile Networks (NEMO) using OLSR},
author = {Emmanuel Baccelli and Thomas Clausen and Ryuji Wakikawa},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2005-NCS-Route-Optimization-in-Nested-Mobile-Networks-NEMO-using-OLSR.pdf},
year = {2005},
date = {2005-04-01},
publisher = {International Conference on Networks and Communication Systems (NCS), Krabi, Thailand, April 2005},
abstract = {Internet edge mobility has been possible for a number of years: mobile IP[8], allows a host to change its point of at- tachment to the Internet and NEMO [6] allows the same functionality for a group of hosts along with a mobile router. The virtue of NEMO and mobile IP is transparency: a host remains identifiable through the same IP address, and traffic sent to that IP address will be tunneled to arrive at the intended node.
NEMO allows “nested networks”: a mobile network which attaches to another mobile network to arbitrary depth. However for each level of nesting, traffic is encap- sulated and tunneled to reach the destination. This leads to increased overhead (encapsulation) and to sub-optimal paths (tunneling without consideration for the actual net- work topology).
In this paper, we investigate route-optimization in nested NEMO networks. We employ an ad-hoc routing protocol between mobile routers to ensure shortest routes when both source and destination for traffic is within the nested NEMO network. The mechanism also simplifies the requirements for route optimization when the source node is located outside of the nested NEMO network.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Internet edge mobility has been possible for a number of years: mobile IP[8], allows a host to change its point of at- tachment to the Internet and NEMO [6] allows the same functionality for a group of hosts along with a mobile router. The virtue of NEMO and mobile IP is transparency: a host remains identifiable through the same IP address, and traffic sent to that IP address will be tunneled to arrive at the intended node.
NEMO allows “nested networks”: a mobile network which attaches to another mobile network to arbitrary depth. However for each level of nesting, traffic is encap- sulated and tunneled to reach the destination. This leads to increased overhead (encapsulation) and to sub-optimal paths (tunneling without consideration for the actual net- work topology).
In this paper, we investigate route-optimization in nested NEMO networks. We employ an ad-hoc routing protocol between mobile routers to ensure shortest routes when both source and destination for traffic is within the nested NEMO network. The mechanism also simplifies the requirements for route optimization when the source node is located outside of the nested NEMO network.
NEMO allows “nested networks”: a mobile network which attaches to another mobile network to arbitrary depth. However for each level of nesting, traffic is encap- sulated and tunneled to reach the destination. This leads to increased overhead (encapsulation) and to sub-optimal paths (tunneling without consideration for the actual net- work topology).
In this paper, we investigate route-optimization in nested NEMO networks. We employ an ad-hoc routing protocol between mobile routers to ensure shortest routes when both source and destination for traffic is within the nested NEMO network. The mechanism also simplifies the requirements for route optimization when the source node is located outside of the nested NEMO network.
Thomas Clausen; Anis Laouiti; Paul Muhlethaler; Daniel Raffo; Cedric Adjih
Securing the OLSR routing protocol with or without compromised nodes in the network Technical Report
2005.
@techreport{LIX-NET-RR-6,
title = {Securing the OLSR routing protocol with or without compromised nodes in the network},
author = {Thomas Clausen and Anis Laouiti and Paul Muhlethaler and Daniel Raffo and Cedric Adjih},
url = {http://www.thomasclausen.net/wp-content/uploads/2018/05/RR-5494.pdf},
year = {2005},
date = {2005-02-01},
publisher = {INRIA Research Report RR-5621},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
2004
Thomas Clausen; Emmanuel Baccelli; Georgios Rodolakis; Cedric Adjih; Philippe Jacquet
Fish-Eye OLSR Scaling Properties Journal Article
In: IEEE Journal on Communications Networks (JCN), Special Issue on Ad Hoc Networking, Dec 2004, 2004.
@article{LIX-NET-journal-2,
title = {Fish-Eye OLSR Scaling Properties},
author = {Thomas Clausen and Emmanuel Baccelli and Georgios Rodolakis and Cedric Adjih and Philippe Jacquet},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2004-JCN-Fish-Eye-OLSR-Scaling-Properties.pdf},
year = {2004},
date = {2004-12-01},
journal = {IEEE Journal on Communications Networks (JCN), Special Issue on Ad Hoc Networking, Dec 2004},
abstract = {Scalability is one of the toughest challenges in ad hoc networking. Recent work outlines theoretical bounds on how well routing protocols could scale in this environment. However, none of the popular routing solutions really scales to large networks, by coming close enough to these bounds. In this paper, we study the case of link state routing and OLSR, one of the strongest candidate for standardization. We analyze how these bounds are not reached in this case, and we study how much the scalability is enhanced with the use of Fish Eye techniques in addition to the link state routing framework. We show that with this enhancement, the theoretical scalability bounds are reached.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Scalability is one of the toughest challenges in ad hoc networking. Recent work outlines theoretical bounds on how well routing protocols could scale in this environment. However, none of the popular routing solutions really scales to large networks, by coming close enough to these bounds. In this paper, we study the case of link state routing and OLSR, one of the strongest candidate for standardization. We analyze how these bounds are not reached in this case, and we study how much the scalability is enhanced with the use of Fish Eye techniques in addition to the link state routing framework. We show that with this enhancement, the theoretical scalability bounds are reached.
Emmanuel Baccelli; Thomas Clausen; Philippe Jacquet
OSPF-style Database Exchange and Reliable Synchronization in the Optimized Link State Routing Protocol Proceedings Article
In: IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON), San Jose, USA, Oct. 2004, 2004.
@inproceedings{Clausen2004b,
title = {OSPF-style Database Exchange and Reliable Synchronization in the Optimized Link State Routing Protocol},
author = {Emmanuel Baccelli and Thomas Clausen and Philippe Jacquet},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2004-IEEE-SECON-OSPF-style-Database-Exchange-and-Reliable-Synchronization-in-the-Optimized-Link-State-Routing-Protocol.pdf},
doi = {10.1109/SAHCN.2004.1381921},
year = {2004},
date = {2004-10-01},
publisher = {IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON), San Jose, USA, Oct. 2004},
abstract = {The Optimized Link-State Routing protocol (OLSR) is a proactive link-state routing protocol. While similar to the well-known Internet routing protocol OSPF, OLSR is designed to be simple, and to maintain connec- tivity in face of highly dense and dynamic networks, while being ressource-economic (battery, bandwidth etc.) These characteristics make OLSR suitable as an underlaying routing protocol in a wide range of ad-hoc sensor networks.
In this paper, we introduce an extension to OLSR: OSPF-style database exchange and reliable synchroniza- tion. The goal of this extension is to provide a mechanism, through which nodes in an ad-hoc sensor network can de- tect and correct discrepancies in their link-state databases. We qualify why the mechanism, found in OSPF, is not directly applicable for ad-hoc sensor networks, describe an adopted mechanism, accomplishing the same goal, and evaluate the performance of this mechanism in comparison to the database exchange mechanism found in OSPF. We finally discuss some applications of database exchange and reliable synchronization in ad-hoc sensor networks.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The Optimized Link-State Routing protocol (OLSR) is a proactive link-state routing protocol. While similar to the well-known Internet routing protocol OSPF, OLSR is designed to be simple, and to maintain connec- tivity in face of highly dense and dynamic networks, while being ressource-economic (battery, bandwidth etc.) These characteristics make OLSR suitable as an underlaying routing protocol in a wide range of ad-hoc sensor networks.
In this paper, we introduce an extension to OLSR: OSPF-style database exchange and reliable synchroniza- tion. The goal of this extension is to provide a mechanism, through which nodes in an ad-hoc sensor network can de- tect and correct discrepancies in their link-state databases. We qualify why the mechanism, found in OSPF, is not directly applicable for ad-hoc sensor networks, describe an adopted mechanism, accomplishing the same goal, and evaluate the performance of this mechanism in comparison to the database exchange mechanism found in OSPF. We finally discuss some applications of database exchange and reliable synchronization in ad-hoc sensor networks.
In this paper, we introduce an extension to OLSR: OSPF-style database exchange and reliable synchroniza- tion. The goal of this extension is to provide a mechanism, through which nodes in an ad-hoc sensor network can de- tect and correct discrepancies in their link-state databases. We qualify why the mechanism, found in OSPF, is not directly applicable for ad-hoc sensor networks, describe an adopted mechanism, accomplishing the same goal, and evaluate the performance of this mechanism in comparison to the database exchange mechanism found in OSPF. We finally discuss some applications of database exchange and reliable synchronization in ad-hoc sensor networks.
Emmanuel Baccelli; Thomas Clausen; Philippe Jacquet
Ad-hoc and Internet Convergence: Adapting OSPF-style Database Exchanges for Ad-hoc Networks, Proceedings Article
In: Proceedings of the Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs), London, UK., Proceedings of the Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs), London, UK., 2004.
@inproceedings{Clausen2004,
title = {Ad-hoc and Internet Convergence: Adapting OSPF-style Database Exchanges for Ad-hoc Networks,},
author = {Emmanuel Baccelli and Thomas Clausen and Philippe Jacquet},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2004-HetNets-Ad-hoc-and-Internet-Convergence-Adapting-OSPF-style-Database-Exchanges-for-Ad-hoc-Networks.pdf},
year = {2004},
date = {2004-10-01},
booktitle = {Proceedings of the Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs), London, UK.},
publisher = {Proceedings of the Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs), London, UK.},
abstract = {The OSPF routing protocol is, currently, the predominant IGP in use on the fixed Internet of today. This routing protocol scales (in principle) ”world wide”, under the assumptions of links being relatively stable, network density being low (relatively few adjacencies per router) and mobility being present at the edges of the networks only. Recently, work has begun towards extending the domain of OSPF to also include ad-hoc networks – i.e. dense networks, in which links are short-lived and all nodes are mobile.
In this paper, we focus on the convergence of the Internet and ad-hoc networks, through extensions to the OSPF routing protocol. Based on WOSPF, a merger of the ad- hoc routing protocol OLSR and OSPF, we examine the feature of OSPF database exchange and reliable synchro- nisation in the context of ad-hoc networking. We find that the mechanisms, in the form present in OSPF, are not suitable for the ad-hoc domain. We propose an alternative mechanism for link-state database exchanges in wireless ad-hoc networks, aiming at furthering an adaptation of OSPF to be useful also on ad-hoc networks, and evaluate our alternative against the mechanism found in OSPF.
Our proposed mechanism is specified with the following applications in mind: (i) Reliable diffusion of link-state information replacing OSPF acknowledgements with a mechanism suitable for mobile wireless networks; (ii) Reduced overhead for performing OSPF style database exchanges in a mobile wireless network; (iii) Reduced initialisation time when new nodes are emerging in the network; (iv) Reduced overhead and reduced convergence time when several wireless OSPF ad hoc network clouds merge.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
The OSPF routing protocol is, currently, the predominant IGP in use on the fixed Internet of today. This routing protocol scales (in principle) ”world wide”, under the assumptions of links being relatively stable, network density being low (relatively few adjacencies per router) and mobility being present at the edges of the networks only. Recently, work has begun towards extending the domain of OSPF to also include ad-hoc networks – i.e. dense networks, in which links are short-lived and all nodes are mobile.
In this paper, we focus on the convergence of the Internet and ad-hoc networks, through extensions to the OSPF routing protocol. Based on WOSPF, a merger of the ad- hoc routing protocol OLSR and OSPF, we examine the feature of OSPF database exchange and reliable synchro- nisation in the context of ad-hoc networking. We find that the mechanisms, in the form present in OSPF, are not suitable for the ad-hoc domain. We propose an alternative mechanism for link-state database exchanges in wireless ad-hoc networks, aiming at furthering an adaptation of OSPF to be useful also on ad-hoc networks, and evaluate our alternative against the mechanism found in OSPF.
Our proposed mechanism is specified with the following applications in mind: (i) Reliable diffusion of link-state information replacing OSPF acknowledgements with a mechanism suitable for mobile wireless networks; (ii) Reduced overhead for performing OSPF style database exchanges in a mobile wireless network; (iii) Reduced initialisation time when new nodes are emerging in the network; (iv) Reduced overhead and reduced convergence time when several wireless OSPF ad hoc network clouds merge.
In this paper, we focus on the convergence of the Internet and ad-hoc networks, through extensions to the OSPF routing protocol. Based on WOSPF, a merger of the ad- hoc routing protocol OLSR and OSPF, we examine the feature of OSPF database exchange and reliable synchro- nisation in the context of ad-hoc networking. We find that the mechanisms, in the form present in OSPF, are not suitable for the ad-hoc domain. We propose an alternative mechanism for link-state database exchanges in wireless ad-hoc networks, aiming at furthering an adaptation of OSPF to be useful also on ad-hoc networks, and evaluate our alternative against the mechanism found in OSPF.
Our proposed mechanism is specified with the following applications in mind: (i) Reliable diffusion of link-state information replacing OSPF acknowledgements with a mechanism suitable for mobile wireless networks; (ii) Reduced overhead for performing OSPF style database exchanges in a mobile wireless network; (iii) Reduced initialisation time when new nodes are emerging in the network; (iv) Reduced overhead and reduced convergence time when several wireless OSPF ad hoc network clouds merge.
Thomas Clausen; Philippe Jacquet; Laurent Viennot
Analyzing Control Traffic Overhead versus Mobility and Data Traffic Activity in Mobile Ad Hoc Network Protocols Journal Article
In: ACM Journal on Wireless Networks (Winet) July 2004, volume 10 no. 4, 2004.
@article{Clausen2004c,
title = {Analyzing Control Traffic Overhead versus Mobility and Data Traffic Activity in Mobile Ad Hoc Network Protocols},
author = {Thomas Clausen and Philippe Jacquet and Laurent Viennot},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2004-ACM-WINET-Analyzing-Control-Traffic-Overhead-versus-Mobility-and-Data-Traffic-Activity-in-Mobile-Ad-hoc-Network-Protoc.pdf},
year = {2004},
date = {2004-07-01},
journal = {ACM Journal on Wireless Networks (Winet) July 2004, volume 10 no. 4},
abstract = {This paper proposes a general, parameterized model for analyzing protocol control overhead in mobile ad-hoc networks. A probabilistic model for the network topology and the data traffic is proposed in order to estimate overhead due to control packets of routing protocols. Our analytical model is validated by comparisons with simulations, both taken from literature and made specifically for this paper. For example, our model predicts linearity of control overhead with regard to mobility as observed in existing simulations results. We identify the model parameters for protocols like AODV, DSR and OLSR. Our model then allows accurate predictions of which protocol will yield the lowest overhead depending on the node mobility and traffic activity pattern.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This paper proposes a general, parameterized model for analyzing protocol control overhead in mobile ad-hoc networks. A probabilistic model for the network topology and the data traffic is proposed in order to estimate overhead due to control packets of routing protocols. Our analytical model is validated by comparisons with simulations, both taken from literature and made specifically for this paper. For example, our model predicts linearity of control overhead with regard to mobility as observed in existing simulations results. We identify the model parameters for protocols like AODV, DSR and OLSR. Our model then allows accurate predictions of which protocol will yield the lowest overhead depending on the node mobility and traffic activity pattern.
Thomas Clausen; Philippe Jacquet; Emmanuel Baccelli
OSPF-style Database Exchange and Reliable Synchronization in the OLSR Technical Report
2004.
@techreport{Clausen2004bb,
title = {OSPF-style Database Exchange and Reliable Synchronization in the OLSR},
author = {Thomas Clausen and Philippe Jacquet and Emmanuel Baccelli},
year = {2004},
date = {2004-06-01},
publisher = {INRIA Research Report RR-5283},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Thomas Clausen
Comparative Study of Routing Protocols for Mobile Ad-hoc networks Proceedings Article
In: INRIA Research Report RR-5135, 2004.
@inproceedings{Clausen2004bbb,
title = {Comparative Study of Routing Protocols for Mobile Ad-hoc networks},
author = {Thomas Clausen},
year = {2004},
date = {2004-03-01},
publisher = {INRIA Research Report RR-5135},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Thomas Clausen; Emmanuel Baccelli; Philippe Jacquet
Signature and Database Exchange for Wireless OSPF Interfaces Technical Report
2004.
@techreport{Clausen2004bbc,
title = {Signature and Database Exchange for Wireless OSPF Interfaces},
author = {Thomas Clausen and Emmanuel Baccelli and Philippe Jacquet},
url = {https://www.thomasclausen.net/wp-content/uploads/2022/05/RR-5096.pdf},
year = {2004},
date = {2004-01-01},
urldate = {2004-01-01},
publisher = {INRIA Research Report RR-5096},
abstract = {In this paper, we specify a mechanism for link-state database exchanges in wire- less ad-hoc networks. The mechanism is taylored for ad-hoc networks employing the wireless OSPF interface extension specification, however is suitable for any proactive link-state routing protocol. The database exchange mechanism is specified with the following applications in mind:
(I) reliable diffusion of link-state information, replacing OSPF acknowledgements with a mechanism, suitable for mobile wireless networks;
(II) reduced overhead for performing OSPF style database exchanges in a mobile wireless network;
(III) reduced initialization time when new node(s) are emerging in the network;
(IV) reduced overhead and reduced convergence time when two (or more) WOSPF adhoc network clouds merge},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
In this paper, we specify a mechanism for link-state database exchanges in wire- less ad-hoc networks. The mechanism is taylored for ad-hoc networks employing the wireless OSPF interface extension specification, however is suitable for any proactive link-state routing protocol. The database exchange mechanism is specified with the following applications in mind:
(I) reliable diffusion of link-state information, replacing OSPF acknowledgements with a mechanism, suitable for mobile wireless networks;
(II) reduced overhead for performing OSPF style database exchanges in a mobile wireless network;
(III) reduced initialization time when new node(s) are emerging in the network;
(IV) reduced overhead and reduced convergence time when two (or more) WOSPF adhoc network clouds merge
(I) reliable diffusion of link-state information, replacing OSPF acknowledgements with a mechanism, suitable for mobile wireless networks;
(II) reduced overhead for performing OSPF style database exchanges in a mobile wireless network;
(III) reduced initialization time when new node(s) are emerging in the network;
(IV) reduced overhead and reduced convergence time when two (or more) WOSPF adhoc network clouds merge
Daniele Raffo; Cédric Adjih; Thomas Clausen; Paul Mühlethaler
An advanced signature system for OLSR Proceedings Article
In: workshop on security of ad hoc and sensor networks, pp. 10–16, 2004.
@inproceedings{Clausen2004d,
title = {An advanced signature system for OLSR},
author = {Daniele Raffo and Cédric Adjih and Thomas Clausen and Paul Mühlethaler},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2003-SASN-An-advanced-signature-system-for-OLSR..pdf},
doi = {10.1145/1029102.1029106},
year = {2004},
date = {2004-01-01},
booktitle = {workshop on security of ad hoc and sensor networks},
pages = {10–16},
abstract = {In this paper we investigate security issues related to the Optimized Link State Routing Protocol – one example of a proactive routing protocol for MANETs. We inventory the possible attacks against the integrity of the OLSR network routing infrastructure, and present a technique for securing the network. In particular, assuming that a mechanism for routing message authentication (digital signatures) has been deployed, we concentrate on the problem where otherwise "trusted" nodes have been compromised by attackers, which could then inject false (however correctly signed) routing messages. Our main approach is based on authentication checks of information injected into the network, and reuse of this information by a node to prove its link state at a later time. We finally synthetize the overhead and the remaining vulnerabilities of the proposed solution.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper we investigate security issues related to the Optimized Link State Routing Protocol – one example of a proactive routing protocol for MANETs. We inventory the possible attacks against the integrity of the OLSR network routing infrastructure, and present a technique for securing the network. In particular, assuming that a mechanism for routing message authentication (digital signatures) has been deployed, we concentrate on the problem where otherwise "trusted" nodes have been compromised by attackers, which could then inject false (however correctly signed) routing messages. Our main approach is based on authentication checks of information injected into the network, and reuse of this information by a node to prove its link state at a later time. We finally synthetize the overhead and the remaining vulnerabilities of the proposed solution.
2003
Thomas Clausen; Philippe Jacquet
RFC3626: The Optimized Link State Routing Protocol Miscellaneous
2003, (http://tools.ietf.org/html/rfc3626).
@misc{Clausen2003,
title = {RFC3626: The Optimized Link State Routing Protocol},
author = {Thomas Clausen and Philippe Jacquet},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc3626.txt.pdf},
doi = {10.17487/RFC3626},
year = {2003},
date = {2003-10-01},
publisher = {The Internet Engineering Task Force (IETF) - MANET Working Group},
organization = {The Internet Engineering Task Force},
abstract = {This document describes the Optimized Link State Routing (OLSR) protocol for mobile ad hoc networks. The protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN. The key concept used in the protocol is that of multipoint relays (MPRs). MPRs are selected nodes which forward broadcast messages during the flooding process. This technique substantially reduces the message overhead as compared to a classical flooding mechanism, where every node retransmits each message when it receives the first copy of the message. In OLSR, link state information is generated only by nodes elected as MPRs. Thus, a second optimization is achieved by minimizing the number of control messages flooded in the network. As a third optimization, an MPR node may chose to report only links between itself and its MPR selectors. Hence, as contrary to the classic link state algorithm, partial link state information is distributed in the network. This information is then used for route calculation. OLSR provides optimal routes (in terms of number of hops). The protocol is particularly suitable for large and dense networks as the technique of MPRs works well in this context.},
note = {http://tools.ietf.org/html/rfc3626},
keywords = {},
pubstate = {published},
tppubtype = {misc}
}
This document describes the Optimized Link State Routing (OLSR) protocol for mobile ad hoc networks. The protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN. The key concept used in the protocol is that of multipoint relays (MPRs). MPRs are selected nodes which forward broadcast messages during the flooding process. This technique substantially reduces the message overhead as compared to a classical flooding mechanism, where every node retransmits each message when it receives the first copy of the message. In OLSR, link state information is generated only by nodes elected as MPRs. Thus, a second optimization is achieved by minimizing the number of control messages flooded in the network. As a third optimization, an MPR node may chose to report only links between itself and its MPR selectors. Hence, as contrary to the classic link state algorithm, partial link state information is distributed in the network. This information is then used for route calculation. OLSR provides optimal routes (in terms of number of hops). The protocol is particularly suitable for large and dense networks as the technique of MPRs works well in this context.
Thomas Clausen
Combining Temporal and Spartial Partial Topolgy for MANET Routing - Merging OLSR and FSR Proceedings Article
In: Proceedings of the IEEE conference on Wireless Personal Multimedia Communications (WPMC), 2003.
@inproceedings{Clausen2003b,
title = {Combining Temporal and Spartial Partial Topolgy for MANET Routing - Merging OLSR and FSR},
author = {Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2003-WPMC-Combining-Temporal-and-Spartial-Partial-Topolgy-for-MANET-Routing-Merging-OLSR-and-FSR.pdf},
year = {2003},
date = {2003-10-01},
booktitle = {Proceedings of the IEEE conference on Wireless Personal Multimedia Communications (WPMC)},
abstract = {In this paper, we propose an extension to the Optimized Link State Routing (OLSR) protocol, a proactive link-state routing protocol optimized for mobile ad-hoc networks, in-troducing temporal partial topology as a mechanism for re-ducing control traffic overhead. The extension is inspired from Fisheye State Routing (FSR), and complements the spatial partial topology of OLSR in extending scalability of manet routing protocols to large, dense networks. Through simulations, the paper justifies that through in-troducing temporal partial topology information in OLSR, the control traffic overhead in some manet configurations can be reduced.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we propose an extension to the Optimized Link State Routing (OLSR) protocol, a proactive link-state routing protocol optimized for mobile ad-hoc networks, in-troducing temporal partial topology as a mechanism for re-ducing control traffic overhead. The extension is inspired from Fisheye State Routing (FSR), and complements the spatial partial topology of OLSR in extending scalability of manet routing protocols to large, dense networks. Through simulations, the paper justifies that through in-troducing temporal partial topology information in OLSR, the control traffic overhead in some manet configurations can be reduced.
Thomas Clausen; Anis Laouiti; Philippe Jacquet; Pascale Minet; Laurent Viennot; Cedric Adjih
Multicast Optimized Link State Routing Technical Report
2003.
@techreport{LIX-NET-RR-10,
title = {Multicast Optimized Link State Routing},
author = {Thomas Clausen and Anis Laouiti and Philippe Jacquet and Pascale Minet and Laurent Viennot and Cedric Adjih},
url = {https://www.thomasclausen.net/wp-content/uploads/2022/05/RR-4721.pdf},
year = {2003},
date = {2003-02-01},
urldate = {2003-02-01},
publisher = {INRIA Research Report RR-4721},
abstract = {This document describes the Multicast extension for the Optimized Link State
Routing protocol (MOLSR). MOLSR is in charge of building a multicast structure in order to route multicast traffic in an ad-hoc network. MOLSR is designed for mobile multicast routers, and works in a heterogenous network composed of simple unicast OLSR routers, MOLSR routers and hosts. In the last part of this document we introduce also a Wireless Internet Group Management Protocol (WIGMP). It offers the possibility for OLSR nodes (without multicast capabilities) to join multicast groups and receive multicast data.},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
This document describes the Multicast extension for the Optimized Link State
Routing protocol (MOLSR). MOLSR is in charge of building a multicast structure in order to route multicast traffic in an ad-hoc network. MOLSR is designed for mobile multicast routers, and works in a heterogenous network composed of simple unicast OLSR routers, MOLSR routers and hosts. In the last part of this document we introduce also a Wireless Internet Group Management Protocol (WIGMP). It offers the possibility for OLSR nodes (without multicast capabilities) to join multicast groups and receive multicast data.
Routing protocol (MOLSR). MOLSR is in charge of building a multicast structure in order to route multicast traffic in an ad-hoc network. MOLSR is designed for mobile multicast routers, and works in a heterogenous network composed of simple unicast OLSR routers, MOLSR routers and hosts. In the last part of this document we introduce also a Wireless Internet Group Management Protocol (WIGMP). It offers the possibility for OLSR nodes (without multicast capabilities) to join multicast groups and receive multicast data.
Cedric Adjih; Thomas Clausen; Anis Laouiti; Paul Mühlethaler; Daniele Raffo
Securing the OLSR protocol Proceedings Article
In: In 2nd IFIP Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2003), Mahdia, pp. 25–27, 2003.
@inproceedings{Clausen2003e,
title = {Securing the OLSR protocol},
author = {Cedric Adjih and Thomas Clausen and Anis Laouiti and Paul Mühlethaler and Daniele Raffo},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/securing-olsr.pdf},
year = {2003},
date = {2003-01-01},
booktitle = {In 2nd IFIP Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2003), Mahdia},
pages = {25–27},
abstract = {In this paper, we examine security issues related to proactive routing protocols for MANETs. Specifically, we investigate security properties of the Optimized Link-State Routing Protocol- one example of a proactive routing protocol for MANETs. We investigate the possible attacks against the integrity of the network routing infrastructure, and present techniques for countering a variety of such attacks. Our main approach is based on authentication checks of information injected into the network. However even with perfect authentication check, replay attacks are still possible. Hence, we develop a distributed timestamp-based approach for verifying if a message is “old ” or “current”. We finally present two different, simple algorithms for distributing public keys in a MANET, in order to provide a mechanism permitting authentication checks to be conducted. While we use OLSR as an example protocol for our studies, we argue that the presented techniques apply equally to any proactive routing protocol for MANETs.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we examine security issues related to proactive routing protocols for MANETs. Specifically, we investigate security properties of the Optimized Link-State Routing Protocol- one example of a proactive routing protocol for MANETs. We investigate the possible attacks against the integrity of the network routing infrastructure, and present techniques for countering a variety of such attacks. Our main approach is based on authentication checks of information injected into the network. However even with perfect authentication check, replay attacks are still possible. Hence, we develop a distributed timestamp-based approach for verifying if a message is “old ” or “current”. We finally present two different, simple algorithms for distributing public keys in a MANET, in order to provide a mechanism permitting authentication checks to be conducted. While we use OLSR as an example protocol for our studies, we argue that the presented techniques apply equally to any proactive routing protocol for MANETs.
2002
Thomas Clausen; Amir Qayyum; Philippe Jacquet; Y. Toor; Paul Muhlethaler
Sleep mode operation of a routing protocol in mobile ad hoc networks Proceedings Article
In: The proceedings of the joint International Conference on Wireless LANs and Home Networks (ICWLHN 2002) and Networking (ICN 2002), 2002, ISBN: 9812381279.
@inproceedings{Clausen2002b,
title = {Sleep mode operation of a routing protocol in mobile ad hoc networks},
author = {Thomas Clausen and Amir Qayyum and Philippe Jacquet and Y. Toor and Paul Muhlethaler},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2002-NETWORK-Sleep-Mode-Operation-of-a-Routing-Protocol-in-Mobile-Ad-hoc-Networks.pdf},
isbn = {9812381279},
year = {2002},
date = {2002-11-01},
booktitle = {The proceedings of the joint International Conference on Wireless LANs and Home Networks (ICWLHN 2002) and Networking (ICN 2002)},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Thomas Clausen; Laurent Viennot; Tue Olesen; Nikolai Larsen
Investigating data broadcast performance in mobile ad-hoc networks Proceedings Article
In: Wireless Personal Multimedia Communications, 2002. The 5th International Symposium on, pp. 786-790 vol.2, 2002, ISSN: 1347-6890.
@inproceedings{Clausen2002a,
title = {Investigating data broadcast performance in mobile ad-hoc networks},
author = {Thomas Clausen and Laurent Viennot and Tue Olesen and Nikolai Larsen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2002-WPMC-Investigating-data-broadcast-performance-in-mobile-ad-hoc-networks.pdf},
doi = {10.1109/WPMC.2002.1088283},
issn = {1347-6890},
year = {2002},
date = {2002-10-01},
booktitle = {Wireless Personal Multimedia Communications, 2002. The 5th International Symposium on},
volume = {2},
pages = {786-790 vol.2},
abstract = {We investigate broadcasting in mobile ad-hoc networks (MANETs). We define broadcasting as being the process of delivering one packet, originated at one node, to (ideally) all other nodes in the MANET. We present specific problems related to broadcasting in MANETs, as well as four broadcast protocols aimed at providing MANET-wide broadcast. Further, three protocol-independent modifications are presented. One aimed at ensuring that a broadcast packet traverses at least the "shortest path" to its destinations, and two aimed at increasing the fraction of nodes which receive a broadcast packet. Through simulation studies, we evaluate the performance characteristics of the broadcast protocols and generic modifications under different conditions.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
We investigate broadcasting in mobile ad-hoc networks (MANETs). We define broadcasting as being the process of delivering one packet, originated at one node, to (ideally) all other nodes in the MANET. We present specific problems related to broadcasting in MANETs, as well as four broadcast protocols aimed at providing MANET-wide broadcast. Further, three protocol-independent modifications are presented. One aimed at ensuring that a broadcast packet traverses at least the "shortest path" to its destinations, and two aimed at increasing the fraction of nodes which receive a broadcast packet. Through simulation studies, we evaluate the performance characteristics of the broadcast protocols and generic modifications under different conditions.
Thomas Clausen; Philippe Jacquet; Laurent Viennot
Investigating the impact of partial topology in proactive MANET routing protocols Proceedings Article
In: Wireless Personal Multimedia Communications, 2002. The 5th International Symposium on, pp. 1374-1378 vol.3, 2002, ISSN: 1347-6890.
@inproceedings{Clausen2002,
title = {Investigating the impact of partial topology in proactive MANET routing protocols},
author = {Thomas Clausen and Philippe Jacquet and Laurent Viennot},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2002-WPMC-Investigating-the-impact-of-partial-topology-in-proactive-MANET-routing-protocols.pdf},
doi = {10.1109/WPMC.2002.1088405},
issn = {1347-6890},
year = {2002},
date = {2002-10-01},
booktitle = {Wireless Personal Multimedia Communications, 2002. The 5th International Symposium on},
volume = {3},
pages = {1374-1378 vol.3},
abstract = {We study the impact of using partial versus full topology in the OLSR (optimized link state routing) protocol for MANETs (mobile ad hoc networks). The core of OLSR is the notion of multi-point relays (MPRs), serving the purpose of reducing the amount of link-state information flooded to nodes in the network, as well as reducing the redundancy in the flooding process. The OLSR protocol specification contains a tunable parameter, MPR coverage, which adjusts the degree of redundancy in both the advertised link-state information, and the links over which the link-state information is advertised. We investigate the impact of assigning various values to this parameter. We further investigate two options for advertising additional link-state information: the "MPR full link-state" option implies that whenever a node is selected to declare any link-state information, it declares all its local link state information; the "full link-state" option states, that all nodes must declare all their local link-state information. Through simulations, we investigate the performance characteristics of OLSR with and without these options.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
We study the impact of using partial versus full topology in the OLSR (optimized link state routing) protocol for MANETs (mobile ad hoc networks). The core of OLSR is the notion of multi-point relays (MPRs), serving the purpose of reducing the amount of link-state information flooded to nodes in the network, as well as reducing the redundancy in the flooding process. The OLSR protocol specification contains a tunable parameter, MPR coverage, which adjusts the degree of redundancy in both the advertised link-state information, and the links over which the link-state information is advertised. We investigate the impact of assigning various values to this parameter. We further investigate two options for advertising additional link-state information: the "MPR full link-state" option implies that whenever a node is selected to declare any link-state information, it declares all its local link state information; the "full link-state" option states, that all nodes must declare all their local link-state information. Through simulations, we investigate the performance characteristics of OLSR with and without these options.
Thomas Clausen; Philippe Jacquet; Laurent Viennot
Optimizing Route Length in Reactive Protocols for Ad Hoc Networks Proceedings Article
In: In Proceeding of The First Annual Mediterranean Ad Hoc Networking Workshop., 2002.
@inproceedings{Clausen2002e,
title = {Optimizing Route Length in Reactive Protocols for Ad Hoc Networks},
author = {Thomas Clausen and Philippe Jacquet and Laurent Viennot},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2002-MedHocNets-Optimizing-Route-Length-in-Reactive-Protocols-for-Ad-Hoc-Networks.pdf},
year = {2002},
date = {2002-09-01},
booktitle = {In Proceeding of The First Annual Mediterranean Ad Hoc Networking Workshop.},
abstract = {Many protocols for Mobile Ad-hoc Networks propose construction of routes reactively using flooding. The advantage hereof is that no prior assumption of the network topology is required in order to provide routing between any pair of nodes in the network. In mobile networks, where the topology may be subject to frequent changes, this is a particularly attractive property. In this paper, we investigate the effect of using flooding for acquiring routes. We show that flooding may lead to non-optimal routes in terms of number of hops. This implies that more retransmissions are needed to send a packet along a route. We proceed by providing a qualitative analysis of the route lengths. Finally, we propose alternative flooding schemes and evaluate these schemes through simulations. We find that using these schemes, it is indeed possible to provide shorter routes.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Many protocols for Mobile Ad-hoc Networks propose construction of routes reactively using flooding. The advantage hereof is that no prior assumption of the network topology is required in order to provide routing between any pair of nodes in the network. In mobile networks, where the topology may be subject to frequent changes, this is a particularly attractive property. In this paper, we investigate the effect of using flooding for acquiring routes. We show that flooding may lead to non-optimal routes in terms of number of hops. This implies that more retransmissions are needed to send a packet along a route. We proceed by providing a qualitative analysis of the route lengths. Finally, we propose alternative flooding schemes and evaluate these schemes through simulations. We find that using these schemes, it is indeed possible to provide shorter routes.
Thomas Clausen; Philippe Jacquet; Laurent Viennot
Comparative Study of Routing Protocols for Mobile Ad-hoc NETworks Proceedings Article
In: Proceedings of the IFIP MedHocNet, September 2002, Sardinia, Italy, 2002.
@inproceedings{Clausen2002c,
title = {Comparative Study of Routing Protocols for Mobile Ad-hoc NETworks},
author = {Thomas Clausen and Philippe Jacquet and Laurent Viennot},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2002-MedHocNets-Comparative-Study-of-Routing-Protocols-for-Mobile-Ad-hoc-NETwork.pdf},
year = {2002},
date = {2002-09-01},
booktitle = {Proceedings of the IFIP MedHocNet, September 2002, Sardinia, Italy},
abstract = {In this paper, we describe the Optimized Link State Routing Protocol (OLSR) [19],[20], a proactive routing protocol for Mobile Ad-hoc NETworks (MANETs). We eval- uate its performance through exhaustive simulations using the Network Simulator 2 (ns2) [1], and compare with other ad-hoc protocols, specifically the Ad-hoc On-Demand Dis- tance Vector (AODV) [4] routing protocol and the Dynamic Source Routing (DSR) [5] protocol. We study the protocols under varying conditions (node mobility, network density) and with varying traffic (TCP, UDP, different number of connections/streams) to provide a qualitative assessment of the applicability of the protocols in different scenarios.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we describe the Optimized Link State Routing Protocol (OLSR) [19],[20], a proactive routing protocol for Mobile Ad-hoc NETworks (MANETs). We eval- uate its performance through exhaustive simulations using the Network Simulator 2 (ns2) [1], and compare with other ad-hoc protocols, specifically the Ad-hoc On-Demand Dis- tance Vector (AODV) [4] routing protocol and the Dynamic Source Routing (DSR) [5] protocol. We study the protocols under varying conditions (node mobility, network density) and with varying traffic (TCP, UDP, different number of connections/streams) to provide a qualitative assessment of the applicability of the protocols in different scenarios.
Thomas Clausen; Philippe Jacquet; Laurent Viennot
Comparative study of CBR and TCP performance of MANET routing protocols Proceedings Article
In: Workshop on Broadband Wireless Ad-Hoc Networks and Services, Sep 2002, Sophia-Antipolis, France. 2002, 2002.
@inproceedings{Clausen2002f,
title = {Comparative study of CBR and TCP performance of MANET routing protocols},
author = {Thomas Clausen and Philippe Jacquet and Laurent Viennot},
url = {http://www.thomasclausen.net/wp-content/uploads/2018/05/2003-MESA-TCPPerformanceComparisoninMANETs.pdf},
year = {2002},
date = {2002-05-01},
booktitle = {Workshop on Broadband Wireless Ad-Hoc Networks and Services, Sep 2002, Sophia-Antipolis, France. 2002},
abstract = {In this paper, we evaluate the performance of two MANET routing protocols under varying
traffic, density and mobility conditions. We observe, that a rather large fraction of the traffic being carried on the Internet today carries TCP. Thus, Internet traffic has inheritly different characteristics than that of CBR traffic, which is the commonly used traffic type for evaluating MANET routing protocol performance. Hence, in this paper, we extend our evaluations of the two protocols to include the performance of both TCP and CBR traffic. We find, that testing a protocol using CBR traffic is not a good indicator for the same protocols performance when subject to TCP traffic.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we evaluate the performance of two MANET routing protocols under varying
traffic, density and mobility conditions. We observe, that a rather large fraction of the traffic being carried on the Internet today carries TCP. Thus, Internet traffic has inheritly different characteristics than that of CBR traffic, which is the commonly used traffic type for evaluating MANET routing protocol performance. Hence, in this paper, we extend our evaluations of the two protocols to include the performance of both TCP and CBR traffic. We find, that testing a protocol using CBR traffic is not a good indicator for the same protocols performance when subject to TCP traffic.
traffic, density and mobility conditions. We observe, that a rather large fraction of the traffic being carried on the Internet today carries TCP. Thus, Internet traffic has inheritly different characteristics than that of CBR traffic, which is the commonly used traffic type for evaluating MANET routing protocol performance. Hence, in this paper, we extend our evaluations of the two protocols to include the performance of both TCP and CBR traffic. We find, that testing a protocol using CBR traffic is not a good indicator for the same protocols performance when subject to TCP traffic.
Laurent Viennot; Philippe Jacquet; Thomas Clausen
Analyzing Control Traffic Overhead in Mobile Ad-hoc Network Protocols versus Mobility and Data Traffic Activity Proceedings Article
In: In Proceedings of the 1st IFIP Annual Mediterranean Ad Hoc Networking Workshop (MedHocNet’02, 2002.
@inproceedings{Viennot2002,
title = {Analyzing Control Traffic Overhead in Mobile Ad-hoc Network Protocols versus Mobility and Data Traffic Activity},
author = {Laurent Viennot and Philippe Jacquet and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2002-MedHocNet-Analyzing-Control-Traffic-Overhead-versus-Mobility-and-Data-Traffic-Activity-in-Mobile-Ad-hoc-Network-Protocols.pdf},
year = {2002},
date = {2002-01-01},
booktitle = {In Proceedings of the 1st IFIP Annual Mediterranean Ad Hoc Networking Workshop (MedHocNet’02},
abstract = {This paper proposes a general, parameterized model for analyzing protocol control overheads in mobile ad-hoc networks. A probabilistic model for the network topology and the data traffic is proposed in order to estimate overhead due to control packets of routing protocols.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper proposes a general, parameterized model for analyzing protocol control overheads in mobile ad-hoc networks. A probabilistic model for the network topology and the data traffic is proposed in order to estimate overhead due to control packets of routing protocols.
2001
Thomas Clausen; Gitte Hansen; Lars Christensen; Gerd Behrmann
The Optimized Link State Routing Protocol Evaluation through Experiments and Simulation Proceedings Article
In: IN PROCEEDING OF WIRELESS PERSONAL MULTIMEDIA COMMUNICATIONS, IEEE, 2001.
@inproceedings{Clausen2001,
title = {The Optimized Link State Routing Protocol Evaluation through Experiments and Simulation},
author = {Thomas Clausen and Gitte Hansen and Lars Christensen and Gerd Behrmann},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2001-WPMC-The-Optimized-Link-State-Routing-Protocol-Evaluation-through-Experiments-and-Simulation.pdf},
year = {2001},
date = {2001-01-01},
booktitle = {IN PROCEEDING OF WIRELESS PERSONAL MULTIMEDIA COMMUNICATIONS},
publisher = {IEEE},
abstract = {In this paper, we describe the Optimized Link State Routing Protocol (OLSR) [1] for Mobile Ad-hoc NETworks (MANETs) and the evaluation of this protocol through experiments and simulations. In particular, we emphasize the practical tests and intensive simulations, which have been used in guiding and evaluating the design of the protocol, and which have been a key to identifying both problems and solutions. OLSR is a proactive link-state routing protocol, employing periodic message exchange for updating topological information in each node in the network. I.e. topological information is flooded to all nodes in the network. Conceptually, OLSR contains three elements: Mechanisms for neighbor sensing based on periodic exchange of HELLO messages within a node’s neighborhood. Generic mechanisms for efficient flooding of control traffic into the network employing the concept of multipoint relays (MPRs) [5] for a significant reduction of duplicate retransmissions during the flooding process. And a specification of a set of control-messages providing each node with sufficient topological information to be able to compute an optimal route to each destination in the network using any shortest-path algorithm. Experimental work, running a test-network of laptops with IEEE 802.11 wireless cards, revealed interesting properties. While the protocol, as originally specified, works quite well, it was found, that enforcing “jitter” on the interval between the periodic exchange of control messages in OLSR and piggybacking said control messages into a single packet, significantly reduced the number of messages lost due to collisions. It was also observed, that under certain conditions a “naive” neighbor sensing mechanism was insufficient: a bad link between two nodes (e.g. when two nodes are on the edge of radio range) might on occasion transmit a HELLO message in both directions (hence enabling the link for routing), while not being able to sustain continuous traffic. This would result in “route-flapping” and temporary loss of connectivity. With the experimental results as basis, we have been deploying simulations to reveal the impact of the various algorithmic improvements, described above.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper, we describe the Optimized Link State Routing Protocol (OLSR) [1] for Mobile Ad-hoc NETworks (MANETs) and the evaluation of this protocol through experiments and simulations. In particular, we emphasize the practical tests and intensive simulations, which have been used in guiding and evaluating the design of the protocol, and which have been a key to identifying both problems and solutions. OLSR is a proactive link-state routing protocol, employing periodic message exchange for updating topological information in each node in the network. I.e. topological information is flooded to all nodes in the network. Conceptually, OLSR contains three elements: Mechanisms for neighbor sensing based on periodic exchange of HELLO messages within a node’s neighborhood. Generic mechanisms for efficient flooding of control traffic into the network employing the concept of multipoint relays (MPRs) [5] for a significant reduction of duplicate retransmissions during the flooding process. And a specification of a set of control-messages providing each node with sufficient topological information to be able to compute an optimal route to each destination in the network using any shortest-path algorithm. Experimental work, running a test-network of laptops with IEEE 802.11 wireless cards, revealed interesting properties. While the protocol, as originally specified, works quite well, it was found, that enforcing “jitter” on the interval between the periodic exchange of control messages in OLSR and piggybacking said control messages into a single packet, significantly reduced the number of messages lost due to collisions. It was also observed, that under certain conditions a “naive” neighbor sensing mechanism was insufficient: a bad link between two nodes (e.g. when two nodes are on the edge of radio range) might on occasion transmit a HELLO message in both directions (hence enabling the link for routing), while not being able to sustain continuous traffic. This would result in “route-flapping” and temporary loss of connectivity. With the experimental results as basis, we have been deploying simulations to reveal the impact of the various algorithmic improvements, described above.
Phiippe Jacquet; Paul Muhlethaler; Thomas Clausen; Anis Laouiti; Amir Qayyum; Laurent Viennot
Optimized link state routing protocol for ad hoc networks Proceedings Article
In: Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century. Proceedings. IEEE International, pp. 62-68, 2001.
@inproceedings{Jacquet2001,
title = {Optimized link state routing protocol for ad hoc networks},
author = {Phiippe Jacquet and Paul Muhlethaler and Thomas Clausen and Anis Laouiti and Amir Qayyum and Laurent Viennot},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2001-INMIC-Optimized-link-state-routing-protocol-for-ad-hoc-networks.pdf},
doi = {10.1109/INMIC.2001.995315},
year = {2001},
date = {2001-01-01},
booktitle = {Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century. Proceedings. IEEE International},
pages = {62-68},
abstract = {In this paper we propose and discuss an optimized link state routing protocol, named OLSR, for mobile wireless networks. The protocol is based on the link state algorithm and it is proactive (or table-driven) in nature. It employs periodic exchange of messages to maintain topology information of the network at each node. OLSR is an optimization over a pure link state protocol as it compacts the size of information sent in the messages, and furthermore, reduces the number of retransmissions to flood these messages in an entire network. For this purpose, the protocol uses the multipoint relaying technique to efficiently and economically flood its control messages. It provides optimal routes in terms of number of hops, which are immediately available when needed. The proposed protocol is best suitable for large and dense ad hoc networks.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper we propose and discuss an optimized link state routing protocol, named OLSR, for mobile wireless networks. The protocol is based on the link state algorithm and it is proactive (or table-driven) in nature. It employs periodic exchange of messages to maintain topology information of the network at each node. OLSR is an optimization over a pure link state protocol as it compacts the size of information sent in the messages, and furthermore, reduces the number of retransmissions to flood these messages in an entire network. For this purpose, the protocol uses the multipoint relaying technique to efficiently and economically flood its control messages. It provides optimal routes in terms of number of hops, which are immediately available when needed. The proposed protocol is best suitable for large and dense ad hoc networks.