Please use this identifier to cite or link to this item:
|Title:||SI-CCMAC: Sender initiating concurrent cooperative MAC for wireless LANs|
|Source:||Hu, Z.,Tham, C.-K. (2009). SI-CCMAC: Sender initiating concurrent cooperative MAC for wireless LANs. Final Proceedings of the 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2009 : -. ScholarBank@NUS Repository. https://doi.org/10.4108/ICST.WIOPT2009.6362|
|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 SI-CCMAC, a sender initiating concurrent 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. Furthermore, nodes are coordinated to enable concurrent transmissions to further increase throughput. The coordination part of SICCMAC is modeled as a vertex coloring problem, a maximum independent set problem and a MDP problem, depending on different scenarios. For all three modeling, solutions can be found, based on the existing algorithms to optimize the throughput performance while guaranteeing a max-min fairness. Through simulation, we show that SI-CCMAC can significantly shorten the transmission time for stations with low data rate links to the AP and it has better throughput performance than other MAC protocols, such as CoopMAC and legacy IEEE 802.11.|
|Source Title:||Final Proceedings of the 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2009|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 12, 2018
checked on Feb 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.