A probabilistic model of k-coverage in minimum cost wireless sensor networks

One of the fundamental problems in the wireless sensor networks is the coverage problem. The coverage problem fundamentally address the quality of service (surveillance or monitoring) provided in the desired area. In past, several studies have proposed different formulation and solutions to this problem. Nevertheless none of them has addressed minimum cost solution to the coverage problem. In this paper we consider minimum cost wireless sensor network which provides full coverage to any arbitrary geometric profile under deterministic/random deployment. We then formulate probabilistic coverage model which provides k coverage probability for minimum cost wireless sensor networks.1

• Type: Conference
• Year: 2008
• Where: CONEXT
• Authors: S. Ali Raza Zaidi, Maryam Hafeez, Desmond C. McLernon, Mounir Ghogho
• Keywords: Computer Networks, CONEXT 2008, Coverage Problem, Minimum Cost, Wireless Sensor Network