research-article

Two Hops or More: On Hop-Limited Search in Opportunistic Networks

Authors:

Jussi Kangasharju,

Jörg OttAuthors Info & Claims

MSWiM '15: Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

Pages 115 - 124

https://doi.org/10.1145/2811587.2811592

Published: 02 November 2015 Publication History

Abstract

While there is a drastic shift from host-centric networking to content-centric networking, how to locate and retrieve the relevant content efficiently, especially in a mobile network, is still an open question. Mobile devices host increasing volume of data which could be shared with the nearby nodes in a multi-hop fashion. However, searching for content in this resource-restricted setting is not trivial due to the lack of a content index, as well as, desire for keeping the search cost low. In this paper, we analyze a lightweight search scheme, hop-limited search, that forwards the search messages only till a maximum number of hops, and requires no prior knowledge about the network. We highlight the effect of the hop limit on both search performance (i.e., success ratio and delay) and associated cost along with the interplay between content availability, tolerated waiting time, network density, and mobility. Our analysis, using the real mobility traces, as well as synthetic models, shows that the most substantial benefit is achieved at the first few hops and that after several hops the extra gain diminishes as a function of content availability and tolerated delay. We also observe that the return path taken by a response is on average longer than the forward path of the query and that the search cost increases only marginally after several hops due to the small network diameter.

References

[1]

L. A. Adamic, R. M. Lukose, and B. A. Huberman. Local search in unstructured networks. Handbook of graphs and networks, 2006.

[2]

A. Al Hanbali, P. Nain, and E. Altman. Performance of ad hoc networks with two-hop relay routing and limited packet lifetime. Performance Evaluation, 65(6):463--483, 2008.

Digital Library

[3]

S. Bayhan, E. Hyytiä, J. Kangasharju, and J. Ott. Seeker-assisted information search in mobile clouds. In ACM SIGCOMM workshop on Mobile cloud computing, 2013.

Digital Library

[4]

S. Bayhan, E. Hyytiä, J. Kangasharju, and J. Ott. Analysis of hop limit in opportunistic networks by static and time-aggregated graphs. In IEEE ICC, 2015.

[5]

S. Bayhan, E. Hyytiä, J. Kangasharju, and J. Ott. Two hops or more: On hop-limited search in opportunistic networks. Technical report, University of Helsinki, Finland, Aug. 2015.

[6]

C. Boldrini, M. Conti, and A. Passarella. Less is more: long paths do not help the convergence of social-oblivious forwarding in opportunistic networks. In ACM Int. workshop on Mobile Opportunistic Networks, 2012.

Digital Library

[7]

A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of human mobility on opportunistic forwarding algorithms. IEEE Trans. on Mobile Comp., 6(6):606--620, 2007.

Digital Library

[8]

A. Chaintreau, A. Mtibaa, L. Massoulie, and C. Diot. The diameter of opportunistic mobile networks. In ACM CoNEXT, 2007.

Digital Library

[9]

K. Fall. A delay-tolerant network architecture for challenged internets. In ACM SIGCOMM, 2003.

Digital Library

[10]

M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In ACM SIGCOMM Computer Communication Review, volume 29, pages 251--262, 1999.

Digital Library

[11]

J. Fan, J. Chen, Y. Du, P. Wang, and Y. Sun. Delque: A socially aware delegation query scheme in delay-tolerant networks. IEEE Transactions on Vehicular Technology, 60(5):2181--2193, Jun 2011.

[12]

W. Gao, Q. Li, and G. Cao. Forwarding redundancy in opportunistic mobile networks: Investigation, elimination, and exploitation. IEEE Transactions on Mobile Computing, 2014.

[13]

P. Gill, M. Arlitt, Z. Li, and A. Mahanti. Youtube traffic characterization: a view from the edge. In ACM SIGCOMM Conf. on Internet measurement, 2007.

Digital Library

[14]

M. Grossglauser and D. Tse. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. on Networking, 10(4):477--486, Aug 2002.

Digital Library

[15]

R. Guérin and A. Orda. Computing shortest paths for any number of hops. IEEE/ACM Transactions on Networking (TON), 10(5):613--620, 2002.

Digital Library

[16]

M. A. Hoque, X. Hong, and B. Dixon. Efficient multi-hop connectivity analysis in urban vehicular networks. Vehicular Comm., 1(2):78--90, April 2014.

Digital Library

[17]

E. Hyyti\"a, S. Bayhan, J. Ott, and J. Kangasharju. Searching a needle in (linear) opportunistic networks. In ACM MSWiM, 2014.

Digital Library

[18]

E. Hyytiä and J. Ott. Criticality of large delay tolerant networks via directed continuum percolation in space-time. In IEEE INFOCOM, 2013.

[19]

A. Keränen, J. Ott, and T. Kärkkäinen. The ONE Simulator for DTN Protocol Evaluation. In Proc. of Int. Conf. on Simulation Tools and Techniques, 2009.

Digital Library

[20]

J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In ACM KDD, 2005.

Digital Library

[21]

J. Ott and M. Pitkänen. DTN-based Content Storage and Retrieval. In The First IEEE WoWMoM Workshop on Autonomic and Opportunistic Communications (AOC), June 2007.

[22]

M. Piorkowski, N. Sarafijanovic-Djukic, and M. Grossglauser. CRAWDAD data set epfl/mobility (v. 2009-02--24), Feb. 2009. Downloaded from http://crawdad.org/epfl/mobility/.

[23]

M. Pitkänen, T. Kärkkäinen, J. Greifenberg, and J. Ott. Searching for content in mobile DTNs. In IEEE PerCom, 2009.

Digital Library

[24]

F. Qian, K. S. Quah, J. Huang, J. Erman, A. Gerber, Z. Mao, S. Sen, and O. Spatscheck. Web caching on smartphones: ideal vs. reality. In ACM MobiSys, 2012.

Digital Library

[25]

R Core Team. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria, 2013.

[26]

J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau. CRAWDAD data set cambridge/haggle (v. 2006-01-31). http://crawdad.org/cambridge/haggle/, Jan. 2006.

[27]

M. Vojnovic and A. Proutiere. Hop limited flooding over dynamic networks. In IEEE INFOCOM, 2011.

Cited By

Mir MZhu HHu C(2022)Enhanced Geographic Routing with One- and Two-Hop Movement Information in Opportunistic Ad Hoc NetworksFuture Internet10.3390/fi1407021414:7(214)Online publication date: 20-Jul-2022
https://doi.org/10.3390/fi14070214
Rashidi LEntezari-Maleki RChatzopoulos DHui PTrivedi KMovaghar A(2019)Performance Evaluation of Epidemic Content Retrieval in DTNs With Restricted MobilityIEEE Transactions on Network and Service Management10.1109/TNSM.2019.290910816:2(701-714)Online publication date: Jun-2019
https://doi.org/10.1109/TNSM.2019.2909108
Sourlas VAscigil OPsaras IPavlou G(2018)Enhancing Information Resilience in Disruptive Information-Centric NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2018.281194415:2(746-760)Online publication date: Jun-2018
https://doi.org/10.1109/TNSM.2018.2811944
Show More Cited By

Index Terms

Two Hops or More: On Hop-Limited Search in Opportunistic Networks
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
2. Networks
  1. Network architectures
  2. Network types
    1. Mobile networks
    2. Wireless access networks

Recommendations

Two-Hops Neighbor-Aware Routing Protocol in Mobile Ad Hoc Networks
Information Networking. Towards Ubiquitous Networking and Services

Routing Protocols for mobile ad hoc networks (MANETs) have been discussed extensively in recent years. Because of node mobility and energy conservation consideration in MANET, reactive routing protocols get more attention than others with their on-...
Two Hops Backup Routing Protocol in Mobile Ad Hoc Networks
ICPADS '05: Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02

Routing protocols play an important role in mobile ad hoc networks (MANET) [1]. Sungle-Ju Lee and Mario Gerla proposed AODV-BR [2] to improve AODV [3], [4] by providing multiple alternate routes. However, the node which detected link failure maybe move ...
Poster: An Adaptive Copy Spraying Scheme for Data Forwarding in Mobile Opportunistic Networks
MobiHoc '15: Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing

Mobile opportunistic network (MON) is a new paradigm which exploits node contacts to forward data, enabling numerous and impressive applications. The data copy spraying scheme is a challenging problem in MON, due to the mobility of nodes and lack of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MSWiM '15: Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

November 2015

358 pages

ISBN:9781450337625

DOI:10.1145/2811587

General Chairs:
J. J. Garcia-Luna-Aceves
University of California, USA
,
Graciela Romén Alonso
Universidad Autónoma Metropolitana, Mexico
,
Program Chairs:
Falko Dressler
University of Paderborn, Germany
,
Brahim Bensaou
Hong Kong University of Science and Technology, Hong Kong
,
Antonio F. Loureiro
Federal University of Minas Gerais, Brazil

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGSIM: ACM Special Interest Group on Simulation and Modeling

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 November 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Suomen Akatemia

Conference

MSWiM'15

Sponsor:

SIGSIM

MSWiM'15: 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

November 2 - 6, 2015

Cancun, Mexico

Acceptance Rates

MSWiM '15 Paper Acceptance Rate 34 of 142 submissions, 24%;

Overall Acceptance Rate 398 of 1,577 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
147
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Mir MZhu HHu C(2022)Enhanced Geographic Routing with One- and Two-Hop Movement Information in Opportunistic Ad Hoc NetworksFuture Internet10.3390/fi1407021414:7(214)Online publication date: 20-Jul-2022
https://doi.org/10.3390/fi14070214
Rashidi LEntezari-Maleki RChatzopoulos DHui PTrivedi KMovaghar A(2019)Performance Evaluation of Epidemic Content Retrieval in DTNs With Restricted MobilityIEEE Transactions on Network and Service Management10.1109/TNSM.2019.290910816:2(701-714)Online publication date: Jun-2019
https://doi.org/10.1109/TNSM.2019.2909108
Sourlas VAscigil OPsaras IPavlou G(2018)Enhancing Information Resilience in Disruptive Information-Centric NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2018.281194415:2(746-760)Online publication date: Jun-2018
https://doi.org/10.1109/TNSM.2018.2811944
Wang LBayhan SOtt JKangasharju JCrowcroft J(2018)Understanding Scoped-Flooding for Content Discovery and Caching in Content NetworksIEEE Journal on Selected Areas in Communications10.1109/JSAC.2018.284492036:8(1887-1900)Online publication date: Aug-2018
https://doi.org/10.1109/JSAC.2018.2844920
Bayhan SHyytia EKangasharju JOtt J(2016)Search in digital pockets: retrieving remote content in mobile opportunistic networksIEEE Wireless Communications10.1109/MWC.2016.749807023:3(10-18)Online publication date: Jun-2016
https://doi.org/10.1109/MWC.2016.7498070

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents