Deploying sensor networks with guaranteed capacity and fault tolerance

Bredin, Jonathan; Demaine, Erik D.; Hajiaghayi, MohammadTaghi; Rus, Daniela

doi:10.1145/1062689.1062729

Cited by 166 publications

(170 citation statements)

References 33 publications

Supporting

Mentioning

169

Contrasting

Order By: Relevance

“…A graph is connected if every pair of nodes is connected. The problem of deploying relay nodes for increased reliability has long been acknowledged as a significant problem [3], [12], [9], [11]. Greedy Randomised Adaptive Search Procedure for Additional Relay Placement (GRASP-ARP) [14], a recently published local search approach, has been shown to deploy fewer relay nodes with faster runtime compared to the closest known approach [3], [12].…”

Section: Background and Related Workmentioning

confidence: 99%

“…The problem of deploying relay nodes for increased reliability has long been acknowledged as a significant problem [3], [12], [9], [11]. Greedy Randomised Adaptive Search Procedure for Additional Relay Placement (GRASP-ARP) [14], a recently published local search approach, has been shown to deploy fewer relay nodes with faster runtime compared to the closest known approach [3], [12]. It uses the GRASP stochastic local search method [5], [6], [13] to deploy additional relay nodes for ensuring (k,l)-sinkconnectivity, where all sensor nodes have k node-disjoint paths of length ≤ l to the sinks.…”

Section: Background and Related Workmentioning

confidence: 99%

“…The second search then finds path B = (1,2,5,6,8,10), and the algorithm terminates with the two path lengths of 3 and 5, and thus fails to satisfy the length bound. However, there are two nodedisjoint paths of length 4: (1,3,6,8,10) and (1,4,7,9,10). To obtain this solution, the second search would have had to return path C = (1,4,7,9,3,6,8,10), which would produce the correct output when A and C are merged and overlapping segments removed.…”

Section: The Bounded Vertex Undirected Disjoint Paths Problemmentioning

confidence: 99%

See 2 more Smart Citations

A constraint programming approach to the additional relay placement problem in wireless sensor networks

et al. 2015

View full text Add to dashboard Cite

Abstract-A Wireless Sensor Network (WSN) is composed of many sensor nodes which transmit their data wirelessly over a multi-hop network to data sinks. Since WSNs are subject to node failures, the network topology should be robust, so that when a failure does occur, data delivery can continue from all surviving nodes. A WSN is k-robust if an alternate lengthconstrained route to a sink is available for each surviving node after the failure of up to k-1 nodes. Determining whether a network is k-robust is an NP-complete problem. We develop a Constraint Programming (CP) approach for solving this problem which outperforms a Mixed-Integer Programming (MIP) model on larger problems. A network can be made robust by deploying extra relay nodes, and we extend our CP approach to an optimisation problem by using QuickXplain to search for a minimal set of relays, and compare it to a state-of-the-art local search approach.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

Section: Background and Related Workmentioning

confidence: 99%

Section: The Bounded Vertex Undirected Disjoint Paths Problemmentioning

confidence: 99%

See 1 more Smart Citation

A constraint programming approach to the additional relay placement problem in wireless sensor networks

et al. 2015

View full text Add to dashboard Cite

show abstract

“…An approximation algorithm was then proposed based on steinerization, which assigns all relay nodes with roughly the same distance on each edge. This problem was generalized to k-connectivity in [2], which is also named as the survivability problem for k ≥ 2. Later [16] further extended the problem by considering the constraint that relay nodes can only be placed at some given locations.…”

Section: Background and Related Workmentioning

confidence: 99%

Traffic-Aware Relay Node Deployment for Data Collection in Wireless Sensor Networks

Feng

Wang

Liu

2009

2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

View full text Add to dashboard Cite

Abstract-Wireless sensor networks have been widely used for ambient data collection in diverse environments. While in many such networks the sensor nodes are randomly deployed in massive quantity, there is a broad range of applications advocating manual deployment. A typical example is structure health monitoring, where the sensors have to be placed at critical locations to fulfill civil engineering requirements. The raw data collected by the sensors can then be forwarded to a remote base station (the sink) through a series of relay nodes.In the wireless communication context, the operation time of a battery-limited relay node depends on its traffic volume and communication range. Hence, although not bounded by the civilengineering-like requirements, the locations of the relay nodes have to be carefully planned to achieve the maximum network lifetime. The deployment has to not only ensure connectivity between the data sources and the sink, but also accommodate the heterogeneous traffic flows from different sources and the dominating many-to-one traffic pattern.Inspired by the uniqueness of such application scenarios, in this paper, we present an in-depth study on the trafficaware relay node deployment problem. We develop optimal solutions for the simple case of one source node, both with single and multiple traffic flows. We show however that the general form of the deployment problem is difficult, and the existing connectivity-guaranteed solutions cannot be directly applied here. We then transform our problem into a generalized version of the Euclidean Steiner Minimum Tree problem (ESMT). Nevertheless, we face further challenges as its solution is in continuous space and may yield fractional numbers of relay nodes, where simple rounding of the solution can lead to poor performance. We thus develop algorithms for discrete relay node assignment, together with local adjustments that yield high-quality practical solutions. Our solution has been evaluated through both numerical analysis and ns-2 simulations and compared with state-of-the-art approaches. The results show that it achieves up to 6 to 14 times improvement on the network lifetime over the existing trafficoblivious strategies.

show abstract

“…To prolong network lifetime while meeting certain network specifications, one proposed direction is to deploy a small number of relay nodes (RNs) in the WSN such that they can communicate with the SNs and other RNs [2], [3], [4], [5], [6], [7], [8], [9], [10]. Relay node placement problems can be classified into either single-tiered or two-tiered based on the routing structures [5], [6], [9], [14] and into either connected or survivable based on the connectivity requirements [13], [5], [7], [15]. In single-tiered relay node placement, a SN also forwards packets received from other nodes.…”

Section: Introductionmentioning

confidence: 99%