Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Computationally feasible VCG mechanisms
Proceedings of the 2nd ACM conference on Electronic commerce
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A Markov-based channel model algorithm for wireless networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Enforcing service availability in mobile ad-hoc WANs
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Ad Hoc Wireless Networks: Protocols and Systems
Ad Hoc Wireless Networks: Protocols and Systems
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Wireless and Mobile Network Architectures
Wireless and Mobile Network Architectures
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
A charging and rewarding scheme for packet forwarding in multi-hop cellular networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
ACM SIGecom Exchanges
Vickrey Prices and Shortest Paths: What is an Edge Worth?
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Proceedings of the 9th annual international conference on Mobile computing and networking
UCAN: a unified cellular and ad-hoc network architecture
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
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Market sharing games applied to content distribution in ad-hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Experiences applying game theory to system design
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
Rethinking incentives for mobile ad hoc networks
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
Truthful multicast routing in selfish wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Ad Hoc Networking
Ripping coins for a fair exchange
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Incentive Compatible Cost- and Stability-Based Routing in Ad Hoc Networks
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A framework for incentive compatible topology control in non-cooperative wireless multi-hop networks
DIWANS '06 Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks
OURS: optimal unicast routing systems in non-cooperative wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Backbone construction in selfish wireless networks
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
On improving the efficiency of truthful routing in MANETs with selfish nodes
Pervasive and Mobile Computing
On the Access Pricing and Network Scaling Issues of Wireless Mesh Networks
IEEE Transactions on Computers
The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes
IEEE Transactions on Mobile Computing
A joint selfish routing and channel assignment game in wireless mesh networks
Computer Communications
Truthful multipath routing for ad hoc networks with selfish nodes
Journal of Parallel and Distributed Computing
Hidden information and actions in multi-hop wireless ad hoc networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Cooperative packet relaying model for wireless ad hoc networks
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Incentive-compatible opportunistic routing for wireless networks
Proceedings of the 14th ACM international conference on Mobile computing and networking
Routing game in hybrid wireless mesh networks with selfish mesh clients
International Journal of Autonomous and Adaptive Communications Systems
Frugal Routing on Wireless Ad-Hoc Networks
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
A Multi-agents Contractual Approach to Incentive Provision in Non-cooperative Networks
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
A light-weight scalable truthful routing protocol in MANETs with selfish nodes
International Journal of Ad Hoc and Ubiquitous Computing
OMH: suppressing selfish behavior in ad hoc networks with One More Hop
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
A Coalitional Game Model for Heat Diffusion Based Incentive Routing and Forwarding Scheme
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
On multipath routing in multihop wireless networks: security, performance, and their tradeoff
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless network security
Auction in multi-path multi-hop routing
IEEE Communications Letters
COFFEE: a context-free protocol for stimulating data forwarding in wireless ad hoc networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Cooperation in ad hoc networks with noisy channels
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Coexistence with malicious nodes: a game theoretic approach
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
OMH--Suppressing Selfish Behavior in Ad hoc Networks with One More Hop
Mobile Networks and Applications
Studying on economic-inspired mechanisms for routing and forwarding in wireless ad hoc network
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Who should pay for forwarding packets?
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
A collusion-resistant routing scheme for noncooperative wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
FRAME: an innovative incentive scheme in vehicular networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Game-theoretic approach for improving cooperation in wireless multihop networks
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Bandwidth exchange: an energy conserving incentive mechanism for cooperation
IEEE Transactions on Wireless Communications
Mobicent: a credit-based incentive system for disruption tolerant network
INFOCOM'10 Proceedings of the 29th conference on Information communications
Truthful least-priced-path routing in opportunistic spectrum access networks
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
An optimal, strategy-proof scheme for multi-path traffic assignment in non-cooperative networks
IEEE Transactions on Wireless Communications
Protocols for stimulating packet forwarding in wireless ad hoc networks
IEEE Wireless Communications
LSTOP: a light-weight scalable truthful routing protocol in MANETs with selfish nodes
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Towards cheat-proof cooperative relay for cognitive radio networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Interference-aware selfish routing in multi-ratio multi-channel wireless mesh networks
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Multi-agent based selfish routing for multi-channel wireless mesh networks
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
IEEE/ACM Transactions on Networking (TON)
Crowdsourcing to smartphones: incentive mechanism design for mobile phone sensing
Proceedings of the 18th annual international conference on Mobile computing and networking
An incentive scheme in wireless access networks through a game based on trust prediction
International Journal of Ad Hoc and Ubiquitous Computing
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
On the credit evolution of credit-based incentive protocols in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Impact of Cooperative Nodes on the Performance of Vehicular Delay-Tolerant Networks
Mobile Networks and Applications
A multi-hop advertising discovery and delivering protocol for multi administrative domain MANET
Mobile Information Systems
Personal and Ubiquitous Computing
Hi-index | 0.00 |
In many applications, wireless ad-hoc networks are formed by devices belonging to independent users. Therefore, a challenging problem is how to provide incentives to stimulate cooperation. In this paper, we study ad-hoc games---the routing and packet forwarding games in wireless ad-hoc networks. Unlike previous work which focuses either on routing or on forwarding, this paper investigates both routing and forwarding. We first uncover an impossibility result---there does not exist a protocol such that following the protocol to always forward others' traffic is a dominant action. Then we define a novel solution concept called cooperation-optimal protocols. We present Corsac, a cooperation-optimal protocol consisting of a routing protocol and a forwarding protocol. The routing protocol of Corsac integrates VCG with a novel cryptographic technique to address the challenge in wireless ad-hoc networks that a link's cost (ie, its type) is determined by two nodes together. Corsac also applies efficient cryptographic techniques to design a forwarding protocol to enforce the routing decision, such that fulfilling the routing decision is the optimal action of each node in the sense that it brings the maximum utility to the node. Additionally, we extend our framework to a practical radio propagation model where a transmission is successful with a probability. We evaluate our protocols using simulations. Our evaluations demonstrate that our protocols provide incentives for nodes to forward packets.