A new model for packet scheduling in multihop wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Achieving MAC layer fairness in wireless packet networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
End-to-end performance and fairness in multihop wireless backhaul networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Wireless mesh networks: a survey
Computer Networks and ISDN Systems
Evaluation of the Masked Node Problem in Ad Hoc Wireless LANs
IEEE Transactions on Mobile Computing
Distributed Fair Scheduling in a Wireless LAN
IEEE Transactions on Mobile Computing
Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
Centralized feedback-driven rate allocation mechanism for CSMA/CA-based wireless mesh networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
FEBA: a bandwidth allocation algorithm for service differentiation in IEEE 802.16 mesh networks
IEEE/ACM Transactions on Networking (TON)
Gateway-assisted max-min rate allocation for wireless mesh networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Granting silence to avoid wireless collisions
ICNP '10 Proceedings of the The 18th IEEE International Conference on Network Protocols
Reversibility and Stochastic Networks
Reversibility and Stochastic Networks
The nominal capacity of wireless mesh networks
IEEE Wireless Communications
An incentive-based fairness mechanism for multi-hop wireless backhaul networks with selfish nodes
IEEE Transactions on Wireless Communications
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Maxmin fair scheduling in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically determine the throughput. Based on the developed model, we propose a distributed MAC protocol called Timestamp-ordered MAC (TMAC), aiming to alleviate the unfairness problem in WMNs. TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed with the transmission only if it receives a sufficient number of grant control messages from these neighbors. A grant message indicates that the associated data packet has the lowest timestamp of all the packets pending transmission at the local transmit queue. We demonstrate that a loose ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11, and thus can be easily integrated in existing 802.11-based WMNs. Our simulation results show that TMAC achieves excellent resource allocation fairness while maintaining over 90% of maximum link capacity across a large number of topologies.