The complexity of dynamic programming
Journal of Complexity
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Solving the Minimum Weighted Integer Coloring Problem
Computational Optimization and Applications
A rate-adaptive MAC protocol for multi-Hop wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
Weighted coloring: further complexity and approximability results
Information Processing Letters
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
To Forward or not to Forward --- that is the Question
Wireless Personal Communications: An International Journal
CCMAC: coordinated cooperative MAC for wireless LANs
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Journal of Heuristics
CoopMAC: A Cooperative MAC for Wireless LANs
IEEE Journal on Selected Areas in Communications
CCMAC: Coordinated cooperative MAC for wireless LANs
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.