Research Article
Elastic Ring Search for Ad Hoc Networks
@INPROCEEDINGS{10.1007/978-3-319-11569-6_44, author={Simon Shamoun and David Sarne and Steven Goldfeder}, title={Elastic Ring Search for Ad Hoc Networks}, proceedings={Mobile and Ubiquitous Systems: Computing, Networking, and Services. 10th International Conference, MOBIQUITOUS 2013, Tokyo, Japan, December 2-4, 2013, Revised Selected Papers}, proceedings_a={MOBIQUITOUS}, year={2014}, month={12}, keywords={MANET Expanding ring search Optimization}, doi={10.1007/978-3-319-11569-6_44} }- Simon Shamoun
David Sarne
Steven Goldfeder
Year: 2014
Elastic Ring Search for Ad Hoc Networks
MOBIQUITOUS
Springer
DOI: 10.1007/978-3-319-11569-6_44
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.
