2012/11/01 by Barun Gorain, Gorain, Barun, Partha Sarathi Mandal +1
Computer Science · #C.1.4 #C.2.4 #Data Structures and Algorithms (cs.DS) #Distributed #Energy Efficient Wireless Sensor Networks #FOS: Computer and information sciences #H.5.3 #Mobile Ad Hoc Networks #Opportunistic and Delay-Tolerant Networks #Parallel #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1211.0157
openalex publication_date 2012/11/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Covering a bounded region with minimum number of homogeneous sensor nodes is a NP-complete problem \citeLi09. In this paper we have proposed an \it id based distributed algorithm for optimal coverage in an unbounded region. The proposed algorithm guarantees maximum spreading in O(√(n)) rounds without creating any coverage hole. The algorithm executes in synchronous rounds without exchanging any message. We have also explained how our proposed algorithm can achieve optimal energy consumption and handle random sensor node deployment for optimal spreading.