scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

RelBAS: Reliable data gathering from border area sensors

TL;DR: RelBAS, a robust data gathering scheme specially designed for the border area network to provide a guaranteed delivery of sensory data is proposed, which aims to find out multiple node-disjoint paths to multiple sinks so that the disconnectivity in one path due to a node failure does not disrupt the delivery of data to the sink.
Abstract: Sensor networks deployed for the border area monitoring requires a high degree of reliability for the data gathering in spite of any arbitrary node or sink failures. This paper proposes RelBAS, a robust data gathering scheme specially designed for the border area network to provide a guaranteed delivery of sensory data. The proposed protocol aims to find out multiple node-disjoint paths to multiple sinks so that the disconnectivity in one path due to a node failure does not disrupt the delivery of data to the sink. The forwarding path selection at every node in RelBAS is based on the combination of three parameters - the hop-count, the residual energy and the number of children for for parent of the corresponding tree. This helps in adapting the protocol to the application requirement depending on the delay, energy efficiency and data aggregation. Moreover, RelBAS is capable of detecting an affected zone due to multiple node failures. The effectiveness of the proposed scheme has been analyzed using the simulation results.
Citations
More filters
Journal ArticleDOI
TL;DR: A robust data gathering scheme specially designed to provide guaranteed delivery of the sensory data for applications on the critical infrastructure monitoring is proposed and compared with other protocols proposed in the literature for reliable data delivery.

13 citations


Cites methods from "RelBAS: Reliable data gathering fro..."

  • ...This paper proposes a framework and working principles of the reliable data gathering protocol, RelBAS (“Reliable Data Gathering from Border Area Sensors” as introduced in Chakraborty et al., 2013) for the critical infrastructure monitoring....

    [...]

Proceedings ArticleDOI
01 Nov 2014
TL;DR: The Enhanced Reed-Solomon (E-RS) code, together with the intra-se segment coding and the inter-segment coding, are designed and the E-RS scheme achieves the minimum energy consumption while keeping data gathering ratio over a preset threshold.
Abstract: In Wireless Sensor Network (WSN), nodes are usually powered by battery and the wireless links of the nodes suffer from packet loss It is extremely significant to develop an energy-efficient reliable data gathering scheme for WSN applications In this paper, the Enhanced Reed-Solomon (E-RS) code, together with the intra-segment coding and the inter-segment coding, are designed The E-RS code based data gathering scheme called the E-RS scheme is presented that adopts the intra-segment coding or the inter-segment coding The Overall Energy Consumption (OEC) of the E-RS scheme is derived and minimized in the Optimization Problem (OP) with the constraint of data gathering ratio The OP is able to find the optimal number of segments each carrying original information symbols, the maximum number of retransmissions in IEEE 802154 Medium Access Control (MAC) layer, and the redundant degree of the E-RS code, so that the E-RS scheme achieves the minimum energy consumption while keeping data gathering ratio over a preset threshold

4 citations


Cites background from "RelBAS: Reliable data gathering fro..."

  • ...The traditional mechanisms helping in improving reliability are Transport Control Protocol (TCP) in the transport layer, retransmission/acknowledgement (ACK) in the MAC layer [2], and multi-path transmission [3]....

    [...]

References
More filters
Journal ArticleDOI
19 Oct 2003
TL;DR: The design and implementation of SplitStream are presented and experimental results show that SplitStream distributes the forwarding load among all peers and can accommodate peers with different bandwidth capacities while imposing low overhead for forest construction and maintenance.
Abstract: In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highly-available, dedicated infrastructure routers but it poses a problem for application-level multicast in peer-to-peer systems. SplitStream addresses this problem by striping the content across a forest of interior-node-disjoint multicast trees that distributes the forwarding load among all participating peers. For example, it is possible to construct efficient SplitStream forests in which each peer contributes only as much forwarding bandwidth as it receives. Furthermore, with appropriate content encodings, SplitStream is highly robust to failures because a node failure causes the loss of a single stripe on average. We present the design and implementation of SplitStream and show experimental results obtained on an Internet testbed and via large-scale network simulation. The results show that SplitStream distributes the forwarding load among all peers and can accommodate peers with different bandwidth capacities while imposing low overhead for forest construction and maintenance.

1,535 citations


"RelBAS: Reliable data gathering fro..." refers background in this paper

  • ...Further, it is hard to find the node disjoint paths from all the sources to all the sinks if the multicast tree based approaches are used [6]....

    [...]

Proceedings ArticleDOI
05 Nov 2003
TL;DR: The design and analysis of novel protocols that can dynamically configure a network to achieve guaranteed degrees of Coverage Configuration Protocol (CCP) and integrate SPAN to provide both coverage and connectivity guarantees are presented.
Abstract: An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and network connectivity. Furthermore, the network must be able to configure itself to any feasible degrees of coverage and connectivity in order to support different applications and environments with diverse requirements. This paper presents the design and analysis of novel protocols that can dynamically configure a network to achieve guaranteed degrees of coverage and connectivity. This work differs from existing connectivity or coverage maintenance protocols in several key ways: 1) We present a Coverage Configuration Protocol (CCP) that can provide different degrees of coverage requested by applications. This flexibility allows the network to self-configure for a wide range of applications and (possibly dynamic) environments. 2) We provide a geometric analysis of the relationship between coverage and connectivity. This analysis yields key insights for treating coverage and connectivity in a unified framework: this is in sharp contrast to several existing approaches that address the two problems in isolation. 3) Finally, we integrate CCP with SPAN to provide both coverage and connectivity guarantees. We demonstrate the capability of our protocols to provide guaranteed coverage and connectivity configurations, through both geometric analysis and extensive simulations.

1,362 citations


"RelBAS: Reliable data gathering fro..." refers background in this paper

  • ...Let Rc be the radius of the communication area for every sensor such that Rc is twice the sensing range to assure both the connectivity and the coverage [8]....

    [...]

Journal ArticleDOI
09 Jan 2012-Sensors
TL;DR: In this paper, the authors present a comprehensive taxonomy of multipath routing protocols for wireless sensor networks and highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages.
Abstract: A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks.

320 citations

Journal ArticleDOI
TL;DR: This paper devise an analytical model to compute, in a centralized manner, the optimal solution to the problem of simultaneously routing from multiple sources to multiple sinks, and presents MUSTER, a routing protocol expressly designed for many-to-many communication.
Abstract: Wireless sensor networks (WSNs) are increasingly proposed for applications characterized by many-to-many communication, where multiple sources report their data to multiple sinks. Unfortunately, mainstream WSN collection protocols are generally designed to account for a single sink and, dually, WSN multicast protocols optimize communication from a single source. In this paper, we present MUSTER, a routing protocol expressly designed for many-to-many communication. First, we devise an analytical model to compute, in a centralized manner, the optimal solution to the problem of simultaneously routing from multiple sources to multiple sinks. Next, we illustrate heuristics approximating the optimal solution in a distributed setting, and their implementation in MUSTER. To increase network lifetime, MUSTER minimizes the number of nodes involved in many-to-many routing and balances their forwarding load. We evaluate MUSTER in emulation and in a real WSN testbed. Results indicate that our protocol builds near-optimal routing paths, doubles the WSN lifetime, and overall delivers to the user 2.5 times the amount of raw data w.r.t. mainstream protocols. Moreover, MUSTER is intrinsically amenable to in-network aggregation, pushing the improvements up to a 180 percent increase in lifetime and a four-time increase in data yield.

119 citations


"RelBAS: Reliable data gathering fro..." refers background or methods in this paper

  • ...The RelBAS protocol is compared with the MUSTER pro­ tocol proposed in [7]....

    [...]

  • ...In [7], the authors have proposed a multi-sink routing...

    [...]

Journal ArticleDOI
TL;DR: This paper proposes a new beacon-less geographic multicast routing protocol called BRUMA, which achieves a higher packet delivery ratio and a lower overall bandwidth consumption than GMR, which is the protocol performing best among existing geographic multicasts solutions.
Abstract: We study the problem of geographic multicast routing (GMR) in a wireless sensor network. In particular, we are interested in geographic routing solutions with a very limited control overhead and overall bandwidth consumption. Existing GMR protocols require nodes to periodically exchange beacon messages to gather information about the position of their neighbors. These beacons represent a waste of resources, specially in areas of the network with no active communications. Beacons also induce significant problems in real deployments such as interferences and collisions that cause inconsistencies in neighboring tables. In this paper we propose a new beacon-less geographic multicast routing protocol called BRUMA. Unlike previous solutions, BRUMA uses the propagation of data packets to opportunistically select next hops among those that are reachable from the sending node. In addition, we contribute a novel next hop selection function by which candidate next hops schedule their responses based on their progress along each of the branches of the multicast tree. This allows the protocol to overcome most of the issues of beacon-based solutions in real deployments such as collisions, low-quality links, etc. The results of our empirical tests in a real testbed as well as in simulations show that BRUMA achieves a higher packet delivery ratio and a lower overall bandwidth consumption than GMR, which is the protocol performing best among existing geographic multicast solutions.

18 citations


"RelBAS: Reliable data gathering fro..." refers background in this paper

  • ...The multicast tree based approaches [5] are widely used for the data forwarding from a single source to multiple sinks....

    [...]