By Topic

Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless 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

2 Author(s)
Xiaojun Lin ; Center for Wireless Syst. & Applic., Purdue Univ., West Lafayette, IN ; Rasool, S.B.

We propose a new class of distributed scheduling policies for ad hoc wireless networks that can achieve provable capacity regions. Previously known scheduling policies that guarantee comparable capacity regions are either centralized or require computation time that increases with the size of the network. In contrast, the unique feature of the proposed distributed scheduling policies is that they are constant-time policies, i.e., given a fixed approximation ratio and a bounded maximum node-degree of the network, the time needed for computing a new schedule is independent of the network size. Hence, they can be easily deployed in large networks.

Published in:

Automatic Control, IEEE Transactions on  (Volume:54 ,  Issue: 2 )