Minimum data-latency-bound κ-sink placement problem in wireless sensor networks

Donghyun Kim; Wei Wang; Nassim Sohaee; Changcun Ma; Weili Wu; Wonjun Lee; Ding Zhu Du

doi:10.1109/TNET.2011.2109394

Minimum data-latency-bound κ-sink placement problem in wireless sensor networks

Donghyun Kim, Wei Wang, Nassim Sohaee, Changcun Ma, Weili Wu, Wonjun Lee, Ding Zhu Du

Graduate School of Information Study

Research output: Contribution to journal › Article › peer-review

33 Citations (Scopus)

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 κ-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.

Original language	English
Article number	5720275
Pages (from-to)	1344-1353
Number of pages	10
Journal	IEEE/ACM Transactions on Networking
Volume	19
Issue number	5
DOIs	https://doi.org/10.1109/TNET.2011.2109394
Publication status	Published - 2011 Oct

Keywords

Graph theory
greedy approximation algorithms
network center placement problem
wireless sensor networks (WSNs)

ASJC Scopus subject areas

Software
Computer Science Applications
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/TNET.2011.2109394

Fingerprint Dive into the research topics of 'Minimum data-latency-bound κ-sink placement problem in wireless sensor networks'. Together they form a unique fingerprint.

Cite this

@article{2eab0e2be4cd4c4da344d2b1851a0472,

title = "Minimum data-latency-bound κ-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 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.",

keywords = "Graph theory, greedy approximation algorithms, network center placement problem, wireless sensor networks (WSNs)",

author = "Donghyun Kim and Wei Wang and Nassim Sohaee and Changcun Ma and Weili Wu and Wonjun Lee and Du, {Ding Zhu}",

year = "2011",

month = oct,

doi = "10.1109/TNET.2011.2109394",

language = "English",

volume = "19",

pages = "1344--1353",

journal = "IEEE/ACM Transactions on Networking",

issn = "1063-6692",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

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

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 -