Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
Enforcing service availability in mobile ad-hoc WANs
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
A Nearly best-possible approximation algorithm for node-weighted Steiner trees
A Nearly best-possible approximation algorithm for node-weighted Steiner trees
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
Self organization in mobile ad hoc networks: the approach of Terminodes
IEEE Communications Magazine
Towards truthful mechanisms for binary demand games: a general framework
Proceedings of the 6th ACM conference on Electronic commerce
Proceedings of the 11th annual international conference on Mobile computing and networking
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
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
A secure incentive protocol for mobile ad hoc networks
Wireless Networks
On the Access Pricing and Network Scaling Issues of Wireless Mesh Networks
IEEE Transactions on Computers
On the benefits of cheating by self-interested agents in vehicular networks
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
IEEE Transactions on Mobile Computing
A joint selfish routing and channel assignment game in wireless mesh networks
Computer Communications
Routing in outer space: fair traffic load in multi-hop wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and 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
A game-theoretic analysis of wireless access point selection by mobile users
Computer Communications
eBay in the Sky: strategy-proof wireless spectrum auctions
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
Game theoretic packet relaying model for wireless ad hoc networks
International Journal of Communication Networks and Distributed Systems
A finite-state-model scheme for efficient cooperation enforcement in mobile ad hoc networks
International Journal of Wireless and Mobile Computing
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
A collusion-resistant routing scheme for noncooperative wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
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
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
Share the multicast payment fairly
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A truthful (2 - 2/k)-approximation mechanism for the steiner tree problem with k terminals*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Nash equilibria and dominant strategies in routing
WINE'05 Proceedings of the First international conference on Internet and Network Economics
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
Design diffserv multicast with selfish agents
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
IEEE/ACM Transactions on Networking (TON)
iMac: strategy-proof incentive mechanism for mobile crowdsourcing
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
In wireless networks, it is often assumed that each individual wireless terminal will faithfully follow the prescribed protocols without any deviation-- except, perhaps, for a few faulty or malicious ones. Wireless terminals, when owned by individual users, will likely do what is the most beneficial to their owners, i.e., act "selfishly". Therefore, an algorithm or protocol intended for selfish wireless networks must be designed.In this paper, we specifically study how to conduct efficient multicast routing in selfish wireless networks. We assume that each wireless terminal or communication link will incur a cost when it transits some data. Traditionally, the VCG mechanism has been the only method to design protocols so that each selfish agent will follow the protocols for its own interest to maximize its benefit. The main contributions of this paper are two-folds. First, for each of the widely used multicast structures, we show that the VCG based mechanism does not guarantee that the selfish terminals will follow the protocol. Second, we design the first multicast protocols without using VCG mechanism such that each agent maximizes its profit when it truthfully reports its cost.Extensive simulations are conducted to study the practical performances of the proposed protocols regarding the actual network cost and total payment.