Making greed work in networks: a game-theoretic analysis of switch service disciplines
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Packet Scheduling in Wireless LANs - A Framework for a Noncooperative Paradigm
PWC '00 Proceedings of the IFIP TC6/WG6.8 Working Conference on Personal Wireless Communications
DOMINO: a system to detect greedy behavior in IEEE 802.11 hotspots
Proceedings of the 2nd international conference on Mobile systems, applications, and services
| Hi-index | 0.00 |
Ad Hoc LAN systems are noncooperative MAC settings where regular stations are prone to "bandwidth stealing" by greedy ones. The paper formulates a minimum-information model of a LAN populated by mutually impenetrable groups. A framework for a noncooperative setting and suitable MAC protocol is proposed, introducing the notions of verifiability, feedback compatibility and incentive compatibility. For Random Token MAC protocols based on voluntary deferment of packet transmissions, a family of winner policies called RT/ECD-Z is presented that guarantees regular stations a close-to-fair bandwidth share under heavy load. The proposed policies make it hard for greedy stations to select short deferments, therefore they resort to smarter strategies, and the winner policy should leave the regular stations the possibility of adopting a regular strategy that holds its own against any greedy strategy. We have formalized this idea by requiring evolutionary stability and high guaranteed regular bandwidth shares within a set of heuristic strategies.