Low overhead loop-free routing in wireless sensor networks

Audéoud, Henry-Joseph; Król, Michał; Heusse, Martin; Duda, Andrzej

doi:10.1109/wimob.2015.7347996

Cited by 4 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The sections below describe the current LRP's collection tree and host routes creation and maintenance mechanisms which appear with more details in a previous paper [5].…”

Section: Background On Lrpmentioning

confidence: 99%

“…The situation is then solved by sending a RERR (Route ERRor) message that backtracks and removes the host route [5].…”

Section: Data Path Validationmentioning

confidence: 99%

“…On the contrary, Lightweight Routing Protocol (LRP) [4], [5] aims at generating as little traffic as possible while remaining simple. Both protocols consider the case of sensor networks in which the sensors need to send out data packets to the sink with limited topology changes at the time scale of the packet generation period; otherwise, a reactive approach would be more suitable [6], [7].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Experimental Comparison of Routing Protocols for Wireless Sensors Networks: Routing Overhead and Asymmetric Links

Audéoud

Heusse

2017

2017 29th International Teletraffic Congress (ITC 29)

Self Cite

View full text Add to dashboard Cite

Abstract-RPL (the IETF Routing Protocol for Low-Power and Lossy Networks) and LRP (Lightweight Routing Protocol) have in common to build a collection tree (or, more precisely, a DODAG) and "downward" host routes in the wireless sensor network. Additionally, the objective of LRP is to keep control overhead as low as possible. To substantiate this claim, we compare RPL and LRP using 40 nodes of the IoT-LAB testbed -and the results are telling.We then introduce asymmetric links, which are unavoidable in most deployments, and measure their impact on the considered protocols in another set of experiments. We present the mechanisms that were introduced in LRP to deal with such cases and we report on extensive experiments involving RPL and LRP to analyze the behavior of both protocols when the links change or they exhibit asymmetry.

show abstract

“…The sections below describe the current LRP's collection tree and host routes creation and maintenance mechanisms which appear with more details in a previous paper [5].…”

Section: Background On Lrpmentioning

confidence: 99%

“…The situation is then solved by sending a RERR (Route ERRor) message that backtracks and removes the host route [5].…”

Section: Data Path Validationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Experimental Comparison of Routing Protocols for Wireless Sensors Networks: Routing Overhead and Asymmetric Links

Audéoud

Heusse

2017

2017 29th International Teletraffic Congress (ITC 29)

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the designs of practical EH-WSN routing protocols, the control of routing loops is a crux of establishing and maintaining throughput-high and cost-aware forwarding paths. Loops are most likely to occur during the routing path re-establishment of various networks, whether the routing protocols in use are designed based on the link state, the distance vector, or the application-specific gradient information [ 12 , 13 , 14 , 15 , 16 , 17 ]. A loop will come into network if a node chooses one of its upstreaming nodes as forwarder.…”

Section: Introductionmentioning

confidence: 99%

La-CTP: Loop-Aware Routing for Energy-Harvesting Wireless Sensor Networks

Sun

Shang

Zuo

2018

Sensors

View full text Add to dashboard Cite

In emerging energy-harvesting wireless sensor networks (EH-WSN), the sensor nodes can harvest environmental energy to drive their operation, releasing the user's burden in terms of frequent battery replacement, and even enabling perpetual sensing systems. In EH-WSN applications, usually, the node in energy-harvesting or recharging state has to stop working until it completes the energy replenishment. However, such temporary departures of recharging nodes severely impact the packet routing, and one immediate result is the routing loop problem. Controlling loops in connectivity-intermittent EH-WSN in an efficient way is a big challenge in practice, and so far, users still lack of effective and practicable routing protocols with loop handling. Based on the Collection Tree Protocol (CTP) widely used in traditional wireless sensor networks, this paper proposes a loop-aware routing protocol for real-world EH-WSNs, called La-CTP, which involves a new parent updating metric and a proactive, adaptive beaconing scheme to effectively suppress the occurrence of loops and unlock unavoidable loops, respectively. We constructed a 100-node testbed to evaluate La-CTP, and the experimental results showed its efficacy and efficiency.

show abstract