A fast algorithm for data collection along a fixed track

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 302
  • Download : 0
Recent research shows that significant energy saving can be achieved in wireless sensor networks (WSNs) with a mobile base station that collects data from sensor nodes via short-range communications. However, a major performance bottleneck of such WSNs is the significantly increased latency in data collection due to the low movement speed of mobile base stations. In this paper we study the problem of finding a data collection path for a mobile base station moving along a fixed track in a wireless sensor network to minimize the latency of data collection. The main contribution is an 0 (mn log n) expected time algorithm, where n is the number of sensors in the networks and m is the complexity of the fixed track.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2014-10
Language
English
Article Type
Article; Proceedings Paper
Keywords

WIRELESS SENSOR NETWORKS; ABSTRACT VORONOI DIAGRAMS

Citation

THEORETICAL COMPUTER SCIENCE, v.554, pp.254 - 262

ISSN
0304-3975
DOI
10.1016/j.tcs.2013.11.037
URI
http://hdl.handle.net/10203/194682
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0