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
Game theory and the design of self-configuring, adaptive wireless networks
IEEE Communications Magazine
MobiCom poster: handling MAC layer misbehavior in wireless networks
ACM SIGMOBILE Mobile Computing and Communications Review
DOMINO: a system to detect greedy behavior in IEEE 802.11 hotspots
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Distributed scheduling and dynamic pricing in a communication network
Wireless Networks
Selfish MAC Layer Misbehavior in Wireless Networks
IEEE Transactions on Mobile Computing
Energy-efficient link-layer jamming attacks against wireless sensor network MAC protocols
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
Mobile Networks and Applications
A game-theoretic study of CSMA/CA under a backoff attack
IEEE/ACM Transactions on Networking (TON)
A station strategy to deter backoff attacks in IEEE 802.11 LANs
Journal of Discrete Algorithms
A game approach for multi-channel allocation in multi-hop wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Energy-efficient link-layer jamming attacks against wireless sensor network MAC protocols
ACM Transactions on Sensor Networks (TOSN)
Efficient MAC in cognitive radio systems: a game-theoretic approach
IEEE Transactions on Wireless Communications
Detecting greedy behaviors by linear regression in wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Playing CSMA/CA game to deter backoff attacks in ad hoc wireless LANs
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Hi-index | 0.00 |
A class of contention-type MAC protocols (e.g., CSMA/CA) relies on random deferment of packet transmission, and subsumes a deferment selection strategy and a scheduling policy that determines the winner of each contention cycle. This paper examines contention-type protocols in a noncooperative an ad-hoc wireless LAN setting, where a number of stations self-optimise their strategies to obtain a more-than-fair bandwidth share. Two scheduling policies, called RT/ECD and RT/ECD-1s, are evaluated via simulation It is concluded that a well-designed scheduling policy should invoke a noncooperative game whose outcome, in terms of the resulting bandwidth distribution, is fair to non-self-optimising stations.