2018
Clausen, Thomas; Cordero, Juan-Antonio; Yi, Jiazi; Igarashi, Yuichi
Use 'em or Lose 'em: On Unidirectional Links in Reactive Routing Protocols Journal Article
In: Ad Hoc Networks, vol. 73, pp. 51 - 64, 2018, ISSN: 1570-8705.
@article{CLAUSEN201851,
title = {Use 'em or Lose 'em: On Unidirectional Links in Reactive Routing Protocols},
author = {Thomas Clausen and Juan-Antonio Cordero and Jiazi Yi and Yuichi Igarashi},
url = {http://www.sciencedirect.com/science/article/pii/S1570870518300325},
doi = {https://doi.org/10.1016/j.adhoc.2018.02.004},
issn = {1570-8705},
year = {2018},
date = {2018-01-01},
journal = {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 unidirectional 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 = {},
pubstate = {published},
tppubtype = {article}
}
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 unidirectional 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, ISSN: 1389-1286.
@article{Clausen2017,
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.sciencedirect.com/science/article/pii/S1389128617302694
http://jiaziyi.com/wp-content/uploads/2017/07/1-s2.0-S1389128617302694-main-2.pdf},
doi = {http://dx.doi.org/10.1016/j.comnet.2017.06.025},
issn = {1389-1286},
year = {2017},
date = {2017-01-01},
journal = {Computer Networks},
volume = {126},
pages = {125-140},
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 = {},
pubstate = {published},
tppubtype = {article}
}
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.
2016
Augustin, Aloÿs; Yi, Jiazi; Clausen, Thomas; Townsley, William Mark
A Study of LoRa: Long Range and Low Power Networks for the Internet of Things Journal Article
In: Sensors, vol. 16, no. 9, pp. 1466, 2016, ISSN: 1424-8220.
@article{s16091466,
title = {A Study of LoRa: Long Range and Low Power Networks for the Internet of Things},
author = {Aloÿs Augustin and Jiazi Yi and Thomas Clausen and William Mark Townsley },
url = {http://jiaziyi.com/wp-content/uploads/2016/09/sensors-16-01466.pdf
http://www.mdpi.com/1424-8220/16/9/1466},
doi = {10.3390/s16091466},
issn = {1424-8220},
year = {2016},
date = {2016-09-09},
journal = {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.},
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.
2015
Yi, Jiazi; Clausen, Thomas; Herberg, Ulrich
Depth First Forwarding for Unreliable Networks: Extensions and Applications Journal Article
In: Internet of Things Journal, IEEE, vol. 2, no. 3, pp. 199–209, 2015.
@article{yi_dff_2015,
title = {Depth First Forwarding for Unreliable Networks: Extensions and Applications},
author = {Jiazi Yi and Thomas Clausen and Ulrich Herberg},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/Depth-First-Forwarding-for-Unreliable-Networks-Extensions-and-Applications.pdf
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7054435},
doi = {10.1109/JIOT.2015.2409892},
year = {2015},
date = {2015-01-01},
urldate = {2015-11-20},
journal = {Internet of Things Journal, IEEE},
volume = {2},
number = {3},
pages = {199--209},
abstract = {This 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 = {},
pubstate = {published},
tppubtype = {article}
}
This 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.
2014
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–14471, 2014.
@article{cordero_adaptive_2014,
title = {An adaptive jitter mechanism for reactive route discovery in sensor networks},
author = {Juan Antonio Cordero and Jiazi Yi and Thomas Clausen},
url = {http://jiaziyi.com/wp-content/uploads/2016/08/An-Adaptive-Jitter-Mechanism-for-Reactive-Route-Discovery-in-Sensor-Networks.pdf
http://www.mdpi.com/1424-8220/14/8/14440/htm},
year = {2014},
date = {2014-08-08},
urldate = {2015-11-20},
journal = {Sensors},
volume = {14},
number = {8},
pages = {14440--14471},
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.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
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.
Yi, Jiazi; Clausen, Thomas
Collection Tree Extension of Reactive Routing Protocol for Low-Power and Lossy Networks Journal Article
In: International Journal of Distributed Sensor Networks, vol. 2014, pp. e352421, 2014, ISSN: 1550-1329.
@article{yi_collection_2014,
title = {Collection Tree Extension of Reactive Routing Protocol for Low-Power and Lossy Networks},
author = {Jiazi Yi and Thomas Clausen},
url = {http://www.hindawi.com/journals/ijdsn/2014/352421/abs/
http://jiaziyi.com/wp-content/uploads/2016/08/Collection-Tree-Extension-of-Reactive-Routing-Protocol-for-Low-Power-and-Lossy-Networks.pdf},
doi = {10.1155/2014/352421},
issn = {1550-1329},
year = {2014},
date = {2014-03-25},
urldate = {2015-11-20},
journal = {International Journal of Distributed Sensor Networks},
volume = {2014},
pages = {e352421},
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., 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 = {},
pubstate = {published},
tppubtype = {article}
}
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., 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.
2011
Yi, Jiazi; Adnane, Asmaa; David, Sylvain; Benoit, Parrein
Multipath optimized link state routing for mobile ad hoc networks Journal Article
In: Ad Hoc Networks, vol. 9, no. 1, pp. 28–47, 2011, ISSN: 15708705.
@article{yi_multipath_2011,
title = {Multipath optimized link state routing for mobile ad hoc networks},
author = {Jiazi Yi and Asmaa Adnane and Sylvain David and Parrein Benoit},
url = {http://linkinghub.elsevier.com/retrieve/pii/S1570870510000533
http://jiaziyi.com/wp-content/uploads/2016/08/MP-OLSR_offprint.pdf},
doi = {10.1016/j.adhoc.2010.04.007},
issn = {15708705},
year = {2011},
date = {2011-01-01},
urldate = {2015-11-20},
journal = {Ad Hoc Networks},
volume = {9},
number = {1},
pages = {28--47},
abstract = {Multipath routing protocols for Mobile Ad hoc NETwork (MANET) address the problem of scalability, security (confidentiality and integrity), lifetime of networks, instability of wireless transmissions, and their adaptation to applications.
Our protocol, called MultiPath OLSR (MP-OLSR), is a multipath routing protocol based on OLSR [1]. The Multipath Dijkstra Algorithm is proposed to obtain multiple paths. The algorithm gains great flexibility and extensibility by employing different link metrics and cost functions. In addition, route recovery and loop detection are implemented in MP-OLSR in order to improve quality of service regarding OLSR. The backward compatibility with OLSR based on IP source routing is also studied. Simulation based on Qualnet simulator is performed in different scenarios. A testbed is also set up to validate the protocol in real world. The results reveal that MP-OLSR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Multipath routing protocols for Mobile Ad hoc NETwork (MANET) address the problem of scalability, security (confidentiality and integrity), lifetime of networks, instability of wireless transmissions, and their adaptation to applications.
Our protocol, called MultiPath OLSR (MP-OLSR), is a multipath routing protocol based on OLSR [1]. The Multipath Dijkstra Algorithm is proposed to obtain multiple paths. The algorithm gains great flexibility and extensibility by employing different link metrics and cost functions. In addition, route recovery and loop detection are implemented in MP-OLSR in order to improve quality of service regarding OLSR. The backward compatibility with OLSR based on IP source routing is also studied. Simulation based on Qualnet simulator is performed in different scenarios. A testbed is also set up to validate the protocol in real world. The results reveal that MP-OLSR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints.
Our protocol, called MultiPath OLSR (MP-OLSR), is a multipath routing protocol based on OLSR [1]. The Multipath Dijkstra Algorithm is proposed to obtain multiple paths. The algorithm gains great flexibility and extensibility by employing different link metrics and cost functions. In addition, route recovery and loop detection are implemented in MP-OLSR in order to improve quality of service regarding OLSR. The backward compatibility with OLSR based on IP source routing is also studied. Simulation based on Qualnet simulator is performed in different scenarios. A testbed is also set up to validate the protocol in real world. The results reveal that MP-OLSR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints.