By Topic

Task Scheduling 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
$33 $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)
Andrei Voinescu ; Fac. of Comput. Sci. & Comput. Eng., Polytech. Univ. of Bucharest, Bucharest, Romania ; Dan Stefan Tudose ; Nicolae Tapus

This paper discusses a scheduling algorithm for the sub-tasks of an application in a Wireless Sensor Network. With the next generation of sensor networks, task-based systems are needed to provide services to entities outside the network. Allocation of tasks on different wireless nodes must take into account energy constraints, compatibility of tasks to a given node or topology and must be in agreement with the purpose of the network. The problem described in this paper requires maximizing network lifetime and satisfying these allocation constraints. The solution proves to be correct though in some cases it can lead to algorithmic complexity, such that further work on an approximation algorithm might be indicated.

Published in:

Networking and Services (ICNS), 2010 Sixth International Conference on

Date of Conference:

7-13 March 2010