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

A distributed adaptive channel assignment algorithm for dynamic spectrum access 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

3 Author(s)
Chunsheng Xin ; Dept. of Comput. Sci., Norfolk State Univ., Norfolk, VA ; Liangping Ma ; Chien-Chung Shen

This paper proposes a distributed adaptive channel assignment (DACA) algorithm for dynamic spectrum access mesh networks (DSAMN) that utilize dynamically accessible channels for communication. DACA utilizes only the local information and operates in a distributed manner, where each node adaptively and independently switches among the available dynamic channels in DSAMN. Compared with existing channel assignment algorithms designed for static spectrum access wireless networks, DACA does not require any coordination or synchronization between neighboring nodes, while achieving good throughput, making DACA highly effective for DSAMN with dynamic channels and topology.

Published in:

Communications and Networking in China, 2008. ChinaCom 2008. Third International Conference on

Date of Conference:

25-27 Aug. 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.