Thomas Heide Clausen, cand.polyt, PhD
Professor
A graduate of Aalborg University, Denmark (M.Sc., PhD – civilingeniør, cand.polyt), Thomas spent a number of years at INRIA where he, among other things, developed and standardised OLSR – the predominant routing protocol for community, mesh, and tactical networks.
In 2004 he joined faculty at Ecole Polytechnique, France’s premiere technical and scientific university, where he is currently a professor. He leads the computer networking research group, and enjoys working with with some of France’s best students.
Thomas has developed, and coordinates, the computer networking curriculum at Ecole Polytechnique, teaches several core classes therein. He’s the academic director of the elite and multidisciplinary Master of Science and Technology programme “IoT: Innovation and Management”.
In terms of research, Thomas is, particularly, interested in “keeping the Internet connected”, even when faced with the immense influx of “new devices” and “new uses”. Thus, his work has emphasized development of algorithms, protocols, and architectures for the (immodestly) termed “future internet”: the Internet of Things (IoT), personal-area networks (PANs), ubiquitous networks, rendering the current Internet routing more “robust” and “adaptive”, as well as for securely supporting new services across the Internet. Thomas has authored more than 100 peer-reviewed academic publications, which have attracted more than 16000 citations.
With a particular affinity for “applicable research”, Thomas remains an active contributor to standardisation. He served as co-chair of the MANET AUTOCONF working group from 2005 until its closure in 2012, within the Internet Engineering Task Force (IETF) – the international standardization body behind the Internet and behind protocols such as TCP/IP, HTTP etc. Also within the IETF, he has served on the Routing Area Directorate, an advisory group of routing experts providing final document reviews as part of the standardization process, as well as other expert advice on routing-related topics. Thomas has authored, edited, and contributed substantially to 24 published IETF standards. He has also consulted for the development of IEEE 802.11s, as well as contributed the routing portions of the recently ratified ITU-T standard G.9903 for G3-PLC networks – the international standard upon which, e.g., the SmartGrid/ConnectedEnergy initiatives are built.
Thomas maintains long-standing formal industrial research collaborations with, e.g., Hitachi (Japan), Fujitsu (USA), Toyota (Japan), Qualcomm (USA), EDF (France), ERDF (France), and Sagemcom (France). He also maintains close collaborative relations with peers in industry, including BAE Systems (UK), Cisco Systems (USA & France), and Alcatel-Lucent (France). He was involved in the ADEME “SOGrid” project, on the future French national “Smart Grid”. Thomas holds the Cisco endowed “Internet of Everything” academic chaire at Ecole Polytechnique.
Thomas is a senior member of the IEEE, and was named an “IEEE Computer Society Distinguished Contributor”, as part of the inaugural 2021 class.
Latest Posts Mentioning Thomas
Paper: IEEE Access – DNN partitioning for inference throughput acceleration at the edge
Intro I am very excited to present this work, published in the IEEE Access journal, which presents an alternative to standard AI workload acceleration mechanisms at the edge (hardware acceleration, model compression, cloud off-loading). This work, in collaboration with Cisco,…
Read more
Paper: Investigating data broadcast performance in mobile ad-hoc networks
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,…
Read more
Paper: Combining Temporal and Spartial Partial Topolgy for MANET Routing – Merging OLSR and FSR
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…
Read more
Thomas’ Publications
2018
Clausen, Thomas; YI, Jiazi; Cordero, Juan Antonio; Igarashi, Yuichi
Use 'em or Lose 'em: On Unidirectional Links in Reactive Routing Protocols Journal Article
In: Elsevier Ad Hoc Networks, vol. 73, pp. 51-64, 2018.
Abstract | Links | BibTeX | Tags: Ad-Hoc, LLN, LOADng, MANET, Reactive, Routing
@article{Clausen2018unidirectional,
title = {Use 'em or Lose 'em: On Unidirectional Links in Reactive Routing Protocols},
author = {Thomas Clausen and Jiazi YI and Juan Antonio Cordero and Yuichi Igarashi},
url = {https://ac.els-cdn.com/S1570870518300325/1-s2.0-S1570870518300325-main.pdf?_tid=0b7f4a7e-b489-4317-b96c-f18cec2af56f&acdnat=1520779362_84dbf04f92cfc3c7ef2448f3b4c3ebf7},
doi = {10.1016/j.adhoc.2018.02.004},
year = {2018},
date = {2018-05-01},
journal = {Elsevier Ad Hoc Networks},
volume = {73},
pages = {51-64},
abstract = {In reactive unicast routing protocols, Route Discovery aims to include only bidirectional links in discovered routing paths. This is typically accomplished by having routers maintain a “blacklist” of links recently confirmed (through Route Reply processing) to be unidirectional – which is then used for excluding subsequent Route Discovery control messages received over these links from being processed and forwarded.
This paper first presents an analytical model, which allows to study the impact of unidirectional links being present in a network, on the performance of reactive routing protocols. Next, this paper identifies that despite the use of a “blacklist”, the Route Discovery process may result in discovery of false forward routes, i.e., routes containing unidirec- tional links – and proposes a counter-measure denoted Forward Bidirectionality Check. This paper further proposes a Loop Exploration mechanism, allowing to properly include unidirectional links in a discovered routing topology – with the goal of providing bidirectional connectivity even in absence of bidirectional paths in the network.
Finally, each of these proposed mechanisms are subjected to extensive network simulations in static scenarios. When the fraction of unidirectional links is moderate (15 50%), simulations find Forward Bidirectionality Check to significantly increase the probability that bidirectional routing paths can be discovered by a reactive routing protocol, while incurring only an insignificant additional overhead. Further, in networks with a significant fraction of unidirectional links ( 50%), simulations reveal that Loop Exploration preserves the ability of a reactive routing protocol to establish bidirectional communication (possibly through non-bidirectional paths), but at the expense of a substantial additional overhead.},
keywords = {Ad-Hoc, LLN, LOADng, MANET, Reactive, Routing},
pubstate = {published},
tppubtype = {article}
}
This paper first presents an analytical model, which allows to study the impact of unidirectional links being present in a network, on the performance of reactive routing protocols. Next, this paper identifies that despite the use of a “blacklist”, the Route Discovery process may result in discovery of false forward routes, i.e., routes containing unidirec- tional links – and proposes a counter-measure denoted Forward Bidirectionality Check. This paper further proposes a Loop Exploration mechanism, allowing to properly include unidirectional links in a discovered routing topology – with the goal of providing bidirectional connectivity even in absence of bidirectional paths in the network.
Finally, each of these proposed mechanisms are subjected to extensive network simulations in static scenarios. When the fraction of unidirectional links is moderate (15 50%), simulations find Forward Bidirectionality Check to significantly increase the probability that bidirectional routing paths can be discovered by a reactive routing protocol, while incurring only an insignificant additional overhead. Further, in networks with a significant fraction of unidirectional links ( 50%), simulations reveal that Loop Exploration preserves the ability of a reactive routing protocol to establish bidirectional communication (possibly through non-bidirectional paths), but at the expense of a substantial additional overhead.
2017
Clausen, Thomas; Yi, Jiazi; Herberg, Ulrich
Lightweight On-demand Ad hoc Distance-vector Routing-Next Generation (LOADng): Protocol, Extension, and Applicability Journal Article
In: Computer Networks, vol. 126, pp. 125-140, 2017.
Abstract | Links | BibTeX | Tags: Ad-Hoc, LLN, LOADng
@article{clausen2017lightweight,
title = {Lightweight On-demand Ad hoc Distance-vector Routing-Next Generation (LOADng): Protocol, Extension, and Applicability},
author = {Thomas Clausen and Jiazi Yi and Ulrich Herberg},
url = {http://www.thomasclausen.net/wp-content/uploads/2017/08/2017-Computer-Networks-Lightweight-On-demand-Ad-hoc-Distance-vector-Routing-Next-Generation-LOADng.pdf},
doi = {10.1016/j.comnet.2017.06.025},
year = {2017},
date = {2017-10-24},
journal = {Computer Networks},
volume = {126},
pages = {125-140},
publisher = {Elsevier},
abstract = {This paper studies the routing protocol “Lightweight On-demand Ad hoc Distance-vector Routing Protocol – Next Generation (LOADng)”, designed to enable efficient, scalable and secure routing in low power and lossy networks. As a reactive protocol, it does not maintain a routing table for all destinations in the network, but initiates a route discovery to a destination only when there is data to be sent to that destination to reduce routing overhead and memory consumption. Designed with a modular approach, LOADng can be extended with additional components for adapting the protocol to different topologies, traffic, and data-link layer characteristics. This paper studies several such additional components for extending LOADng: support for smart route requests and expanding ring search, an extension permitting maintaining collection trees, a fast rerouting extension. All those extensions are examined from the aspects of specification, interoperability with other mechanisms, security vulnerabilities, performance and applicability. A general framework is also proposed to secure the routing protocol.},
keywords = {Ad-Hoc, LLN, LOADng},
pubstate = {published},
tppubtype = {article}
}
2016
Augustin, Aloys; Yi, Jiazi; Clausen, Thomas; Townsley, Mark
A Study of LoRa: Long Range & Low Power Networks for the Internet of Things Journal Article
In: MDPI Sensors, vol. 16, no. 9, pp. 1466, 2016, ISSN: 1424-8220, ((5 yr Impact Factor: 2.437)).
Abstract | Links | BibTeX | Tags: Chaire Cisco, IoT, LLN, LoRA, LPWAN, Sensor Networks
@article{Augustin2016,
title = {A Study of LoRa: Long Range & Low Power Networks for the Internet of Things},
author = {Aloys Augustin and Jiazi Yi and Thomas Clausen and Mark Townsley},
url = {http://www.thomasclausen.net/2016-a-study-of-lora-long-range-low-power-networks-for-the-internet-of-things/},
doi = {10.3390/s16091466},
issn = {1424-8220},
year = {2016},
date = {2016-09-09},
journal = {MDPI Sensors},
volume = {16},
number = {9},
pages = {1466},
abstract = {LoRa is a long-range, low-power, low-bitrate, wireless telecommunications system, promoted as an infrastructure solution for the Internet of Things: end-devices use LoRa across a single wireless hop to communicate to gateway(s), connected to the Internet and which act as transparent bridges and relay messages between these end-devices and a central network server. This paper provides an overview of LoRa and an in-depth analysis of its functional components. The physical and data link layer performance is evaluated by field tests and simulations. Based on the analysis and evaluations, some possible solutions for performance enhancements are proposed.},
note = {(5 yr Impact Factor: 2.437)},
keywords = {Chaire Cisco, IoT, LLN, LoRA, LPWAN, Sensor Networks},
pubstate = {published},
tppubtype = {article}
}
2015
Yi, Jiazi; Clausen, Thomas; Herberg, Ulrich
Depth-First Forwarding for Unreliable Networks: Extensions and Application Journal Article
In: IEEE Internet of Things Journal, vol. 2015, no. 06, 2015.
Abstract | Links | BibTeX | Tags: DFF, LLN, LOADng, MESH, Smart Grid, SOGRID
@article{Yi2015,
title = {Depth-First Forwarding for Unreliable Networks: Extensions and Application},
author = {Jiazi Yi and Thomas Clausen and Ulrich Herberg},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2015-IEEE-Internet-of-Things-Journal-Depth-First-Forwarding-for-Unreliable-Networks-Extensions-and-Applications.pdf},
doi = {10.1109/JIOT.2015.2409892},
year = {2015},
date = {2015-05-25},
journal = {IEEE Internet of Things Journal},
volume = {2015},
number = {06},
abstract = {his paper introduces extensions and applications of depth-first forwarding (DFF)-a data forwarding mechanism for use in unreliable networks such as sensor networks and Mobile Ad hoc NETworks with limited computational power and storage, low-capacity channels, device mobility, etc. Routing protocols for these networks try to balance conflicting requirements of being reactive to topology and channel variation while also being frugal in resource requirements-but when the underlying topology changes, routing protocols require time to re converge, during which data delivery failure may occur. DFF was developed to alleviate this situation: it reacts rapidly to local data delivery failures and attempts to successfully deliver data while giving a routing protocol time to recover from such a failure. An extension of DFF, denoted as DFF++, is proposed in this paper, in order to optimize the performance of DFF by way of introducing a more efficient search ordering. This paper also studies the applicability of DFF to three major routing protocols for the Internet of Things (IoT), including the Lightweight On-demand Ad hoc Distance-vector Routing Protocol-Next Generation (LOADng), the optimized link state routing protocol version 2 (OLSRv2), and the IPv6 routing protocol for low-power and lossy networks (RPL), and presents the performance of these protocols, with and without DFF, in lossy and unreliable networks.},
keywords = {DFF, LLN, LOADng, MESH, Smart Grid, SOGRID},
pubstate = {published},
tppubtype = {article}
}
2014
Yi, Jiazi; Clausen, Thomas
Collection Tree Extension of Reactive Routing Protocol for Low-Power and Lossy Networks Journal Article
In: Hindawi International Journal of Distributed Sensor Networks, vol. 2014, no. Article ID 352421, pp. 12, 2014.
Abstract | Links | BibTeX | Tags: LLN, LOADng, MESH, Smart Grid, SOGRID
@article{Yi2014,
title = {Collection Tree Extension of Reactive Routing Protocol for Low-Power and Lossy Networks},
author = {Jiazi Yi and Thomas Clausen},
editor = {Christos Verikoukis},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2014-Hindawi-International-Journal-of-Distributed-Sensor-Networks-Collection-Tree-Extension-of-LOADng-Protocol-for-Low-power-and-Lossy-Networks.pdf},
doi = {doi:10.1155/2014/352421},
year = {2014},
date = {2014-03-25},
journal = {Hindawi International Journal of Distributed Sensor Networks},
volume = {2014},
number = {Article ID 352421},
pages = {12},
abstract = {This paper proposes an extension to reactive routing protocol, for efficient construction of a collection tree for data acquisition in sensor networks. The Lightweight On-Demand Ad hoc Distance Vector Routing Protocol-Next Generation (LOADng) is a reactive distance vector protocol which is intended for use in mobile ad hoc networks and low-power and lossy networks to build paths between source-destination pairs. In 2013, ITU-T has ratified the recommendation G.9903 Amendment 1, which includes LOADng in a specific normative annex for routing protocol in smart grids. The extension uses the mechanisms from LOADng, imposes minimal overhead and complexity, and enables a deployment to efficiently support “sensor-to-root” traffic, avoiding complications of unidirectional links in the collection tree. The protocol complexity, security, and interoperability are examined in detail. The simulation results show that the extension can effectively improve the efficiency of data acquisition in the network.},
keywords = {LLN, LOADng, MESH, Smart Grid, SOGRID},
pubstate = {published},
tppubtype = {article}
}
Yi, Jiazi; Clausen, Thomas; Herberg, Ulrich
Depth First Forwarding for Low Power and Lossy Networks: Application and Extension Proceedings Article
In: Proceedings of IEEE World Forum on Internet of Things WF-IoT 2014, 2014.
Abstract | Links | BibTeX | Tags: Constrained Networks, Cross-Layer Design, DFF, LLN, LOADng, MESH, Sensor Networks, Smart Grid, SOGRID
@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, MESH, Sensor Networks, Smart Grid, SOGRID},
pubstate = {published},
tppubtype = {inproceedings}
}
Clausen, Thomas; Yi, Jiazi
Path Accumulation Extensions for the LOADng Routing Protocol in Sensor Networks Proceedings Article
In: Hsu, RobertC. -H.; Wang, Shangguang (Ed.): Internet of Vehicles – Technologies and Services, pp. 150-159, Springer International Publishing, 2014, ISBN: 978-3-319-11166-7.
Abstract | Links | BibTeX | Tags: LLN, LOADng, Sensor Networks
@inproceedings{Clausen2014,
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, Sensor Networks},
pubstate = {published},
tppubtype = {inproceedings}
}
Cordero, Juan Antonio; Yi, Jiazi; Clausen, Thomas
An Adaptive Jitter Mechanism for Reactive Route Discovery in Sensor Networks Journal Article
In: Sensors, vol. 14, no. 8, pp. 14440, 2014, ISSN: 1424-8220, (http://www.mdpi.com/1424-8220/14/8/14440).
Abstract | Links | BibTeX | Tags: Jitter, LLN, LOADng, MESH, Sensor Networks, Smart Grid
@article{s140814440,
title = {An Adaptive Jitter Mechanism for Reactive Route Discovery in Sensor Networks},
author = {Juan Antonio Cordero and Jiazi Yi and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2014-MDPI-Sensors-An-Adaptive-Jitter-Mechanism-for-Reactive-Route-Discovery-in-Sensor-Networks.pdf},
doi = {10.3390/s140814440},
issn = {1424-8220},
year = {2014},
date = {2014-01-01},
journal = {Sensors},
volume = {14},
number = {8},
pages = {14440},
abstract = {This paper analyses the impact of jitter when applied to route discovery in reactive (on-demand) routing protocols. In multi-hop non-synchronized wireless networks, jitter—a small, random variation in the timing of message emission—is commonly employed, as a means to avoid collisions of simultaneous transmissions by adjacent routers over the same channel. In a reactive routing protocol for sensor and ad hoc networks, jitter is recommended during the route discovery process, specifically, during the network-wide flooding of route request messages, in order to avoid collisions. Commonly, a simple uniform jitter is recommended. Alas, this is not without drawbacks: when applying uniform jitter to the route discovery process, an effect called delay inversion is observed. This paper, first, studies and quantifies this delay inversion effect. Second, this paper proposes an adaptive jitter mechanism, designed to alleviate the delay inversion effect and thereby to reduce the route discovery overhead and (ultimately) allow the routing protocol to find more optimal paths, as compared to uniform jitter. This paper presents both analytical and simulation studies, showing that the proposed adaptive jitter can effectively decrease the cost of route discovery and increase the path quality.},
note = {http://www.mdpi.com/1424-8220/14/8/14440},
keywords = {Jitter, LLN, LOADng, MESH, Sensor Networks, Smart Grid},
pubstate = {published},
tppubtype = {article}
}
2013
Clausen, Thomas; Yi, Jiazi; Bas, Antonin; Herberg, Ulrich
A Depth First Forwarding (DFF) Extension for the LOADng Routing Protocol Proceedings Article
In: ASON 2013 Sixth International Workshop on Autonomous Self-Organizing Networks, 2013.
Abstract | Links | BibTeX | Tags: Constrained Networks, Cross-Layer Design, DFF, LLN, LOADng, Sensor Networks, Smart Grid, SOGRID
@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, Smart Grid, SOGRID},
pubstate = {published},
tppubtype = {inproceedings}
}
Yi, Jiazi; Clausen, Thomas; Igarashi, Yuichi
Evaluation of Routing Protocol for Low Power and Lossy Networks: LOADng and RPL Proceedings Article
In: 2013 IEEE Conference on Wireless Sensors, 2013.
Abstract | Links | BibTeX | Tags: Constrained Networks, LLN, LOADng, Performance Evaluation, RPL, Sensor Networks, Smart Grid, SOGRID
@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, Smart Grid, SOGRID},
pubstate = {published},
tppubtype = {inproceedings}
}
Clausen, Thomas; de Verdiere, Axel Colin; Yi, Jiazi
Performance analysis of Trickle as a flooding mechanism Proceedings Article
In: IEEE 15th International Conference on Communication Technology, 2013.
Abstract | Links | BibTeX | Tags: Constrained Networks, LLN, Performance Evaluation, RPL, Sensor Networks, Trickle
@inproceedings{Clausen2013b,
title = {Performance analysis of Trickle as a flooding mechanism},
author = {Thomas Clausen and Axel Colin de 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}
}
Cordero, Juan Antonio; Yi, Jiazi; Clausen, Thomas; Baccelli, Emmanuel
Enabling Multihop Communication in Spontaneous Wireless Networks Book Chapter
In: Haddadi, Hamed; Bonaventure, Olivier (Ed.): Recent Advances in Networking, Chapter 9, pp. 413-457, ACM SIGCOMM, 2013.
Links | BibTeX | Tags: Ad-Hoc, LLN, LOADng, MANET, MPR, OLSR, OSPF
@inbook{Cordero2013,
title = {Enabling Multihop Communication in Spontaneous Wireless Networks},
author = {Juan Antonio Cordero and Jiazi Yi and Thomas Clausen and Emmanuel Baccelli},
editor = {Hamed Haddadi and Olivier Bonaventure},
url = {http://sigcomm.org/education/ebook/SIGCOMMeBook2013v1_chapter9.pdf},
year = {2013},
date = {2013-08-01},
booktitle = {Recent Advances in Networking},
pages = {413-457},
publisher = {ACM SIGCOMM},
chapter = {9},
keywords = {Ad-Hoc, LLN, LOADng, MANET, MPR, OLSR, OSPF},
pubstate = {published},
tppubtype = {inbook}
}
Cordero, Juan Antonio; Yi, Jiazi; Clausen, Thomas
Optimization of jitter configuration for reactive route discovery in wireless mesh networks Proceedings Article
In: Modeling & Optimization in Mobile, Ad Hoc & Wireless Networks (WiOpt), 2013 11th International Symposium on, 2013, ISBN: 978-1-61284-824-2.
Abstract | Links | BibTeX | Tags: Ad-Hoc, Jitter, LLN, LOADng, MANET, MESH, Sensor Networks, Smart Grid
@inproceedings{Clausen2013c,
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, LLN, LOADng, MANET, MESH, Sensor Networks, Smart Grid},
pubstate = {published},
tppubtype = {inproceedings}
}
2012
Yi, Jiazi; Clausen, Thomas; Bas, Antonin
Smart Route Request for On-demand Route Discovery in Constrained Environments Proceedings Article
In: 2012 IEEE International Conference on Wireless Information Technology and Systems, 2012.
Abstract | Links | BibTeX | Tags: Constrained Networks, LLN, LOADng, Sensor Networks
@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}
}
Bas, Antonin; Yi, Jiazi; Clausen, Thomas
Expanding Ring Search for Route Discovery in LOADng Routing Protocol Proceedings Article
In: The 1st International Workshop on Smart Technologies for Energy, Information and Communication, 2012.
Abstract | Links | BibTeX | Tags: Constrained Networks, LLN, LOADng, Sensor Networks
@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}
}
Yi, Jiazi; Clausen, Thomas; de Verdiere, Axel Colin
Efficient Data Acquisition in Sensor Networks:Introducing (the) LOADng Collection Tree Protocol Proceedings Article
In: IEEE WiCom 2012, The 8th IEEE International Conference on Wireless Communications, Networking and Mobile Computing., 2012.
Abstract | Links | BibTeX | Tags: Constrained Networks, LLN, LOADng, Sensor Networks
@inproceedings{Clausen2012,
title = {Efficient Data Acquisition in Sensor Networks:Introducing (the) LOADng Collection Tree Protocol},
author = {Jiazi Yi and Thomas Clausen and Axel Colin de 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}
}
Clausen, Thomas; Yi, Jiazi; de Verdiere, Axel Colin
LOADng: Towards AODV Version 2 Proceedings Article
In: 2012 IEEE 76th Vehicular Technology Conference, 2012.
Abstract | Links | BibTeX | Tags: Constrained Networks, LLN, LOADng, MESH, Sensor Networks
@inproceedings{Clausen2012b,
title = {LOADng: Towards AODV Version 2},
author = {Thomas Clausen and Jiazi Yi and Axel Colin de 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, MESH, Sensor Networks},
pubstate = {published},
tppubtype = {inproceedings}
}
2011
Herberg, Ulrich; Clausen, Thomas
Study of Multipoint-to-Point and Broadcast Traffic Performance in the 'IPv6 Routing Protocol for Low Power and Lossy Networks' (RPL) Journal Article
In: Journal of Ambient Intelligence and Humanized Computing, Springer, ISSN 1868-5137, Volume 2, Number 4, 2011, (http://link.springer.com/article/10.1007/s12652-011-0046-2).
Abstract | Links | BibTeX | Tags: Broadcast, Constrained Networks, LLN, LLN Broadcast, Multicast, Performance Evaluation, RPL, Sensor Networks
@article{LIX-NET-journal-119,
title = {Study of Multipoint-to-Point and Broadcast Traffic Performance in the 'IPv6 Routing Protocol for Low Power and Lossy Networks' (RPL)},
author = {Ulrich Herberg and Thomas Clausen},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-Journal-of-Ambient-Intelligence-and-Humanized-Computing-Study-of-Multipoint-to-Point-and-Broadcast-Traffic-Performance-in-the-IPv6-Routing-Protocol-for-Low-Power-and-Lossy-Networks-RPL.pdf},
year = {2011},
date = {2011-10-01},
journal = {Journal of Ambient Intelligence and Humanized Computing, Springer, ISSN 1868-5137, Volume 2, Number 4},
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 “IPv6 Routing Protocol for Low Power and Lossy Networks” (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 several such broadcast mechanisms, all aiming at (1) exploiting the existing routing state of RPL, while (2) requiring no additional state maintenance, and studies the performance of RPL and of these suggested mechanisms.},
note = {http://link.springer.com/article/10.1007/s12652-011-0046-2},
keywords = {Broadcast, Constrained Networks, LLN, LLN Broadcast, Multicast, Performance Evaluation, RPL, Sensor Networks},
pubstate = {published},
tppubtype = {article}
}
Herberg, Ulrich; Clausen, Thomas
A Comparative Performance Study of the Routing Protocols LOAD and RPL with Bi-Directional Traffic in Low-power and Lossy Networks (LLN) Proceedings Article
In: Proceedings of the Eighth ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN), 2011.
Abstract | Links | BibTeX | Tags: Constrained Networks, LLN, LOADng, Performance Evaluation, RPL, Sensor Networks
@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, LOADng, Performance Evaluation, RPL, Sensor Networks},
pubstate = {published},
tppubtype = {inproceedings}
}
Clausen, Thomas; Herberg, Ulrich; Philipp, Matias
A Critical Evaluation of the “IPv6 Routing Protocol for Low Power and Lossy Networks” (RPL) Proceedings Article
In: Proceedings of the 5th IEEE International Conference on Wireless & Mobile Computing, Networking & Communication (WiMob), 2011.
Abstract | Links | BibTeX | Tags: Constrained Networks, IPv6, LLN, RPL, Sensor Networks
@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}
}
Clausen, Thomas; Herberg, Ulrich
Some Considerations on Routing in Particular and Lossy Environments Proceedings Article
In: Proceedings of the 1st Interconnecting Smart Objects with the Internet Workshop, 2011.
Abstract | Links | BibTeX | Tags: Constrained Networks, LLN, RPL
@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}
}
Levis, Phil; Clausen, Thomas; Hui, Jonatan; Gnawali, Omprakash; Ko, JeongGil
RFC6206: The Trickle Algorithm Miscellaneous
2011, (http://tools.ietf.org/html/rfc6206).
Abstract | Links | BibTeX | Tags: IETF, LLN, RFC, RPL, Sensor Networks, Standard, Trickle
@misc{Levis2011,
title = {RFC6206: The Trickle Algorithm},
author = {Phil Levis and Thomas Clausen and Jonatan Hui and Omprakash Gnawali and JeongGil Ko},
url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/rfc6206.txt.pdf},
doi = {10.17487/RFC6206},
year = {2011},
date = {2011-03-01},
publisher = {IETF - Std. Track RFC 6206},
organization = {The Internet Engineering Task Force},
abstract = {The Trickle algorithm allows nodes in a lossy shared medium (e.g., low-power and lossy networks) to exchange information in a highly robust, energy efficient, simple, and scalable manner. Dynamically adjusting transmission windows allows Trickle to spread new information on the scale of link-layer transmission times while sending only a few messages per hour when information does not change. A simple suppression mechanism and transmission point selection allow Trickle's communication rate to scale logarithmically with density. This document describes the Trickle algorithm and considerations in its use.},
note = {http://tools.ietf.org/html/rfc6206},
keywords = {IETF, LLN, RFC, RPL, Sensor Networks, Standard, Trickle},
pubstate = {published},
tppubtype = {misc}
}
2010
Clausen, Thomas; Herberg, Ulrich
Comparative Study of RPL-Enabled Optimized Broadcast in Wireless Sensor Networks Proceedings Article
In: Proceedings of the 6th International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP), 2010.
Abstract | Links | BibTeX | Tags: Broadcast, Constrained Networks, LLN, Multicast, Performance Evaluation, RPL, Sensor Networks
@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}
}
Clausen, Thomas; Herberg, Ulrich
Multipoint-to-Point and Broadcast in RPL Proceedings Article
In: Proceedings of the First International Symposium on Frontiers in Ubiquitous Computing, Networking and Applications (NeoFUSION 2010), 2010.
Abstract | Links | BibTeX | Tags: Broadcast, Constrained Networks, LLN, LLN Broadcast, Multicast, RPL, Sensor Networks
@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, LLN Broadcast, Multicast, RPL, Sensor Networks},
pubstate = {published},
tppubtype = {inproceedings}
}