A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Science of Computer Programming - Special issue on COST 247, verification and validation methods for formal descriptions
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Improved Approximations of Independent Dominating Set in Bounded Degree Graphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
A Distributed Connectivity Restoration Algorithm in Wireless Sensor and Actor Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
Coverage and latency aware actor placement mechanisms in WSANs
International Journal of Sensor Networks
Maximizing connected coverage via controlled actor relocation in wireless sensor and actor 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
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Movement control algorithms for realization of fault-tolerant ad hoc robot networks
IEEE Network: The Magazine of Global Internetworking
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Modelling and analysis of strategies in the design of WSAN coordination systems
Journal of Parallel and Distributed Computing
A multi-criteria target monitoring strategy using MinMax operator in formed virtual sensor networks
ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part III
A cooperative pursuit-evasion game in wireless sensor and actor networks
Journal of Parallel and Distributed Computing
ISNN'13 Proceedings of the 10th international conference on Advances in Neural Networks - Volume Part II
| Hi-index | 0.00 |
Wireless Sensor and Actor Networks (WSANs) employ significantly more capable actor nodes that can collect data from sensors and perform application specific actions. To take these actions collaboratively at any spot in the monitored regions, maximal actor coverage along with inter-actor connectivity is desirable. In this paper, we propose a distributed actor positioning and clustering algorithm which employs actors as cluster-heads and places them in such a way that the coverage of actors is maximized and the data gathering and acting times are minimized. Such placement of actors is done by determining the k-hop Independent Dominating Set (IDS) of the underlying sensor network. Basically, before the actors are placed, the sensors pick the cluster-heads based on IDS. The actors are then placed at the locations of such cluster-heads. We further derive conditions to guarantee inter-actor connectivity after the clustering is performed. If inter-connectivity does not exist, the actors coordinate through the underlying sensors in their clusters to adjust their locations so that connectivity can be established. The performances of the proposed approaches are validated through simulations.