Name
Title | ||
|---|---|---|
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks |
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 underwater sensor nodes (USNs) which are floated at different depths to perform collaborative monitoring tasks over a given region, and a set of candidate locations where SGs may be placed, our objective is to place minimum number of SGs at a subset of candidate locations such that it is connected (or k-connected) from any USN to the base station. We first propose a general algorithm for the connected C-SGP problem and prove its approximation ratio. We also give a constant ratio approximation algorithm for the problem. Second, for the survivable C-SGP problem we also propose a general algorithm and prove its approximation ratio. Finally, we give a constant ratio approximation algorithm for the 2-connected C-SGP problem. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.tcs.2011.10.009 | Conference on Combinatorial Optimization and Applications |
Keywords | Field | DocType |
underwater sensor node,connected C-SGP problem,constant ratio approximation algorithm,approximation ratio,survivable C-SGP problem,2-connected C-SGP problem,general algorithm,surface-level gateway placement,3-D underwater acoustic sensor,underwater acoustic sensor network,candidate location | Approximation algorithm,Base station,Key distribution in wireless sensor networks,Survivability,Computer science,Computer network,Default gateway,Acoustic sensor,Wireless sensor network,Underwater | Journal |
Volume | Issue | ISSN |
447, | null | 16113349 |
ISBN | Citations | PageRank |
3-642-17460-4 | 4 | 0.48 |
References | Authors | |
9 | 5 | |