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

J-CAR: An efficient joint channel assignment and routing protocol for IEEE 802.11-based multi-channel multi-interface mobile Ad Hoc 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

3 Author(s)
Hon Sun Chiu ; Dept. of Electr. & Electron. Eng., Univ. of Hong Kong, Hong Kong ; Yeung, K.L. ; King-Shan Lui

The capacity of an IEEE 802.11-based multi-hop wireless network is limited. By effectively utilizing multiple non-overlapping channels and multiple interfaces, collision and co-channel interference can be reduced. This allows more concurrent transmissions and thus enhances the network capacity. In this paper, we introduce an efficient distributed joint channel assignment and routing protocol, called J-CAR. Unlike existing schemes, J-CAR allows a data interface to dynamically change its routing protocol working mode between send and receive on a call-by-call basis, which distributed joint channel assignment enhances the utilization of both interface and channel. In J-CAR, channels are negotiated and assigned to active links in conjunction with the on-demand routing process. At each hop, J-CAR conducts a local optimization by selecting the least interfered channel according to the channel interference index. The channel interference index is designed by taking both the protocol and physical interference models into consideration. To find the least interfered path for network load balancing on a global scale, J-CAR employs a length-constrained widest-path routing. The ldquowidthrdquo of a path is determined by the interference level of its bottleneck link. With an adjustable threshold on the path length (with respect to the shortest-path), the excessively long path can also be avoided. We show that with a comparable complexity as the existing schemes, J-CAR provides much higher system good puts and shorter end-to-end packet delays.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:8 ,  Issue: 4 )

Date of Publication:

April 2009

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.