A trust-based probabilistic coverage algorithm for wireless sensor

Zahra Taghikhaki, Nirvana Meratnia, Paul J.M. Havinga

    Research output: Contribution to journalConference articleAcademicpeer-review

    23 Citations (Scopus)
    64 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 languageEnglish
    Pages (from-to)455-464
    Number of pages10
    JournalProcedia computer science
    Volume21
    DOIs
    Publication statusPublished - 20 Oct 2013
    Event4th International Conference on Emerging Ubiquitous Systems and Pervasive Networks, EUSPN 2013 - Niagara Falls, Canada
    Duration: 21 Oct 201324 Oct 2013
    Conference number: 4

    Fingerprint

    Dive into the research topics of 'A trust-based probabilistic coverage algorithm for wireless sensor'. Together they form a unique fingerprint.

    Cite this