Relay-Bounded single-actor selection algorithms for wireless sensor and actor networks

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

  • Affiliations:
  • 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;Computer Institute, National University of Defense Technology, Changsha, Hunan, China

  • Venue:
  • ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
  • 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. Real time and network lifetime are important factors of WSANs. So in this paper, a single-actor selection problem for WSANs is addressed from real time and nodes' Relay Bound constraints first, and then a multi-objective programming is provided. After that, two approximate algorithms, Global Relay-Bounded and MIN-MAX Hops (GRBMMH) and Distributed Relay-Bounded and MIN-MAX Hops (DRBMMH), are put forward. In the performance evaluation, those algorithms are compared with MECT (Minimum Energy Cost Tree) and MPLCT (Minimum Path Length Cost Tree) algorithms.