An Incentive Compatible Flow Control Algorithm for Rate Allocation in Computer Networks
IEEE Transactions on Computers
Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
Making greed work in networks: a game-theoretic analysis of switch service disciplines
IEEE/ACM Transactions on Networking (TON)
An analysis of short-term fairness in wireless media access protocols (poster session)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The quest for security in mobile ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Multiple Access in Ad-Hoc Wireless LANs with Noncooperative Stations
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
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
DOMINO: a system to detect greedy behavior in IEEE 802.11 hotspots
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Slotted Aloha as a game with partial information
Computer Networks: The International Journal of Computer and Telecommunications Networking
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Solvability of a Markovian Model of an IEEE 802.11 LAN under a Backoff Attack
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
802.11 denial-of-service attacks: real vulnerabilities and practical solutions
SSYM'03 Proceedings of the 12th conference on USENIX Security Symposium - Volume 12
Game theory and the design of self-configuring, adaptive wireless networks
IEEE Communications Magazine
CSMA/CA performance under high traffic conditions: throughput and delay analysis
Computer Communications
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Architecting noncooperative networks
IEEE Journal on Selected Areas in Communications
ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
A negotiation game for multichannel access in cognitive radio networks
Proceedings of the 4th Annual International Conference on Wireless Internet
An analysis of generalized slotted-Aloha protocols
IEEE/ACM Transactions on Networking (TON)
Wireless multihoming modeled as a multi-WLAN game
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
On the uniqueness of Nash equilibrium in ALOHA games with group of selfish users
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
Capacity-fairness performance of an ad hoc IEEE 802.11 WLAN with noncooperative stations
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Wireless networks as an infrastructure for mission-critical business applications
NBiS'07 Proceedings of the 1st international conference on Network-based information systems
Selfish MAC layer misbehavior detection model for the IEEE 802.11-based wireless mesh networks
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Random access protocols for WLANs based on mechanism design
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
On order gain of backoff misbehaving nodes in CSMA/CA-based wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Ad hoc multi-WLAN: a game-theoretic model of correlated play
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
An IEEE 802.11 EDCA model with support for analysing networks with misbehaving nodes
EURASIP Journal on Wireless Communications and Networking
DRinK: a defense strategy of cooperative wireless terminals in a wireless multihoming environment
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
An adaptive tit-for-tat strategy for IEEE 802.11 CSMA/CA protocol
International Journal of Security and Networks
A game-theoretic approach to distributed opportunistic scheduling
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
CSMA/CA, the contention mechanism of the IEEE 802.11 DCF medium access protocol, has recently been found vulnerable to selfish backoff attacks consisting in nonstandard configuration of the constituent backoff scheme. Such attacks can greatly increase a selfish station's bandwidth share at the expense of honest stations applying a standard configuration. The paper investigates the distribution of bandwidth among anonymous network stations, some of which are selfish. A station's obtained bandwidth share is regarded as a payoff in a noncooperative CSMA/CA game. Regardless of the IEEE 802.11 parameter setting, the payoff function is found similar to a multiplayer Prisoners' Dilemma; moreover, the number (though not the identities) of selfish stations can be inferred by observation of successful transmission attempts. Further, a repeated CSMA/CA game is defined, where a station can toggle between standard and nonstandard backoff configurations with a view of maximizing a long-term utility. It is argued that a desirable station strategy should yield a fair, Pareto efficient, and subgame perfect Nash equilibrium. One such strategy, called CRISP, is described and evaluated.