CRISP: collusion-resistant incentive-compatible routing and forwarding in opportunistic networks

In opportunistic environments, tasks such as content sharing and service execution among remote devices are facilitated by relays (devices with short-range wireless connectivity) that receive data, move around, and then forward the data. To achieve high throughput, it is important to secure forwarding and provide incentives for participation by relays. However, it is extremely challenging to monitor the behavior of relays in an opportunistic network due to sparse connectivity. Existing schemes do not work when selfish/malicious relays collude with each other to forge routing metrics, drop useful data, flood the network, or earn extra reward. The credit scheme presented in this paper is the first in which routing as well as forwarding are incentive compatible. To design the scheme, the data transfer and loss in an opportunistic network are modeled as a non-linear generalized flow network. Then, optimality conditions for flow maximization describe the optimal behavior of a relay. This optimal behavior is made incentive compatible by requiring a relay to make a specific payment upon receiving the data and earn reward on forwarding the data. A cryptographic technique is used to make the scheme collusion resistant. Finally, a framework is proposed to implement CRISP in a completely distributed and opportunistic environment. Simulations on real and synthetic mobility traces validate a significant gain in throughput when compared with the existing credit schemes that are not incentive compatible.

[1]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.

[2]  Jon Crowcroft,et al.  Delivery Properties of Human Social Networks , 2009, IEEE INFOCOM 2009.

[3]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[4]  Maiko Shigeno.  Maximum network flows with concave gains , 2006, Math. Program..

[5]  Jie Wu,et al.  Thwarting Blackhole Attacks in Disruption-Tolerant Networks using Encounter Tickets , 2009, IEEE INFOCOM 2009.

[6]  László A. Végh.  Concave Generalized Flows with Applications to Market Equilibria , 2011, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[7]  Xiang-Yang Li,et al.  OURS: optimal unicast routing systems in non-cooperative wireless networks , 2006, MobiCom '06.

[8]  Sheng Zhong,et al.  INPAC: An Enforceable Incentive Scheme for Wireless Networks using Network Coding , 2010, 2010 Proceedings IEEE INFOCOM.

[9]  Srikanth V. Krishnamurthy,et al.  Detecting Route Attraction Attacks in Wireless Networks , 2011, 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems.

[10]  Mun Choon Chan,et al.  MobiCent: a Credit-Based Incentive System for Disruption Tolerant Network , 2010, 2010 Proceedings IEEE INFOCOM.

[11]  Xiang-Yang Li,et al.  Low-cost routing in selfish and rational wireless ad hoc networks , 2006, IEEE Transactions on Mobile Computing.

[12]  Steven H. Low,et al.  An optimization approach to ABR control , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[13]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[14]  Fan Wu,et al.  Incentive-compatible opportunistic routing for wireless networks , 2008, MobiCom '08.

[15]  Martin Skutella,et al.  Generalized Maximum Flows over Time , 2011, WAOA.

[16]  Xiaodong Lin,et al.  SMART: A Secure Multilayer Credit-Based Incentive Scheme for Delay-Tolerant Networks , 2009, IEEE Transactions on Vehicular Technology.

[17]  Refik Molva,et al.  Optimistic fair exchange for secure forwarding , 2007, 2007 Fourth Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services (MobiQuitous).

[18]  Andreas Heinemann,et al.  Collaboration in opportunistic networks , 2007 .

[19]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

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

[21]  Mohan Kumar,et al.  ProxiMol: Proximity and Mobility Estimation for Efficient Forwarding in Opportunistic Networks , 2011, 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems.

[22]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[23]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

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

[25]  Srdjan Capkun,et al.  SECTOR: secure tracking of node encounters in multi-hop wireless networks , 2003, SASN '03.

[26]  Stephan Eidenbenz,et al.  Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents , 2003, MobiCom '03.

[27]  Sheng Zhong,et al.  On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks , 2006, Wirel. Networks.

[28]  Xiaodong Lin,et al.  Pi: A practical incentive protocol for delay tolerant networks , 2010, IEEE Transactions on Wireless Communications.

[29]  Jörg Ott,et al.  Floating content: Information sharing in urban areas , 2011, 2011 IEEE International Conference on Pervasive Computing and Communications (PerCom).

[30]  Fan Wu,et al.  On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks , 2007, MobiCom '07.

[31]  D. Y. Barrer.  Queuing with Impatient Customers and Ordered Service , 1957 .

[32]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[33]  Mun Choon Chan,et al.  Robustness of DTN against routing attacks , 2010, 2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010).

[34]  Mohan Kumar,et al.  Opportunities in Opportunistic Computing , 2010, Computer.

[35]  Marco Conti,et al.  ContentPlace: social-aware data dissemination in opportunistic networks , 2008, MSWiM '08.

[36]  Jie Yang,et al.  Detecting blackhole attacks in Disruption-Tolerant Networks through packet exchange recording , 2010, 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM).

[37]  Kyunghan Lee,et al.  On the Levy-Walk Nature of Human Mobility , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[38]  Sajal K. Das,et al.  RADON: reputation-assisted data forwarding in opportunistic networks , 2010, MobiOpp '10.