Abstract
Bounding node-to-sink latency is an important issue of wireless sensor networks (WSNs) with a quality of service requirement. This paper proposes to deploy multiple sinks to control the worst case node-to-sink data latency in WSNs. The end-to-end latency in multihop wireless networks is known to be proportional to the hop length of the routing path that the message moves over. Therefore, we formulate the question of what is the minimum number of sinks and their locations to bound the latency as the minimum d-hop sink placement problem. We also consider its capacitated version. We show problems are NP-hard in unit disk graph (UDG) and unit ball graph, and propose constant factor approximations of the problems in both graph models. We further extend our algorithms so that they can work well in more realistic quasi UDG model. A simulation study is also conducted to see the average performance of our algorithms.
| Original language | English |
|---|---|
| Pages (from-to) | 13-29 |
| Number of pages | 17 |
| Journal | International Journal of Sensor Networks |
| Volume | 13 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2013 Apr 5 |
Fingerprint
Keywords
- Approximation algorithm
- Graph theory
- Mobile computing
- Multiple sink placement
- Quasi unit disk graph
- Relay node placement
- UBG
- UDG
- Unit ball graph
- Unit disk graph
- Wireless sensor networks
- WSNs
ASJC Scopus subject areas
- Computer Networks and Communications
- Computer Science Applications
- Control and Systems Engineering
- Electrical and Electronic Engineering
Cite this
On bounding node-to-sink latency in wireless sensor networks with multiple sinks. / Kim, Donghyun; Wang, Wei; Wu, Weili; Li, Deying; Ma, Changcun; Sohaee, Nassim; Lee, Wonjun; Wang, Yuexuan; Du, Ding Zhu.
In: International Journal of Sensor Networks, Vol. 13, No. 1, 05.04.2013, p. 13-29.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - On bounding node-to-sink latency in wireless sensor networks with multiple sinks
AU - Kim, Donghyun
AU - Wang, Wei
AU - Wu, Weili
AU - Li, Deying
AU - Ma, Changcun
AU - Sohaee, Nassim
AU - Lee, Wonjun
AU - Wang, Yuexuan
AU - Du, Ding Zhu
PY - 2013/4/5
Y1 - 2013/4/5
N2 - Bounding node-to-sink latency is an important issue of wireless sensor networks (WSNs) with a quality of service requirement. This paper proposes to deploy multiple sinks to control the worst case node-to-sink data latency in WSNs. The end-to-end latency in multihop wireless networks is known to be proportional to the hop length of the routing path that the message moves over. Therefore, we formulate the question of what is the minimum number of sinks and their locations to bound the latency as the minimum d-hop sink placement problem. We also consider its capacitated version. We show problems are NP-hard in unit disk graph (UDG) and unit ball graph, and propose constant factor approximations of the problems in both graph models. We further extend our algorithms so that they can work well in more realistic quasi UDG model. A simulation study is also conducted to see the average performance of our algorithms.
AB - Bounding node-to-sink latency is an important issue of wireless sensor networks (WSNs) with a quality of service requirement. This paper proposes to deploy multiple sinks to control the worst case node-to-sink data latency in WSNs. The end-to-end latency in multihop wireless networks is known to be proportional to the hop length of the routing path that the message moves over. Therefore, we formulate the question of what is the minimum number of sinks and their locations to bound the latency as the minimum d-hop sink placement problem. We also consider its capacitated version. We show problems are NP-hard in unit disk graph (UDG) and unit ball graph, and propose constant factor approximations of the problems in both graph models. We further extend our algorithms so that they can work well in more realistic quasi UDG model. A simulation study is also conducted to see the average performance of our algorithms.
KW - Approximation algorithm
KW - Graph theory
KW - Mobile computing
KW - Multiple sink placement
KW - Quasi unit disk graph
KW - Relay node placement
KW - UBG
KW - UDG
KW - Unit ball graph
KW - Unit disk graph
KW - Wireless sensor networks
KW - WSNs
UR - http://www.scopus.com/inward/record.url?scp=84875664144&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84875664144&partnerID=8YFLogxK
U2 - 10.1504/IJSNET.2013.052729
DO - 10.1504/IJSNET.2013.052729
M3 - Article
AN - SCOPUS:84875664144
VL - 13
SP - 13
EP - 29
JO - International Journal of Sensor Networks
JF - International Journal of Sensor Networks
SN - 1748-1279
IS - 1
ER -