Single-Actor selection algorithms for wireless sensor and actor networks

  • Authors:

  • ZhenYang Xu;GuangSheng Zhang;Jie Qin;WenHua Dou

  • Affiliations:

  • Computer Institute, National University of Defense Technology, Changsha Hunan, China;Computer Institute, National University of Defense Technology, Changsha Hunan, China;School of information Science and Engineering, Henan University of Technology, Zhengzhou Henan, China;Computer Institute, National University of Defense Technology, Changsha Hunan, China

  • Venue:
  • WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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. Due to many actors, an important problem appears: which sensor(s) communicate with which actor(s). In this paper, a linear programming of single-actor selection for event-driven data model is put forward from event reliability and time constraints for WSANs. Then some approximate algorithms, such as MECT (Minimum Energy Cost Tree) and MPLCT (Minimum Path Length Cost Tree), are addressed from path length and energy aspects respectively. Since those approximate solutions need the whole state, and can't adapt to WSANs, so a distributed approximate algorithm HBMECT (Hop-Bound and Minimum Energy Cost Tree) is proposed from both energy and delay. In the performance evaluation, those algorithms are compared from average number of hops and energy consumption.