Adaptive Tasks Balancing in Wireless Sensor Networks

Fadi Tirkawi, Stefan Fischer

Abstract

In this paper, we extend our CPU-scheduling algorithm [1] which is based on topology information of the network. In wireless sensor network applications, the nodes closer to the network's central point have to perform forwarding operations. Concurrently, they also have to process their own sensing packets. In high rate application, such nodes suffer from CPU overloading. In the priority scheduling scheme [2], which solves the overloading in simple FIFO CPU-scheduling in wireless sensor nodes, it is not ensured that these nodes will have fair chance to process their local sensing packets if the forwarding operations will be prioritized over their local processing. To guarantee processing and then sending the local packets, we introduce the scheme of switching in the priority according to the routing information in such nodes, so that they are able to complete their local tasks also. Our proposal enhances the fairness of the distributed sensing.

OriginalspracheEnglisch
Titel2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications
Seitenumfang6
Herausgeber (Verlag)IEEE
Erscheinungsdatum15.08.2008
Seiten1-6
Aufsatznummer4530162
ISBN (Print)978-1-4244-1751-3, 978-1-4244-1752-0
DOIs
PublikationsstatusVeröffentlicht - 15.08.2008
Veranstaltung2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications - Damascus, Syrien
Dauer: 07.04.200811.04.2008
Konferenznummer: 72900

Fingerprint

Untersuchen Sie die Forschungsthemen von „Adaptive Tasks Balancing in Wireless Sensor Networks“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren