Skip to main content
SpringerLink
Log in
Book cover

International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services

MobiQuitous 2013: Mobile and Ubiquitous Systems: Computing, Networking, and Services pp 564–575Cite as

Elastic Ring Search for Ad Hoc Networks

  • 1357 Accesses

Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST,volume 131)

Abstract

In highly dynamic mobile ad hoc networks, new paths between nodes can become available in a short amount of time. We show how to leverage this property in order to efficiently search for paths between nodes using a technique we call elastic ring search, modeled after the popular expanding ring search. In both techniques, a node searches up to a certain number of hops, waits long enough to know if a path was found, and searches again if no path was found. In elastic ring search, the delays between search attempts are long enough for shorter paths to become available, and therefore the optimal sequence of search extents may increase and even decrease. In this paper, we provide a framework to model this network behavior, define two heuristics for optimizing elastic ring search sequences, and show that elastic ring search can incur significantly lower search costs than expanding ring search.

Keywords

  • MANET
  • Expanding ring search
  • Optimization

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Baryshnikov, Y.M., Coffman Jr, E.G., Jelenkovic, P.R., Momcilovic, P., Rubenstein, D.: Flood search under the california split rule. Oper. Res. Lett. 32(3), 199–206 (2004)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Bettstetter, C., Hartenstein, H., Costa, X.P.: Stochastic properties of the random waypoint mobility model. Wireless Netw. 10(5), 555–567 (2004)

    CrossRef  Google Scholar 

  3. Bettstetter, C., Resta, G., Santi, P.: The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Trans. Mob. Comput. 2(3), 257–269 (2003)

    CrossRef  Google Scholar 

  4. Chang, N.B., Liu, M.: Revisiting the TTL-based controlled flooding search: optimality and randomization. In: Haas, Z.J., Das, S.R., Jain, R. (eds.) Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom ’04), pp. 85–99. ACM, New York (2004)

    Google Scholar 

  5. Chang, N.B., Liu, M.: Controlled flooding search in a large network. IEEE/ACM Trans. Netw. 15(2), 436–449 (2007)

    CrossRef  MathSciNet  Google Scholar 

  6. Cheng, Z., Heinzelman, W.B.: Searching strategies for target discovery in wireless networks. Ad Hoc Netw. 5(4), 413–428 (2007)

    CrossRef  Google Scholar 

  7. Deng, J., Zuyev, S.A.: On search sets of expanding ring search in wireless networks. Ad Hoc Netw. 6(7), 1168–1181 (2008)

    CrossRef  Google Scholar 

  8. Hassan, J., Jha, S.K.: On the optimization trade-offs of expanding ring search. In: Sen, A., Das, N., Das, S.K., Sinha, B.P. (eds.) IWDC 2004. LNCS, vol. 3326, pp. 489–494. Springer, Heidelberg (2004)

    CrossRef  Google Scholar 

  9. Lee, S.-J., Belding-Royer, E.M., Perkins, C.E.: Scalability study of the ad hoc on-demand distance vector routing protocol. Int. J. Netw. Manag. 13(2), 97–114 (2003)

    CrossRef  Google Scholar 

  10. Mukherjee, S., Avidor, D.: On the probability distribution of the minimal number of hops between any pair of nodes in a bounded wireless ad-hoc network subject to fading. In: IWWAN (2005)

    Google Scholar 

  11. Park, I., Pu, I.: Energy efficient expanding ring search. In: Asia International Conference on Modelling and Simulation, pp. 198–199. IEEE Computer Society (2007)

    Google Scholar 

  12. Pu, I., Shen, Y.: Enhanced blocking expanding ring search in mobile ad hoc networks. In: 2009 3rd International Conference on New Technologies, Mobility and Security (NTMS), 20–23 December 2009. pp. 1–5 (2009)

    Google Scholar 

  13. Pu, I., Shen, Y.: Analytical studies of energy-time efficiency of blocking expanding ring search. Math. Comput. Sci. 3, 443–456 (2010)

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. Royer, E.M., Toh, C.-K.: A review of current routing protocols for ad hoc mobile wireless networks. IEEE Pers. Commun. 6, 46–55 (1999)

    CrossRef  Google Scholar 

  15. Yoon, J., Liu, M., Noble, B.: Sound mobility models. In: Proceedings of the 9th Annual International Conference on Mobile computing and networking (MOBICOM ’03), pp. 205–216. ACM, New York (2003)

    Google Scholar 

  16. Younes, O., Thomas, N.: Analysis of the expected number of hops in mobile ad hoc networks with random waypoint mobility. Electr. Notes Theor. Comput. Sci. 275, 143–158 (2011)

    CrossRef  Google Scholar 

Download references

Acknowledgments

This work was supported in part by the Israeli Ministry of Industry and Trade under project RESCUE and ISF grant 1083/13.

Author information

Authors and Affiliations

  1. Bar Ilan University, Ramat Gan, Israel

    Simon Shamoun & David Sarne

  2. Princeton University, Princeton, USA

    Steven Goldfeder

Authors
  1. Simon Shamoun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Sarne
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Steven Goldfeder
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Simon Shamoun .

Editor information

Editors and Affiliations

  1. University of Ottawa, Ottawa, Ontario, Canada

    Ivan Stojmenovic

  2. School of Computer Science and Engineering,The University of Aizu Tsuruga, Fukushima, Japan

    Zixue Cheng

  3. School of Computer Science and Engineering, The University of Aizu Tsuruga, Fukushima, Japan

    Song Guo

Rights and permissions

Reprints and Permissions

Copyright information

© 2014 Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Shamoun, S., Sarne, D., Goldfeder, S. (2014). Elastic Ring Search for Ad Hoc Networks. In: Stojmenovic, I., Cheng, Z., Guo, S. (eds) Mobile and Ubiquitous Systems: Computing, Networking, and Services. MobiQuitous 2013. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 131. Springer, Cham. https://doi.org/10.1007/978-3-319-11569-6_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11569-6_44

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11568-9

  • Online ISBN: 978-3-319-11569-6

  • eBook Packages: Computer ScienceComputer Science (R0)

search

Navigation