skip to main content
10.1145/2491266.2491269acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Free access

Seeker-assisted information search in mobile clouds

Published: 16 August 2013 Publication History

Abstract

The increase in the size of mobile cloud as well as the volume of information necessitates efficient search mechanisms for finding the searched information or the target node. In this paper, we focus on search mechanisms to retrieve information from within a mobile cloud in which nodes have intermittent connectivity and hence operate on a store-carry-forward manner. We design an opportunistic search scheme in which the searching node spreads a limited number of replicas of the query to the nodes it meets and these nodes, so called seekers, perform the search on behalf of the searching node. We assume that nodes are grouped into communities based on their interest profiles, and seekers use this community information to forward the data and the query to the right community - the community that is more likely to store the searched content. Since people store and search for similar information in the scope of their interest, the nodes in the same community as the searching node have higher probability to store the searched content. We model this seeker-assisted search scheme as a continuous time Markov process and analyze its performance under various inter-community/intra-community meeting rate, number of replicas, and network population. Our analysis shows that seeker-assisted search achieves a good balance between the search response time and search cost compared to the two extremes of epidemic search and direct delivery search.

References

[1]
Eyuphan Bulut and B Szymanski. Exploiting friendship relations for efficient routing in mobile social networks. IEEE Trans. on Parallel and Dist. Sys., 12:2254--65, 2012.
[2]
Han Cai and Do Young Eun. Crossing over the bounded domain: from exponential to power-law intermeeting time in mobile ad hoc networks. IEEE/ACM Trans. on Networking (TON), 17(5):1578--1591, 2009.
[3]
Jialu Fan, Jiming Chen, Yuan Du, Ping Wang, and Youxian Sun. Delque: A socially aware delegation query scheme in delay-tolerant networks. IEEE Trans. on Vehicular Technology, 60(5):2181--2193, 2011.
[4]
Santo Fortunato. Community detection in graphs. Physics Reports, 486(3):75--174, 2010.
[5]
Wei Gao and Qinghua Li. Wakeup scheduling for energy-efficient communication in opportunistic mobile networks. In IEEE INFOCOM, 2013.
[6]
Pan Hui, Jeremie Leguay, Jon Crowcroft, James Scott, Timur Friedman, and Vania Conan. Osmosis in Pocket Switched Networks. In IEEE First Int. Conf. on Comms. and Netw. in China, 2006.
[7]
Pan Hui and Eiko Yoneki. BUBBLE Rap : Social-based Forwarding in Delay Tolerant Networks. IEEE Trans. Mobile Comp., pages 1--14, 2011.
[8]
Pan Hui, Eiko Yoneki, Shu Yan Chan, and Jon Crowcroft. Distributed community detection in delay tolerant networks. In Proc. of 2nd ACM/IEEE Int. Workshop on Mobility in the evolving internet architecture, 2007.
[9]
Thomas Karagiannis, Jean-yves Le Boudec, and Milan Vojnovi. Power Law and Exponential Decay of Intercontact Times between Mobile Devices. IEEE Trans. on Mobile Computing, 9(10):1377--1390, Oct. 2010.
[10]
Vincent Lenders, Gunnar Karlsson, and Martin May. Wireless ad hoc podcasting. In IEEE Conf. on Sensor, Mesh and Ad Hoc Comms. and Netws., 2007.
[11]
Miller McPherson, Lynn Smith-Lovin, and James M Cook. Birds of a feather: Homophily in social networks. Annual review of sociology, pages 415--444, 2001.
[12]
Abderrahmen Mtibaa, Martin May, Christophe Diot, and Mostafa Ammar. Peoplerank: Social opportunistic forwarding. In Proc. of IEEE INFOCOM, 2010.
[13]
Nam P Nguyen, Thang N Dinh, Sindhura Tokala, and My T Thai. Overlapping communities in dynamic networks: their detection and mobile applications. In Proc. of the 17th Int. Conf. on Mobile Comp. and netw., pages 85--96, 2011.
[14]
Andrea Passarella and Marco Conti. Analysis of individual pair and aggregate inter-contact times in heterogeneous opportunistic networks. IEEE Trans. on Mobile Comp., 2012.
[15]
Mikko Pitkänen, Teemu Kärkkäinen, Janico Greifenberg, and Jörg Ott. Searching for content in mobile DTNs. In IEEE Int. Conf. on Pervasive Computing and Comms., 2009.
[16]
Thrasyvoulos Spyropoulos, Konstantinos Psounis, and Cauligi S Raghavendra. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In Proc. of the ACM SIGCOMM workshop on DTN, 2005.
[17]
Ying Zhu, Bin Xu, Xinghua Shi, and Yu Wang. A survey of social-based routing in delay tolerant networks: Positive and negative social effects. 15(1), First quarter 2013.
[18]
Gjergji Zyba, Geoffrey M Voelker, Stratis Ioannidis, and Christophe Diot. Dissemination in opportunistic mobile ad-hoc networks: The power of the crowd. In Prof. of IEEE INFOCOM, pages 1179--1187, 2011.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
MCC '13: Proceedings of the second ACM SIGCOMM workshop on Mobile cloud computing
August 2013
70 pages
ISBN:9781450321808
DOI:10.1145/2491266
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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 August 2013

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. interest similarity
  2. mobile opportunistic networks
  3. mobile search

Qualifiers

  • Research-article

Conference

SIGCOMM'13
Sponsor:
SIGCOMM'13: ACM SIGCOMM 2013 Conference
August 16, 2013
Hong Kong, China

Acceptance Rates

MCC '13 Paper Acceptance Rate 10 of 24 submissions, 42%;
Overall Acceptance Rate 10 of 24 submissions, 42%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)45
  • Downloads (Last 6 weeks)9
Reflects downloads up to 06 Nov 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media