An Incentive Compatible Flow Control Algorithm for Rate Allocation in Computer Networks
IEEE Transactions on Computers
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
Multimedia Applications Support for Wireless ATM Networks
Multimedia Applications Support for Wireless ATM Networks
On Learning and the Quality of Service in a Wireless Network
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
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
Architecting noncooperative networks
IEEE Journal on Selected Areas in Communications
Selfish MAC Layer Misbehavior in Wireless Networks
IEEE Transactions on Mobile Computing
Using Multiple Detectors to Detect the Backoff Time of the Selfish Node in Wireless Mesh Network
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
Detecting greedy behaviors by linear regression in wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
| Hi-index | 0.00 |
A single-channel, single-hop wireless LAN (WLAN) providing communication for a set of stations is considered in an ad-hoc configuration, using a distributed MAC protocol synchronised to a common slotted time axis. A framework for a non-cooperative setting is outlined featuring a number of non-cooperative stations intent on stealing the channel bandwidth for their multimedia traffic streams. The packet scheduling policy and station strategies being logically separate in such a setting, it is argued that protection of fairness for cooperative stations should rely on suitable redefinition of the scheduling policy so as to invoke a non-cooperative game between the competing stations with a possibly fair and efficient Nash equilibrium. An example of such a policy, called EB/ECD-驴, is given and evaluated via simulation against a reference policy resembling the elimination-yield procedure of HIPERLAN/1.