For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Differentiated CW Policy and Strict Priority Policy for Location-Independent End-to-End Delay in Multi-Hop Wireless Mesh Networks
Yun Han BAE Kyung Jae KIM Jin Soo PARK Bong Dae CHOI
IEICE TRANSACTIONS on Communications
Publication Date: 2010/07/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: PAPER
wireless mesh network, 802.11e EDCA, end-to-end delay, priority, M/G/1 queue,
Full Text: PDF>>
We investigate delay analysis of multi-hop wireless mesh network (WMN) where nodes have multi-channel and multiple transceivers to increase the network capacity. The functionality of the multi-channel and multiple transceivers allows the whole WMN to be decomposed into disjoint zones in such a way that i) nodes in a zone are within one-hop distance, and relay node and end nodes with different CWmins contend to access the channel based on IEEE 802.11e EDCA, ii) different channels are assigned to neighbor zones to prevent the hidden node problem, iii) relay nodes can transmit and receive the packets simultaneously by multi-channel and multiple transceivers. With this decomposition of the network, we focus on the delay at a single zone and then the end-to-end delay can be obtained as the sum of zone-delays. In order to have the location-independent end-to-end delay to the gateway regardless of source nodes' locations, we propose two packet management schemes, called the differentiated CW policy and the strict priority policy, at each relay node where relay packets with longer hop count are buffered in higher priority queues according to their experienced hop count. For the differentiated CW policy, a relay node adopts the functionality of IEEE 802.11e EDCA where a higher priority queue has a shorter minimum contention window. We model a typical zone as a one-hop IEEE 802.11e EDCA network under non-saturation condition where priority queues have different packet arrival rates and different minimum contention window sizes. First, we find the PGF (probability generating function) of the HoL-delay of packets at priority queues in a zone. Second, by modeling each queue as M/G/1 queue with the HoL-delay as a service time, we obtain the packet delay (the sum of the queueing delay and the HoL-delay) of each priority queue in a zone. Third, the average end-to-end delay of packet generated at end node in each zone is obtained by summing up the packet delays at each zone. For the strict priority policy, we regard a relay node as a single queueing system with multiple priority queues where relay packets in priority queues are served in the order of strict priority. Relay node has smaller CWmin than end node has and relay node competes with end nodes in a zone. Using the PGF of HoL-delay of packet at relay node and end node, we obtain the packet delay in a zone. The average end-to-end delay to the gateway generated at end node in each zone is obtained. Finally, for both the differentiated CW policy and strict priority policy, by equating all end-to-end delays to be approximately equal, we find the minimum contention window sizes of each priority queue numerically by trial and error method so that end-to-end delays of packets are almost equal regardless of their source's location, respectively. Numerical results show that proposed two methods obtain almost same end-to-end delay of packets regardless of their generated locations and our analytical results are shown to be well matched with the simulation results.