Grouping tasks to save energy in a cyclic wireless sensor network scheduling problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00211280" target="_blank" >RIV/68407700:21230/13:00211280 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Grouping tasks to save energy in a cyclic wireless sensor network scheduling problem
Original language description
In order to improve the functionality and efficiency of industrial monitoring and control systems, the industries are looking toward ZigBee protocol, especially in environments where electricity is not available. We model the problem by a cyclic dependence graph with uniform constraints is to be scheduled so that some tasks are grouped in order to save energy. In this paper, we investigate the special case where the structure of the cyclic precedence graph is reduced to a collection of independent cycles, and where the grouping follows a topological structure of a chain or a tree (like in Zigbee). We show that a necessary condition that can be checked in polynomial time can also be stated and we propose an integer linear program to model the problem.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
BC - Theory and management systems
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP103%2F12%2F1994" target="_blank" >GAP103/12/1994: Adaptive scheduling and Optimization algorithms for distributed Real-time Embeddes Systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů