Relay-Bounded Single-Actor Selection Algorithms for Wireless Sensor and Actor Networks

• Published in: Advances in Natural Computation pp. 416 - 427
• Main Authors: Xu, ZhenYang, Qin, Jie, Zhang, GuangSheng, Dou, WenHua
• Format: Book Chapter Conference Proceeding
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2006; Springer
• Series: Lecture Notes in Computer Science
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Energy Efficiency; Exact sciences and technology; Real-Time Communications; Relay-Bound; Software; Theoretical computing; Wireless Sensor and Actor Networks; Performance evaluation; Selection problem; Measurement sensor; Minimax method; Multiobjective programming; Analog calculus; Wireless network; Minimum energy; Distributed system; Sensor array; Real time
• ISBN: 3540459073; 9783540459071; 9783540459019; 3540459014
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/11881223_51

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.