LOOP: A location based routing scheme for opportunistic networks

As a key enabling technology for pervasive computing, opportunistic networks have attracted intensive research efforts recently. In this paper, we present a new routing scheme for opportunistic networks that aims at forwarding messages to a destination location/area, instead of forwarding to specific nodes. Our routing scheme, termed LOOP for LOcation based routing for OPportunistic networks, exploits the regularity embedded in human moving pattern. As human movements often exhibit a high degree of repetition including regular visits to certain places and regular contacts during daily activities, we can predict a mobile node's future locations based on its mobility trace with high confidence. We formulate the movement pattern mining as a multi-label classification problem and construct a Bayes' predictive model to explore the mobility history and learn the movement pattern. This movement pattern will then be used to predict the node's future movement. Based on the prediction, the ability of the node to deliver a message to the destination is quantified through defined metrics. These metrics will be the determining factor for choosing proper relaying nodes in several proposed strategies. Our scheme can preserve privacy as no information, including location information, needs to be exchanged among nodes. At the same time, our scheme achieves total distributed control as each node can choose its individual forwarding strategy without involving network wide changes. Our analytical and simulation results show that LOOP can achieve significant performance gains over well known existing strategies for routing in opportunistic networks.

[1]  Albert-László Barabási,et al.  Understanding individual human mobility patterns , 2008, Nature.

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

[3]  Iain Parris,et al.  The impact of location privacy on opportunistic networks , 2011, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[4]  Marco Conti,et al.  Modelling Social-Aware Forwarding in Opportunistic Networks , 2010, PERFORM.

[5]  Geoff Holmes,et al.  Classifier chains for multi-label classification , 2009, Machine Learning.

[6]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[7]  Kevin C. Almeroth,et al.  Coupons: A Multilevel Incentive Scheme for Information Dissemination in Mobile Networks , 2008, IEEE Transactions on Mobile Computing.

[8]  Cecilia Mascolo,et al.  Adaptive routing for intermittently connected mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[9]  Anne-Marie Kermarrec,et al.  Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks , 2009, IEEE INFOCOM 2009.

[10]  Dong Xuan,et al.  P3-coupon: A probabilistic system for Prompt and Privacy-preserving electronic coupon distribution , 2011, 2011 IEEE International Conference on Pervasive Computing and Communications (PerCom).

[11]  Robin Kravets,et al.  Encounter-Based Routing in DTNs , 2009, INFOCOM.

[12]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[13]  Natarajan Meghanathan,et al.  Location Prediction Based Routing Protocol for Mobile Ad Hoc Networks , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[14]  Cecilia Mascolo,et al.  GeOpps: Geographical Opportunistic Routing for Vehicular Networks , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[15]  Jörg Ott,et al.  Working day movement model , 2008, MobilityModels '08.

[16]  Timur Friedman,et al.  Evaluating MobySpace-based routing strategies in delay-tolerant networks , 2007, Wirel. Commun. Mob. Comput..

[17]  Mostafa H. Ammar,et al.  PeopleRank: Social Opportunistic Forwarding , 2010, 2010 Proceedings IEEE INFOCOM.

[18]  Jie Wu,et al.  An optimal probabilistic forwarding protocolin delay tolerant networks , 2009, MobiHoc '09.

[19]  Klaus Wehrle,et al.  GeoDTN: Geographic Routing in Disruption Tolerant Networks , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[20]  Marco Conti,et al.  HiBOp: a History Based Routing Protocol for Opportunistic Networks , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[21]  Pablo Rodriguez,et al.  Fair Routing in Delay Tolerant Networks , 2009, IEEE INFOCOM 2009.

[22]  Anne-Marie Kermarrec,et al.  Convex Partition of Sensor Networks and Its Use in Virtual Coordinate Geographic Routing , 2009, IEEE INFOCOM 2009.

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

[24]  M. Conti,et al.  Users Mobility Models for Opportunistic Networks : the Role of Physical Locations , 2007 .

[25]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

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

[27]  Donald F. Towsley,et al.  Performance Modeling of Epidemic Routing , 2006, Networking.

[28]  Marco Conti,et al.  Social-based autonomic routing in opportunistic networks , 2010, Autonomic Communication.

[29]  Jörg Ott,et al.  Author's Personal Copy Pervasive and Mobile Computing Floating Content for Probabilistic Information Sharing , 2022 .

[30]  Jean-Yves Le Boudec,et al.  A location-based routing method for mobile ad hoc networks , 2005, IEEE Transactions on Mobile Computing.

[31]  Jing Wang,et al.  Congestion management in delay tolerant networks , 2008, WICON.

[32]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[33]  Richard E. Hansen,et al.  Prioritized epidemic routing for opportunistic networks , 2007, MobiOpp '07.

[34]  Mario Gerla,et al.  Geo-opportunistic routing for vehicular networks [Topics in Automotive Networking] , 2010, IEEE Communications Magazine.

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

[36]  Pan Hui,et al.  How Small Labels Create Big Improvements , 2006, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

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

[38]  Chen-Nee Chuah,et al.  Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks , 2005, 2005 IEEE 61st Vehicular Technology Conference.