Results 1 - 5 of 5

L.H.: Performance analysis of two-level QoS scheduler for wireless backhaul networks

by Ping-chen Lin, Ray Cheng, Bob Zhang, See Profile, Ping-chen Lin, Ray-guang Cheng, Senior Member, Li-hung Liao - IEEE Trans. Vehicular Techn , 2012
"... All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
(Show Context)

Fair packet scheduling in Wireless Mesh Networks

by Faisal Nawaba, Kamran Jamshaidb, Basem Shihadab, Pin-han Hoc
"... In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wire-less 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 der ..."
Abstract - Add to MetaCart
In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wire-less 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 nu-merically 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 times-tamp 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 Context)

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

by unknown authors
"... 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 mess ..."
Abstract - Add to MetaCart
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 stack, 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 in parking lot and large grid topologies. Index Terms—Wireless Mesh Networks, 802.11, TCP, fairness I.
(Show Context)

This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TWC.2014.2358591, IEEE Transactions on Wireless Communication

by Yung-cheng Tu, Meng Chang Chen, Yeali S. Sun
"... Abstract—Providing end-to-end QoS for delay sensitive flows with variable-bit-rate (VBR) traffic in wireless mesh networks is a major challenge. There are several reasons for this phenomenon, including time-varied bandwidth requirements, competition for transmission opportunities from flows on the s ..."
Abstract - Add to MetaCart
Abstract—Providing end-to-end QoS for delay sensitive flows with variable-bit-rate (VBR) traffic in wireless mesh networks is a major challenge. There are several reasons for this phenomenon, including time-varied bandwidth requirements, competition for transmission opportunities from flows on the same link, and interference from other wireless links. In this paper, we propose a flexible bandwidth allocation and uncoordinated scheduling scheme, called two-stage link scheduling (2SLS), to support flow delay control in TDMA-based wireless mesh networks. The scheme is implemented in two stages: slot allocation and on-the-go scheduling. The slot allocation mechanism allocates contiguous time slots to each link in each frame based on pre-defined maximum and minimum bandwidth requirements. Then, each link’s on-the-go scheduling mechanism dynamically schedules the transmissions within the allocated time slots. The objective is to maximally satisfy the demand of all flows on the link according to the bandwidth requirements and channel condition. Compared to traditional slot allocation approaches, 2SLS achieves higher channel utilization and provides better end-to-end QoS for delay sensitive flows with VBR traffic. Index Terms—wireless mesh networks, TDMA-based schedul-ing, flexible bandwidth allocation, 2-stage link scheduling. I.
(Show Context)

Photonic Network Communications manuscript No. (will be inserted by the editor) A Simple Analytical Throughput-Delay Model for Clustered FiWi Networks

by Po-yen Chen, Martin Reisslein, P. Chen, M. Reisslein , 2014
"... Abstract A Fiber-Wireless (FiWi) network integrates a passive optical network (PON) with wireless mesh networks (WMNs) to provide high speed backhaul via the PON while offering the flexibility and mobility of a WMN. Generally, increasing the size of a WMN leads to higher wireless interference and lo ..."
Abstract - Add to MetaCart
Abstract A Fiber-Wireless (FiWi) network integrates a passive optical network (PON) with wireless mesh networks (WMNs) to provide high speed backhaul via the PON while offering the flexibility and mobility of a WMN. Generally, increasing the size of a WMN leads to higher wireless interference and longer packet de-lays. We examine the partitioning of a large WMN into several smaller WMN clusters, whereby each cluster is served by an Optical Network Unit (ONU) of the PON. Existing WMN throughput-delay analysis tech-niques considering the mean load of the nodes at a given hop distance from a gateway (ONU) are unsuitable for the heterogeneous nodal traffic loads arising from clustering. We introduce a simple analytical queuing model that considers the individual node loads to accu-rately characterize the throughput-delay performance of a clustered FiWi network. We verify the accuracy of the model through extensive simulations. We em-ploy the model to examine the impact of the number of clusters on the network throughput-delay performance. We find that with sufficient PON bandwidth, clustering substantially improves the FiWi network throughput-delay performance.
(Show Context)