Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Intelligent fluid infrastructure for embedded networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
A distributed coordination framework for wireless sensor and actor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Topological hole detection in wireless sensor networks and its applications
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Deployment analysis in underwater acoustic wireless sensor networks
WUWNet '06 Proceedings of the 1st ACM international workshop on Underwater networks
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
A Distributed Connectivity Restoration Algorithm in Wireless Sensor and Actor Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Sink repositioning for enhanced performance in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Coverage, exploration, and deployment by a mobile robot and communication network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
A fast distributed approximation algorithm for minimum spanning trees
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Real-Time coordination and routing in wireless sensor and actor networks
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Movement control algorithms for realization of fault-tolerant ad hoc robot networks
IEEE Network: The Magazine of Global Internetworking
Clustering of wireless sensor and actor networks based on sensor distribution and connectivity
Journal of Parallel and Distributed Computing
Simple movement control algorithm for bi-connectivity in robotic sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Connectivity restoration in delay-tolerant sensor networks using game theory
International Journal of Ad Hoc and Ubiquitous Computing
Handling large-scale node failures in mobile sensor/robot networks
Journal of Network and Computer Applications
Application-centric recovery algorithm for wireless sensor and actor networks
International Journal of Communication Networks and Distributed Systems
A cooperative pursuit-evasion game in wireless sensor and actor networks
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Wireless sensor and actor networks (WSANs) have recently emerged with the idea of combining wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs). In addition to resource constrained sensors, resource rich and mobile actor nodes are employed in WSANs. These actors can collect data from the sensors and perform appropriate actions as a result of processing such data. To perform the actions at all parts of the region in a timely manner, the actors should be deployed in such a way that they might be able to communicate with each other and cover the whole monitored area. This requires that the actors should be placed carefully prior to network operation in order to maximize the coverage and maintain the inter-actor connectivity. In this paper, we propose a distributed actor deployment algorithm that strives to maximize the coverage of actors without violating the connectivity requirement. The approach applies repelling forces between neighboring actors and from the sensors that sit on the boundaries in order to spread them in the region. The spreading of the nodes is done using a tree of actors which can provide more freedom for the movement of the nodes but at the same time maintain the required connectivity among the nodes. We present two techniques for creation of such an actor tree which are based on local pruning of the actor links and spanning tree of the inter-actor network. The performance of our approach is validated both analytically and experimentally.