Relay node placement in structurally damaged wireless sensor networks via triangular steiner tree approximation

Authors:
Fatih Senel;Mohamed Younis
Affiliations:
Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, Baltimore, MD 21250, United States;Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, Baltimore, MD 21250, United States
Venue:
Computer Communications
Year:
2011

Citing 20
Cited 5

Improved approximation algorithms for uniform connectivity problems

Journal of Algorithms
Steiner tree problem with minimum number of Steiner points and bounded edge-length

Information Processing Letters
Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
Span: An energy-efficient coordination algorithm for topology maintenance in Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximations for Steiner Trees with Minimum Number of Steiner Points

Journal of Global Optimization
On Relay Node Placement and Locally Optimal Traffic Allocation in Heterogeneous Wireless Sensor Networks

LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
A Distributed Connectivity Restoration Algorithm in Wireless Sensor and Actor Networks

LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Strategies and techniques for node placement in wireless sensor networks: A survey

Ad Hoc Networks
Relay sensor placement in wireless sensor networks

Wireless Networks
Improved Approximation Algorithms for Relay Placement

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Relay Node Placement in Heterogeneous Wireless Sensor Networks with Basestations

CMC '09 Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01
Movement-Assisted Connectivity Restoration in Wireless Sensor and Actor Networks

IEEE Transactions on Parallel and Distributed Systems
Relay node placement in large scale wireless sensor networks

Computer Communications
Distributed Recovery from Network Partitioning in Movable Sensor/Actor Networks via Controlled Mobility

IEEE Transactions on Computers
On Performance of Node Placement Approaches for Hierarchical Heterogeneous Sensor Networks

Mobile Networks and Applications
Optimized relay placement to federate segments in wireless sensor networks

IEEE Journal on Selected Areas in Communications
Fault-tolerant relay node placement in wireless sensor networks

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On energy provisioning and relay node placement for wireless sensor networks

IEEE Transactions on Wireless Communications
Movement control algorithms for realization of fault-tolerant ad hoc robot networks

IEEE Network: The Magazine of Global Internetworking

Towards augmented connectivity with delay constraints in WSN federation

International Journal of Ad Hoc and Ubiquitous Computing
Connectivity restoration in delay-tolerant sensor networks using game theory

International Journal of Ad Hoc and Ubiquitous Computing
Establishing connectivity among disjoint terminals using a mix of stationary and mobile relays

Computer Communications
Relay placement for restoring connectivity in partitioned wireless sensor networks under limited information

Ad Hoc Networks
Survey Topology management techniques for tolerating node failures in wireless sensor networks: A survey

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.24

Visualization

Abstract

Wireless sensor networks (WSNs) have many applications which operate in hostile environments. Due to the harsh surroundings, WSNs may suffer from a large scale damage that causes many nodes to fail simultaneously and the network to get partitioned into multiple disjoint segments. In such a case, restoring the network connectivity is very important in order to avoid negative effects on the applications. In this paper, we pursue the placement of the least number of relay nodes to re-establish a strongly connected network topology. The problem of finding the minimum count and the position of relay nodes is NP-hard and hence we pursue heuristics. We present a novel three-step algorithm called FeSTA which is based on steinerizing appropriate triangles. Each segment is represented by a terminal. Each subset of 3 terminals forms a triangle. Finding the optimal solution for a triangle (i.e. connecting 3 segments) is a relatively easier problem. In the first step, FeSTA finds the best triangles and form islands of segments by establishing intra-triangle connectivity. Then in the second, disjoint islands of segment are federated. In the final step, the steinerized edges are optimized. The performance of FeSTA is validated through simulation.