Advertisement

A Fast Algorithm for Data Collection along a Fixed Track

  • Otfried Cheong
  • Radwa El Shawi
  • Joachim Gudmundsson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7936)

Abstract

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 O(mn logn) expected time algorithm, where n is the number of sensors in the networks and m is the complexity of the fixed track.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks 38(4), 393–422 (2002)CrossRefGoogle Scholar
  2. 2.
    Anastasi, G., Conti, M., Di Francesco, M., Passarella, A.: Energy conservation in wireless sensor networks: a survey. Ad Hoc Networks 7(3), 537–568 (2009)CrossRefGoogle Scholar
  3. 3.
    Batalin, M., Rahimi, M., Yu, Y., Liu, D., Kansal, A., Sukhatme, G., Kaiser, W.J., Hansen, M., Pottie, G.J., Srivastava, M.B., Estrin, D.: Call and response: experiments in sampling the environment. In: Proceedings of the 2nd International ACM Conference on Embedded Networked Sensor Systems (Sensys), pp. 25–38 (2004)Google Scholar
  4. 4.
    Chew, L.P., Drysdale, R.L.: Voronoi diagrams based on convex distance functions. In: Proceedings of the 1st Annual Symposium on Computational Geometry (SoCG), pp. 235–244 (1985)Google Scholar
  5. 5.
    de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational geometry – algorithms and applications, 3rd edn. Springer, Heidelberg (2008)zbMATHGoogle Scholar
  6. 6.
    Eppstein, D.: Offline algorithms for dynamic minimum spanning tree problems. Journal of Algorithms 17(2), 237–250 (1994)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Di Francesco, M., Das, S.K., Anastasi, G.: Data collection in wireless sensor networks with mobile elements: a survey. ACM Transactions on Sensor Networks 8(1), 1–7 (2011)CrossRefGoogle Scholar
  8. 8.
    Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences 48(3), 533–551 (1994)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Meiser, S., Mehlhorn, K., O’Dúnlaing, C.: On the construction of abstract Voronoi diagrams. Discrete and Computational Geometry 6, 211–224 (1991)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Kansal, A., Somasundara, A., Jea, D., Srivastava, M., Estrin, D.: Intelligent fluid infrastructure for embedded networks. In: Proceedings of the 2nd ACM International Conference on Mobile Systems, Applications, and Services (MobiSys), pp. 111–124 (2004)Google Scholar
  11. 11.
    Klein, R.: Concrete and Abstract Voronoi Diagrams. LNCS, vol. 400. Springer, Heidelberg (1989)zbMATHCrossRefGoogle Scholar
  12. 12.
    Pon, R., Batalin, M.A., Gordon, J., Kansal, A., Liu, D., Rahimi, M., Shirachi, L., Yu, Y., Hansen, M., Kaiser, W.J., Srivastava, M., Sukhatme, G., Estrin, D.: Networked infomechanical systems: a mobile embedded networked sensor platform. In: Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN), pp. 376–381 (2005)Google Scholar
  13. 13.
    Mehlhorn, K., Klein, R., Meiser, S.: Randomized incremental construction of abstract Voronoi diagrams. Computational Geometry: Theory and Applications 3, 157–184 (1993)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Sahni, S., Xu, X.: Algorithms for wireless sensor networks. International Journal of Distributed Sensor Networks 1(1), 35–56 (2005)CrossRefGoogle Scholar
  15. 15.
    Wee, Y.C., Chaiken, S., Willard, D.E.: General metrics and angle restricted Voronoi diagrams. In: Proceedings of the 1st Canadian Conference on Computational Geometry (1989)Google Scholar
  16. 16.
    Xing, G., Wang, T., Jia, W., Li, M.: Rendezvous design algorithms for wireless sensor networks with a mobile base station. In: Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, pp. 231–240 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Otfried Cheong
    • 1
  • Radwa El Shawi
    • 2
    • 3
  • Joachim Gudmundsson
    • 2
    • 3
  1. 1.Korea Advanced Institute of Science and TechnologyRepublic of Korea
  2. 2.University of SydneyAustralia
  3. 3.NICTASydneyAustralia

Personalised recommendations