Skip to main content
SpringerLink
Log in

RaceTrack: An Approximation Algorithm for the Mobile Sink Routing Problem

  • Conference paper
Ad-Hoc, Mobile and Wireless Networks (ADHOC-NOW 2010)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6288))

Included in the following conference series:

Abstract

In large-scale monitoring applications, randomly deployed wireless sensor networks may not be fully connected. Using mobile sink for data collection is one of the feasible solutions. For energy saving, it is necessary to plan a shortest route for the mobile sink. Mobile sink routing problem can be regarded as a special case of TSP with neighborhoods (TSPN) problem. In this paper, we propose a novel approximation algorithm called RaceTrack. This algorithm forms a “racetrack” based on the TSP route, which is constructed from the locations of the deployed sensor nodes. By using inner lane heuristic and concave bend heuristic of auto racing, and a shortcut finding step, we optimize the obtained TSP route within O(n) computation time. Through formal proofs and large-scale simulations, we verified that our RaceTrack algorithm can achieve a good approximation ratio.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dumitrescu, A., Mitchell, J.: Approximation algorithms for tsp with neighborhoods in the plane. Journal of Algorithms 48(1), 135–159 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Yuan, B., Orlowska, M., Sadiq, S.: On the optimal robot routing problem in wireless sensor networks. IEEE Trans. on Knowledge and Data Engineering 19(9), 1252–1261 (2007)

    Article  Google Scholar 

  3. Arkin, E., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Applied Math. 55(3), 197–218 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Lawler, E., Lenstra, J., Rinnooy Kan, A., Shmoys, D.: The traveling Salesman Problem. John Wiley, Chichester (1985)

    MATH  Google Scholar 

  5. Tolle, G., Polastre, J., Szewczyk, R., Culler, D.: A macroscope in the redwoods. In: Proceedings of SenSys (November 2005)

    Google Scholar 

  6. Xing, G., Wang, T., Jia, W., Li, M.: Rendezvous design algorithms for wireless sensor networks with a mobile base station. In: Proceedings of MobiHoc (2008)

    Google Scholar 

  7. Gudmundsson, J., Levcopoulos, C.: A fast approximation algorithm for TSP with neighborhoods and red-blue separation. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 473–482. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. Elbassioni, K., Fishkin, A., Mustafa, N., Sitters, R.: Approximation algorithms for euclidean group TSP. In: Proceedings of ICALP (2005)

    Google Scholar 

  9. Gupta, P., Kumar, P.: Critical power for asymptotic connectivity in wireless networks. In: A Volume in Honor of Fleming, W.H., McEneaney, W.M., Yin, G., Zhang, Q. (eds.) Stochastic Analysis, Control, Optimization and Applications (1998)

    Google Scholar 

  10. Liu, R.: A simple and fast algorithm for detecting the convexity and concavity of vertices for an arbitrary polygon. Journal of Software 13(7), 1309–1312 (2002)

    Google Scholar 

  11. Sugihara, R., Gupta, R.: Improving the data delivery latency in sensor networks with controlled mobility. In: Proceedings of DCOSS (2008)

    Google Scholar 

  12. Arora, S.: Nearly linear time approximation schemes for euclidean tsp and other geometric problems. Journal of ACM 45(5), 1–30 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gandhi, S., Suri, S., Welzl, E.: Catching elephants with mice: sparse sampling for monitoring sensor networks. In: Proceedings of SenSys (November 2007)

    Google Scholar 

  14. Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration in wireless sensor networks. In: Proceedings of Sensys (2003)

    Google Scholar 

  15. Gu, Y., Bozdag, D., Brewer, R.W., Ekici, E.: Critical power for asymptotic connectivity in wireless networks. Journal of Computer Networks 50, 3449–3465 (2006)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National University of Defense Technology, China

    Yuan Yuan & Yuxing Peng

Authors
  1. Yuan Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuxing Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Science Department, University of Alberta, Edmonton, AB, Canada

    Ioanis Nikolaidis

  2. University of Victoria, BC, Canada

    Kui Wu

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yuan, Y., Peng, Y. (2010). RaceTrack: An Approximation Algorithm for the Mobile Sink Routing Problem. In: Nikolaidis, I., Wu, K. (eds) Ad-Hoc, Mobile and Wireless Networks. ADHOC-NOW 2010. Lecture Notes in Computer Science, vol 6288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14785-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14785-2_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14784-5

  • Online ISBN: 978-3-642-14785-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation