NarrowCast: A New Link-Layer Primitive for Gossip-Based Sensornet Protocols

Pazurkiewicz, Tomasz; Gregorczyk, Michal; Iwanicki, Konrad

doi:10.1007/978-3-319-04651-8_1

Cited by 7 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similarly, CSMA/CA for low-power networks has been analyzed without considering the upper layers, e.g., [4,7]. Finally, the potential problematic interaction between Trickle-based data dissemination and radio duty cycling has been sketched in [20], along with potential energy efficiency improvements by reducing the scope of single-hop broadcasts. However, to the best of the authors' knowledge, a detailed analysis on the interaction between Trickle and the MAC layer, consisting of both CSMA/CA and radio duty cycling, their combined performance and potential problems in specific topologies, has not yet been conducted, which is what this paper aims to do.…”

Section: Related Workmentioning

confidence: 99%

Improving the Performance of Trickle-Based Data Dissemination in Low-Power Networks

Stolikj

Meyfroyt

Cuijpers

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Trickle is a polite gossip algorithm for managing communication traffic. It is of particular interest in low-power wireless networks for reducing the amount of control traffic, as in routing protocols (RPL), or reducing network congestion, as in multicast protocols (MPL). Trickle is used at the network or application level, and relies on up-to-date information on the activity of neighbors. This makes it vulnerable to interference from the media access control layer, which we explore in this paper. We present several scenarios how the MAC layer in low-power radios violates Trickle timing. As a case study, we analyze the impact of CSMA/CA with ContikiMAC on Trickle's performance. Additionally, we propose a solution called Cleansing that resolves these issues.

show abstract

Section: Related Workmentioning

confidence: 99%

Improving the Performance of Trickle-Based Data Dissemination in Low-Power Networks

Stolikj

Meyfroyt

Cuijpers

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This timer ticks independently of the main Trickle timer, and a beacon is broadcast whenever any of the two timers fires unless it has already been broadcast since the timer fired for the last time (due to the other's timer firing). An advantage of having two timers over simply resetting the main timer upon a synopsis change is that propagating synopsis changes may require different settings for Trickle or lowerlevel services, such as narrowcasting [31], than propagating DODAG information. At the same time, suppressing redundant beacons limits the growth in control traffic that would occur with two completely independent timers.…”

Section: Counting Neighbors Of the Rootmentioning

confidence: 99%

RNFD: Routing-Layer Detection of DODAG (Root) Node Failures in Low-Power Wireless Networks

Iwanicki¹

2016

2016 15th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN)

Self Cite

View full text Add to dashboard Cite

While routing protocols for low-power wireless networks, such as CTP or RPL, handle link failures relatively well, node failures have received considerably less research attention. This paper thus studies crash-failures of destination nodes in distance-vector routing, that is, failures of so-called DODAG root nodes. First, it demonstrates empirically that handling root node crashes in existing state-of-the-art routing protocols leaves room for improvement or even fails completely in some cases. Second, based on an analysis of this behavior, the paper proposes RNFD, a new algorithm that explicitly tracks node failures at the routing layer. The algorithm is designed as a framework that complements rather than replaces regular route maintenance algorithms, which facilitates its integration with the existing protocols. Third, the paper evaluates a prototype implementation of RNFD through simulations and testbed experiments. In particular, it demonstrates that, with little information overhead, RNFD can speed up node failure detection by an order of magnitude and considerably reduce the traffic during the process.

show abstract