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

Authors:
Donghyun Kim;Wei Wang;Nassim Sohaee;Changcun Ma;Weili Wu;Wonjun Lee;Ding-Zhu Du
Affiliations:
Department of Mathematics and Computer Science, North Carolina Central University, Durham, NC;Department of Mathematics, Xi'an Jiaotong University, Xi'an, China;Department of Clinical Sciences, University of Texas Southwestern Medical Center, Dallas, TX;Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science and Engineering, Korea University, Seoul, Korea;Department of Computer Science, University of Texas at Dallas, Richardson, TX
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2011

Citing 10
Cited 2

A unified approach to approximation algorithms for bottleneck problems

Journal of the ACM (JACM)
Unit disk graphs

Discrete Mathematics - Topics on domination
Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimizing the Placement of Internet TAPs in Wireless Neighborhood Networks

ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Minimum connected dominating sets and maximal independent sets in unit disk graphs

Theoretical Computer Science
Relay node placement in large scale wireless sensor networks

Computer Communications
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
Universality considerations in VLSI circuits

IEEE Transactions on Computers
Optimal multi-sink positioning and energy-efficient routing in wireless sensor networks

ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking

A constant-factor approximation for d-hop connected dominating sets in unit disk graph

International Journal of Sensor Networks
On bounding node-to-sink latency in wireless sensor networks with multiple sinks

International Journal of Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

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 -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 showour algorithm outperforms its competitor on average.