By Topic

Delay Efficient Link and Aggregation Scheduling under Physical Interference Model

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

4 Author(s)

In this work, we design efficient algorithms for scheduling node activities, under the physical interference model, to minimize the delay for activating a set of communication links, or for finishing a data aggregation communication task. Given a set of communication links, assume that each link is associated with a positive weight (representing the award of transmission along this link). We consider two problems: the first one is to find an independent set of links with maximum total weight; the second one is to partition all links into independent subsets, such that the number of subsets is minimized. We are the first to develop distributed algorithms with constant approximations for both problems respectively. The other line of this work is to explore the relations between link scheduling and an important practical problem: Minimum Latency Aggregation Scheduling which seeks a shortest schedule for data aggregation in multi-hop wireless networks. By utilizing the algorithmic results for link scheduling, our proposed method can find an aggregation schedule that greatly improves the upper bound on latency, compared to the previous best result.

Published in:

Mobile Adhoc and Sensor Systems (MASS), 2011 IEEE 8th International Conference on

Date of Conference:

17-22 Oct. 2011