By Topic

Access Scheduling on the Control Channels in TDMA 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

1 Author(s)
Hongju Cheng ; Fuzhou Univ., Fuzhou

The access scheduling on the control channels in TDMA wireless mesh networks is studied in this paper. The problem is to assign time-slots for each node in the network to access the control channels so that it is guaranteed that each node can broadcast the control packet to any one-hop neighbor in one scheduling cycle. The objective is to minimize the total number of different time-slots in the scheduling cycle. The original contributions of this paper are that it has taken the large interference range problem into consideration for the first time and proposed two algorithms for the scheduling problem, namely, the speak once algorithm and the speak separately algorithm. We prove that the number of time-slots by the second algorithm is upper-bounded by min(n, 2K) in some special cases, where n is the node number and K is the maximum node degree. The fully distributed versions of these algorithms are given in this paper. Simulation results also show that the performance of the speak separately algorithm is rather better than that of the speak once algorithm.

Published in:

Information Science and Security, 2008. ICISS. International Conference on

Date of Conference:

10-12 Jan. 2008