Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.comnet.2010.02.001
Title: CCMAC: Coordinated cooperative MAC for wireless LANs
Authors: Hu, Z.
Tham, C.-K. 
Keywords: Algorithm design
Concurrent
Cooperative
MAC
Issue Date: 19-Mar-2010
Source: Hu, Z., Tham, C.-K. (2010-03-19). CCMAC: Coordinated cooperative MAC for wireless LANs. Computer Networks 54 (4) : 618-630. ScholarBank@NUS Repository. https://doi.org/10.1016/j.comnet.2010.02.001
Abstract: In wireless LANs, throughput is one of, if not the most, important performance metric. This metric becomes more critical at the bottleneck area of the network, which is normally the area around the Access Point (AP). In this paper, we propose CCMAC, a coordinated cooperative MAC for wireless LANs. It is designed to improve the throughput performance in the region near the AP through cooperative communication, where data is forwarded through a two-hop high data rate link instead of a low data rate direct link. The most unique feature is that, it can coordinate nodes to perform concurrent transmissions which can further increase the throughput. To optimize the performance, the coordination problem is formulated as a Partially Observable Markov Decision Process and solved by a Reinforcement Learning algorithm. Through analysis and simulation, we show that CCMAC can significantly shorten the transmission time for stations with low data rate links to the AP and CCMAC has better throughput performance than other MAC protocols, such as CoopMAC and legacy IEEE 802.11. © 2010.
Source Title: Computer Networks
URI: http://scholarbank.nus.edu.sg/handle/10635/55257
ISSN: 13891286
DOI: 10.1016/j.comnet.2010.02.001
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

10
checked on Dec 5, 2017

WEB OF SCIENCETM
Citations

10
checked on Nov 16, 2017

Page view(s)

37
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.