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)).
@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 = {},
pubstate = {published},
tppubtype = {article}
}
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.
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.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
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.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
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.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
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.
@inproceedings{Clausen2013,
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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
“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.
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.
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.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
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.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
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.
Clausen, Thomas; Yi, Jiazi; de Verdiere, Axel Colin
LOADng: Towards AODV Version 2 Proceedings Article
In: 2012 IEEE 76th Vehicular Technology Conference, 2012.
@inproceedings{Clausen2012,
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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
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.
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.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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”).
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.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
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.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
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).
@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 = {},
pubstate = {published},
tppubtype = {article}
}
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.
Clausen, Thomas; Herberg, Ulrich
A Comparative Performance Study of the Routing Protocols LOAD and RPL with Bi-Directional Traffic in Low-power and Lossy Networks (LLN) Technical Report
2011.
@techreport{Clausen2011bb,
title = {A Comparative Performance Study of the Routing Protocols LOAD and RPL with Bi-Directional Traffic in Low-power and Lossy Networks (LLN)},
author = {Thomas Clausen and Ulrich Herberg},
year = {2011},
date = {2011-06-01},
publisher = {INRIA Research Report 7637},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Clausen, Thomas; Herberg, Ulrich; Philipp, Matias
A Critical Evaluation of the "IPv6 Routing Protocol for Low Power and Lossy Networks" (RPL) Technical Report
2011.
@techreport{LIX-NET-RR-107,
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},
year = {2011},
date = {2011-05-01},
publisher = {INRIA Research Report 7633},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
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.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
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.
@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 = {},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Clausen, Thomas; Herberg, Ulrich
Study of Multipoint-to-Point and Broadcast Traffic Performance in RPL Technical Report
2010.
@techreport{Clausen2010bb,
title = {Study of Multipoint-to-Point and Broadcast Traffic Performance in RPL},
author = {Thomas Clausen and Ulrich Herberg},
year = {2010},
date = {2010-09-01},
publisher = {INRIA Research Report RR-7384},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Clausen, Thomas; Herberg, Ulrich
Comparative Study of RPL-Enabled Optimized Broadcast in Wireless Sensor Networks Technical Report
2010.
@techreport{Clausen2010bb,
title = {Comparative Study of RPL-Enabled Optimized Broadcast in Wireless Sensor Networks},
author = {Thomas Clausen and Ulrich Herberg},
year = {2010},
date = {2010-05-01},
publisher = {INRIA Research Report 7296},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}
Clausen, Thomas; Herberg, Ulrich
Multipoint-to-Point and Broadcast in RPL Technical Report
2010.
@techreport{Clausen2010bb,
title = {Multipoint-to-Point and Broadcast in RPL},
author = {Thomas Clausen and Ulrich Herberg},
year = {2010},
date = {2010-04-01},
publisher = {INRIA Research Report 7244},
keywords = {},
pubstate = {published},
tppubtype = {techreport}
}