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 conferencePaper

4 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

Fingerprint

Sensor networks
Wireless sensor networks
Quality of service
Sensors

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Software

Cite this

Kong, W., Li, M., Han, L., & Fukuda, A. (2014). An SMT-based accurate algorithm for the K-coverage problem in sensor network. 240-245. Paper presented at 8th International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, UBICOMM 2014, Rome, Italy.

An SMT-based accurate algorithm for the K-coverage problem in sensor network. / Kong, Weiqiang; Li, Ming; Han, Long; Fukuda, Akira.

2014. 240-245 Paper presented at 8th International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, UBICOMM 2014, Rome, Italy.

Research output: Contribution to conferencePaper

Kong, W, Li, M, Han, L & Fukuda, A 2014, 'An SMT-based accurate algorithm for the K-coverage problem in sensor network' Paper presented at 8th International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, UBICOMM 2014, Rome, Italy, 8/24/14 - 8/28/14, pp. 240-245.
Kong W, Li M, Han L, Fukuda A. An SMT-based accurate algorithm for the K-coverage problem in sensor network. 2014. Paper presented at 8th International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, UBICOMM 2014, Rome, Italy.
Kong, Weiqiang ; Li, Ming ; Han, Long ; Fukuda, Akira. / An SMT-based accurate algorithm for the K-coverage problem in sensor network. Paper presented at 8th International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, UBICOMM 2014, Rome, Italy.6 p.
@conference{9077c98715b04ec488523f694d2f87cb,
title = "An SMT-based accurate algorithm for the K-coverage problem in sensor network",
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.",
author = "Weiqiang Kong and Ming Li and Long Han and Akira Fukuda",
year = "2014",
month = "1",
day = "1",
language = "English",
pages = "240--245",
note = "8th International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, UBICOMM 2014 ; Conference date: 24-08-2014 Through 28-08-2014",

}

TY - CONF

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

AU - Kong, Weiqiang

AU - Li, Ming

AU - Han, Long

AU - Fukuda, Akira

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84924454869&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84924454869&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:84924454869

SP - 240

EP - 245

ER -