Loading web-font TeX/Math/Italic
Minimum Data-Latency-Bound --Sink Placement Problem in Wireless Sensor Networks | IEEE Journals & Magazine | IEEE Xplore

Minimum Data-Latency-Bound k-Sink Placement Problem in Wireless Sensor Networks


Abstract:

In this paper, we propose a new multiple-sink positioning problem in wireless sensor networks to best support real-time applications. We formally define this problem as t...Show More

Abstract:

In this paper, we propose a new multiple-sink positioning problem in wireless sensor networks to best support real-time applications. We formally define this problem as the k -Sink Placement Problem (k -SPP) and prove that it is APX-complete. We show that an existing approximation algorithm for the well-known k-center problem is a constant factor approximation of k -SPP. Furthermore, we introduce a new greedy algorithm for k-SPP and prove its approximation ratio is very near to the best achievable, 2. Via simulations, we show our algorithm outperforms its competitor on average.
Published in: IEEE/ACM Transactions on Networking ( Volume: 19, Issue: 5, October 2011)
Page(s): 1344 - 1353
Date of Publication: 24 February 2011

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.