TY - JOUR
T1 - Minimum data-latency-bound κ-sink placement problem in wireless sensor networks
AU - Kim, Donghyun
AU - Wang, Wei
AU - Sohaee, Nassim
AU - Ma, Changcun
AU - Wu, Weili
AU - Lee, Wonjun
AU - Du, Ding Zhu
N1 - Funding Information:
Manuscript received October 30, 2009; revised August 28, 2010 and January 02, 2011; accepted January 15, 2011; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor K. Kar. Date of publication February 24, 2011; date of current version October 14, 2011. This work was supported in part by the National Natural Science Foundation of China under Grants 11071191, 61073174, and 61033001; the National Scientific Foundation under Grants CNS-0524429, CCF-0627233, and CCF-0514796; the National Basic Research Program of China under Grants 2007CB807900 and 2007CB807901; the Ministry of Education, Science and Technology (MEST), Korea, under WCU (R33-2008-000-10044-0); the National Research Foundation (NRF), Korea, under Grant KRF-2008-314-D00354; and the Ministry of Knowledge Economy (MKE), Korea, under ITRC NIPA-2010-(C1090-1021-0008).
Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2011/10
Y1 - 2011/10
N2 - 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 κ-Sink Placement Problem (κ-SPP) and prove that it is APX-complete. We show that an existing approximation algorithm for the well-known κ-center problem is a constant factor approximation of κ-SPP. Furthermore, we introduce a new greedy algorithm for κ-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.
AB - 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 κ-Sink Placement Problem (κ-SPP) and prove that it is APX-complete. We show that an existing approximation algorithm for the well-known κ-center problem is a constant factor approximation of κ-SPP. Furthermore, we introduce a new greedy algorithm for κ-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.
KW - Graph theory
KW - greedy approximation algorithms
KW - network center placement problem
KW - wireless sensor networks (WSNs)
UR - http://www.scopus.com/inward/record.url?scp=80054116082&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80054116082&partnerID=8YFLogxK
U2 - 10.1109/TNET.2011.2109394
DO - 10.1109/TNET.2011.2109394
M3 - Article
AN - SCOPUS:80054116082
VL - 19
SP - 1344
EP - 1353
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
SN - 1063-6692
IS - 5
M1 - 5720275
ER -