Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLi, Fengen
dc.contributor.authorLuo, Junen
dc.contributor.authorXin, Shi-Qingen
dc.contributor.authorWang, Wen-Pingen
dc.contributor.authorHe, Yingen
dc.description.abstractAlthough 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, we 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. We prove the convergence of the algorithm, as well as the (local) optimality of the output. We also show that our optimization objective is closely related to other frequently considered objectives. Therefore, our practical algorithm design also contributes to the theoretical understanding of the k-area coverage problem. Finally, we use extensive simulation results both to confirm our theoretical claims and to demonstrate the efficacy of LAACAD.en
dc.subjectDRNTU::Engineering::Computer science and engineeringen
dc.titleLAACAD : load balancing k-area coverage through autonomous deployment in wireless sensor networksen
dc.typeConference Paperen
dc.contributor.schoolSchool of Computer Engineeringen
dc.contributor.conferenceIEEE International Conference on Distributed Computing Systems (32nd : 2012 : Macau)en
item.fulltextNo Fulltext-
Appears in Collections:SCSE Conference Papers

Citations 20

Updated on Nov 26, 2022

Web of ScienceTM
Citations 20

Updated on Dec 1, 2022

Page view(s) 10

Updated on Dec 6, 2022

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.