By Topic

Virtual Sieve: A Distributed Channel Assignment Algorithm Resolving the Hidden Node Problem

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
$33 $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)
Zhe Yu ; Dept. of Electron. Eng., Tsinghua Univ., Beijing, China ; Wei Feng ; Wenzhu Zhang ; Lin Zhang
more authors

In wireless ad hoc networks, hidden nodes has been an important topic of recent research. This paper proposes a novel and efficient distributed multi-channel assignment algorithm, Virtual Sieve Distributed Channel Assignment Algorithm (VSDCA), for wireless ad hoc networks to avoid hidden node problem. The main purpose of this algorithm is to guarantee all links with hidden node problems to be assigned to different channels. In this paper, it shows that our VSDCA algorithm can completely avoid hidden node problem, and the performance of the network can be dramatically improved compared to previous Carrier Sensing (CS) algorithm.

Published in:

Communications and Mobile Computing (CMC), 2011 Third International Conference on

Date of Conference:

18-20 April 2011