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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
Bettstetter, C., Hartenstein, H., Costa, X.P.: Stochastic properties of the random waypoint mobility model. Wireless Netw. 10(5), 555–567 (2004)
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)
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)
Chang, N.B., Liu, M.: Controlled flooding search in a large network. IEEE/ACM Trans. Netw. 15(2), 436–449 (2007)
Cheng, Z., Heinzelman, W.B.: Searching strategies for target discovery in wireless networks. Ad Hoc Netw. 5(4), 413–428 (2007)
Deng, J., Zuyev, S.A.: On search sets of expanding ring search in wireless networks. Ad Hoc Netw. 6(7), 1168–1181 (2008)
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)
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)
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)
Park, I., Pu, I.: Energy efficient expanding ring search. In: Asia International Conference on Modelling and Simulation, pp. 198–199. IEEE Computer Society (2007)
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)
Pu, I., Shen, Y.: Analytical studies of energy-time efficiency of blocking expanding ring search. Math. Comput. Sci. 3, 443–456 (2010)
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)
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)
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)
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
Corresponding author
Editor information
Editors and Affiliations
Rights 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)