Constrained surface-level gateway placement for underwater acoustic wireless sensor networks

Authors:
Deying Li;Zheng Li;Wenkai Ma;Hong Chen
Affiliations:
Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, China;Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, China;Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, China;Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, China
Venue:
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Year:
2010

Citing 6
Cited 0

A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Tighter Bounds for Graph Steiner Tree Approximation

SIAM Journal on Discrete Mathematics
Deployment analysis in underwater acoustic wireless sensor networks

WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
Relay Node Placement in Wireless Sensor Networks

IEEE Transactions on Computers
Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete

IEEE Transactions on Computers
Steiner Tree Problems In Computer Communication Networks

Steiner Tree Problems In Computer Communication Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

One approach to guarantee the performance of underwater acoustic sensor networks is to deploy multiple Surface-level Gateways (SGs) at the surface. This paper addresses the connected (or survivable) Constrained Surface-level Gateway Placement (C-SGP) problem for 3-D underwater acoustic sensor networks. Given a set of candidate locations where SGs can be placed, our objective is to place minimum number of SGs at a subset of candidate locations such that it is connected (or 2-connected) from any USN to the base station. We propose a polynomial time approximation algorithm for the connected C-SGP problem and survivable C-SGP problem, respectively. Simulations are conducted to verify our algorithms' efficiency.