Cart (Loading....) | Create Account
Close category search window
 

Packet management scheme for location-independent end-to-end delay in IEEE 802.11s multi-hop wireless mesh networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Yun Han Bae ; Dept. of Math. & Telecommun. Math. Res. Center, Korea Univ., Seoul ; Kyung Jae Kim ; Eunju Hwang ; Jin Soo Park
more authors

We consider IEEE 802.11s multi-hop wireless mesh network under multi-channel and multi-radio environments. We decompose the mesh network into disjoint zones by using multiple channels and multiple radios such a way that (i)mesh nodes in a zone are within one-hop distance and compete with other nodes to access the channel using IEEE 802.11e EDCA, (ii) neighbor zones use different channels, (iii) each node can send and receive the packets simultaneously. Thus we may focus on a single zone in order to derive the performance measure such as end-to-end delay. We propose packet management scheme at relay node where relay packets passing by more hops are buffered in higher priority AC of EDCA. Firstly, we model one zone as one-hop 802.11e EDCA network and find the HoL-delay of packet of each AC at relay node in a zone. Secondly, by modeling each AC as M/G/1 queue with HoL-delay as service time, we obtain packet delay (sum of queueing delay and HoL-delay) in a zone. The average end-to-end delay is calculated by summing up of packet delays in zones along the designated route. The goal of the packet management scheme in this paper is to provide location-independent end-to-end packet delays in the sense that all end-to-end packet delays regardless of nodespsila location are almost same. To do this, we propose a method to determine the minimum contention window size of ACs so as to have shorter delay for AC with relay packets passing by more hops. Finally, we suggest a heuristic algorithm to reduce the difference of delays due to packetspsila originated location and eventually to achieve the fair end-to-end delay of packets regardless of nodespsila location. Numerical results show that our proposed algorithm guarantees the location-independent end-to-end delay of packets in all the zones, regardless of locations.

Published in:

Telecommunications, 2008. ICT 2008. International Conference on

Date of Conference:

16-19 June 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.