Conference Proceedings

@inproceedings{nokeyf,

title = {Understanding Semantics in Feature Selection for Fault Diagnosis in Network Telemetry Data},

author = {Thomas Feltin and Juan Antonio Cordero and Thomas Heide Clausen and Frank Brockners},

editor = {IEEE},

url = {https://www.epizeuxis.net/wp-content/uploads/2023/06/2023009866.pdf},

year  = {2023},

date = {2023-05-08},

urldate = {2023-05-08},

booktitle = {Proc. IEEE/IFIP Network Operations and Management Symposium 2023},

publisher = {IEEE},

abstract = {Expert systems for fault diagnosis are computationally expensive to build and maintain, and lack scalability and inherent adaptability to unknown events or modifications in the topology of the monitored system. While data-driven feature se- lection mechanisms can facilitate diagnosis without the hardship of developing and maintaining expert systems, purely data-driven mechanisms lack understanding of semantic importance within a feature set, and would benefit from additional domain knowledge. Part of this additional knowledge can be extracted from meta-data. The proposed approach combines data-driven metrics and semantic information contained in the feature names to produce selections of features which best represent an underlying event. This study extends a cross entropy based optimization method to join semantic importance with data behavior. A benchmarking architecture is introduced to evaluate the benefits of semantic analysis, and demonstrate the performance and robustness of semantic feature selection on different types of faults in network telemetry datasets, modeled with the YANG data modeling language. The results illustrate the interest of such a complementary meta-data analysis for data-driven fault diagnosis, and highlight the robustness of the studied approach against variations in the input feature set.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{nokeyg,

title = {Efficient Data-Driven Network Functions},

author = {Zhiyuan Yao and Yoann Desmouceaux and Juan Antonio Cordero and Mark Townsley and Thomas Heide Clausen},

url = {https://arxiv.org/pdf/2208.11385},

year  = {2022},

date = {2022-10-18},

urldate = {2022-10-18},

booktitle = {30th International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2022)},

abstract = {Cloud environments require dynamic and adaptive networking policies. It is preferred to use heuristics over advanced learning algorithms in Virtual Network Functions (VNFs) in production becuase of high-performance constraints. This paper proposes Aquarius to passively yet efficiently gather observations and enable the use of machine learning to collect, infer, and supply accurate networking state information-without incurring additional signalling and management overhead. This paper illustrates the use of Aquarius with a traffic classifier, an autoscaling system, and a load balancer-and demonstrates the use of three different machine learning paradigms-unsupervised, supervised, and reinforcement learning, within Aquarius, for inferring network state. Testbed evaluations show that Aquarius increases network state visibility and brings notable performance gains with low overhead.},

keywords = {Chaire Cisco, Infrastructure for Big Data, Machine Learning, Network Management},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{nokeyh,

title = {Multi-agent reinforcement learning for network load balancing in data center},

author = {Zhiyuan Yao and Zihan Ding and Thomas Heide Clausen},

url = {https://www.researchgate.net/profile/Zhiyuan_Yao13/publication/358163217_Multi-Agent_Reinforcement_Learning_for_Network_Load_Balancing_in_Data_Center/links/62fe5fd3e3c7de4c34666311/Multi-Agent-Reinforcement-Learning-for-Network-Load-Balancing-in-Data-Center.pdf},

doi = {10.1145/3511808.3557133},

year  = {2022},

date = {2022-10-17},

urldate = {2022-10-17},

booktitle = {31st ACM International Conference on Information and Knowledge Management (CIKM'22)},

abstract = {This paper presents the network load balancing problem, a challenging real-world task for multi-agent reinforcement learning (MARL) methods. Conventional heuristic solutions like Weighted-Cost Multi-Path (WCMP) and Local Shortest Queue (LSQ) are less flexible to the changing workload distributions and arrival rates, with a poor balance among multiple load balancers. The cooperative network load balancing task is formulated as a Dec-POMDP problem, which naturally induces the MARL methods. To bridge the reality gap for applying learning-based methods, all models are directly trained and evaluated on a real-world system from moderate- to large-scale setups. Experimental evaluations show that the independent and “selfish” load balancing strategies are not necessarily the globally optimal ones, while the proposed MARL solution has a superior performance over different realistic settings. Additionally, the potential difficulties of the application and deployment of MARL methods for network load balancing are analysed, which helps draw the attention of the learning and network communities to such challenges.},

keywords = {Chaire Cisco, Infrastructure for Big Data, load balancing},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{yao2021reinforced,

title = {Reinforced Workload Distribution Fairness},

author = {Zhiyuan Yao and Zihan Ding and Thomas Heide Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2021/11/2111.00008-1.pdf},

year  = {2021},

date = {2021-12-01},

urldate = {2021-12-01},

booktitle = {Machine Learning for Systems at 35th Conference on Neural Information Processing Systems (NeurIPS 2021)},

abstract = {Network load balancers are central components in data centers, that distributes workloads across multiple servers and thereby contribute to offering scalable services. However, when load balancers operate in dynamic environments with limited monitoring of application server loads, they rely on heuristic algorithms that require manual configurations for fairness and performance. To alleviate that, this paper proposes a distributed asynchronous reinforcement learning mechanism to-with no active load balancer state monitoring and limited network observations-improve the fairness of the workload distribution achieved by a load balancer. The performance of proposed mechanism is evaluated and compared with stateof-the-art load balancing algorithms in a simulator, under configurations with progressively increasing complexities. Preliminary results show promise in RLbased load balancing algorithms, and identify additional challenges and future research directions, including reward function design and model scalability.},

keywords = {Chaire Cisco, Infrastructure for Big Data, load balancing},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{yao2021intelligent,

title = {Towards Intelligent Load Balancing in Data Centers},

author = {Zhiyuan Yao and Yoann Desmouceaux and Mark Townsley and Thomas Heide Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2021/11/2110.15788.pdf},

year  = {2021},

date = {2021-12-01},

urldate = {2021-12-01},

booktitle = {Machine Learning for Systems at 35th Conference on Neural Information Processing Systems (NeurIPS 2021), Dec 2021, Sydney, Australia},

abstract = {Network load balancers are important components in data centers to provide scalable services. Workload distribution algorithms are based on heuristics, e.g., Equal-Cost Multi-Path (ECMP), Weighted-Cost Multi-Path (WCMP) or naive machine learning (ML) algorithms, e.g., ridge regression. Advanced ML-based approaches help achieve performance gain in different networking and system problems. However, it is challenging to apply ML algorithms on networking problems in real-life systems. It requires domain knowledge to collect features from low-latency, high-throughput, and scalable networking systems, which are dynamic and heterogenous. This paper proposes Aquarius to bridge the gap between ML and networking systems and demonstrates its usage in the context of network load balancers. This paper demonstrates its ability of conducting both offline data analysis and online model deployment in realistic systems. The results show that the ML model trained and deployed using Aquarius improves load balancing performance yet they also reveals more challenges to be resolved to apply ML for networking systems.},

keywords = {Chaire Cisco, Infrastructure for Big Data},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{rizzi2021charon,

title = {Charon: Load-Aware Load-Balancing in P4},

author = {Carmine Rizzi and Zhiyuan Yao and Yoann Desmouceaux and Mark Townsley and Thomas Heide Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2021/11/2110.14389.pdf},

year  = {2021},

date = {2021-10-01},

urldate = {2021-01-01},

booktitle = {1st Joint International Workshop on Network Programmability & Automation (NetPA) at 17th International Conference on Network and Service Management (CNSM 2021),},

abstract = {Load-Balancers play an important role in data centers as they distribute network flows across application servers and guarantee per-connection consistency. It is hard however to make fair load balancing decisions so that all resources are efficiently occupied yet not overloaded. Tracking connection states allows to infer server load states and make informed decisions, but at the cost of additional memory space consumption. This makes it hard to implement on programmable hardware, which has constrained memory but offers line-rate performance. This paper presents Charon, a stateless load-aware load balancer that has line-rate performance implemented in P4-NetFPGA. Charon passively collects load states from application servers and employs the power-of-2-choices scheme to make data-driven load balancing decisions and improve resource utilization. Perconnection consistency is preserved statelessly by encoding server ID in a covert channel. The prototype design and implementation details are described in this paper. Simulation results show performance gains in terms of load distribution fairness, quality of service, throughput and processing latency.},

keywords = {Chaire Cisco, Infrastructure for Big Data, load balancing},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Hawari2021,

title = {OP4T: Bringing Advanced Network Packet Timestamping into the Field},

author = {Mohammed Hawari and Thomas Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2021/03/paper.pdf},

doi = {10.1109/ICOIN50884.2021.9333927},

year  = {2021},

date = {2021-01-13},

booktitle = {2021 International Conference on Information Networking (ICOIN)},

pages = {137-142},

abstract = {Because it is very bursty, the microsecond-scale temporal behaviour of network traffic in data-centres is chal- lenging to measure and understand. To bring observability into data-centre networks, this paper introduces the Open Platform for Programmable Precise Packet Timestamping (OP4T), a hardware architecture, targeting Field-Programmable Gateway Arrays (FPGAs), integrated into data-centre servers as a Smart Network Interface Card (SmartNIC), and flexible enough to enable advanced latency diagnosis. 

In this paper, OP4T is specified, and an open-source im- plementation of that architecture is proposed, targeting the NetFPGA SUME prototyping board. By leveraging the P4 programming language, and partial reconfiguration, that open- source implementation is experimentally shown to enable in-band, precise packet timestamping, without sacrificing the achievable throughput. As an illustration, OP4T is shown to be usable to measure fine-grained properties of a software packet forwarder, e.g., packet batching.},

keywords = {Chaire Cisco, Infrastructure for Big Data},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Feltin2020,

title = {Semantic feature selection for network telemetry event description},

author = {Thomas Feltin and Parisa Foroughi and Wenqin Shao and Frank Brockners and Thomas Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2020/08/AnNet20201-1.pdf},

doi = {10.1109/NOMS47738.2020.9110382},

isbn = {2374-9709},

year  = {2020},

date = {2020-04-20},

booktitle = {NOMS 2020 - 2020 IEEE/IFIP Network Operations and Management Symposium},

pages = {1-6},

abstract = {Model driven telemetry (MDT) enables the real-time collection of hundreds of thousands of counters on large-scale networks, with contextual information to each counter provided in the telemetry data structure definition. Explaining network events in such datasets implies substantial analysis by a domain expert. This paper presents an semantic feature selection method, to find the most important counters which describe a given event in a telemetry dataset, and facilitate the explanation process. This paper proposes a metric for estimating the importance of features in a dataset with descriptive feature names, to find those that are most meaningful to a human. With this estimation, this paper presents a cross-entropy based metric describing the quality of a selection of counters, which is combined with the data behavior to define an optimization goal. The computation of optimal selections distills intelligible and precise selections of counters with adjustable verbosity, and describes events with a few selected counters outlining the root cause of network events.},

keywords = {contextual information, cross-entropy based metric, data analysis, data behavior, data structures, Decision support, explanation, explanation process, feature selection, large-scale networks, model driven telemetry, Network Management, network telemetry event description, real-time systems, Selection process, semantic feature selection, telemetry, telemetry data structure},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Desmouceaux2018e,

title = {Zero-Loss Virtual Machine Migration with IPv6 Segment Routing},

author = {Yoann Desmouceaux and Mark Townsley and Thomas Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2019/11/Zero-Loss-Virtual-Machine-Migration-with-Segment-Routing.pdf},

year  = {2018},

date = {2018-11-01},

booktitle = {Proceedings 1st SR+SFC Workshop at IEEE CNSM},

abstract = {With the development of large-scale data centers, Virtual Machine (VM) migration is a key component for resource optimization, cost reduction, and maintenance. From a network perspective, traditional VM migration mechanisms rely on the hypervisor running at the destination host advertising the new location of the VM once migration is complete. However, this creates a period of time during which the VM is not reachable, yielding packet loss. 

This paper introduces a method to perform zero-loss VM migration by using IPv6 Segment Routing (SR). Rather than letting the hypervisor update a locator mapping after VM migration is complete, a logical path consisting of the source and destination hosts is pre-provisioned. Packets destined to the migrating VM are sent through this path using SR, shortly before, during, and shortly after migration – the virtual router on the source host being in charge of forwarding packets locally if the VM migration has not completed yet, or to the destination host otherwise. The proposed mechanism is implemented as a VPP plugin, and feasibility of zero-loss VM migration is demonstrated with various workloads. Evaluation shows that this yields benefits in terms of session opening latency and TCP throughput.},

keywords = {Chaire Cisco, Infrastructure for Big Data, segment routing},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Toussaint2018,

title = {Chasing Linux Jitter Sources for Uncompressed Video},

author = {Arthur Toussaint and Mohammed Hawari and Thomas Clausen},

url = {https://www.thomasclausen.net/wp-content/uploads/2019/11/CNSM-HipNet-Toussaint-et.-al.-Chasing-Linux-Jutter-Sources-for-Uncompressed-Video.pdf},

year  = {2018},

date = {2018-11-01},

booktitle = {In Proceedings of the 1st Workshop on High-Precision Networks Operations and Control (HiPNet 2018) ad the IEEE 14th International Conference on Network and Service Management (CNSM)},

abstract = {Beyond the transport of uncompressed video over IP networks, defined in standards such as ST2022-6, the ability to build software-based Video Processing Functions (VPF) on commodity hardware and using general purpose Operating Systems is the next logical step in the evolution of the media industry towards an “all-IP” world. In that context, understand- ing the jitter induced on an ST2022-6 stream by a commodity platform is essential. This paper describes a general methodology to enumerate jitter sources on commodity platforms and to quantify their relative contribution to the overall system jitter. The methodology is applied to the Linux kernel, producing a classification of the different sources of jitter, and a quantification of their impact.},

keywords = {Chaire Cisco, Linux, Network Greedy Applications, Performance},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Pit–Claudel2018,

title = {Stateless Load-Aware Load Balancing in P4},

author = {Benoit Pit–Claudel and Yoann Desmouceaux and Pierre Pfister and Mark Townsley and Thomas Clausen},

url = {http://www.thomasclausen.net/en/p4eu-2018/},

year  = {2018},

date = {2018-09-24},

publisher = {1st P4 European Workshop (P4EU)},

abstract = {Leveraging the performance opportunities offered by programmable hardware, stateless load-balancing architectures allowing line-rate processing are appealing. Moreover, it has been demonstrated that significantly fairer load-balancing can be achieved by an architecture that considers the actual load of application instances when dispatching connection requests. Architectures which maintain per-connection state for resiliency and/or track application load state for fairness are, however, at odds with hardware-imposed memory constraints. Thus, a desirable load-balancer for programmable hardware would be both stateless and able to dispatch queries to application instances according to their current load. 

This paper presents SHELL, a stateless application-aware load-balancer combining (i) a power-of-choices scheme using IPv6 Segment Routing to dispatch new flows to a suitable application instance from among multiple candidates, and (ii) the use of a covert channel to record/report which flow was assigned to which candidate in a stateless fashion. In addition, consistent hashing versioning is used to ensure that connections are maintained to the correct application instance, using Segment Routing to “browse” through the history when needed. The stateless design of SHELL makes it suitable for hardware implementation, and this paper describes the implementation of a P4-NetFPGA prototype. A performance evaluation of this SHELL implementation demonstrates throughput and latency characteristics comparable to other stateless load-balancing implementations, while enabling application instance-load-aware dispatching and significantly increasing per-connection consistency resiliency.},

keywords = {Chaire Cisco, Infrastructure for Big Data, load balancing, NetFPGA, segment routing},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Desmouceaux2017b,

title = {SRLB: The Power of Choices in Load Balancing with Segment Routing},

author = {Yoann Desmouceaux and Pierre Pfister and Jerome Tollet and Mark Townsley and Thomas Clausen},

url = {http://www.thomasclausen.net/wp-content/uploads/2017/05/camera-ready-ieeepdfexpress.pdf},

year  = {2017},

date = {2017-06-05},

booktitle = {In Proceedings of the 37th IEEE International Conference on Distributed Computing Systems (ICDCS)},

abstract = {Network load-balancers generally either do not take application state into account, or do so at the cost of a central- ized monitoring system. This paper introduces a load-balancer running exclusively within the IP forwarding plane, i.e. in an application protocol agnostic fashion – yet which still provides application-awareness and makes real-time, decentralized deci- sions. To that end, IPv6 Segment Routing is used to direct data packets from a new flow through a chain of candidate servers, until one decides to accept the connection, based on its local state. This way, applications themselves naturally decide on how to share incoming connections, while incurring minimal network overhead, and no out-of-band signaling. 

Tests on different workloads – including realistic workloads such as replaying actual Wikipedia access traffic towards a set of replica Wikipedia instances – show significant performance benefits, in terms of shorter response times, when compared to a traditional random load-balancer.},

keywords = {Chaire Cisco, dc-optimization, Infrastructure for Big Data, load balancing, segment routing},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{LIX-NET-conference-153,

title = {Depth First Forwarding for Low Power and Lossy Networks: Application and Extension},

author = {Jiazi Yi and Thomas Clausen and Ulrich Herberg},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2014-IEEE-WF-IoT-Depth-First-Forwarding-for-Low-Power-and-Lossy-Networks-Application-and-Extension.pdf},

doi = {10.1109/WF-IoT.2014.6803211},

year  = {2014},

date = {2014-03-01},

publisher = {Proceedings of IEEE World Forum on Internet of Things WF-IoT 2014},

abstract = {Data delivery across a multi-hop low-power and lossy networks (LLNs) is a challenging task: devices participating in such a network have strictly limited computational power and storage, and the communication channels are of low capacity, time-varying and with high loss rates. Consequently, routing protocols finding paths through such a network must be frugal in their control traffic and state requirements, as well as in algorithmic complexity – and even once paths have been found, these may be usable only intermittently, or for a very short time due to changes on the channel. Routing protocols exist for such networks, balancing reactivity to topology and channel variation with frugality in resource requirements. Complementary compo- nent to routing protocols for such LLNs exist, intended not to manage global topology, but to react rapidly to local data delivery failures and (attempt to) successfully deliver data while giving a routing protocol time to recover globally from such a failure. Specifically, this paper studies the “Depth-First Forwarding (DFF) in Unreliable Networks” protocol, standardised within the IETF in June 2013. Moreover, this paper proposes optimisations to that protocol, denoted DFF++, for improved performance and reactivity whilst remaining fully interoperable with DFF as standardised, and incurring neither additional data sets nor protocol signals to be generated.},

keywords = {Constrained Networks, Cross-Layer Design, DFF, LLN, LOADng, Sensor Networks, SOGRID},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2014b,

title = {Path Accumulation Extensions for the LOADng Routing Protocol in Sensor Networks},

author = {Thomas Clausen and Jiazi Yi},

editor = {RobertC. -H. Hsu and Shangguang Wang},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2014-IoV-Path-Accumulation-Extensions-for-the-LOADng-Routing-Protocol-in-Sensor-Networks.pdf 

http://dx.doi.org/10.1007/978-3-319-11167-4_15},

doi = {10.1007/978-3-319-11167-4_15},

isbn = {978-3-319-11166-7},

year  = {2014},

date = {2014-01-01},

booktitle = {Internet of Vehicles – Technologies and Services},

volume = {8662},

pages = {150-159},

publisher = {Springer International Publishing},

series = {Lecture Notes in Computer Science},

abstract = {The “Light-weight On-demand Ad-hoc Distance-vector Routing Protocol – Next Generation” (LOADng) is a simple, yet efficient and flexible routing protocol, specifically designed for use in lossy networks with constrained devices. A reactive protocol, LOADng – as a basic mode of operation – offers discovery and maintenance of hop-by-hop routes and imposes a state in intermediate routers proportional to the number of traffic paths served by that intermediate router. 

This paper offers an extension to LOADng, denoted LOADng-PA (Path Accumulation). LOADng-PA is designed with the motivation of requiring even less state in each intermediate router, and with that state being independent on the number of concurrent traffic flows carried. Another motivation the design of LOADng-PA is one of monitoring and managing networks: providing more detailed topological visibility of traffic paths through the network, for either traffic or network engineering purposes.},

keywords = {LLN, LOADng},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2013a,

title = {Evaluation of Routing Protocol for Low Power and Lossy Networks: LOADng and RPL},

author = {Jiazi Yi and Thomas Clausen and Yuichi Igarashi},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2013-ICWiSE-Evaluation-of-Routing-Protocol-for-Low-Power-and-Lossy-Networks-LOADng-and-RPL.pdf},

doi = {10.1109/ICWISE.2013.6728773},

year  = {2013},

date = {2013-12-01},

publisher = {2013 IEEE Conference on Wireless Sensors},

abstract = {Routing protocol is a critical component of Low- power and Lossy Networks for Smart Grid. The protocols are used for data forwarding, which includes data acquisition, information dissemination, etc. This paper evaluates two main routing protocols used for Low-power and Lossy Networks: RPL and LOADng, to understand their strengths and limitations. Observations are provided based on analysis of specification and experimental experience, regarding the protocol’s routing overhead, traffic pattern, resource requirement, fragmentation, etc. Simulations are further launched to study the performance in different traffic patterns, which include sensor-to-sensor traffic, sensor-to-root traffic and root-to-sensor bidirectional traffic. By evaluating those protocols, the readers could have better under- standing of the protocol applicability, and choose the appropriate protocol for desired applications.},

keywords = {Constrained Networks, LLN, LOADng, Performance Evaluation, RPL, Sensor Networks, SOGRID},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2013,

title = {A Depth First Forwarding (DFF) Extension for the LOADng Routing Protocol},

author = {Thomas Clausen and Jiazi Yi and Antonin Bas and Ulrich Herberg},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2013-ASON-A-Depth-First-Forwarding-DFF-Extension-for-the-LOADng-Routing-Protocol.pdf},

doi = {10.1109/CANDAR.2013.72},

year  = {2013},

date = {2013-12-01},

publisher = {ASON 2013 Sixth International Workshop on Autonomous Self-Organizing Networks},

abstract = {This paper explores the cooperation between the new standards for “Low Power and Lossy Networks” (LLNs): IETF RFC 6971, denoted “Depth-First Forwarding in Unreliable Networks” (DFF) and the ITU-T standardised routing protocol “LOADng” (Lightweight On-demand ad hoc Distance-vector Routing - next generation). DFF is a data-forwarding mechanism for increasing reliability of data delivery in networks with dynamic topology and lossy links, using a mechanism similar to a “depth-first search” for the destination of a packet. LOADng is a reactive on-demand routing protocol used in LLNs. The purpose of this study is to evaluate the benefit of using DFF conjointly with a routing protocol. To this end, the paper compares the performance of LOADng and LOADng+DFF using Ns2 simulations, showing a 20% end-to-end data delivery ratio increase at expense of expected longer path lengths.},

keywords = {Constrained Networks, Cross-Layer Design, DFF, LLN, LOADng, Sensor Networks, SOGRID},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2013c,

title = {Performance analysis of Trickle as a flooding mechanism},

author = {Thomas Clausen and Axel Colin Verdiere and Jiazi Yi},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2013-ICCT-Performance-analysis-of-Trickle-as-a-flooding-mechanism.pdf},

doi = {http://dx.doi.org/10.1109/ICCT.2013.6820439},

year  = {2013},

date = {2013-11-01},

publisher = {IEEE 15th International Conference on Communication Technology},

abstract = {“The Trickle Algorithm” is conceived as an adaptive mechanism for allowing efficient and reliable information sharing among nodes, communicating across a lossy and shared medium. Its basic principle is, for each node, to monitor transmissions from its neighbours, compare what it receives with its cur- rent state, and schedule future transmissions accordingly: if an inconsistency of information is detected, or if few or no neighbours have transmitted consistent information “recently”, the next transmission is scheduled “soon” – and, in case consistent information from a sufficient number of neighbours is received, the next transmission is scheduled to be “later”. 

Developed originally as a means of distributing firmware updates among sensor devices, this algorithm has found use also for distribution of routing information in the routing protocol RPL, standardised within the IETF for maintaining a routing topology for low-power and lossy networks (LLNs). Its use is also proposed in a protocol for multicast in LLNs, denoted “Multicast Forwarding Using Trickle”. This paper studies the performance of the Trickle algorithm, as it is used in that multicast protocol.},

keywords = {Constrained Networks, LLN, Performance Evaluation, RPL, Sensor Networks, Trickle},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2013g,

title = {Jitter Considerations in On-demand Route Discovery for Mobile Ad Hoc Networks},

author = {Jiazi Yi and Juan Antonio Cordero and Thomas Clausen},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2013-NBIS-Jitter-Considerations-in-On-demand-Route-Discovery-for-Mobile-Ad-Hoc-Networks.pdf},

doi = {10.1109/NBiS.2013.28},

year  = {2013},

date = {2013-09-01},

publisher = {The 16th International Conference on Network-Based Information Systems (NBiS-2013)},

abstract = {Jittering (a small, random variation in timing of control message emission) is widely used in protocols for wireless communication, in order to avoid simultaneous packet transmis- sions over the same channel by adjacent nodes in the network. Used for both regularly scheduled packets, for event-triggered packets, and for scheduled resets in the network, jittering is a particularly important mechanism when a network event may cause multiple adjacent nodes to react concurrently. Introduced in the proactive MANET routing protocol OLSR, the “LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation” (LOADng), a derivative of AODV, is specified so as to also use jitter for flooding Route Request (RREQ) messages during route discovery. This use of jitter in RREQ flooding is, however, not without drawbacks, which are identified and addressed in this paper within the framework of a more general study of jitter mechanisms used for route discovery in reactive routing protocols. The paper studies the behavior of route discovery when using “naive” jitter (simply, delaying RREQ retransmission by a small uniformly distributed random delay), in order to identify and analyze the problems hereof, mostly related to route sub-optimality and excessive control traffic overhead. A Window Jitter mechanism is then proposed to address these issues – with the performance hereof, when compared to “naive” jitter being evaluated by way of modeling, theoretical analysis and experiments. The paper shows that the use of Window Jitter improves indeed the efficiency of route discovery in AODV and overcome the drawbacks identified for “naive” jitter.},

keywords = {Ad-Hoc, Jitter, LOADng, MANET, MESH, SOGRID},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2013cb,

title = {Optimization of jitter configuration for reactive route discovery in wireless mesh networks},

author = {Juan Antonio Cordero and Jiazi Yi and Thomas Clausen},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2013-WiOpt-Optimization-of-Jitter-Configuration-for-Reactive-Route-Discovery-in-Wireless-Mesh-Networks.pdf},

isbn = {978-1-61284-824-2},

year  = {2013},

date = {2013-05-01},

publisher = {Modeling & Optimization in Mobile, Ad Hoc & Wireless Networks (WiOpt), 2013 11th International Symposium on},

abstract = {Jitter is a small, random variation of timing before message emission that is widely used in non-synchronized wireless communication. It is employed to avoid collisions caused by simultaneous transmissions by adjacent nodes over the same channel. In reactive (on-demand) routing protocols, such as AODV and LOADng, it is recommended to use jitter during the flooding of Route Request messages. This paper analyzes the cost of jitter mechanisms in route discovery of on-demand routing protocols, and examines the drawbacks of the standard and commonly used uniformly distributed jitter. The main studied drawback is denominated delay inversion effect. Two variations on the jitter mechanism –window jitter and adaptive jitter– are proposed to address this effect, which take the presence and the quality of traversed links into consideration to determine the per-hop forwarding delay. These variations allow to effectively reduce the routing overhead, and increase the quality of the computed paths with respect to the standard uniform jitter mechanism. Simulations are also performed to compare the performance of different jitter settings in various network scenarios.},

keywords = {Ad-Hoc, Jitter, LOADng, MANET, MESH},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clause2012f,

title = {Smart Route Request for On-demand Route Discovery in Constrained Environments},

author = {Jiazi Yi and Thomas Clausen and Antonin Bas},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2012-IEEE-ICWITS-Smart-Route-Request-for-On-demand-Route-Discovery-in-Constrained-Environments.pdf},

doi = {10.1109/ICWITS.2012.6417755},

year  = {2012},

date = {2012-11-01},

publisher = {2012 IEEE International Conference on Wireless Information Technology and Systems},

abstract = {A derivative of AODV , denoted LOADng, is proposed for use in very constrained environment, sacrificing a number of features from AODV for the benefit of smaller control messages and simpler processing logic. Among these sacrifices is intermediate route replies. This paper presents an alternative to intermediate router replies, denoted Smart Route Request, which provides an optimization similar to that attainable by intermediate route requests, but without imposing additional processing complexity or additional signaling. A performance study is presented, showing that the use of Smart Route Requests can effectively reduce the control traffic overhead from Route Requests, while retaining the simplicity of LOADng. LOADng with Smart Route Requests effectively reduces control traffic overhead and on-link traffic collisions, and this especially for multipoint-to-point traffic.},

keywords = {Constrained Networks, LLN, LOADng, Sensor Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Bas2012,

title = {Expanding Ring Search for Route Discovery in LOADng Routing Protocol},

author = {Antonin Bas and Jiazi Yi and Thomas Clausen},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2012-STEIC-Expanding-Ring-Search-for-Route-Discovery-in-LOADng-Routing-Protocol.pdf},

year  = {2012},

date = {2012-10-01},

publisher = {The 1st International Workshop on Smart Technologies for Energy, Information and Communication},

abstract = {LOADng is an on-demand routing protocol, derived from AODV, simplified for use in lossy, low-power and constrained environments, where the ability for devices to communicate is a commodity to their primary function, and where therefore not only the communications channel offers limited capacity, but also the resources available to the device’s communica- tions subsystem are limted. 

LOADng simplifies AODV in a number of ways, notably the route discovery process by removing intermediate/gratuitous Route Replies – sacrificing that functionality in order to attain smaller control messages and less router state and processing. Alas, this comes at an expense: in some situations, LOADng produces increased control traffic overhead (as com- pared to AODV), and more control messages transmissions means tapping into the device’s limited resources. 

This paper presents a simple mechanism by which to integrate Expanding Ring flooding into LOADng. The mechanism is described, and the result of simulation studies are presented, showing that both in scenarios with “point-to-point” (any-to-any) traffic and in scenarios with “multipoint-to-point” (all traffic sent to the same destination, as in a data acquisition sensor network) traffic, considerable savings in control traffic overhead can be achieved – without loss in data delivery ratios.},

keywords = {Constrained Networks, LLN, LOADng, Sensor Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2012,

title = {LOADng: Towards AODV Version 2},

author = {Thomas Clausen and Jiazi Yi and Axel Colin Verdiere},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2012-IEEE-VTC-LOADng-Towards-AODVv2.pdf},

doi = {10.1109/VTCFall.2012.6399334},

year  = {2012},

date = {2012-09-01},

publisher = {2012 IEEE 76th Vehicular Technology Conference},

abstract = {The Ad hoc On-demand Distance-Vector routing protocol (AODV) was published in 2003 by the IETF, as ex- perimental RFC 3561. This routing protocol was one of four routing protocols, developed by the IETF for use in mobile ad hoc networks (MANETs) – with the other being DSR, TBRPF and OLSR. As operational experiences with these protocols accumulated, the IETF set forth on standardization of OLSRv2, a successor to OLSR, and DYMO – with DYMO being the intended successor to DSR and AODV. Alas, while there was traction for and standardization of OLSRv2, interest in, development, standardization, and use of DYMO in MANETs slowly withered. 

AODV did, however, attract interest for routing in Low-power Lossy Networks (LLNs) due to its limited state requirements. Since 2005, several proposals for simplifying and adapting AODV specifically for LLNs emerged, in 2011 and 2012 with the use of one such adaptation of AODV in the G3-PLC standard for power line communications in smart grids, and with efforts within the IETF emerging towards a single LOADng specification, as next version of AODV. 

This paper presents this development – from AODV, as specified in RFC3561 – to LOADng. While the basic operation remains unchanged, LOADng presents simplifications, and additional features and flexibilities are introduced. This paper studies the impact of these changes “from AODV to LOADng”, and observes that LOADng unites simplification, flexibility and performance improvements.},

keywords = {Constrained Networks, LLN, LOADng, Sensor Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2012b,

title = {Efficient Data Acquisition in Sensor Networks:Introducing (the) LOADng Collection Tree Protocol},

author = {Jiazi Yi and Thomas Clausen and Axel Colin Verdiere},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2012-IEEE-WiCOM-Efficient-Data-Acquisition-in-Sensor-NetworksIntroducing-the-LOADng-Collection-Tree-Protocol.pdf},

doi = {10.1109/WiCOM.2012.6478508},

year  = {2012},

date = {2012-09-01},

publisher = {IEEE WiCom 2012, The 8th IEEE International Conference on Wireless Communications, Networking and Mobile Computing.},

abstract = {This paper proposes an extension to the “LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation” (LOADng), for efficient construction of a collection tree for data acquisition in sensor networks. The extension uses the mechanisms from LOADng, imposes minimal overhead and complexity, and enables a deployment to efficiently support both “point-to-point” and “multipoint-to-point” traffic, avoiding complications of uni-directional links in the collection tree. This paper further compares the performance of proposed pro-tocol extension to that of basic LOADng and to the protocol RPL (“IPv6 Routing Protocol for Low power and Lossy Networks”).},

keywords = {Constrained Networks, LLN, LOADng, Sensor Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Yi2012,

title = {Vulnerability Analysis of Relay Set Selection Algorithms for the Simplified Multicast Forwarding (SMF) Protocol for Mobile Ad Hoc Networks},

author = {Jiazi Yi and Thomas Clausen},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2012-NBIS-Vulnerability-Analysis-of-Relay-Set-Selection-Algorithms-for-the-Simplified-Multicast-Forwarding-SMF-Protocol-for-Mobile-Ad-Hoc-Networks.pdf},

doi = {10.1109/NBiS.2012.48},

year  = {2012},

date = {2012-09-01},

publisher = {The 15th International Conference on Network-Based Information Systems (NBiS-2012)},

abstract = {After more than a decade of research and stan-dardization, Mobile Ad Hoc NETworks (MANET) are finding their place in real-world deployments, such as in community, tactical and vehicular networks. Becoming so present in “the real world” also means that MANETs, and the protocols operating them, are affronted with a more hostile environment, where misconfiguration, eavesdropping, and attacks must be addressed. A first step in addressing MANET security is understanding the vulnerabilities of MANET protocols, and how an attacker can exploit these. This paper studies the Relay Set Selection (RSS) algorithms that are commonly used in multicast routing protocol for MANETs, and which are undergoing standardization as part of the Simplified Multicast Forwarding (SMF) protocol, developed within the Internet Engineering Task Force (IETF). Attack vectors for these different RSS algorithms are described, with the purpose of enabling future development of security solutions.},

keywords = {Ad-Hoc, MANET, MESH, Security, SMF, SMF Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Herberg2011,

title = {Delay Tolerant Routing with OLSRv2},

author = {Ulrich Herberg and Thomas Clausen},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-EUC-Delay-Tolerant-Networking-with-OLSRv2.pdf},

doi = {10.1109/EUC.2011.27},

year  = {2011},

date = {2011-10-01},

publisher = {Proceedings of the The 9th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC)},

abstract = {This paper proposes a simple mechanism for en-abling basic delay tolerant networking with off-the-shelf MANET routing protocols – with the objective being to enable trading off slightly longer data delivery delays against resilience to a temporary lack of connectivity between a router and the ultimate destination of an IP datagram. As part of testing the benefit of said mechanism, an extreme network mobility model is proposed, entitled the “PopUp model”: a router appears in the network, and operates normally – then may disable and disappear from the network to appear later elsewhere. Observed to cause severely degraded performance for MANET routing protocols, this model is used for testing the proposed mechanism in OLSRv2-routed MANETs. The proposed mechanism shows to vastly increase the data delivery ration, with reasonably low increases in delays and control traffic overhead incurred.},

keywords = {Ad-Hoc, DTN, MANET, MESH, OLSR, OLSRv2},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2011a,

title = {A Comparative Performance Study of the Routing Protocols LOAD and RPL with Bi-Directional Traffic in Low-power and Lossy Networks (LLN)},

author = {Ulrich Herberg and Thomas Clausen},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-PE-WASUN-A-Comparative-Performance-Study-of-the-Routing-Protocols-LOAD-and-RPL-with-Bi-Directional-Traffic-in-Low-power-and-Lossy-Networks-LLN.pdf},

doi = {10.1145/2069063.2069076},

year  = {2011},

date = {2011-10-01},

publisher = {Proceedings of the Eighth ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN)},

abstract = {Routing protocols for sensor networks are often designed with explicit assumptions, serving to simplify design and re-duce the necessary energy, processing and communications requirements. Different protocols make different assump-tions – and this paper considers those made by the designers of RPL – an IPv6 routing protocol for such networks, de-veloped within the IETF. Specific attention is given to the predominance of bi-directional traffic flows in a large class of sensor networks, and this paper therefore studies the per-formance of RPL for such flows. As a point of comparison, a different protocol, called LOAD, is also studied. LOAD is derived from AODV and supports more general kinds of traffic flows. The results of this investigation reveal that for scenarios where bi-directional traffic flows are predomi-nant, LOAD provides similar data delivery ratios as RPL, while incurring less overhead and being simultaneously less constrained in the types of topologies supported.},

keywords = {Constrained Networks, LLN, Performance Evaluation, RPL, Sensor Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2011b,

title = {A Critical Evaluation of the “IPv6 Routing Protocol for Low Power and Lossy Networks” (RPL)},

author = {Thomas Clausen and Ulrich Herberg and Matias Philipp},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-WiMOB-A-Critical-Evaluation-of-the-IPv6-Routing-Protocol-for-Low-Power-and-Lossy-Networks-RPL.pdf},

doi = {10.1109/WiMOB.2011.6085374},

year  = {2011},

date = {2011-10-01},

publisher = {Proceedings of the 5th IEEE International Conference on Wireless & Mobile Computing, Networking & Communication (WiMob)},

abstract = {With RPL – the “IPv6 Routing Protocol for Low-power Lossy Networks” – emerging as a Proposed Standard “Request For Comment” (RFC) in the Internet Engineering Task Force (IETF) after a ∼2-year development cycle, this paper presents a critical evaluation of the resulting protocol and its applicability and limits. The paper presents a selection of observations of the protocol characteristics, exposes experiences acquired when producing a prototype implementation of RPL, and presents results obtained from testing this protocol – both in a network simulator, and in real-world experiments on a wireless sensor network testbed. The paper aims at providing a better understanding of possible weaknesses and limits of RPL, notably the possible directions that further protocol developments should explore, in order to address these.},

keywords = {Constrained Networks, IPv6, LLN, RPL, Sensor Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Yi2011c,

title = {Vulnerability Analysis of the SMF Protocol for Mobile Ad Hoc Networks},

author = {Jiazi Yi and Thomas Clausen and Ulrich Herberg},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-CPScom-Vulnerability-Analysis-of-the-Simple-Multicast-Forwarding-SMF-Protocol-for-Mobile-Ad-Hoc-Networks.pdf},

doi = {10.1109/iThings/CPSCom.2011.63},

year  = {2011},

date = {2011-10-01},

publisher = {IEEE CPSCom 2011},

abstract = {If deployments of Mobile Ad Hoc Networks (MANETs) are to become common outside of purely experimental settings, protocols operating such MANETs must be able to preserve network integrity, even when faced with careless or malicious participants. A first step towards protecting a MANET is to analyze the vulnerabilities of the routing protocol(s), managing the connectivity. Understanding how these routing protocols can be exploited by those with ill intent, countermeasures can be developed, readying MANETs for wider deployment and use. One routing protocol for MANETs, developed by the Internet Engineering Task Force (IETF) as a multicast routing protocol for efficient data dissemination, is denoted "Simplified Multicast Forwarding'' (SMF). This protocol is analyzed, and its vulnerabilities described, in this paper. SMF consists of two independent components: (i) duplicate packet detection and (ii) relay set selection, each of which presents its own set of vulnerabilities that an attacker may exploit to compromise network integrity. This paper explores vulnerabilities in each of these, with the aim of identifying attack vectors and thus enabling development of countermeasures.},

note = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=6142260},

keywords = {Ad-Hoc, MANET, MESH, Security, SMF, SMF Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2011d,

title = {Some Considerations on Routing in Particular and Lossy Environments},

author = {Thomas Clausen and Ulrich Herberg},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-IAB-Some-Considerations-on-Routing-In-Particular-and-Lossy-Environments.pdf},

year  = {2011},

date = {2011-03-01},

publisher = {Proceedings of the 1st Interconnecting Smart Objects with the Internet Workshop},

abstract = {RPL – the “Routing Protocol for Low Power and Lossy Networks” (RPL) [1] – is a proposal for an IPv6 routing pro-tocol for Low-power Lossy Networks (LLNs), by the ROLL Working Group in the Internet Engineering Task Force (IETF). The basic construct in RPL is a DODAG – a destination oriented directed acyclic graph, rooted in a “controller”. Traffic inside the LLN flows along this DODAG, either up-ward (towards the “controller”) or downward. In RPL, upward routes, having the controller as destination (either by way of explicitly addressing the destination, or by using the controller as “gateway”), are provided by the DODAG construction mechanism: each LLN router selects a set of parents, on a path towards the controller, as well as a preferred parent. Once a router is part of a DODAG (i.e. has selected parents) will emit DODAG Information Object (DIO) messages, using link-local multicasting, indicating its respective rank in the DODAG (i.e. its position – distance according to some metric(s), in the simplest form hop-count – with respect to the root). Routes for any destination inside the LLN, other than the controller, are provided by these destinations generating Destination Advertisement Objects (DAOs).},

keywords = {Constrained Networks, LLN, RPL},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Fuertes2011,

title = {MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF},

author = {Juan Antonio Cordero and Thomas Clausen and Emmanuel Baccelli},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-HICSS-MPRSP-Towards-a-Unified-MPR-based-MANET-Extension-for-OSPF.pdf},

doi = {10.1109/HICSS.2011.313},

year  = {2011},

date = {2011-01-01},

publisher = {Hawaii International Conference on System Sciences},

abstract = {Heterogeneous networks combining both wired and wireless components – fixed routers as well as mobile routers – emerge as wireless mesh networks are being deployed. Such heterogeneity is bound to become more and more present in the near future as mobile ad hoc networking becomes a reality. While it is possible to cope with heterogeneity by employing different routing protocols for the fixed / wired part and for the wireless / ad hoc part of the network, this may lead to sub-optimal performance, e.g. by way of longer routing paths due to these routing protocols sharing prefixes and ”connecting” the network only at distinct gateways between the two routing domains. Thus, the establishment of a single unified routing domain, and the use of a single routing protocol, for such heterogeneous networks is desired. OSPF is a natural candidate for this task, due to its wide deployment, its modularity and its similarity with the popular ad hoc routing protocol OLSR. Multiple OSPF extensions for MANETs have therefore been specified by the IETF. This paper introduces a novel OSPF extension for operation on ad hoc networks, MPRSP, and compares it with the existing OSPF extensions via simulations, which show that MPR+SP outperforms prior art.},

keywords = {Ad-Hoc, MANET, MESH, MPR, OSPF},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2010e,

title = {Comparative Study of RPL-Enabled Optimized Broadcast in Wireless Sensor Networks},

author = {Thomas Clausen and Ulrich Herberg},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-ISSNIP-Comparative-Study-of-RPL-Enabled-Optimized-Broadcast-in-Wireless-Sensor-Networks.pdf},

doi = {10.1109/ISSNIP.2010.5706795},

year  = {2010},

date = {2010-12-01},

publisher = {Proceedings of the 6th International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP)},

abstract = {Recent trends have suggested convergence to Wire-less Sensor Networks (WSNs) becoming IPv6-based. To this effect, the Internet Engineering Task Force has chartered a Work-ing Group to develop a routing protocol specification, enabling IPv6-based multi-hop Wireless Sensor Networks. The current effort of this working group is development of a uni-cast routing protocol denoted RPL. RPL constructs a “DAG-like” logical structure with a single root, at which the majority of the traffic flows terminate, and assumes restrictions on network dynamics and traffic generality, in order to satisfy strict constraints on router state and processing. This paper investigates the possibility for providing (effi-cient) network-wide broadcast mechanisms in WSNs, using the logical structure already provided by RPL. The aim hereof is to not impose any additional state requirements on WSN routers already running RPL. This paper presents two such broadcast mechanisms for RPL routed WSNs, and evaluates their performances. As part of this evaluation, the paper compares with MPR Flooding – an established efficient flooding optimization, widely used in MANETs.},

keywords = {Broadcast, Constrained Networks, LLN, Multicast, Performance Evaluation, RPL, Sensor Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2010f,

title = {IPv6 Operation for WAVE - Wireless Access in Vehicular Environments},

author = {Emmanuel Baccelli and Thomas Clausen and Ryuji Wakikawa},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-VNC-IPv6-Operation-for-WAVE-Wireless-Access-in-Vehicular-Environments.pdf},

doi = {10.1109/VNC.2010.5698260},

year  = {2010},

date = {2010-12-01},

publisher = {Proceedings of IEEE VNC 2010, Jersey City, USA},

abstract = {The IEEE WAVE protocol suite is providing commu- nications services to applications in vehicular networks, by way of promising support for two protocol stacks: the Wave Short Message Protocol (WSMP) and IPv6. While WSMP is developed within the IEEE 1609 family of standards, the authors of this paper assert, that considerations for IPv6 operation for WAVE are less developed, and several issues are left unaddressed by the current IEEE 1609 specifications. This paper reviews these issues and analyzes the main challenges in providing proper IPv6 operation for WAVE networks.},

keywords = {IPv6, WAVE},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2010g,

title = {Yet Another Autoconf Proposal (YAAP) for Mobile Ad hoc NETworks},

author = {Ulrich Herberg and Thomas Clausen},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-MSN-Yet-Another-Autoconf-Proposal.pdf},

doi = {10.1109/MSN.2010.48},

year  = {2010},

date = {2010-12-01},

publisher = {Proceedings of the 6th International Conference on Mobile Ad-hoc and Sensor Networks (MSN'10)},

abstract = {This paper addresses the issues of automatic address and prefix configuration of MANET routers. Specifically, the paper analyzes the differences between “classic IP networks” and MANETs, emphasizing the interface, link, topology, and addressing assumptions present in “classic IP networks”. The paper presents a model for how this can be matched to the specific constraints and conditions of a MANET – i.e., how MANETs can be configured to adhere to the Internet addressing architecture. This sets the stage for development of a MANET autoconfiguration protocol, enabling automatic configuration of MANET interfaces and prefix delegation. This autoconfiguration protocol is characterized by (i) adhering strictly to the Internet addressing architecture, (ii) being able to configure both MANET interface addresses and handle prefix delegation, and (iii) being able to configure both stand-alone MANETs, as well as MANETs connected to an infrastructure providing, e.g., globally scoped addresses/prefixes for use within the MANET. The protocol is specified through timed automatons which, by way of model checking, enable verification of certain protocol properties. Fur-thermore, a performance study of the basic protocol, as well as an optimization hereto, is conducted based on network simulations.},

keywords = {Ad-Hoc, Autoconfiguration, MANET, MESH},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Herberg2010,

title = {MANET Network Management and Performance Monitoring for NHDP and OLSRv2},

author = {Ulrich Herberg and Thomas Clausen and Robert G. Cole},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-CNSM-MANET-Network-Management-and-Performance-Monitoring-for-NHDP-and-OLSRv2.pdf},

doi = {10.1109/CNSM.2010.5691209},

year  = {2010},

date = {2010-10-01},

publisher = {Proceedings of the 6th International Conference on Network and Services Management},

abstract = {Mobile Ad Hoc NETworks (MANETs) are gener-ally thought of as infrastructureless and largely “un-managed” network deployments, capable of accommodating highly dynamic network topologies. Yet, while the network infrastructure may be “un-managed”, monitoring the network performance and setting configuration parameters once deployed, remains important in order to ensure proper “tuning” and maintenance of a MANET. This paper describes a management framework for the MANET routing protocol OLSRv2, and its constituent protocol NHDP. It does so by presenting considerations for “what to monitor and manage” in an OLSRv2 network, and how. The approach developed is based on the Simple Network Management Protocol (SNMP), and thus this paper details the various Management Information Bases (MIBs) for router status monitoring and control – as well as a novel approach to history-based perfor-mance monitoring. While SNMP may not be optimally designed for MANETs, it is chosen due to it being the predominant protocol for IP network management – and thus, efforts are made in this paper to “adapt” the management tools within the SNMP framework for reasonable behavior also in a MANET environment.},

keywords = {Ad-Hoc, MANET, MESH, Network Management, Network Monitoring, OLSR, OLSRv2},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2010h,

title = {Multipoint-to-Point and Broadcast in RPL},

author = {Thomas Clausen and Ulrich Herberg},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-NeoFUSION-Multipoint-to-Point-and-Broadcast-in-RPL.pdf},

doi = {10.1109/NBiS.2010.38},

year  = {2010},

date = {2010-09-01},

publisher = {Proceedings of the First International Symposium on Frontiers in Ubiquitous Computing, Networking and Applications (NeoFUSION 2010)},

abstract = {Recent trends in Wireless Sensor Networks (WSNs) have suggested converging to such being IPv6-based. To this effect, the Internet Engineering Task Force has chartered a Working Group to develop a routing protocol specification, enabling IPv6-based multi-hop Wireless Sensor Networks. This routing protocol, denoted RPL, has been under development for approximately a year, and this paper takes a critical look at the state of advancement hereof: it provides a brief algorithmic description of the protocol, and discusses areas where – in the authors view – further efforts are required in order for the protocol to become a viable candidate for general use in WSNs. Among these areas is the lack of a proper broadcast mechanism. This paper suggests two such broadcast mechanisms, both aiming at (i) exploiting the existing routing state of RPL, while (ii) requiring no additional state maintenance, and studies the performance of RPL and of these suggested mechanisms.},

keywords = {Broadcast, Constrained Networks, LLN, Multicast, RPL, Sensor Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2010i,

title = {Router and Link Admittance Control in the Optimized Link State Routing Protocol version 2 (OLSRv2)},

author = {Thomas Clausen and Ulrich Herberg},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-NSS-Router-and-Link-Admittance-Control-in-the-Optimized-Link-State-Routing-Protocol-version-2-OLSRv2.pdf},

doi = {10.1109/NSS.2010.20},

isbn = {978-1-4244-8484-3},

year  = {2010},

date = {2010-09-01},

publisher = {Proceedings of the 4th International Conference on Network and System Security (NSS 2010)},

abstract = {This paper presents security mechanisms for router and link admittance control in OLSRv2. Digitally signing OLSRv2 control messages allows recipient routers to – individually – choose to admit or exclude the originating router for when populating link-state databases, calculating MPR sets etc. By additionally embedding signatures for each advertised link, recipient routers can also control admittance of each advertised link in the message, rendering an OLSRv2 network resilient to both identity-spoofing and link-spoofing attacks. The flip-side of the coin when using such a link-admittance mechanism is, that the number of signatures to include in each OLSRv2 control message is a function of the number of links advertised. For HELLO messages, this is essentially the number of neighbor routers, for TC messages, this is the number of MPR Selectors of the originator of the message. Also, upon receipt of a control message, these signatures are to be verified. This paper studies the impact of adding a link-admittance control mechanism to OLSRv2, both in terms of additional control-traffic overhead and additional in-router processing resources, using several cryptographic algorithms, such as RSA and Elliptic Curve Cryptography for very short signatures. Index Terms—OLSRv2, MANET, security, router, link admit-tance control, digital signatures},

keywords = {Ad-Hoc, MANET, MESH, OLSR, OLSR Security, OLSRv2, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2010j,

title = {Digital Signatures for Admittance Control in the Optimized Link State Routing Protocol version 2},

author = {Ulrich Herberg and Thomas Clausen and Jerome Milan},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-ITAP-Digital-Signatures-for-Admittance-Control-in-OLSRv2.pdf},

doi = {10.1109/ITAPP.2010.5566285},

isbn = {978-1-4244-5142-5},

year  = {2010},

date = {2010-08-01},

publisher = {Proceedings of the International Conference on Internet Technology and Applications (iTAP 2010)},

abstract = {Public community Mobile Ad Hoc NETworks (MANETs), such as the “Funkfeuer” or “Freifunk” networks, scale up to several hundreds of routers, connecting users with each other, and with the Internet. As MANETs are typically operated over wireless channels (e.g. WiFi), access to these networks is granted to anyone in the radio range of another router in the MANET, and running the same MANET routing protocol. In order to protect the stability of the networks from malicious intruders, it is important to ensure that only trusted peers are admitted to participate in the control message exchange, and to provide means for logically “disconnecting” a non-trustworthy peer. This paper presents the concept of admittance control for the Optimized Link State Routing Protocol version 2 (OLSRv2), and suggests a security extension based on digital signatures. Due to the flexible message format of OLSRv2, this extension keeps compatibility with the core OLSRv2 specification. Several standard digital signature algorithms (RSA, DSA, ECDSA), as well as HMAC, are compared in terms of message overhead and CPU time for generating and processing signatures.},

keywords = {Ad-Hoc, MANET, MESH, OLSR, OLSR Security, OLSRv2},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2010k,

title = {Vulnerability Analysis of the Optimized Link State Routing Protocol version 2 (OLSRv2)},

author = {Thomas Clausen and Ulrich Herberg},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2010-WCNIS-Vulnerability-Analysis-of-the-Optimized-Link-State-Routing-Protocol-version-2-OLSRv2.pdf},

doi = {10.1109/WCINS.2010.5544732},

isbn = {978-1-4244-5850-9},

year  = {2010},

date = {2010-06-01},

publisher = {Proceedings of the IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS2010)},

abstract = {Mobile Ad hoc NETworks (MANETs) are leaving the confines of research laboratories, to find place in real-world deploy-ments. Outside specialized domains (military, vehicular, etc.), city-wide community-networks are emerging, connecting regular Internet users with each other, and with the Internet, via MANETs. Growing to encompass more than a handful of “trusted participants”, the question of preserving the MANET network connectivity, even when faced with careless or malicious participants, arises, and must be addressed. A first step towards protecting a MANET is to analyze the vulnerabilities of the routing protocol, managing the connectivity. By understanding how the algorithms of the routing protocol operate, and how these can be exploited by those with ill intent, countermeasures can be developed, readying MANETs for wider deployment and use. This paper takes an abstract look at the algorithms that constitute the Optimized Link State Routing Protocol version 2 (OLSRv2), and identifies for each protocol element the possible vulnerabilities and attacks – in a certain way, provides a “cookbook” for how to best attack an operational OLSRv2 network, or for how to proceed with developing protective countermeasures against these attacks.},

keywords = {Ad-Hoc, MANET, MESH, OLSR, OLSR Security, OLSRv2, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2009,

title = {IP Links in Multihop Ad Hoc Wireless Networks?},

author = {Emmanuel Baccelli and Thomas Clausen and Ulrich Herberg and Charles E. Perkins},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2009-SOFTCOM-IP-Links-in-Multihop-Ad-Hoc-Wireless-Networks.pdf},

year  = {2009},

date = {2009-09-01},

publisher = {Proceedings of SoftCom},

abstract = {A number of efforts currently aim at scalable and efficient mobile ad hoc routing, an essential piece concerning the integration of such networks in the Internet. However, there is another independent and important issue, namely, how can existing Internet networks and ad hoc networks co- exist coherently within the same protocol architecture. A fundamental concept in the IP protocol suite is that of a link. The link concept has so far been key to the scalability of IP networking. This paper identifies and discusses issues regarding the formalisation of a similar concept in the multi- hop ad hoc networking context – one of the first steps that must be taken in the near future, in order to be able to accomodate ad hoc networks in the Internet.},

keywords = {Ad-Hoc, Cross-Layer Design},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {OSPF, VANET, Vehicular Networking},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {Ad-Hoc, Autoconfiguration, MANET, MESH, OLSR},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {Ad-Hoc, Autoconfiguration, MANET, MESH, OLSR},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {NEMO, OLSR},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {Ad-Hoc, MANET, MESH, OSPF},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {Ad-Hoc, MANET, MESH, OSPF},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {Ad-Hoc, MANET, MESH, OLSR},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {OLSR, OLSR Security, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {FSR, MANET, OLSR, Scalability},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {MANET, OLSR, OLSR Security, Security},

pubstate = {published},

tppubtype = {inproceedings}

}

@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 = {MANET, OLSR},

pubstate = {published},

tppubtype = {inproceedings}

}