Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Enforcing service availability in mobile ad-hoc WANs
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
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
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
Designing Networks for Selfish Users is Hard
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
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
JANUS: towards robust and malicious resilient routing in hybrid wireless networks
Proceedings of the 3rd ACM workshop on Wireless security
Truthful multicast routing in selfish wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Proceedings of the 6th ACM conference on Electronic commerce
Wireless mesh networks: a survey
Computer Networks and ISDN Systems
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
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
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 Using Peer-to-Peer Communication in Cellular Wireless Data Networks
IEEE Transactions on Mobile Computing
Comparison of incentive-based cooperation strategies for hybrid networks
WWIC'05 Proceedings of the Third international conference on Wired/Wireless Internet Communications
Charging support for ad hoc stub networks
Computer Communications
Self organization in mobile ad hoc networks: the approach of Terminodes
IEEE Communications Magazine
Mesh networks: commodity multihop ad hoc networks
IEEE Communications Magazine
Integrated cellular and ad hoc relaying systems: iCAR
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Wireless mesh networks (WMNs) consist of mesh routers and mesh clients where fixed mesh routers form the multi-hop backbone of the network. It is often assumed that each individual mesh client will faithfully follow the prescribed protocols. However, these mobile devices, owned by individual users, will likely do what is the most beneficial to their owners, i.e. act 'selfishly'. In this article, we study how to design routing protocols in WMNs with selfish mesh clients. We first show that the totalpayment of the classical Vickrey-Clarke-Groves (VCG)-based routing protocol could be very expensive and inefficient for hybrid mesh networks. Then, we modify the VCG-based method to make it more efficient in terms of total payment, but we also prove that mesh clients could lie about their costs in this modified method. Instead of the VCG-based method, we then propose a novel routing protocol that could achieve Nash equilibrium with low total payments.