Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit
IEEE/ACM Transactions on Networking (TON)
Habitat monitoring: application driver for wireless communications technology
SIGCOMM LA '01 Workshop on Data communication in Latin America and the Caribbean
Research challenges in wireless networks of biomedical sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Energy Efficient Multi-Hop Polling in Clusters of Two-Layered Heterogeneous Sensor Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
IEEE Communications Magazine
Crash faults identification in wireless sensor networks
Computer Communications
Autonomous Deployment of Self-Organizing Mobile Sensors for a Complete Coverage
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
Localized Sensor Self-deployment with Coverage Guarantee in Complex Environment
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
An adaptive mobile robots tethering algorithm in constrained environments
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Can you see me now? sensor positioning for automated and persistent surveillance
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours
Computer Networks: The International Journal of Computer and Telecommunications Networking
Localized sensor self-deployment for guaranteed coverage radius maximization
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Mobile sensor deployment in unknown fields
INFOCOM'10 Proceedings of the 29th conference on Information communications
Design and implementation of a navigation system for autonomous mobile robots
International Journal of Ad Hoc and Ubiquitous Computing
Wireless Personal Communications: An International Journal
On Adaptive Density Deployment to Mitigate the Sink-Hole Problem in Mobile Sensor Networks
Mobile Networks and Applications
The critical-square-grid coverage problem in wireless sensor networks is NP-Complete
Computer Networks: The International Journal of Computer and Telecommunications Networking
A moving algorithm for non-uniform deployment in mobile sensor networks
International Journal of Autonomous and Adaptive Communications Systems
Flocking based distributed self-deployment algorithms in mobile sensor networks
Journal of Parallel and Distributed Computing
Flocking based sensor deployment in mobile sensor networks
Computer Communications
Self organization for area coverage maximization and energy conservation in mobile ad hoc networks
Transactions on Computational Science XV
A Best Fit Relocation Approach for Heterogeneous Sensor Networks
Wireless Personal Communications: An International Journal
Rolling dispersion for robot teams
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 14.98 |
In this paper, we present a novel sensor deployment algorithm, called the adaptive triangular deployment (ATRI) algorithm, for large-scale unattended mobile sensor networks. The ATRI algorithm aims at maximizing coverage area and minimizing coverage gaps and overlaps by adjusting the deployment layout of nodes close to equilateral triangulation, which is proven to be the optimal layout to provide the maximum no-gap coverage. The algorithm only needs the location information of nearby nodes, thereby avoiding communication cost for exchanging global information. By dividing the transmission range into six sectors, each node adjusts the relative distance to its one-hop neighbors in each sector separately. The distance threshold strategy and the movement state diagram strategy are adopted to avoid the oscillation of nodes. The simulation results show that the ATRI algorithm achieves a much larger coverage area and smaller average moving distance of nodes than existing algorithms. We also show that the ATRI algorithm is applicable to practical environments and tasks such as working in both bounded and unbounded areas and avoiding irregularly shaped obstacles. In addition, the density of nodes can be adjusted adaptively to different requirements of tasks.