Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the 9th annual international conference on Mobile computing and networking
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
SECTOR: secure tracking of node encounters in multi-hop wireless networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Convex Optimization
Maximum network flows with concave gains
Mathematical Programming: Series A and B
Low-Cost Routing in Selfish and Rational Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
OURS: optimal unicast routing systems in non-cooperative wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Incentive-compatible opportunistic routing for wireless networks
Proceedings of the 14th ACM international conference on Mobile computing and networking
ContentPlace: social-aware data dissemination in opportunistic networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Optimistic fair exchange for secure forwarding
MOBIQUITOUS '07 Proceedings of the 2007 Fourth Annual International Conference on Mobile and Ubiquitous Systems: Networking&Services (MobiQuitous)
Collaboration in Opportunistic Networks
Collaboration in Opportunistic Networks
RADON: reputation-assisted data forwarding in opportunistic networks
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Pi: a practical incentive protocol for delay tolerant networks
IEEE Transactions on Wireless Communications
Robustness of DTN against routing attacks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Mobicent: a credit-based incentive system for disruption tolerant network
INFOCOM'10 Proceedings of the 29th conference on Information communications
INPAC: an enforceable incentive scheme for wireless networks using network coding
INFOCOM'10 Proceedings of the 29th conference on Information communications
Detecting blackhole attacks in Disruption-Tolerant Networks through packet exchange recording
WOWMOM '10 Proceedings of the 2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)
Floating content: Information sharing in urban areas
PERCOM '11 Proceedings of the 2011 IEEE International Conference on Pervasive Computing and Communications
Detecting Route Attraction Attacks in Wireless Networks
MASS '11 Proceedings of the 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems
ProxiMol: Proximity and Mobility Estimation for Efficient Forwarding in Opportunistic Networks
MASS '11 Proceedings of the 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems
| Hi-index | 0.00 |
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.