Conference Paper

Cluster-Based Forwarding for Reliable End-to-End Delivery in Wireless Sensor Networks

Univ. of Illinois at Urbana-Champaign, Urbana-Champaign
DOI: 10.1109/INFCOM.2007.224 Conference: INFOCOM 2007. 26th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 6-12 May 2007, Anchorage, Alaska, USA
Source: DBLP

ABSTRACT

Providing efficient and reliable communication in wireless sensor networks is a challenging problem. To recover from corrupted packets, previous approaches have tried to use retransmissions and FEC mechanisms. The energy efficiency of these mechanisms, however, is very sensitive to unreliable links. In this paper, we present cluster-based forwarding, where each node forms a cluster such that any node in the next-hop's cluster can take forwarding responsibility. This architecture, designed specifically for wireless sensor networks, achieves better energy-efficiency by reducing retransmissions. Cluster-based forwarding is not a routing protocol. Rather, it is designed as an extension layer that can augment existing routing protocols. Using simulations, we demonstrate that cluster-based forwarding is effective in improving both end-to-end energy efficiency and latency of current routing protocols.

Download full-text

Full-text

Available from: Robin Kravets
  • Source
    • "Furthermore , the forwarding schedules in all related schemes are not proper, where the interferences may still exist among two hops' transmissions, even though priority timer-based forwarding is utilized in [27] [31]. Similar to existing braided multipath routings, the size of forwarding list has not been explored in detail, and only depends on the density of network deployment in almost schemes [24] [25] [26] [27] [28] [29] [30], which does not adapt to the varying and heterogeneous wireless links. R3E [31] relies on the common neighbor nodes between two adjacent hops on the guide path, and hence cannot tolerate the case that the number of common neighbor nodes gets small or asymmetric links appear, under which the network performance will get worse sharply. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Multipath routing, especially braided multipath routing (BMR), has become a powerful tool to provide reliable and energy-efficient packet transmissions against wireless links losses and node failures. In previous literatures, most of the construction methods of braided multipath routes are centralized and inefficient. By exploiting the broadcast nature of wireless mediums, opportunistic routings proposed recently bring much more reliability and efficiency for wireless communications. In this paper, with the idea of opportunistic routings, we propose a distributed width-controllable braided multipath routing (WC-BMR) based on local neighbor's information for data collections in wireless sensor networks. By only attaching a little information to data packets, the transmission direction can be restricted near the main route. Heterogeneous widths, namely, different widths on different hops from the source to the sink can also be supported to adapt to the dynamic and heterogeneous wireless links. Then, to avoid packet collisions, a novel time schedule strategy is given. In terms of the reliability, delay and transmission overhead, the performance of WC-BMR is analyzed theoretically. In addition, a kind of less cooperative topology (LC-Topology) in the WC-BMR is found, which brings no or less reliability gain. And modified cooperative WC-BMR (MCWC-BMR) with the detection algorithm for LC-Topology is proposed to maintain the high reliability and efficiency, which allows parents nodes to choose the best main route locally and dynamically. Using TOSSIM platform, WC-BMR and MCWC-BMR are both evaluated with some previous baseline approaches. Simulation results reveal that both WC-BMR and MCWC-BMR, especially the latter, can achieve higher reliability and efficiency, as well as keep lower delay under various network settings.
    Full-text · Article · Aug 2015
  • Source
    • "They proposed a concept called collective ACKs which solves the ACK storm problem [30] by inferring the success of a transmission to a receiver based on the ACKs from other neighboring receivers. More generally , link correlation has a broad impact on network protocols that utilize concurrent wireless links, which include but are not limited to (i) traditional network protocols such as broadcast [27] [32], multi-cast [12] [16], and multi-path routing [13], or (ii) diversitybased protocols such as opportunistic forwarding [5] [7] [10], collaborative forwarding [6], and network coding [2] [21] [25]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless communication essentially occurs in a broadcast medium with concurrent receptions. Recent works [34, 41] have shown clear evidence that wireless links are not independent and that transmissions from a transmitter to multiple receivers are correlated, a phenomenon that has profound implications for the performance of network protocols such as broadcast, multi-cast, opportunistic forwarding and network coding. In this paper, we show how link correlation can significantly impact broadcast. We present the design and implementation of CorLayer, a general supporting layer for energy efficient reliable broadcast that carefully blacklists certain poorly correlated wireless links. This method uses only one-hop information, which makes it work in a fully distributed manner and introduces minimal communication overhead. The highlight of our work is CorLayer's broad applicability and effectiveness. Our system effort is indeed significant. We integrate CorLayer transparently with sixteen state-of-the-art broadcast protocols specified in thirteen publications [1, 3, 18, 19, 23, 25--27, 32, 36, 38--40] on three physical testbeds running TelosB, MICAz, and GreenOrbs nodes, respectively. The experimental results show that CorLayer remarkably improves energy efficiency across a wide spectrum of broadcast protocols and that the total number of packet transmissions can be reduced consistently by 47% on average.
    Full-text · Article · Sep 2013 · IEEE/ACM Transactions on Networking
  • Source
    • "Intra-channel interference caused by external signals in the unlicensed shared spectrum can also lead to link correlations where the interferer's signal can corrupt neighboring links simultaneously. Link correlation has significant effects on diversity based algorithms in wireless networks such as opportunistic routing [4], network coding [5] and collaborative forwarding [6]. Without considering link correlation, modeling and simulating such algorithms often overestimates their performances [2]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: By exploiting reception diversity of wireless network links, researchers have shown that opportunistic routing can improve network performance significantly over traditional routing schemes. However, recently empirical studies indicate that we are too optimistic, i.e. diversity gain can be overestimated if we continue to assume that packet receptions of wireless links are independent events. For the first time, this paper formally analyzes the opportunistic routing gain under the presence of link correlation considering the loss of DATA and ACK packets. Based on the model, we introduce a new link-correlation-aware opportunistic routing scheme, which improves the performance by exploiting the diverse uncorrelated forwarding links. Our design is evaluated using simulation where we show (i) link correlation leads to less diversity gain, (ii) and with our link-correlation-aware design; improvement can be gained. We also provide a unique model to generate strings of randomly correlated receptions.
    Full-text · Article · Jan 2012 · Proceedings - IEEE INFOCOM
Show more