Elastic ring search for ad hoc networks

Simon Shamoun; David Sarne; Steven Goldfeder

doi:10.1007/978-3-319-11569-6_44

Elastic ring search for ad hoc networks

Simon Shamoun, David Sarne, Steven Goldfeder

Department of Computer Science

Princeton University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

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.

Original language	English
Title of host publication	Mobile and Ubiquitous Systems
Subtitle of host publication	Computing, Networking, and Services - 10th International Conference, MOBIQUITOUS 2013, Revised Selected Papers
Editors	Ivan Stojmenovic, Zixue Cheng, Song Guo
Publisher	Springer Verlag
Pages	564-575
Number of pages	12
ISBN (Electronic)	9783319115689
DOIs	https://doi.org/10.1007/978-3-319-11569-6_44
State	Published - 2014
Event	10th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MOBIQUITOUS 2013 - Tokyo, Japan Duration: 2 Dec 2013 → 4 Dec 2013

Publication series

Name	Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
Volume	131
ISSN (Print)	1867-8211

Conference

Conference	10th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MOBIQUITOUS 2013
Country/Territory	Japan
City	Tokyo
Period	2/12/13 → 4/12/13

Bibliographical note

Publisher Copyright:
© Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2014.

Funding

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

Funders	Funder number
Israeli Ministry of Industry and Trade
Israel Science Foundation	1083/13

Keywords

Expanding ring search
MANET
Optimization

Access to Document

10.1007/978-3-319-11569-6_44

Cite this

Shamoun, S., Sarne, D., & Goldfeder, S. (2014). Elastic ring search for ad hoc networks. In I. Stojmenovic, Z. Cheng, & S. Guo (Eds.), Mobile and Ubiquitous Systems: Computing, Networking, and Services - 10th International Conference, MOBIQUITOUS 2013, Revised Selected Papers (pp. 564-575). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol. 131). Springer Verlag. https://doi.org/10.1007/978-3-319-11569-6_44

Shamoun, Simon ; Sarne, David ; Goldfeder, Steven. / Elastic ring search for ad hoc networks. Mobile and Ubiquitous Systems: Computing, Networking, and Services - 10th International Conference, MOBIQUITOUS 2013, Revised Selected Papers. editor / Ivan Stojmenovic ; Zixue Cheng ; Song Guo. Springer Verlag, 2014. pp. 564-575 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST).

@inproceedings{e74c0368332547a880192b5c41f2e49d,

title = "Elastic ring search for ad hoc networks",

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 = "Expanding ring search, MANET, Optimization",

author = "Simon Shamoun and David Sarne and Steven Goldfeder",

note = "Publisher Copyright: {\textcopyright} Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2014.; 10th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MOBIQUITOUS 2013 ; Conference date: 02-12-2013 Through 04-12-2013",

year = "2014",

doi = "10.1007/978-3-319-11569-6_44",

language = "אנגלית",

series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST",

publisher = "Springer Verlag",

pages = "564--575",

editor = "Ivan Stojmenovic and Zixue Cheng and Song Guo",

booktitle = "Mobile and Ubiquitous Systems",

address = "גרמניה",

}

Shamoun, S, Sarne, D & Goldfeder, S 2014, Elastic ring search for ad hoc networks. in I Stojmenovic, Z Cheng & S Guo (eds), Mobile and Ubiquitous Systems: Computing, Networking, and Services - 10th International Conference, MOBIQUITOUS 2013, Revised Selected Papers. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST, vol. 131, Springer Verlag, pp. 564-575, 10th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MOBIQUITOUS 2013, Tokyo, Japan, 2/12/13. https://doi.org/10.1007/978-3-319-11569-6_44

Elastic ring search for ad hoc networks. / Shamoun, Simon; Sarne, David; Goldfeder, Steven.
Mobile and Ubiquitous Systems: Computing, Networking, and Services - 10th International Conference, MOBIQUITOUS 2013, Revised Selected Papers. ed. / Ivan Stojmenovic; Zixue Cheng; Song Guo. Springer Verlag, 2014. p. 564-575 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST; Vol. 131).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Elastic ring search for ad hoc networks

AU - Shamoun, Simon

AU - Sarne, David

AU - Goldfeder, Steven

N1 - Publisher Copyright: © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2014.

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Expanding ring search

KW - MANET

KW - Optimization

UR - http://www.scopus.com/inward/record.url?scp=84910595080&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-11569-6_44

DO - 10.1007/978-3-319-11569-6_44

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84910595080

T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST

SP - 564

EP - 575

BT - Mobile and Ubiquitous Systems

A2 - Stojmenovic, Ivan

A2 - Cheng, Zixue

A2 - Guo, Song

PB - Springer Verlag

T2 - 10th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MOBIQUITOUS 2013

Y2 - 2 December 2013 through 4 December 2013

ER -

Shamoun S, Sarne D, Goldfeder S. Elastic ring search for ad hoc networks. In Stojmenovic I, Cheng Z, Guo S, editors, Mobile and Ubiquitous Systems: Computing, Networking, and Services - 10th International Conference, MOBIQUITOUS 2013, Revised Selected Papers. Springer Verlag. 2014. p. 564-575. (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST). doi: 10.1007/978-3-319-11569-6_44

Elastic ring search for ad hoc networks

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this