An SMT-based accurate algorithm for the K-coverage problem in sensor network

Weiqiang Kong, Ming Li, Long Han, Akira Fukuda

Research output: Contribution to conferencePaperpeer-review

5 Citations (Scopus)

Abstract

In the context of wireless sensor network (WSN), the K-Coverage problem denotes that each point in a certain network area is covered by at least K sensors at the same time so as to guarantee the quality of services provided by the WSN. In this paper, we first propose a bottom-up modeling method for the K-coverage problem. Based on this method, we investigate a set of iteratively-applicable simplification techniques for simplifying the problem. Furthermore, we propose a satisfiability modulo theory (SMT) based algorithm for computing an accurate solution to the K-coverage problem. Experimental results have shown that our proposed simplification techniques and algorithm provide sufficiently satisfiable performance with respect to both computing speed and problem size.

Original languageEnglish
Pages240-245
Number of pages6
Publication statusPublished - Jan 1 2014
Event8th International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, UBICOMM 2014 - Rome, Italy
Duration: Aug 24 2014Aug 28 2014

Other

Other8th International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, UBICOMM 2014
CountryItaly
CityRome
Period8/24/148/28/14

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Software

Fingerprint Dive into the research topics of 'An SMT-based accurate algorithm for the K-coverage problem in sensor network'. Together they form a unique fingerprint.

Cite this