From: Resource-aware task scheduling by an adversarial bandit solver method in wireless sensor networks
Notation | Meaning |
---|---|
\(\hat {N}\) | Set of nodes WSN consists of |
(u i ,v i ) | Known position of a node |
r i | Sensing range of node i |
R i | Communication range of node i |
\(\hat {A}\) | Set of available actions |
E i | Available resources of node i |
\(\tilde {E}_{j}\) | Required resources for task execution |
P | Overall performance |