NDLI: A game-theoretic approach to distributed opportunistic scheduling

Content Provider	ACM Digital Library
Author	Banchs, Albert Widmer, Joerg Garcia-saavedra, Andres Serrano, Pablo
Copyright Year	2014
Abstract	Distributed opportunistic scheduling (DOS) is inherently more difficult than conventional opportunistic scheduling due to the absence of a central entity that knows the channel state of all stations. With DOS, stations use random access to contend for the channel and, upon winning a contention, they measure the channel conditions. After measuring the channel conditions, a station only transmits if the channel quality is good; otherwise, it gives up the transmission opportunity. The distributed nature of DOS makes it vulnerable to selfish users: By deviating from the protocol and using more transmission opportunities, a selfish user can gain a greater share of wireless resources at the expense of "well-behaved" users. In this paper, we address the problem of selfishness in DOS from a game-theoretic standpoint. We propose an algorithm that satisfies the following properties: 1) When all stations implement the algorithm, the wireless network is driven to the optimal point of operation; and 2) one or more selfish stations cannot obtain any gain by deviating from the algorithm. The key idea of the algorithm is to react to a selfish station by using a more aggressive configuration that (indirectly) punishes this station. We build on multivariable control theory to design a mechanism for punishment that is sufficiently severe to prevent selfish behavior, yet not so severe as to render the system unstable. We conduct a game-theoretic analysis based on repeated games to show the algorithm's effectiveness against selfish stations. These results are confirmed by extensive simulations.
Starting Page	1553
Ending Page	1566
Page Count	14
File Format	PDF
ISSN	10636692
DOI	10.1109/TNET.2012.2228500
Volume Number	21
Issue Number	5
Journal	IEEE/ACM Transactions on Networking (TON)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-10-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Contention-based channel access Distributed opportunistic scheduling (DOS) Game theory Multivariable control theory Repeated games Selfish stations Wireless networks
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering Computer Networks and Communications Software Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Game-Theoretic Approach to Distributed Opportunistic Scheduling

Adaptive Mechanism for Distributed Opportunistic Scheduling

Selfish Random Access over Wireless Channels with Multipacket Reception

An opportunistic power control algorithm for cellular network

Random access game and medium access control design

GCW: A Game Theoretic Contention Window Adjustment Approach for IEEE 802.11 WLANs

Obey or Play: Asymptotic Equivalence of Slotted Aloha with a Game Theoretic Contention Model

Distributed opportunistic scheduling for energy harvesting based wireless networks: a two-stage probing approach

Near-optimal deviation-proof medium access control designs in wireless networks

A game-theoretic approach to distributed opportunistic scheduling

Similar Documents

A Game-Theoretic Approach to Distributed Opportunistic Scheduling

Adaptive Mechanism for Distributed Opportunistic Scheduling

Selfish Random Access over Wireless Channels with Multipacket Reception

An opportunistic power control algorithm for cellular network

Random access game and medium access control design

GCW: A Game Theoretic Contention Window Adjustment Approach for IEEE 802.11 WLANs

Obey or Play: Asymptotic Equivalence of Slotted Aloha with a Game Theoretic Contention Model

Distributed opportunistic scheduling for energy harvesting based wireless networks: a two-stage probing approach

Near-optimal deviation-proof medium access control designs in wireless networks

A game-theoretic approach to distributed opportunistic scheduling