Matching Services with Users in Opportunistic Network Environments

Opportunistic Networks are a specific type of wireless ad hoc network where there is an absence of a continuous end-to-end path. The proliferation of mobile devices with Wi-Fi capability creates opportunities to forward packets by utilizing nodes as they present themselves. Such a dynamic networking environment enables services to be advertised by propagating from device to device, in order that all users in an area receive them. However, excessive propagation of service advertisements consumes energy from mobile devices, whilst also degrading the users' experience if they receive adverts for services that are misaligned with their personal interests. In this article we propose an architecture for a protocol and an algorithm that facilitates the matching of relevant service adverts with interested recipients in an Opportunistic Networking environment, whilst serving to minimize energy consumption.

[1]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[2]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[3]  David De Roure,et al.  A Semantic Service Matching Middleware for Mobile Devices Discovering Grid Services , 2008, GPC.

[4]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[5]  Marco Conti,et al.  From opportunistic networks to opportunistic computing , 2010, IEEE Communications Magazine.

[6]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[7]  Richard Hill,et al.  Measuring Efficiency in Opportunistic Ad Hoc Networks , 2011, J. Interconnect. Networks.

[8]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[9]  Anshul Verma,et al.  Integrated Routing Protocol for Opportunistic Networks , 2012, ArXiv.

[10]  Stefano Spaccapietra,et al.  Matching User's Semantics with Data Semantics in Location-Based Services , 2005, MCMP@MDM.

[11]  Matthias Klusch,et al.  Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace , 2002, Autonomous Agents and Multi-Agent Systems.

[12]  Pan Hui,et al.  A socio-aware overlay for publish/subscribe communication in delay tolerant networks , 2007, MSWiM '07.

[13]  Fabián E. Bustamante,et al.  An integrated mobility and traffic model for vehicular wireless networks , 2005, VANET '05.

[14]  Anthony Smith,et al.  Evaluation of a Framework for Measuring Efficency in Opportunistic Ad-hoc Networks , 2012, 2012 Third International Conference on Emerging Intelligent Data and Web Technologies.

[15]  Richard Hill,et al.  Towards a Framework for the Evaluation of Efficient Provisioning in Opportunistic Ad Hoc Networks , 2011, 2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing.

[16]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.

[17]  Patrick Th. Eugster,et al.  Location-based Publish/Subscribe , 2005, Fourth IEEE International Symposium on Network Computing and Applications.

[18]  Daniel Kuokka,et al.  Matchmaking for Information Agents , 1995, IJCAI.