Skip to main content Accessibility help
×
Hostname: page-component-77c89778f8-vpsfw Total loading time: 0 Render date: 2024-07-17T02:06:14.756Z Has data issue: false hasContentIssue false

10 - Wireless local area networks

from Part II - Applications of game theory in communications and networking

Published online by Cambridge University Press:  25 October 2011

Zhu Han
Affiliation:
University of Houston
Dusit Niyato
Affiliation:
Nanyang Technological University, Singapore
Walid Saad
Affiliation:
University of Miami
Tamer Başar
Affiliation:
University of Illinois, Urbana-Champaign
Are Hjørungnes
Affiliation:
Universitetet i Oslo
Get access

Summary

IEEE 802.11 wireless local area networks (WLANs) have been widely deployed in many places for both residential and commercial use. The IEEE 802.11 standard supports two major configurations – i.e., the point – coordination function (PCF) and the distributed coordination function (DCF). With PCF, the transmission in the network is based on a central node (i.e., an access point). Client nodes listen to the channel and wait for the signal from the access point. Once permission is sent by the access point, the client node can start data transmission. On the other hand, with DCF, the nodes employ carrier-sense multiple-access with collision avoidance (CSMA/CA) for MAC protocol. Each node can transmit independently, based on the availability of the channel. In particular, with CSMA/CA, the nodes listen for the channel status. If the channel is busy, the node defers its transmission by waiting for a backoff period. If a node senses a channel is idle, it will wait for a certain period of time and start transmission. In this case, multiple nodes can start transmissions at the same time, which results in collision. The colliding nodes will wait for the backoff period, and then sense for transmission again. To avoid performance degradation arising from packet collision, the backoff period can be adjusted, according to a specific rule, on the basis of the congestion level in the network (e.g., the rate of packet collisions).

Type
Chapter
Information
Game Theory in Wireless and Communication Networks
Theory, Models, and Applications
, pp. 321 - 344
Publisher: Cambridge University Press
Print publication year: 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×