Affiliation:
1. Hofstra University, Hempstead, NY
2. University of Texas at Arlington, TX
Abstract
Connectivity
, primarily a graph-theoretic concept, helps define the
fault tolerance
of wireless sensor networks (WSNs) in the sense that it enables the sensors to communicate with each other so their sensed data can reach the sink. On the other hand,
sensing coverage
, an intrinsic architectural feature of WSNs plays an important role in meeting application-specific requirements, for example, to reliably extract relevant data about a sensed field. Sensing coverage and network connectivity are not quite orthogonal concepts. In fact, it has been proven that connectivity strongly depends on coverage and hence considerable attention has been paid to establish tighter connection between them although only loose lower bound on network connectivity of WSNs is known. In this article, we investigate connectivity based on the degree of sensing coverage by studying
k-covered
WSNs, where every location in the field is simultaneously covered (or sensed) by at least
k
sensors (property known as
k-coverage
, where
k
is the
degree of coverage
). We observe that to derive network connectivity of
k
-covered WSNs, it is necessary to compute the sensor spatial density required to guarantee
k
-coverage. More precisely, we propose to use a model, called the
Reuleaux Triangle
, to characterize
k
-coverage with the help of Helly's Theorem and the analysis of the intersection of sensing disks of
k
sensors. Using a deterministic approach, we show that the sensor spatial density to guarantee
k
-coverage of a convex field is proportional to
k
and inversely proportional to the sensing range of the sensors. We also prove that network connectivity of
k
-covered WSNs is higher than their sensing coverage
k
. Furthermore, we propose a new measure of fault tolerance for
k
-covered WSNs, called
conditional fault tolerance
, based on the concepts of
conditional connectivity
and
forbidden faulty sensor set
that includes all the neighbors of a given sensor. We prove that
k
-covered WSNs can sustain a large number of sensor failures provided that the faulty sensor set does not include a forbidden faulty sensor set.
Publisher
Association for Computing Machinery (ACM)
Subject
Software,Computer Science (miscellaneous),Control and Systems Engineering
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献