Context- and social-aware middleware for opportunistic networks

被引:54
作者
Boldrini, C. [1 ]
Conti, M. [1 ]
Delmastro, F. [1 ]
Passarella, A. [1 ]
机构
[1] CNR, IIT Inst, I-56124 Pisa, Italy
关键词
Middleware; Context; Social-awareness; Opportunistic networks; Content sharing;
D O I
10.1016/j.jnca.2010.03.017
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Opportunistic networks are multi-hop ad hoc networks in which nodes opportunistically exploit any pair-wise contact to share and forward content, without requiring any pre-existing Internet infrastructure. Opportunistic networks tolerate partitions, long disconnections, and topology instability in general. In this challenging environment, leveraging users' mobility represents the most effective way to deliver content to interested users. In this paper we propose a context- and social-aware middleware that autonomically learns context and social information on the users of the network, and that uses this information in order to predict users' future movements. In order to evaluate the proposed middleware on a realistic scenario, we have designed and implemented a context- and social-aware content sharing service, exploiting the functionality of the middleware. Both the middleware and the content sharing service have been integrated with an existing data-centric architecture (the Haggle architecture) for opportunistic networks. Finally, we have validated the proposed content sharing application on a small-scale testbed and, on a larger scale, we have investigated the advantages provided by context- and social-aware sharing strategies by means of extensive simulations. The main result of this paper is the definition and implementation of a context- and social-aware middleware able to share context information with all the interested components improving the efficiency and performances of services and protocols in opportunistic networks. With respect to content sharing strategies that do not exploit context and social information, we have obtained up to 200% improvements in terms of hit rate (probability that users receive the content they request) and 99% reduction in resource consumption in terms of traffic generated on the network. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:525 / 541
页数:17
相关论文
共 43 条
[1]  
[Anonymous], 2006, 11 INT C TRAV BEH RE
[2]  
[Anonymous], CS200006
[3]  
[Anonymous], P SIGCOMM
[4]  
[Anonymous], 2000, Small worlds: The dynamics of networks between order and randomness
[5]  
[Anonymous], HDB MOBILE MIDDLEWAR
[6]  
[Anonymous], P MOBIHOC
[7]  
[Anonymous], 2004, WORKSH ADV CONT MOD
[8]   AN OVERVIEW OF WEB CACHING REPLACEMENT ALGORITHMS [J].
Balamash, Abdullah ;
Krunz, Marwan .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2004, 6 (02) :44-56
[9]  
BALASUBRAMANIAN A, 2007, APPL TECHNOLOGIES AR, V37, P4
[10]   HCMM: Modelling spatial and temporal properties of human mobility driven by users' social relationships [J].
Boldrini, Chiara ;
Passarella, Andrea .
COMPUTER COMMUNICATIONS, 2010, 33 (09) :1056-1074