Download Now Free registration required
Although the problem of k-area coverage has been intensively investigated for dense Wireless Sensor Networks (WSNs), how to arrive at a k-coverage sensor deployment that optimizes certain objectives in relatively sparse WSNs still faces both theoretical and practical difficulties. In this paper, the authors present a practical algorithm LAACAD (Load bAlancing k-Area Coverage through Autonomous Deployment) to move sensor nodes toward k-area coverage, aiming at minimizing the maximum sensing range required by the nodes. LAACAD enables purely autonomous node deployment as it only entails localized computations.
- Format: PDF
- Size: 4792.32 KB