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

Weighted fairness guaranteed data aggregation scheduling algorithm in wireless sensor 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)
Jian Xu ; Coll. of Comput. Sci. & Technol., Nanjing Univ. of Posts & Telecommun., Nanjing, China ; Yanli Chen ; Wei Zhu

Data aggregation from a set of sensors to a common sink over a tree-based routing topology is a fundamental traffic pattern in wireless sensor networks (WSNs). The time division multiple access (TDMA)-based scheduling protocols are suitable for such data aggregation applications. Most of the previously proposed TDMA schemes focus on a particular objective, such as minimizing schedule delay, latency, and energy consumption etc. In this paper, we investigate another important aspect of aggregation, i.e., weighted fairness, and propose a novel weighted fairness guaranteed aggregation scheduling algorithm (WAS) under the protocol interference model. We use node weight to reflect the importance of each node, and introduce the weighted delay as the weighted fairness guaranteed metric. Then the problem of weighted fairness guaranteed can be translated into minimizing the weighted delay. In order to achieve this purpose, WAS utilizes the approximate maximum weighted set to allocate time slots for each node according to different accumulative weight. The results of simulation demonstrate that the weighted fairness of WAS is much better than the existing TDMA scheduling algorithm. In particular, the proposed scheduling scheme can achieve a good trade-off between weighted fairness guarantee and aggregation delay.

Published in:

Cloud Computing Technology and Science (CloudCom), 2012 IEEE 4th International Conference on

Date of Conference:

3-6 Dec. 2012

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.