Real-time obstacle avoidance for manipulators and mobile robots
International Journal of Robotics Research
Computational Geometry in C
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Coding Theory Framework for Target Location in Distributed Sensor Networks
ITCC '01 Proceedings of the International Conference on Information Technology: Coding and Computing
A Bidding Protocol for Deploying Mobile Sensors
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Sensor deployment and target localization in distributed sensor networks
ACM Transactions on Embedded Computing Systems (TECS)
Optimizing sensor movement planning for energy efficiency
ISLPED '05 Proceedings of the 2005 international symposium on Low power electronics and design
Middleware: Middleware Challenges and Approaches for Wireless Sensor Networks
IEEE Distributed Systems Online
Movement-Assisted Sensor Deployment
IEEE Transactions on Mobile Computing
The coverage problem in a wireless sensor network
Mobile Networks and Applications
On the Path Coverage Properties of Random Sensor Networks
IEEE Transactions on Mobile Computing
Deploying Wireless Sensor Networks under Limited Mobility Constraints
IEEE Transactions on Mobile Computing
The design space of wireless sensor networks
IEEE Wireless Communications
Energy-efficient deployment of Intelligent Mobile sensor networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Scan-Based Movement-Assisted Sensor Deployment Methods in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Coverage is a fundamental problem in sensor networks. Sensor coverage, which reflects how well a sensor network is monitored by sensors, is an important measure for the quality of service (QoS) that a sensor network can provide. In mobile sensor networks, the mobility of sensor nodes can be utilized to enhance the coverage of the network. Since the movement of sensor nodes will consume much energy, this mobility of sensor nodes should be properly managed by some pre-defined schemes or protocols. By noticing this issue, some existing works have proposed several movement-assisted sensor deployment schemes. These works assume that the target field is a 2-dimensional space. In this paper, we study a generalized case of this problem whereby the target field can be a space which ranges from 1-dimensional to 3-dimensional. Two variations of the movement-assisted sensor deployment problem with different optimization objectives were formulated. We identify a set of basic attributes which can be used as guidelines for designing movement-assisted sensor deployment schemes. Based on these attributes, we propose efficient algorithms for both variants of the movement-assisted sensor deployment problem.