a hop-bounded single-actor selection algorithm for wireless sensor and actor networks
Wireless sensor and actor networks (WSANs) are composed of a large number of sensors and a small number of (mobile) resource-rich actors. Sensors gather information about the physical phenomenon, while actors take decisions and then perform appropriate actions upon the environment.In this paper, a single-actor selection algorithm for WSANs is addressed from hops and energy constraints. The corresponding optimal solution HBMECT (Hop-Bounded and Minimum Energy Cost Tree) is determined by integer linear programming (ILP). And then, a distributed approximate algorithm of HBMECT is provided.In the performance evaluation, the approximate algorithm of HBMECT is compared with MECT (Minimum Energy Cost Tree) and MPCT (Minimum Path Cost Tree) algorithms.
hop-bounded wireless sensor and actor networks real-time communications energy efficiency