 Research Article
 Open Access
 Published:
Collaborative EventDriven Coverage and Rate Allocation for Event MissRatio Assurances in Wireless Sensor Networks
EURASIP Journal on Wireless Communications and Networking volume 2010, Article number: 345052 (2010)
Abstract
Wireless sensor networks are often required to provide event missratio assurance for a given event type. To meet such assurances along with minimum energy consumption, this paper shows how a node's activation and rate assignment is dependent on its distance to event sources, and proposes a practical coverage and rate allocation (CORA) protocol to exploit this dependency in realistic environments. Both uniform event distribution and nonuniform event distribution are considered and the notion of ideal correlation distance around a clusterhead is introduced for onduty node selection. In correlation distance guided CORA, rate assignment assists coverage scheduling by determining which nodes should be activated for minimizing data redundancy in transmission. Coverage scheduling assists rate assignment by controlling the amount of overlap among sensing regions of neighboring nodes, thereby providing sufficient data correlation for rate assignment. Extensive simulation results show that CORA meets the required event missratios in realistic environments. CORA's joint coverage scheduling and rate allocation reduce the total energy expenditure by 85%, average battery energy consumption by 25%, and the overhead of source coding up to 90% as compared to existing rate allocation techniques.
1. Introduction
Wireless sensor networks usually consist of a large number of sensor nodes that collaboratively gather data from a target region of interest. A sensor network is expected to provide event missratio guarantees, while minimizing the energy consumption of its sensor nodes. The missratio for an event is equal to the fraction of those occurrences that are missed by wireless sensor nodes in a given time interval. While a sensor network can dynamically adapt its aggregate coverage in response to event misses, providing such assurances with minimum energy consumption is not easy due to the following problems. First, event occurrences may follow a nonuniform distribution. Consequently, two sensor nodes may detect a different number of events in a given interval even though their contribution to aggregate coverage of the network is the same. Second, minimizing the number of active nodes by reducing the overlapping areas among sensing regions of neighboring nodes often sacrifices their correlation. However, sensor data correlation can be exploited by distributed source coding for reducing the energy spent for data transmission which is a major component in overall system energy consumption [1, 2]. Inspired by these problems, this paper is the first of its kind to exploit the relationship between coverage scheduling (i.e., deciding which sensing unit(s) of each node should be activated) and source coding rate allocation (i.e., determining the number of bits that a sensor node should transmit for its sensor reading), and to show how they should cooperate. The main contributions of this research include the following.
We demonstrate the existence of an ideal correlator radius within cluster of sensor nodes around which onduty node selection will minimize the amount of data sensed and transmitted under both uniform and nonuniform event distributions.
CORA (COverage and Rate Allocation) Protocol is proposed to exploit ideal correlator radius concept via cooperation between eventbased scheduling and rate allocation. CORA schedules onduty nodes to achieve better accuracy on the coverage of the monitored area than existing algorithms and provides event missratio assurances even when nodes have no location information and there's noise in sensing ranges of nodes.
This paper develops a novel technique called differential data transmission to remove those data redundancies which cannot be eliminated via distributed source coding. Nonredundant data gathered by distributed source coding are compared with known reference data and then only its difference from the reference data are transmitted to the clusterhead.
We noticed that certain cluster members are critical for meeting the required event missratios energy efficiently due to their following two features. First, by taking advantage of their location in cluster topology, they can apply distributed source coding for other cluster members and significantly reduce data redundancy. Second, due to their proximity to the hotspots (i.e., regions with high event occurrence probabilities), they can detect majority of the event occurrences which are condensed around hotspots. Therefore, in CORA, rate allocation requests coverage scheduling to activate such critical cluster members within the ideal proximity of the clusterhead which we refer as correlator radius. Similarly, coverage scheduling helps rate allocation assign various rates to sensor nodes by determining which neighboring sensor nodes of a given sensor node should be put in sleep mode.
CORA's rate allocation first identifies the uniform/nonuniform distribution of event occurrences using a continuously updated histogram. Under nonuniform event distribution, those hotspot locations where the event occurrence probability is very high are determined. For both uniform and nonuniform event distributions, we then demonstrate the existence of an ideal radius around the clusterhead where the source coding gain is maximized. At the distance of ideal radius from clusterhead, our rate allocation algorithm forms groups of active nodes. Each group has a socalled correlator node that gathers data from its group members and transmits the aggregated data to its clusterhead. To further improve data reduction, we propose a new differential data transmission technique for correlator nodes. To the best of our knowledge, there is no previously known technique that assigns rates in accordance with the occurrence of the observed phenomena.
CORA's coverage scheduling is unique of its kind in guaranteeing the missratio required for each event without any need for location information of nodes. While activating less number of nodes than existing coverage scheduling algorithms to provide such assurances, coverage scheduling also relieves sensor nodes computation and storage overhead. To be of practical value, the coverage scheduling algorithm takes into account the effects of realistic environments on coverage such as the changes in sensing ability of nodes and the noise in distance measurements between node pairs.
The preliminary results of this research have appeared in [3, 4]. The rest of the paper is organized as follows. The related work is presented in Section 2. In Section 3, system model and assumptions are given. The problem we tackle is formally described in Section 4. Section 5 presents the CORA protocol. The performance evaluation of CORA is discussed in Section 6. The concluding remarks are made in Section 7.
2. Related Work
Coverage scheduling algorithms and distributed source coding techniques are usually addressed as two separate research fronts in the literature. CORA distinguishes itself from the existing solutions in closing the loop between these two research fronts.
Coverage Scheduling
Coverage scheduling in wireless sensor networks has received increasing attention in the recent years [5–15]. Some research efforts have considered coverage scheduling in conjunction with connectivity requirements [16, 17], bandwidth constraints [18], and target localization [19]. But, in none of the previously known coverage scheduling techniques, the impact of coverage scheduling on distributed source coding is addressed, even though distributed source coding efficiency depends on which set of sensor nodes gather data for an event. In comparison, CORA identifies the nodes that are critical for distributed source coding by keeping track of the event distribution. Then, only such critical nodes are put on duty to provide the variable coverage needed over the monitored area for minimizing event misses. CORA also uses less number of active nodes to meet the coverage needed than existing coverage scheduling techniques [5].
Rate Allocation
Distributed source coding [20, 21] and explicit communication [22] reduce the amount of data transmitted by taking advantage of the correlation structure between the sensor measurements. Let and be the data sources at two neighboring sensor nodes that have overlapping sensing areas and belong to the same cluster. In case of distributed source coding, the data of are sent as to the clusterhead which then informs about the correlation structure between the data of and . Finally, the data of are encoded as with side information in accordance with the SlepianWolf theorem [20]. In case of explicit communication, the node with source receives explicit side information from the node with source and decodes . Then, the data of is encoded as and sent to their clusterhead in addition to .
Recently, rate assignment algorithms are developed to determine the coding rates to be used by each sensor node [22–24]. These rate assignment algorithms usually focus on minimizing energy consumption and do not consider the overhead of distributed source coding. In CORA however, cooperative coverage scheduling and rate assignment activates and maintains correlation information only for those critical nodes that would maximize the energy saving of distributed source coding.
The main drawback of aforementioned existing rate allocation algorithms is that they usually assume uniform distribution of event occurrences. In our work, we address both uniform and nonuniform event distributions and show the ideal correlator radius for each case. In light of the ideal correlator radius, our rate allocation algorithm partitions on duty nodes into groups, each with a designated correlator node, and assigns rates within each group in response to the uniform/nonuniform distribution of event occurrences.
Rate allocation and network lifetime are very related to each other. For instance, in [25], rate allocation in wireless sensor networks is addressed under a given network lifetime requirement. This research work advocates the use of lexicographical maxmin rate allocation for all sensor nodes in order to avoid a severe bias in rate allocation when the objective is to maximize the sum of rates of all nodes.
Event MissRatio Assurances
The problem of eventmisses have been addressed by several node level scheduling algorithms [26–29]. The objective of such research efforts is to keep a node in low power modes as much as possible while processing event occurrences within their deadlines. However, these existing techniques do not provide any event missratio assurances and schedule events at a sensor node separately from its neighboring nodes. Such algorithms can not relieve a sensor node from processing those events that are also detected by its neighboring nodes. In comparison, CORA assigns each event only to some sensor nodes within a group of cluster members. Therefore, CORA significantly reduces the event processing load at each node.
3. System Model and Terminology
Network and Node Model
This paper focuses on dense wireless sensor networks which consists of multiple clusters that are formed based on node residual energy levels. We consider single hop clusters where each cluster member is within the direct transmission range of the clusterhead. The sensor nodes are static and have the same hardware capabilities. The distance between any two sensor nodes within a cluster is assumed to be known based on standard methods such as ReceivedSignalStrengthIndicator (RSSI) and Time of Arrival (ToA).
We consider the recent commercial offtheshelf sensor nodes that have multiple sensing units [30]. The sensor nodes do not have an attached GPS device but their positions within a cluster are estimated based on internode distances. The power control circuit of each sensing unit enables putting it in sleep or active mode [31]. The sensing unit consumes constant power level in active mode. The radio unit has dynamic transmission power control capability which enables sensor nodes to control their transmission range under the effect of environmental factors and multipath propagation. In order to transmit bits between two sensor nodes separated by a distance , the required power is modeled as for transmission and for reception where and are constants [32].
Coverage and Event Model
In sensor networks, different types of coverage models exist, (i) the monitored area consists of a discrete set of points and each point should be within the sensing region of at least one active node [12], (ii) the monitored area is a predefined contiguous region and the active sensor nodes should be covering each point within this region [10], and (iii) the monitored area is a contiguous region defined by the union of all individual nodes' sensing regions, and a subset of active nodes should cover the sensing regions of others [11]. In this paper, we focus on the third coverage model. We consider both uniform and nonuniform event distribution models. In uniform case, each node has the same event occurrence probability. To model nonuniform event distribution, however, random hotspot locations are created within the monitored area, and event occurrences follow the Gaussian distribution around these hotspot locations.
Data Correlation Model
For active sensor nodes that participate in source coding within the same group, a vector of entries keeps the mean values of their sensor readings and an matrix maintains their correlation. , where the random variable corresponds to the source sensor readings at active cluster member for . denotes the correlation degree between and active cluster member for .
The existing research efforts consider only internode distances while modeling sensor data correlation [33]. Given a set of nodes , their model calculate the nonredundant data produced by node based on the minimum Euclidean distance between node and any node for . However, this distancebased approach faces problems when node is very close to more than one member of the node set . In this case, the amount of nonredundant data generated by is actually much less than the amount that is approximated by their model. To address such cases and represent correlation more accurately, this paper models the data correlation among sensor nodes based on the overlapping area of their sensing regions. Specifically, the data correlation of active cluster members and is expressed as , where and denote the sensing regions of and active cluster members, respectively, for and is the sensing range.
The total number of bits in the sensed data of a group of sensor nodes is expressed based on their aggregate coverage. Specifically, if the entropy [34] of the source at a single cluster member is bits then the sensor nodes produce bits of nonredundant data where is the sensing region of node sensor node for . The number of entries in and indicate the storage overhead of source coding which is equal to . The update overhead of source coding is determined by the modifications made on and for each new event occurrence. Table 1 lists most of the notation used in the rest of the paper.
4. Problem Statement
Let us consider an event type to be sensed by a wireless sensor network. Let us assume that a discrete set of sensor nodes' sensing areas define the monitored area. Also let denote the point where sensor node is located for . Let us consider a short interval where at most one event can occur at location . We define two random variables and that correspond to the total number of event occurrences and the total number of event detections, respectively, within the monitored area. When the monitored area has total event occurrences, assumes the value for . Similarly, takes the value when total event occurrences are detected among number of event occurrences for . Also let us define the inputs and outputs of the problem as follows.

(i)
Inputs:

(a)
: the required event missratio threshold for event ,

(b)
: the sensing area of sensor node at location for ,

(c)
: probability of event occurrence at for ,

(d)
: probability that takes value for .

(a)

(ii)
Outputs:

(a)
: the observed (actual) event missratio for event ,

(b)
: probability of event detection at for ,

(c)
: the energy consumption of active sensor nodes for data transmission with their assigned rates at location for ,

(d)
: probability that takes value for .

(a)
The problem of this paper is to show that the proposed protocol CORA guarantees that the observed event missratio is less than or equal to the required event missratio
and minimize the total energy consumption of all active sensor nodes
where and (i.e., the expected values of and , resp.) are written as
There are two extreme cases for . At one extreme, the observed event missratio is becoming equal to one when all event occurrences are missed. The other extreme occurs when all event occurrences are detected, thereby making the observed event missratio equal to zero.
Among the aforementioned probability values, depends on the distribution of event occurrences. is controlled by the aggregate coverage of active sensor nodes. is computed by considering all possible combinations of the locations for having total events in the monitored area for . As an example, let us derive a close expression for where there exists a single event in the entire monitored area. The probability, say , that a single event occurs at location is equal to the probability of event occurrence at location times the product of all those probabilities of not having event occurrences at the remaining grid locations for . is equal to the sum of all s over locations. Thus,
Since there is no close formula for for we provide Algorithm Probability Computation for to express . is computed similar to with the exception that it depends on not only the probability of event occurrences but also their probability of detection. For example, is expressed as
where
5. CORA Protocol for Event MissRatio Assurances
We first give in this section an overview of how CORA provides event missratio assurances with minimum energy consumption. The network lifetime is divided into consecutive rounds and CORA performs coverage scheduling and rate assignment at the beginning of each round. The roundbased operation enables CORA to take the recent node residual energy information into account. At each location , coverage scheduling and rate assignment control and respectively, for . Meanwhile, CORA enables eventdriven cooperation of coverage scheduling and rate assignment in two phases.
In Phase I, event distribution is identified using a continuously updated histogram. Depending on whether the event distribution is uniform or nonuniform, the ideal correlator radius is found for each cluster. As we will show, there exists a single correlator radius within the cluster for uniform event distribution such as the one depicted in Figure 1. For nonuniform event distributions as illustrated in Figure 2, a local correlator radius exists for each hotspot. The local correlator radii of all hotspots are combined to find the cluster level global correlator radius. Under the guidance of the correlator radius, correlator nodes are selected and cluster members form groups around correlator nodes for rate assignment.
In Phase II, those critical nodes which significantly improve the energy consumption of the cluster are identified from their assigned rates. Coverage scheduling then activates only those critical nodes for improving energy consumption and meeting the required event missratios. Since Phase I differs for uniform and nonuniform event distributions, the steps of Phase I are described next separately for uniform and nonuniform event distributions.
5.1. Phase I for Uniform Event Distribution
The expected amount of data generated by each node is the same under uniform event distribution. Therefore, the locations of sensor nodes within the cluster topology plays the key role for overall energy consumption. In this section, we study how distance of correlator nodes to the clusterhead affects the energy expenditure. Let us refer to this distance as where the subscript denotes the correlator radius and . Let be the ideal value which maximizes the energy gain of distributed source coding by correlator nodes relative to the case when cluster members transmit data directly to the clusterhead. In what follows, we will explain how is found in Step I of Protocol CORA by formulating this energy gain as a function of . We will then describe the allocation of coding rates in accordance with .
We now analyze the energy consumption for a cluster of wireless sensor nodes when distributed source coding is applied at a given distance from the clusterhead (i.e., when correlator nodes have distance to the clusterhead). The first question we answer in this analysis is the following: For which cluster members would correlator nodes yield any improvement in energy consumption? Especially within the close proximity of the clusterhead, transmitting data directly to the clusterhead (i.e., bypassing the correlators) should be preferable over sending data through the correlator nodes.
Let us call the union of those locations from where the sensed data should be sent directly to the clusterhead as Direct Transmission Region (DTR). Let denote the radius of where the subscript refers to direct data transmission. The donut shaped region obtained by excluding the from the clusterhead transmission region is referred to as Distributed Source Coding Region (DSCR). Figure 3 illustrates and in blue and red colors, respectively.
To identify , we find the relationship between and . Specifically, we consider the energy consumed for gathering data from any cluster member with distance to the clusterhead where . Note that the energy consumption of node should be the same in direct data transmission and distributed source coding cases since node is located on the boundary of . Let us refer to the energy consumption of node when it uses direct transmission to the clusterhead as . Let be the energy consumption of when its data reach the clusterhead indirectly through correlator nodes.
When node bypasses the correlators, the entropy of the source at node is transmitted over distance to the clusterhead. Based on the energy model given in Section 3, would be
When correlator nodes apply distributed source coding at distance from the clusterhead, sends only nonredundant data to the correlator node which are then forwarded to the clusterhead. Thus, we next consider the expected amount of data transmitted by node when data redundancy is eliminated by distributed source coding.
The redundancy in node 's data is attributed to the overlap of node 's sensing region with the sensing regions of its neighboring nodes. Consequently, we need to find how much of the area within the sensing range of a node is covered only by the node itself. When there is coverage redundancy within the cluster, the expected size of the common area covered by node with its neighboring nodes is
where refers to the coverage area of the cluster and the term denotes the maximum area that can be covered by cluster members. If there is no coverage redundancy (i.e., no overlap among sensing regions of neighboring nodes), then the size of the common area becomes zero. Following these observations, let us define as the ratio of a node's sensing region that is covered exclusively by the node itself where . With the assumption that coverage redundancy is uniformly distributed among cluster members, is expressed as
Let us also assume that the task of covering the common areas (i.e., the regions that are covered by at least two cluster members) is evenly distributed among all cluster members. We introduce the variable as the expected ratio of the common areas covered by a sensor node to its overall sensing region where . Since any area within the cluster that is not covered only by a single sensor node belongs to the common area, is expressed as
From the exclusive and common areas covered by node , we can now determine the amount of nonredundant data transmitted by node and express . Specifically,
where represents the ratio of the rate control message size to the data message size. First, rate information is transmitted from the correlator to node over distance . Then, node codes sensor data with the assigned rate. The data received by the correlator node are transmitted to the clusterhead over distance .
Let refer to the value substitution of which to (7) and (11) yields the same energy consumption for and , respectively. The term is included in subscript to indicate that is dependent on the value. Since refers to the radius of , a cluster member uses direct data transmission to the clusterhead if its distance to the clusterhead is less than . Otherwise, the data of the cluster member are sent to its designated correlator node. In light of this selection criteria for data transmission, we next define the energy gain function of correlator nodes for any given value.
Let denote the energy consumption for gathering data from the cluster members when they bypass the correlator nodes and transmit their data directly to the clusterhead with the subscript referring to no source coding. Let be the energy expenditure for the case where cluster members use correlator nodes with the subscript denoting distributed source coding. is a function of and is defined within the interval while is independent from . Then, the energy gain due to the correlator nodes is defined as where
By incorporating each possible location of a cluster member within the cluster, is expressed as
where and refer to the expected energy consumption of cluster members in and , respectively. Specifically,
where that is the probability of having a sensor node with distance to the clusterhead. The first and second terms of (14) represent the energy consumption of cluster members in that are closer to and farther from the clusterhead than correlator nodes, respectively. On the other hand, is defined by considering the direct transmission from each cluster member as
By subtracting from is determined and the ideal correlator radius is found as the value which yields the maximum . Specifically, is a domeshaped function of with its derivative having value zero at point . Figure 4 illustrates the behavior of along with the ideal correlator radius .
Algorithm Coding Rate Assignment describes how rate allocation groups are formed under guidance of and rates are assigned to group members at Step II and Step III of Protocol CORA, respectively. To select the correlator nodes, the average residual energy of cluster members is calculated first. A cluster member within becomes a correlator node if (i) it has higher residual energy than the average residual energy, and (ii) its distance to the clusterhead is closer to than any one of its neighboring nodes. The remaining active nodes join the group of the closest correlator node.
Within each group, the data transmissions from group members to the correlator node are ordered in descending order of node residual energy levels. Thus, a sensor node uses the data of other group members that have higher residual energy as side information. Note that, having a high residual energy node transmit data earlier than others does not guarantee that it will use the highest coding rate. This is especially true when such a node has highly overlapping sensing region with other high energy nodes that have already transmitted data. However, when a high energy node uses low coding rate, its residual energy would not change significantly while other nodes would be spending more energy. Consequently, CORA would schedule such group members to transmit data earlier than others in the following rounds.
The correlator node applies the proposed differential data transmission technique to further reduce the size of the data before sending it to the clusterhead. The basic motivation behind differential data transmission is that the data gathered from group members exhibit not only spatial correlation but also temporal correlation. To exploit the correlation in temporal domain, both clusterhead and correlator node maintain a common reference data which captures the characteristic values of last data values transmitted from the correlator node to the clusterhead.
Let be the reference data and be the raw nonredundant data gathered at the correlator node. Let denote the difference operator and refer to its inverse. As an example, if the sensor readings are mapped to numbers than and may correspond to the subtraction and addition, respectively. Then, the correlator node transmits the differential data with the value . After receiving , the clusterhead recovers the original raw data .
5.2. Phase I for Nonuniform Event Distribution
CORA determines the ideal rate assignment for a nonuniform event distribution by considering all hotspots of event occurrences. For each hotspot, a local ideal correlator radius is computed first. Then, local ideal correlator radii for different hotspots are combined to determine the global ideal correlator radius for the cluster. In the following analysis, we describe the computation of the ideal correlator radius for a hotspot with distance to the clusterhead as shown in Figure 5.
In the analysis, we do not follow a particular event distribution but assume that event occurrence probabilities are nonzero within the local proximity of hotspots only. In particular, let be the event occurrence probability at a point with distance to the hotspot center. can be calculated either by using exponential and Pareto distributions depending on the nature of the event occurrences. In exponential distribution, the probability density function is where the event occurrence probability decreases rapidly as the distance to the hotspot center increases. For those hotspots with a slowly decreasing effect, Pareto distribution is more suitable due to its density function where is the shape parameter and is the initial value.
As in uniform event distribution analysis, we will express the energy gain function in terms of where . However, unlike the uniform event distribution case, the analysis is shaped by those locations near hotspots that have nonzero event occurrence probabilities rather than all cluster locations. Let us refer to the maximum distance between the center of the hotspot and any node within the hotspot as the hotspot range and denote it by .
In computation of both and , we will consider each possible distance that a sensor node can have to the hotspot center where . In Figure 5, a red circle labeled illustrates the possible node locations with distance to the hotspot center. For the upper semicircle of as an example, such locations are defined by the coordinates where and . Let denote the expected energy consumption of the nodes located on when they use correlator nodes. Let refer to the expected energy expenditure of the same nodes on when they apply direct data transmission to the clusterhead. We will integrate and over all within the hotspot to find and , respectively.
To compute , we break up into small segments with each segment representing a possible location of a sensor node on . For each one of these segments, the event occurrence probability is the same and is equal to . From Figure 5, it can be observed that
Therefore,
where
and . In words, when there is a sensor node on , the probability of event data transmission from is equal to the probability that the node is placed at (i.e.,) and the probability that an event occurs (i.e.,). The energy consumption for sending data from to the clusterhead consists of two components. First, the data are transmitted from to the correlator node over distance , and then sent by correlator node to the clusterhead over distance .
To determine , we follow the same segmentbased division of but assume that any sensor node on bypasses the correlator nodes. Thus,
where .
To express and , we integrate over each and incorporate the expected number of nodes to be located on for . Specifically,
Finally, we take the derivative of the energy gain function where . The ideal correlator radius makes the derivative function equal to zero at point .
Given a set of hotspots with the local ideal correlator radius for the hotspot referred to as , the global ideal correlator radius is set as where . Once the value of is obtained, the selection of correlator nodes and their group members are the same with the uniform event distribution case. Within a group however, the rates are allocated based on the proximity of nodes to the hotspots. Specifically, a sensor node uses the data of other group members that have larger distances to the hotspot as side information. The motivation here is that those group members that are near the hotspots consume more energy due to their high event detection activity. Thus, CORA alleviates the burden on such nodes by increasing their side information in distributed source coding.
5.3. Phase II for Both Uniform and Nonuniform Event Distributions
This section presents the steps of Phase II that are implemented in the same way for both uniform and nonuniform event distributions. CORA employs a prioritybased coverage scheduling technique to select the active sensor nodes for each event . In coverage scheduling, a node that is considered earlier for activation has better chance of going to sleep mode since those nodes that are waiting to be activated can still meet the required event missratio. Based on this observation, CORA implements node priorities to have critical nodes considered later in coverage scheduling, thereby forcing them to remain active. In Step IV, each cluster member is associated with a score that reveals how much it improves the energy expenditure of the cluster for . is computed by estimating the rates within the neighborhood of node for the following two cases:
Case I.
Node participates in distributed source coding.
Case II.
Node is excluded from distributed source coding.
The rate predictions are made according to the proposed rate assignment algorithms. Then, is set as the ratio of the expected average residual energy of the neighboring nodes for Case I to the one for Case II. Consequently, the critical nodes get assigned the highest scores.
Algorithm Coverage Scheduling implements Step V of Protocol CORA for the assignment of events to cluster members. The clusterhead first sorts the nodes in ascending order of their scores such that low score nodes are considered first. Then, each node is evaluated for coverage scheduling in the order of its score where . The status of node for event is determined according to its sensing region's overlap with the sensing regions of its neighboring nodes. To control event misses, either (i) node remains active and covers the physical area within its sensing region on its own, or (ii) node goes to sleep mode and lets its neighboring nodes provide coverage over its sensing region.
Let denote the set of neighboring nodes for that can contribute to the coverage of 's sensing region where . Based on the evaluation of scores, the clusterhead creates an eligible set of neighboring nodes for coverage of node 's sensing region where . Each neighboring node satisfies either one of the following conditions where and .

(i)
.

(ii)
and node has already been scheduled as an active node or has not announced its status yet for .

(iii)
and node has already been scheduled as an active node for .
Once its eligible set of neighboring nodes are identified, node computes the uncovered part of its sensing region for event denoted by where . If , then node goes to sleep mode for event since its sensing region is covered sufficiently by neighboring nodes that would remain active. Otherwise, node is scheduled active to preserve for event .
To ensure that , each cluster member identifies its from and event distribution such that . Let us define and as the maximum and minimum probability of an event occurrence, respectively, for at any point within the monitored region. Specifically, and for where is the sensor locations in the monitored region. For node located at is set as
where . Consequently, CORA provides variable coverage over the monitored area with the worst and best coverage defined by the following two cases. When is equal to , node meets the required event missratio threshold by setting . On the other hand, if is equal to , then node detects all event occurrences by using .
Lemma 1.
The variable coverage provided by CORA guarantees that for any given event .
Proof of Lemma 1.
The proof is given in the Appendix.
We next present an efficient algorithm to compute the area covered within a node's sensing region by its neighboring nodes. The coverage computation is used to verify that a node's sensing region has sufficient overlap with its neighboring nodes before the node goes to sleep mode. While computing coverage, a sensor node considers its neighboring nodes in ascending order of their identifiers. For each neighboring node, the area of intersection that's not covered by lower id nodes is determined. This helps the overlapping areas between the sensing regions of neighboring nodes to be considered only once.
Algorithm Coverage Computation describes the steps taken for finding the area of overlap a node has with its neighboring nodes. The sensing region of each node is represented as a set of segments as shown in Figure 6 where . Each segment has the same thickness and the union of all segments is equal to the node's sensing region where . The segments are numbered in increasing order from the center of the sensing region towards its boundary.
For a given neighboring node, the segment with the lowest id that intersects with the sensing region of the neighboring node is determined. Then, for each segment with a higher id than the lowest id segment, the covered part of the segment by the neighboring node is represented with an angle . This angle is defined with respect to the intersection points of the segment and the neighboring node's sensing region as illustrated in Figure 6. By finding the overlap with the sensing regions of all neighboring nodes, the covered portions of any given segment are represented with a set of angles where . The covered portion of segment is found based on the comparison of and the sum of magnitudes for the angles in . The total covered portion of the sensing region is determined by incorporating each segment in proportion with its area.
Example 1.
Let us consider a particular segment within the sensing region of node for which the neighboring nodes , and can contribute to its coverage. Suppose
initially based on the contributions of nodes and to the coverage of the segment. If the angle obtained for the coverage contribution of node is found to be , then is updated as
Finally, based on the magnitudes of each angle, the covered area of segment is determined as
where refers to sum of the magnitudes of angles in any given set .
The accuracy of the proposed coverage computation technique improves with increasing number of segments. However, using a large number of segments also comes at the expense of higher computational and storage overhead. We next describe how the overhead of the segmentbased representation is minimized. The key idea is to limit the application of segmentbased division scheme to specific parts of the sensing region only. The remaining parts of the sensing region are divided into subregions at a higher level of granularity than segments, specifically into four quadrants. These quadrants have the special property that the full coverage of each quadrant can be verified in a very simple manner. The segmentbased representation is then applied only within those quadrants for which the full coverage cannot be verified.
Let us now focus on the coverage of any given quadrant within a node's sensing region by the neighboring sensor nodes. We refer to the four quadrants within the sensing region as (upper left), (down left), (upper right), (down right) as shown in Figure 7(b). Without loss of generality, let us consider the full coverage of , the upper left quadrant, shown in Figure 7(a). In order to lay down the placement constraints of neighboring sensor nodes for the full coverage of quadrant , we first address the random placement of a single neighboring node within quadrant . In any outcome of this experiment, the extreme points at which the neighboring node can be located are and shown as dots in Figure 7(a). The circles with dashed lines in the figure indicate the sensing region of the neighboring node when it would be located at and . These boundary cases are important in the sense that they reveal the field in which the placement of the neighboring node yields the full coverage of the quadrant.
Figure 7(a) shows field along with fields and which together form the quadrant. Specifically
Figure 7(b) shows these three fields separately for each one of the quadrants where the quadrant name is indicated in parentheses and appended to the field name.
Let us also consider the random placement of more than one neighboring node over the quadrant. In this case, either one of the conditions below satisfies full coverage of the quadrant.
Condition 1.
At least one of the neighboring nodes should be located in the field .
Condition 2.
There should be at least one neighboring node in each one of the fields and .
These conditions apply to all quadrants since each one of them has its own , and fields.
We next give an important lemma which describes the coverage relationship between different quadrants of the same sensing region. The key observation here is that the existence of active neighboring nodes in a quadrant can compensate for the uncovered parts of its adjacent quadrants. Two quadrants are referred to as adjacent if they have a common boundary of length and they constitute a contiguous .
Example 2.
The quadrant is adjacent to and but not .
Lemma 2.
Let and be the set of active nodes that are located over the adjacent quadrants and , respectively, where , and . An element of placed in field has an equal coverage effect on as compared to an element of placed in . This property is also symmetric and is applicable to fields of adjacent quadrants.
Proof of Lemma 2.
The proof is available in the Appendix.
From Lemma 2, Condition 2 for the full coverage of each quadrant is rephrased as follows. Let the neighboring subregions of be denoted by and according to the type of adjacent field that has with its neighboring quadrant where and .
Example 3.
If is equal to then and since the quadrants and have adjacent fields while quadrants and have neighboring fields.
Then, for the full coverage of , Condition 2 requires the existence of at least one neighboring node in each one of the following fields.

(i)
or .

(ii)
or .
The remaining question that needs to be answered is how to determine the field and the quadrant that a neighboring is located.
Let us consider a node with coordinates which computes the covered portion of its sensing region. Let node be one of neighboring nodes of node with coordinates where . Table 2 gives a set of simple conditions that can be checked by node to identify the particular quadrant and field at which node is located. In these conditions, if node is located at the boundary of two quadrants, it is assumed to belong to the right quadrant in clockwise order. The conditions are expressed in terms of distance of node to the points , and that are illustrated in Figure 7(b). Once the exact quadrant and field information for each neighboring node is determined, the sensor node verifies whether each one of its quadrants is covered completely by checking Condition 1 and Condition 2.
We next address the effect of environmental factors on coverage computation. The changes in weather and ground status result in differences between the effective sensing ranges of nodes and their nominal sensing ranges. To incorporate effective sensing ranges into coverage computation, CORA considers both singlenode detectable and multinode detectable environmental factors such as humidity level and rain, respectively. Let denote the set of all such environmental factors taken into account by the sensor nodes. For each sensing unit, a correction constant is associated with environmental factor for where . The magnitude and sign of each correction constant is determined by experimental evaluation with sensor hardware and different settings for the environmental factor it is associated with. The negative and positive sign for represents the degradation and improvement in the sensing ability of the sensing unit due to the environmental factor, respectively, [35].
The effective sensing range of a sensing unit is obtained by adjusting its nominal sensing range as
Once the effective sensing range is determined, it is broadcast to the neighboring nodes at the beginning of each round before the coverage scheduling takes place. In order to check the full coverage of its quadrants, a sensor node compares its distance to each one of its neighboring nodes with its effective sensing range. Then, among those neighboring nodes within the sensing region, the sensor node considers only the ones which have larger effective sensing ranges than itself while checking Condition 1 and Condition 2. For the quadrants that are not fully covered, the coverage of the segments are determined based on the intersection of effective sensing ranges of the node itself and its neighboring node.
5.3.1. Noise in Internode Distance Measurements
The clusterhead uses the distances between pairs of cluster members to create a local coordinate system. The coordinate assigned to each cluster member is not exact and has an error margin [36]. This section considers how such errors in node location estimates can be incorporated into coverage computation. In the absence of exact node coordinate information, we express coverage and event missratio in terms of expected values rather than absolute values.
Let us represent the maximum deviation on the and coordinates of sensor nodes as and , respectively. A cluster member with coordinate estimates may be located at any point within the ellipsis bounded by a box of width and of height . In what follows, we denote the set of all candidate points for the exact location of the node in this ellipsis by .
Let us now consider the coverage of any given cluster member 's sensing area by its neighboring nodes where . We refer to node 's location as and the neighboring nodes that can contribute to the coverage of its sensing region as the set . In the case of location errors, we define two sets of angles for the coverage of each segment within 's sensing region. These sets of angles, namely, and , represent the worst and best possible cases for the coverage of the segment by the neighboring sensor nodes in , respectively, where .
Let represent one of the neighboring nodes in with coordinates that covers a part of segment within node 's sensing region where and . Now consider the possible cases for the actual locations of nodes and that minimizes and maximizes the covered part of the node 's sensing region by node , respectively. For the worst case placement in terms of coverage, let us assume that node 's coordinates are and node is located at where and . Similarly, also assume that when node is positioned at and has coordinates , the best case for the coverage of the segment is achieved where and . and the following condition holds
Let the pair of angles represent the worst and best case contribution of node for the coverage of the segment, respectively. and are updated with the addition of and , respectively. The same coverage computation is applied for each neighboring node in set in addition to node . Once the coverage contribution of all neighboring nodes is determined, we define as the expected covered portion of segment where
and represents the sum of the magnitudes of angles in a set . From the coverage of each segment for , the uncovered portion of node 's sensing region is determined as
6. Performance Evaluation
CORA is evaluated in terms of event missratios, total energy expenditure, average node battery consumption, and the storage/update overhead for the application of source coding. In the simulations, we consider sensor networks with multiple clusters in which the clusters are formed based on residual energy of sensor nodes. Each network is simulated for a single round with data gatherings. For uniform event distribution, every sensor node within a cluster is assumed to detect an event per data gathering. For nonuniform event distribution, we have randomly selected hotspot centers. At each data gathering, the event occurrences are modeled around these hotspot centers following the Gaussian distribution.
In the simulation graphs, the results for uniform and nonuniform event distributions are illustrated with solid and dashed lines, respectively. Each point shown in the graphs is obtained by averaging the simulation outcomes from a large number sensor networks. The sensor networks are deployed randomly over a target area of side length 100 m. The number of sensor nodes in each network is selected from the interval [] to control node/coverage redundancy. As network population increases, the sensing ranges of nodes overlap more, thereby increasing both the number of nodes redundant for coverage and the data correlation among neighboring sensor nodes.
The sensing range and transmission range of the nodes are set to 10 m and 30 m, respectively. The initial residual energy level of each node is assigned as 10 Joules. To calculate the energy expenditure, we have used the radio power consumption model described in Section 3 with settings and . The entropy of the source at a single cluster member is modeled as bits. The ratio of the control message size to the data message size is set to . Unless specified otherwise, the required event missratio threshold is equal to .
Figure 8(a) shows the results of the experiments in which we've considered sensor nodes equipped with four sensing units for event types . CORA exploits the increase in node redundancy and required event missratio thresholds to minimize the average number of events scheduled to each sensor node. As simulation results indicate, CORA enables a node to keep only one of its sensing units active at any time with sufficient node redundancy. It is possible that a node keeps its sensing unit active for event type while its neighboring node might activate the sensing unit for a different event type . Meanwhile, CORA's distributed coverage scheduling ensures that event missratio assurances are met for every event types and .
Figure 8(b) illustrates the empirical verification of the assurances provided by CORA under different event missratio requirements. For a particular value, a large number of simulations are run while keeping the network population constant. The observed event missratios (shown in axis of Figure 8(b)) always remain below the required event missratios (illustrated in axis of Figure 8(b)).
CORA assigns rates to the active nodes only and therefore is highly scalable. Figure 8(c) shows the results of the simulations that are run with the same required event missratio value but with varying number of nodes. Even though the network population increases, CORA limits the number of nodes that are scheduled active and get assigned rates. Having only a smaller set of nodes active prolong the time event missratio assurances can be met as those sensor nodes which are put in offduty mode can save their energy to go active in the subsequent scheduling phases.
The simulations in Figure 8(c) also evaluate the accuracy of Algorithm Coverage Computation. For comparison, we have used the sponsored sectorbased coverage computation technique proposed in [5] which we refer to as in the results. considers those neighboring nodes that are located within the sensing region of a node while checking whether the node's sensing region is covered by its neighboring nodes. If the node's sensing region overlaps sufficiently by its neighboring nodes, then it becomes eligible to go offduty. In particular, for a neighboring node with distance closer than the sensing range represents the region covered by the neighboring sensor node with a central angle which is referred to as the sponsored sector where . If the union of sponsored sectors by all neighboring nodes is equal to , then the sensing region of the node is covered completely by its neighboring nodes and the node becomes eligible for going to sleep mode.
Figure 8(c) shows that CORA approximates the coverage of the monitored area with better accuracy than and hence activates less number of nodes to meet the same coverage requirement. This is attributed to the fact that, CORA can consider neighboring nodes of a sensor node during coverage computation, including those with a distance to the sensor node larger than the sensing range . While achieving more accurate coverage computation, CORA introduces little overhead with the help of its quadrantbased and segmentbased coverage computation techniques described in Section 5.3.
Figure 9(a) and Figure 9(b) show that CORA is a good crosslayer combination. In these simulations, Cooperative CORA refers to the proposed collaboration where rate assignment helps coverage scheduling by identifying which critical nodes should be activated for minimizing data redundancy in transmission. On the other hand, Noncooperative CORA describes the case when coverage scheduling is applied before the rate assignment, however without any interaction between the two. In noncooperative case, as coverage scheduling does not have feedback on those critical nodes for reducing data redundancy, it is possible that such critical nodes are put in sleep mode just by checking their residual energy and coverage of their sensing area by their neighbor sensor nodes. As simulation results indicate, the increase in node density improves the amount of side data available to a sensor node and decreases the average battery consumption. However, by identifying the critical nodes and only letting them participate in source coding, Cooperative CORA yields better energy consumption and battery usage than Noncooperative CORA.
To evaluate the performance of differential data transmission, we consider the energy spent for gathering data from the correlator nodes to their clusterhead. We model the sensor data sent by correlator nodes as numbers, and define arithmetic subtraction () as the difference operator and arithmetic addition () as its reverse. The reference data used between the clusterhead and a particular correlator node is calculated based on the arithmetic average of the data values transmitted by that correlator node. The data value to be transmitted from a correlator node is selected as 100 plus a random differential data value for each data gathering. The upper bound used in each experiment for the differential data values are shown in the axis of Figure 9(c). When upper bound value is 40 as an example, the sensor data sent by correlator nodes are selected randomly from the range [].
Let us consider a scenario where the reference data value used by a particular correlator node is 110, and the correlator node has sensor data value of 130. The correlator node would apply the difference operator (subtraction) with respect to the reference data and would send 20 as the differential data value. Clusterhead would then recover the original data 130 using the same reference data value by applying the inverse operator (addition) to the reference data value 110 and the differential data 20 received from the correlator node. CORA in Figure 9(c) refers to the energy consumption when original data values, such as 130 in the example above, are sent by the correlator nodes without any differential data transmission. As simulation results show, differential data transmission takes advantage of the temporal correlation of data sent by correlator nodes to the clusterhead for reducing energy consumption.
The performance of CORA is also evaluated with respect to the existing rate assignment schemes. For comparison, we have chosen MasterSlave and Clustered SlepianWolf rate assignment techniques [24] due to their following special feature. These rate assignment schemes represent the two extreme cases for the tradeoff between the efficiency of rate allocation and overhead of source coding. Following the notation in Table 1, let us consider a cluster of active sensor nodes with referring to active sensor node.

(i)
MasterSlave Rate Assignment. This rate allocation represents the low efficiency, lowoverhead end of all possible rate assignments to sensor nodes. The cluster members code their data according to their correlation with the data of the clusterhead. For clarity, let us label active node as the clusterhead. Then, masterslave rate assignment allocates rate to active node for . This rate allocation has low storage overhead as only the correlation between the data of each cluster member and the clusterhead needs to be maintained. However, while being scalable, MasterSlave scheme sacrifices the potential gains achievable from the correlation of a cluster member with other cluster members for .

(ii)
Clustered SlepianWolf Rate Assignment. This rate assignment has the characteristic of efficient rate allocation at the cost of high storage overhead of correlation information. The cluster members code their data based on their correlation with the cluster members that have higher residual energy. Let us consider active nodes as labeled in descending order of their residual energy where active node has more remaining energy than for with clusterhead having the highest residual energy. SlepianWolf Rate Assignment then assigns rate to active node . To achieve this rate allocation, data correlation need to be maintained between node and node(s) . Consequently, clustered SlepianWolf brings significant storage/update overhead in order to increase the side data available to sensor nodes.
As Figures 10(a)–10(c) show, CORA possesses the desirable features of both Clustered SlepianWolf (efficiency) and MasterSlave (lowoverhead) rate assignment schemes. In particular, CORA would first identify critical nodes within the cluster for source coding gain and coverage scheduling then activates only those critical nodes for ensuring that the required event missratios are met. For clarity of discussion, let us assume there are such critical nodes which are scheduled active and label them as where . CORA puts noncritical nodes in sleep mode, thereby assigning rates to and maintaining correlation between node and other critical nodes only.
Figure 10(a) shows the total energy consumption of sensor nodes when CORA Protocol, MasterSlave, and Clustered SlepianWolf schemes are applied on the same network instances. As node redundancy increases, CORA's ability to identify noncritical sensor nodes and to put them off duty yields better energy consumption than Clustered SlepianWolf. As expected from the increase in side data, Figure 10(b) shows that node redundancy improves the average battery consumption for both CORA and Clustered SlepianWolf. For MasterSlave, the battery consumption of nodes remains almost the same since data is coded at each cluster member without considering its correlation with other cluster members. In terms of storage/update overhead, CORA gets close to MasterSlave with the increase in node density as illustrated in Figure 10(c).
7. Conclusions
In this paper, we have addressed the problem of meeting event missratio requirements with minimum energy expenditure. We identify a graceful cooperation between coverage scheduling and rate allocation techniques, which are addressed separately in the literature. For both uniform/ nonuniform (hotspot) event distributions, we show the existence of a radius within the cluster for ideal application of distributed source coding. With the help of this radius, rate allocation guides coverage scheduling to activate only those cluster members that are critical for minimizing energy consumption. The coverage scheduling technique of the proposed protocol CORA assists rate assignment by enabling overlapping sensing regions and correlation among neighboring nodes while minimizing the overhead of distributed source coding. In comparison with existing rate allocation algorithms, CORA significantly improves energy expenditure by 85%, node battery energy consumption up to 25% and source coding overhead by 90%.
This paper has addressed the impact of environmental factors on the size of circularshaped sensing regions. As for future work, identifying the irregularshaped sensing regions due to environmental factors and considering their effect on event missratio assurances remain interesting and challenging problems.
Algorithm 1: Probability computation for .
Require:: The case of having total event occurrences in the monitored area where and is the number of sensor locations.
Ensure: is computed.

1:
Initialize .

2:
Determine the set of all possible combinations of events that occur in any out of network locations.

3:
while the set is not empty do

4:
Remove a combination from and denote it by .

5:
Find out the product of the event occurrence probabilities at the locations selected by combination and probabilities of not having any event occurrences at the remaining locations of the network.

6:
Multiply the product from the previous step with the probability of having combination and add the result of multiplication to .

7:
end while
Algorithm 2: Protocol CORA.
Require: : An event to be sensed by sensor nodes in a clusterbased wireless sensor network.
: The required event missratio threshold.
Ensure: The event missratio assurance is met.
is minimized.
PHASE I

StepI:
Each clusterhead finds its correlator radius.

StepII:
Those cluster members that are located around the correlator radius form rate assignment groups, each consisting of a correlator node and a number of sensor nodes.

StepIII:
Each correlator node assigns the source coding rates to its group members in order to minimize .PHASE II

StepIV:
Each clusterhead identifies the critical nodes of rate assignment groups, based on their assigned rates.

StepV:
The members of each cluster perform coverage scheduling by activating critical nodes, in order to meet the required event missratio threshold .
Algorithm 3: Coding rate assignment.
Require: A cluster of sensor nodes that produce correlated data for a given event .
Ensure: The coding rates are allocated for event to minimize the energy consumption.

1:
The ideal correlator radius is determined by the clusterhead for uniform event distribution.

2:
for all Active node do

3:
if is located within then

4:
Use coding rate and transmit data directly to the clusterhead.

5:
else

6:
Check whether node should become a correlator node by verifying the residual energy requirement and comparing its distance to the clusterhead with .

7:
if is selected as correlator then

8:
Code data at rate and apply differential data transmission for group members.

9:
else

10:
Use coding rate = and send data to the correlator node where the set contains the group members with higher residual energy.

11:
end if

12:
end if

13:
end for
Algorithm 4: Coverage scheduling.
Require: A cluster of wireless sensor nodes to be scheduled for sensing event .
: The required event missratio threshold for event .
: The scores assigned to cluster members based on coding rate estimates.
Ensure: Each cluster member is selected either as an active node or a sleeping node for event .

1:
The set of cluster members are sorted in ascending order of their scores in .

2:
for all Node do

3:
is identified from and event distribution for .

4:
if is met by neighboring nodes of node then

5:
Node goes to sleep mode.

6:
else

7:
Node is activated for .

8:
end if

9:
end for
Algorithm 5: Coverage computation.
Require: Any given cluster member that has overlapping sensing regions with the set neighboring nodes where the
neighboring node is referred to as .
Ensure:: The area within the cluster member's sensing region that is not covered by the neighboring nodes from the set is
computed.

1:
Initialize to zero.

2:
Divide the node's sensing region into segments each of width .

3:
Let be the set of angles that represent the covered portions of the segment. Initialize to for .

4:
Sort the set of neighboring nodes in ascending order of node identifiers.

5:
for allto do

6:
Identify the lowest id segment that intersects with node 's sensing region.

7:
for all = lowest id segment to do

8:
Determine the portion of segment that is covered by node but not by any other node and represent this covered portion with the angle where .

9:
Add as an element to the set .

10:
end for

11:
end for

12:
for all = to do

13:
Add to where denote the sum of magnitudes of the angles in .

14:
end for

15:
return
References
 1.
Feeney LM, Nilsson M: Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies, April 2001 15481557.
 2.
Jones CE, Sivalingam KM, Agrawal P, Chen JC: A survey of energy efficient network protocols for wireless networks. Wireless Networks 2001, 7(4):343358. 10.1023/A:1016627727877
 3.
Sanli HO, Cam H: Eventdriven coverage and rate allocation for providing missratio assurances in wireless sensor networks. Proceedings of the 50th Annual IEEE Global Telecommunications Conference (GLOBECOM '07), November 2007 11341138.
 4.
Sanli HO, Cam H: Adaptive task scheduling for providing event missratio statistical assurances in wireless sensor networks. Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC '06), April 2006 445450.
 5.
Tian D, Georganas ND: A node scheduling scheme for energy conservation in large wireless sensor networks. Wireless Communications and Mobile Computing 2003, 3(2):271290. 10.1002/wcm.116
 6.
Tian W, Liu J: A novel approach for the maximum coverage sets of WSN based on immune clone selection algorithm. Proceedings of the 2nd International Symposium on Electronic Commerce and Security (ISECS '09), May 2009, Nanchang, China 1: 275279.
 7.
Chen UR, Chiou BS, Chen JM, Lin W: An adjustable target coverage method in directional sensor networks. Proceedings of the 3rd IEEE AsiaPacific Services Computing Conference (APSCC '08), December 2008, Pisa, Italy 174180.
 8.
Wang X, Xing G, Zhang Y, Lu C, Pless R, Gill C: Integrated coverage and connectivity configuration in wireless sensor networks. Proceedings of the 1st International Conference on Embedded Networked Sensor Systems (SenSys '03), November 2003 2839.
 9.
Yan T, He T, Stankovic JA: Differentiated surveillance for sensor networks. Proceedings of the 1st International Conference on Embedded Networked Sensor Systems (SenSys '03), November 2003 5162.
 10.
Gupta H, Das SR, Gu Q: Connected sensor cover: Selforganization of sensor networks for efficient query execution. Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC '03), June 2003 189200.
 11.
Carle J, SimplotRyl D: Energyefficient area monitoring for sensor networks. IEEE Computer 37(2):4046.
 12.
Cardei M, Wu J: Energyefficient coverage problems in wireless adhoc sensor networks. Computer Communications 2006, 29(4):413420. 10.1016/j.comcom.2004.12.025
 13.
Slijepcevic S, Potkonjak M: Power efficient organization of wireless sensor networks. Proceedings of International Conference on Communications (ICC '01), June 2001 472476.
 14.
Sanli HO, Poornachandran R, Çam H: Collaborative twolevel task scheduling for wireless sensor nodes with multiple sensing units. Proceedings of the 2nd Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON '05), September 2005 350361.
 15.
Cǎrbunar B, Grama A, Vitek J, Cǎrbunar O: Redundancy and coverage detection in sensor networks. ACM Transactions on Sensor Networks 2006, 2(1):94128. 10.1145/1138127.1138131
 16.
Liu C, Wu K, Xiao Y, Sun B: Random coverage with guaranteed connectivity: joint scheduling for wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems 2006, 17(6):562575.
 17.
C. F. Huang, Y.C. Tseng, and H. L. Wu, “Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network,” ACM Transactions on Sensor Networks, vol. 3, no. 1, artile 5, 2007.
 18.
M. X. Cheng, L. Ruan, and W. Wu, “Coverage breach problems in bandwidthconstrained sensor networks,” ACM Transactions on Sensor Networks, vol. 3, no. 2, article 12, 2007.
 19.
Wang W, Srinivasan V, Wang B, Chua KC: Coverage for target localization in wireless sensor networks. Proceedings of the 5th International Conference on Information Processing in Sensor Networks (IPSN '06), April 2006 118125.
 20.
Slepian D, Wolf JK: Noiseless coding of correlated information sources. IEEE Transactions on Information Theory 1973, 19(4):471480. 10.1109/TIT.1973.1055037
 21.
Pradhan SS, Ramchandran K: Distributed source coding using syndromes (DISCUSS): design and construction. Proceedings of the Data Compression Conference (DCC '99), March 1999 158167.
 22.
Cristescu R, BeferullLozano B, Vetterli M: On network correlated data gathering. Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '04), March 2004 25712582.
 23.
Baek SJ, de Veciana G, Su X: Minimizing energy consumption in largescale sensor networks through distributed data compression and hierarchical aggregation. IEEE Journal on Selected Areas in Communications 2004, 22(6):11301140. 10.1109/JSAC.2004.830934
 24.
Marco D, Neuhoff DL: Reliability vs. efficiency in distributed source coding for fieldgathering sensor networks. Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN '04), April 2004 161168.
 25.
Hou YT, Shi Y, Sherali HD: Rate allocation and network lifetime problems for wireless sensor networks. IEEE/ACM Transactions on Networking 2008, 16(2):321334.
 26.
Poornachandran R, Ahmad H, Çam H: Energyefficient task scheduling for wireless sensor nodes with multiple sensing units. Proceedings of the 24th IEEE International Performance, Computing, and Communications Conference (IPCCC '05), April 2005 409414.
 27.
Sinha A, Chandrakasan A: Operating system and algorithmic techniques for energy scalable wireless sensor networks. Proceedings of the 2nd International Conference on Mobile Data Management (MDM ' 05), January 2001 1987: 199209.
 28.
McIntyre GA, Hintz KJ: Sensor measurement scheduling: an enhanced dynamic, preemptive algorithm. Optical Engineering 1998, 37(2):517523. 10.1117/1.601640
 29.
Goel S, Imielinski T: Predictionbased monitoring in sensor networks: taking lessons from MPEG. Computer Communication Review 2001, 31(5):8298. 10.1145/1037107.1037117
 30.
Mica Motes, http://www.xbow.com/
 31.
MTS400CA and MTS420CA (with GPS module) Environmental Sensor Boards http://www.xbow.com/
 32.
Heinzelman WR, Chandrakasan A, Balakrishnan H: Energyefficient communication protocol for wireless microsensor networks. Proceedings of the 33rd Annual Hawaii International Conference on System Siences (HICSS33 '00), January 2000, Maui, Hawaii, USA 8020.
 33.
Pattem S, Krishnamachari B, Govindan R: The impact of spatial correlation on routing with compression in wireless sensor networks. Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN '04), April 2004 2835.
 34.
Cover T, Thomas J: Elements of Information Theory, Wiley Series in Telecommunications. John Wiley & Sons, New York, NY, USA; 1991.
 35.
Casalegno JW: Allweather ground sensor system with possible law enforcement applications. Enabling Technologies for Law Enforcement and Security, February 2001, Proceedings of SPIE 4232: 359366.
 36.
Oliveira HABF, Nakamura EF, Loureiro AAF, Boukerche A: Error analysis of localization systems for sensor networks. Proceedings of the 13th ACM International Workshop on Geographic Information Systems (GIS '05), November 2005 7178.
Author information
Appendix
Proof of Lemma 1. Considering , we need to prove that , specifically
Without loss of generality, let us consider the terms and in expansion of and , respectively, where . To identify the value of and , we consider every possible division of network locations into two subsets, namely, and , such that and . If , then we assume that an event occurs at and an event gets detected at . Otherwise, it is assumed that there is not any event occurrence or event detection at . For a combination among all such possible divisions, the probability of having event over the monitored area is calculated as
On the other hand, the probability of having event is expressed as
By replacing the probability of event detections in accordance with the variable coverage provided by CORA, (A.3) becomes
Note that our objective is to show that , thus we multiply and every other term in with the constant and get
Let us now compare the coefficients of the first term for from (A.5), specifically
Even in the case of single event occurrence and single event detection (i.e.,), the coefficient in (A.6) is less than the coefficient in (A.7) since the largest value the expression can assume is 1. Further, it is easy to see that the second term
Proof of Lemma 2. Without loss of generality, let us focus on quadrants and in Figure 7(b). We refer to the set of active nodes covering the upper left () and upper right () quadrant as and , respectively. For the worstcase analysis let us make the following assumptions.

(i)
does not satisfy Condition 2 for the quadrant with the active nodes placed in only.

(ii)
All active nodes from the set are placed at point within .

(iii)
All active nodes from the set are placed at point within .
In order to prove that active nodes at can compensate for the uncovered portion of the subregion , that is , it is necessary to show that

(i)
,

(ii)
.
The condition (i) is trivial based on the disk equation itself. The condition (ii) can be proved by placing an imaginary active node at each one of the points and . The points can then be defined as the intersection of the node's sensing region centered at with the imaginary active nodes centered at , respectively.Let be the projection point of online segment which is indicated as a red dot in Figure 7(b). The equality holds due to the fact that the sensing regions are congruent. Similarly, the equation also holds from the symmetry where is the projection point of on line segment shown as a red point in Figure 7(b).It can be concluded from these equalities that . This proves that can be covered by active nodes placed at even in worstcase placement of active nodes. Similarly, the members of placed at can cover the field completely.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Received
Accepted
Published
DOI
Keywords
 Sensor Node
 Wireless Sensor Network
 Neighboring Node
 Cluster Member
 Rate Allocation