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

Weiqiang Kong, Ming Li, Long Han, Akira Fukuda

研究成果: Contribution to conferencePaper査読

5 被引用数 (Scopus)

抄録

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.

本文言語英語
ページ240-245
ページ数6
出版ステータス出版済み - 1 1 2014
イベント8th International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, UBICOMM 2014 - Rome, イタリア
継続期間: 8 24 20148 28 2014

その他

その他8th International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies, UBICOMM 2014
Countryイタリア
CityRome
Period8/24/148/28/14

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Software

フィンガープリント 「An SMT-based accurate algorithm for the K-coverage problem in sensor network」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル