A trust-based probabilistic coverage algorithm for wireless sensor

Research output: Contribution to journalArticleAcademicpeer-review

15 Citations (Scopus)
27 Downloads (Pure)

Abstract

Sensing coverage is a fundamental issue for many applications in wireless sensor networks. Due to sensors resource limitations, inherent uncertainties associated with their measurements, and the harsh and dynamic environment in which they are deployed, having a QoS-aware coverage scheme is a must. In this paper, we propose a Trust-based Probabilistic Coverage algorithm, which leverages the trust concept to tackle the uncertainties introduced by the nodes and the environment, in which they operate. We formulate this problem as an Integer Linear Programming (ILP) problem, which is able to always guarantee the required QoS despite uncertainties introduced by node and/or environment. In consideration of the limitation of ILP, we also put forward a greedy heuristic algorithm to achieve almost the same ILP results without suffering from complexities imposed by ILP. We examine our heuristic with different input parameters and compare it with the ILP approach. Simulation results are presented to verify our approaches.
Original languageUndefined
Pages (from-to)455-464
Number of pages10
JournalProcedia computer science
Volume21
DOIs
Publication statusPublished - 20 Oct 2013

Keywords

  • EWI-23889
  • IR-88332
  • METIS-300117

Cite this

@article{039d7ea884664bd792b7f732baca96d7,
title = "A trust-based probabilistic coverage algorithm for wireless sensor",
abstract = "Sensing coverage is a fundamental issue for many applications in wireless sensor networks. Due to sensors resource limitations, inherent uncertainties associated with their measurements, and the harsh and dynamic environment in which they are deployed, having a QoS-aware coverage scheme is a must. In this paper, we propose a Trust-based Probabilistic Coverage algorithm, which leverages the trust concept to tackle the uncertainties introduced by the nodes and the environment, in which they operate. We formulate this problem as an Integer Linear Programming (ILP) problem, which is able to always guarantee the required QoS despite uncertainties introduced by node and/or environment. In consideration of the limitation of ILP, we also put forward a greedy heuristic algorithm to achieve almost the same ILP results without suffering from complexities imposed by ILP. We examine our heuristic with different input parameters and compare it with the ILP approach. Simulation results are presented to verify our approaches.",
keywords = "EWI-23889, IR-88332, METIS-300117",
author = "Zahra Taghikhaki and Nirvana Meratnia and Havinga, {Paul J.M.}",
note = "Open access. The 4th International Conference on Emerging Ubiquitous Systems and Pervasive Networks (EUSPN-2013) and the 3rd International Conference on Current and Future Trends of Information and Communication Technologies in Healthcare (ICTH)",
year = "2013",
month = "10",
day = "20",
doi = "10.1016/j.procs.2013.09.061",
language = "Undefined",
volume = "21",
pages = "455--464",
journal = "Procedia computer science",
issn = "1877-0509",
publisher = "Elsevier",

}

A trust-based probabilistic coverage algorithm for wireless sensor. / Taghikhaki, Zahra; Meratnia, Nirvana; Havinga, Paul J.M.

In: Procedia computer science, Vol. 21, 20.10.2013, p. 455-464.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - A trust-based probabilistic coverage algorithm for wireless sensor

AU - Taghikhaki, Zahra

AU - Meratnia, Nirvana

AU - Havinga, Paul J.M.

N1 - Open access. The 4th International Conference on Emerging Ubiquitous Systems and Pervasive Networks (EUSPN-2013) and the 3rd International Conference on Current and Future Trends of Information and Communication Technologies in Healthcare (ICTH)

PY - 2013/10/20

Y1 - 2013/10/20

N2 - Sensing coverage is a fundamental issue for many applications in wireless sensor networks. Due to sensors resource limitations, inherent uncertainties associated with their measurements, and the harsh and dynamic environment in which they are deployed, having a QoS-aware coverage scheme is a must. In this paper, we propose a Trust-based Probabilistic Coverage algorithm, which leverages the trust concept to tackle the uncertainties introduced by the nodes and the environment, in which they operate. We formulate this problem as an Integer Linear Programming (ILP) problem, which is able to always guarantee the required QoS despite uncertainties introduced by node and/or environment. In consideration of the limitation of ILP, we also put forward a greedy heuristic algorithm to achieve almost the same ILP results without suffering from complexities imposed by ILP. We examine our heuristic with different input parameters and compare it with the ILP approach. Simulation results are presented to verify our approaches.

AB - Sensing coverage is a fundamental issue for many applications in wireless sensor networks. Due to sensors resource limitations, inherent uncertainties associated with their measurements, and the harsh and dynamic environment in which they are deployed, having a QoS-aware coverage scheme is a must. In this paper, we propose a Trust-based Probabilistic Coverage algorithm, which leverages the trust concept to tackle the uncertainties introduced by the nodes and the environment, in which they operate. We formulate this problem as an Integer Linear Programming (ILP) problem, which is able to always guarantee the required QoS despite uncertainties introduced by node and/or environment. In consideration of the limitation of ILP, we also put forward a greedy heuristic algorithm to achieve almost the same ILP results without suffering from complexities imposed by ILP. We examine our heuristic with different input parameters and compare it with the ILP approach. Simulation results are presented to verify our approaches.

KW - EWI-23889

KW - IR-88332

KW - METIS-300117

U2 - 10.1016/j.procs.2013.09.061

DO - 10.1016/j.procs.2013.09.061

M3 - Article

VL - 21

SP - 455

EP - 464

JO - Procedia computer science

JF - Procedia computer science

SN - 1877-0509

ER -