Grouping tasks to save energy in a cyclic wireless sensor network scheduling problem

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Grouping tasks to save energy in a cyclic wireless sensor network scheduling problem

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Grouping tasks to save energy in a cyclic wireless sensor network scheduling problem

Popis výsledku anglicky

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.

Druh

O - Ostatní výsledky

CEP obor

BC - Teorie a systémy řízení

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP103%2F12%2F1994" target="_blank" >GAP103/12/1994: Adaptivní algoritmy pro rozvrhování a optimalizaci distribuovaných vestavěných real-time systémů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů