By Topic

A Dynamic-alliance-based Adaptive Task Allocation 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)
Ying Chen ; Coll. of Math. & Comput. Sci., Fuzhou Univ., Fuzhou, China ; Wenzhong Guo ; Guolong Chen

In distributed sensor networks, which have limited resources, such as energy and storage, and work in a dynamic environment, the networks should effectively allocate some real-time tasks on those limited resources. Additionally, we should do our best to maximize the lifetime of wireless sensor networks (WSNs) and the accuracy of the results. Due to most of previous works focusing on static task allocation for WSNs and only a few works having paid attention to dynamic resource allocation for sensor networks, this paper present an effectively adaptive task allocation (EATA) in WSNs which applied dynamic alliance. Instead of being aid of manual adjustment, each node can autonomously adjust its parameters and state by means of EATA according to tracking the change of environment, such as energy depletion. By comparing with static task allocation, experiment results show that our scheme can save a great deal of energy and prolong the lifetime of the network.

Published in:

Grid and Cooperative Computing (GCC), 2010 9th International Conference on

Date of Conference:

1-5 Nov. 2010