Introduction to algorithms
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless Sensor Networks: Technology, Protocols, and Applications
Wireless Sensor Networks: Technology, Protocols, and Applications
Bidding Protocols for Deploying Mobile Sensors
IEEE Transactions on Mobile Computing
Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks
IEEE Transactions on Computers
Optimal and approximate approaches for deployment of heterogeneous sensing devices
EURASIP Journal on Wireless Communications and Networking
How mutation and selection solve long-path problems in polynomial expected time
Evolutionary Computation
Vineyard Computing: Sensor Networks in Agricultural Production
IEEE Pervasive Computing
Monitoring user activities in smart home environments
Information Systems Frontiers
Runtime analysis of a simple ant colony optimization algorithm
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
IEEE Transactions on Evolutionary Computation
IEEE Communications Magazine
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
The heterogeneity of sensing devices has to be taken into account for increasing the network performance and lifetime. This paper presents a study for the sensor relocation problem based on the heterogeneity point of view. A novel approach named Best Fit Relocation Approach, BFRA, is proposed for heterogeneous sensors in order to maximize the coverage of the monitored field and guarantee the connectivity of the deployed sensors. This approach proposes new computational geometry algorithms with perfect complexity to be exploited in small and large-scale sensor networks. A simulation tool is proposed to perform a set of experiments to evaluate the proposed algorithms for different sensor characteristics taking into consideration the curly of field boundaries and the presence of obstacles. Simulation results show that near-optimal coverage performance could be achieved in much less both running time and average moving distance.