2014
Yi, Jiazi; Clausen, Thomas; Herberg, Ulrich
Depth First Forwarding for Low Power and Lossy Networks: Application and Extension Inproceedings
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, Sensor Networks, 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://jiaziyi.com/wp-content/uploads/2016/08/Depth-First-Forwarding-for-Low-Power-and-Lossy-Networks-Application-and-Extension.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6803211},
doi = {10.1109/WF-IoT.2014.6803211},
year = {2014},
date = {2014-03-01},
publisher = {Proceedings of IEEE World Forum on Internet of Things WF-IoT 2014},
abstract = {Data delivery across a multi-hop low-power and lossy networks (LLNs) is a challenging task: devices participating in such a network have strictly limited computational power and storage, and the communication channels are of low capacity, time-varying and with high loss rates. Consequently, routing protocols finding paths through such a network must be frugal in their control traffic and state requirements, as well as in algorithmic complexity – and even once paths have been found, these may be usable only intermittently, or for a very short time due to changes on the channel. Routing protocols exist for such networks, balancing reactivity to topology and channel variation with frugality in resource requirements. Complementary compo- nent to routing protocols for such LLNs exist, intended not to manage global topology, but to react rapidly to local data delivery failures and (attempt to) successfully deliver data while giving a routing protocol time to recover globally from such a failure. Specifically, this paper studies the “Depth-First Forwarding (DFF) in Unreliable Networks” protocol, standardised within the IETF in June 2013. Moreover, this paper proposes optimisations to that protocol, denoted DFF++, for improved performance and reactivity whilst remaining fully interoperable with DFF as standardised, and incurring neither additional data sets nor protocol signals to be generated.},
keywords = {Constrained Networks, Cross-Layer Design, dff, lln, loadng, Sensor Networks, sogrid},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
2013
Clausen, Thomas; Yi, Jiazi; Bas, Antonin; Herberg, Ulrich
A Depth First Forwarding (DFF) Extension for the LOADng Routing Protocol Inproceedings
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, 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://jiaziyi.com/wp-content/uploads/2016/08/A-Depth-First-Forwarding-DFF-Extension-for-the-LOADng-Routing-Protocol.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6726934},
doi = {10.1109/CANDAR.2013.72},
year = {2013},
date = {2013-12-01},
publisher = {ASON 2013 Sixth International Workshop on Autonomous Self-Organizing Networks},
abstract = {This paper explores the cooperation between the new standards for “Low Power and Lossy Networks” (LLNs): IETF RFC 6971, denoted “Depth-First Forwarding in Unreliable Networks” (DFF) and the ITU-T standardised routing protocol “LOADng” (Lightweight On-demand ad hoc Distance-vector Routing - next generation). DFF is a data-forwarding mechanism for increasing reliability of data delivery in networks with dynamic topology and lossy links, using a mechanism similar to a “depth-first search” for the destination of a packet. LOADng is a reactive on-demand routing protocol used in LLNs. The purpose of this study is to evaluate the benefit of using DFF conjointly with a routing protocol. To this end, the paper compares the performance of LOADng and LOADng+DFF using Ns2 simulations, showing a 20% end-to-end data delivery ratio increase at expense of expected longer path lengths.},
keywords = {Constrained Networks, Cross-Layer Design, dff, lln, loadng, Sensor Networks, sogrid},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
Yi, Jiazi; Clausen, Thomas; Igarashi, Yuichi
Evaluation of Routing Protocol for Low Power and Lossy Networks: LOADng and RPL Inproceedings
In: 2013 IEEE Conference on Wireless Sensors, 2013.
Abstract | Links | BibTeX | Tags: Constrained Networks, lln, loadng, Performance Evaluation, rpl, Sensor Networks, 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://jiaziyi.com/wp-content/uploads/2016/08/Evaluation-of-Routing-Protocol-for-Low-Power-and-Lossy-Networks-LOADng-and-RPL.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6728773},
doi = {10.1109/ICWISE.2013.6728773},
year = {2013},
date = {2013-12-01},
publisher = {2013 IEEE Conference on Wireless Sensors},
abstract = {Routing protocol is a critical component of Low- power and Lossy Networks for Smart Grid. The protocols are used for data forwarding, which includes data acquisition, information dissemination, etc. This paper evaluates two main routing protocols used for Low-power and Lossy Networks: RPL and LOADng, to understand their strengths and limitations. Observations are provided based on analysis of specification and experimental experience, regarding the protocol’s routing overhead, traffic pattern, resource requirement, fragmentation, etc. Simulations are further launched to study the performance in different traffic patterns, which include sensor-to-sensor traffic, sensor-to-root traffic and root-to-sensor bidirectional traffic. By evaluating those protocols, the readers could have better under- standing of the protocol applicability, and choose the appropriate protocol for desired applications.},
keywords = {Constrained Networks, lln, loadng, Performance Evaluation, rpl, Sensor Networks, sogrid},
pubstate = {published},
tppubtype = {inproceedings}
}
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; de Verdiere, Axel Colin; Yi, Jiazi
Performance analysis of Trickle as a flooding mechanism Inproceedings
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://jiaziyi.com/wp-content/uploads/2016/08/Performance-analysis-of-Trickle-as-a-flooding-mechanism.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6820439},
doi = {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}
}
“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.
2012
Yi, Jiazi; Clausen, Thomas; Bas, Antonin
Smart Route Request for On-demand Route Discovery in Constrained Environments Inproceedings
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://jiaziyi.com/wp-content/uploads/2016/08/Smart-Route-Request-for-on-demand-route-discovery-in-constrained-environments.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6417755},
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}
}
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 Inproceedings
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://jiaziyi.com/wp-content/uploads/2016/08/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}
}
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.
Yi, Jiazi; Clausen, Thomas; de Verdiere, Axel Colin
Efficient Data Acquisition in Sensor Networks:Introducing (the) LOADng Collection Tree Protocol Inproceedings
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://jiaziyi.com/wp-content/uploads/2016/08/Efficient-Data-Acquisition-in-Sensor-Networks-Introducing-the-LOADng-Collection-Tree-Protocol.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6478508},
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}
}
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”).
Clausen, Thomas; Yi, Jiazi; de Verdiere, Axel Colin
LOADng: Towards AODV Version 2 Inproceedings
In: 2012 IEEE 76th Vehicular Technology Conference, 2012.
Abstract | Links | BibTeX | Tags: Constrained Networks, lln, loadng, Sensor Networks
@inproceedings{Clausen2012b,
title = {LOADng: Towards AODV Version 2},
author = {Thomas Clausen and Jiazi Yi and Axel Colin de Verdiere},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/LOADng-Towards-AODV-Version-2.pdf
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6399334},
doi = {10.1109/VTCFall.2012.6399334},
year = {2012},
date = {2012-09-01},
publisher = {2012 IEEE 76th Vehicular Technology Conference},
abstract = {The Ad hoc On-demand Distance-Vector routing protocol (AODV) was published in 2003 by the IETF, as ex- perimental RFC 3561. This routing protocol was one of four routing protocols, developed by the IETF for use in mobile ad hoc networks (MANETs) – with the other being DSR, TBRPF and OLSR. As operational experiences with these protocols accumulated, the IETF set forth on standardization of OLSRv2, a successor to OLSR, and DYMO – with DYMO being the intended successor to DSR and AODV. Alas, while there was traction for and standardization of OLSRv2, interest in, development, standardization, and use of DYMO in MANETs slowly withered. AODV did, however, attract interest for routing in Low-power Lossy Networks (LLNs) due to its limited state requirements. Since 2005, several proposals for simplifying and adapting AODV specifically for LLNs emerged, in 2011 and 2012 with the use of one such adaptation of AODV in the G3-PLC standard for power line communications in smart grids, and with efforts within the IETF emerging towards a single LOADng specification, as next version of AODV. This paper presents this development – from AODV, as specified in RFC3561 – to LOADng. While the basic operation remains unchanged, LOADng presents simplifications, and additional features and flexibilities are introduced. This paper studies the impact of these changes “from AODV to LOADng”, and observes that LOADng unites simplification, flexibility and performance improvements.},
keywords = {Constrained Networks, lln, loadng, Sensor Networks},
pubstate = {published},
tppubtype = {inproceedings}
}
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.