Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
An Energy-Aware QoS Routing Protocol for Wireless Sensor Networks
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
SPEED: A Stateless Protocol for Real-Time Communication in Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Optimizing the Placement of Internet TAPs in Wireless Neighborhood Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
A distributed coordination framework for wireless sensor and actor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Distributed data gathering in multi-sink sensor networks with correlated sources
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
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.