TMAC: Timestamp-Ordered MAC for CSMA/CA Wireless Mesh Networks

Nawab, Faisal; Jamshaid, Kamran; Shihada, Basem; Ho, Pin–Han

doi:10.1109/icccn.2011.6005807

Cited by 9 publications

(7 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The location of node is randomly generated with uniform distribution and this is the average results from 4000 independent simulations. The average per-node goodput is defined as the average number of successfully delivered packets per time per node [70,71,72,73] such that it is a fair measure to compare goodput of the network with different sizes. The per-node goodput can be different upon utilization of network coding.…”

Section: Tcle [11]mentioning

confidence: 99%

Distributed topology design for network coding deployed networks

Kwon

Park

2019

Signal Processing

View full text Add to dashboard Cite

Section: Tcle [11]mentioning

confidence: 99%

Distributed topology design for network coding deployed networks

Kwon

Park

2019

Signal Processing

View full text Add to dashboard Cite

“…We propose a packet scheduling algorithm over 802.11 that prioritizes packets according to their age [9]. Our protocol uses request/grant control messages to enforce scheduling between neighboring nodes.…”

Section: Fair Mac Protocol For Csma/ca Radiosmentioning

confidence: 99%

MAC-layer protocol for TCP fairness in Wireless Mesh Networks

Nawab

Jamshaid

Shihada

et al. 2012

2012 1st IEEE International Conference on Communications in China (ICCC)

Self Cite

View full text Add to dashboard Cite

“…However, in this paper, we focus on larger WMNs topologies with a larger number of flows. Thus, we maintain the objective of the work in [11,12,13] with a more tractable model that is applicable to complex scenarios.…”

Section: Related Workmentioning

confidence: 99%

Fair packet scheduling in Wireless Mesh Networks

et al. 2014

Self Cite

View full text Add to dashboard Cite

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

show abstract

TMAC: Timestamp-Ordered MAC for CSMA/CA Wireless Mesh Networks

Cited by 9 publications

References 24 publications

Distributed topology design for network coding deployed networks

Distributed topology design for network coding deployed networks

MAC-layer protocol for TCP fairness in Wireless Mesh Networks

Fair packet scheduling in Wireless Mesh Networks

Contact Info

Product

Resources

About