An efficient approximate algorithm for winner determination in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
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
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The sybil attack in sensor networks: analysis & defenses
Proceedings of the 3rd international symposium on Information processing in sensor networks
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Proceedings of the 11th annual international conference on Mobile computing and networking
Beyond VCG: Frugality of Truthful Mechanisms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Optimal decision-making with minimal waste: strategyproof redistribution of VCG payments
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Algorithmic Game Theory
Fast track article: Impact of source counter on routing performance in resource constrained DTNs
Pervasive and Mobile Computing
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
An incentive mechanism to reinforce truthful reports in reputation systems
Journal of Network and Computer Applications
A routing protocol for socially selfish delay tolerant networks
Ad Hoc Networks
CRISP: collusion-resistant incentive-compatible routing and forwarding in opportunistic networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
RIS: A Reciprocal Incentive Scheme in Selfish Opportunistic Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
When Disruption Tolerant Network (DTN) is used in commercial environments, incentive mechanism should be employed to encourage cooperation among selfish mobile users. Key challenges in the design of an incentive scheme for DTN are that disconnections among nodes are the norm rather than exception and network topology is time varying. Thus, it is difficult to detect selfish actions that can be launched by mobile users or to pre-determine the routing path to be used. In this paper, we propose MobiCent, a credit-based incentive system for DTN. While MobiCent allows the underlying routing protocol to discover the most efficient paths, it is also incentive compatible. Therefore, using MobiCent, rational nodes will not purposely waste transfer opportunity or cheat by creating non-existing contacts to increase their rewards. MobiCent also provides different payment mechanisms to cater to client that wants to minimize either payment or data delivery delay.