- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

International Journal of Distributed Sensor Networks

Volume 2011 (2011), Article ID 962476, 21 pages

http://dx.doi.org/10.1155/2011/962476

## Spatio-Temporally Adaptive Waiting Time for Cell Phone Sensor Networks

^{1}SPANN Lab, Electrical Engineering Department, Indian Institute of Technology Bombay, Powai, Mumbai 400076, India^{2}TCS Innovation Labs Mumbai, Tata Consultancy Services, Yantra Park, Thane 400601, India^{3}Indian Institute of Technology Hyderabad, Ordnance Factory Estate, Yeddumailaram 502205, Andhra Pradesh, India

Received 28 November 2010; Accepted 23 March 2011

Copyright © 2011 Deepthi Chander et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

In cell phone sensor networks (CpSN), sensor-embedded cell phones communicate sensor data using Near Field Communication outlets such as Wi-Fi or Bluetooth. This paper considers a query dissemination application of CpSN, where sensor data belonging to a certain time window [, ] is needed from a region of interest. Existing approaches, such as ADAPT, use adaptive broadcast ranges at the Wireless Access Point (WAP) for query dissemination. This paper proposes the adaptation of waiting time at nodes for energy-efficient query dissemination. The design and analysis of the proposed *Spatio-Temporally Adaptive Distributed Velocity Dependent (STA-DVD)* waiting time is presented. The STA-DVD protocol is analytically compared with a Spatially Adaptive Distributed Velocity Dependent (SA-DVD) waiting time based protocol. Simulation results show that STA-DVD has a superior querying performance in terms of number of samples procured than SA-DVD, at a slightly higher energy cost. For the case of a Randomized Waiting (RW) time adopted by nodes in ADAPT, the ADAPT-RW protocol has the best querying performance, with significantly high energy costs. STA-DVD has a comparable querying performance with ADAPT-RW, for high residual times and a better performance for low residual times, with significantly low energy dissipation.

#### 1. Introduction

Cell phone-based sensor networks are constituted by cell phones which are additionally empowered with sensing capabilities [1–6]. While the ubiquitous use of cell phones for regular voice applications resolves issues related to the deployment and provision of energy for the embedded sensors, the mobility of cell phone users provides improved coverage and energy efficiency [7, 8]. These networks can either use the cellular bandwidth (as in [9, 10]) or can use short-range communication outlets such as Wi-Fi or Bluetooth [11] to share sensor data. Cell phone-based sensor networks can cater to various urban sensing applications such as environmental monitoring, urban planning, natural resource management, civic hazard detection, and information sharing. Some of the on-going research in this relatively nascent area are discussed in Section 9. In this paper, we consider an architecture of cell phone-based sensor networks, where cell phones use short-range communications to transmit sensor data. Such networks (shown in Figure 1) are referred to as *cell phone sensor networks* (CpSNs). This paper specifically focusses on an application of CpSN which requires carbon monoxide (CO) levels, belonging to a particular time window , from a region of interest. This involves the *querying of nodes*, by a wireless access point (WAP) in the specified region, to sense CO levels during the time window. Flooding of the query maximizes chances of querying more number of nodes, at the cost of increased interference which disrupts ongoing communications. Therefore, this work essentially develops an energy-efficient query dissemination scheme which maximizes the number of nodes (cell phones) queried to sense data within the time interval , in the region of interest.

Figure 2 shows a schematic of the sensing platform on the cell phone, consisting of the query processing module, sensing module and data processing module. For the query dissemination application, the *rate* and *duration of activation* of the query processing module determines the energy dissipated by the sensing platform. In order to minimize this energy, this module can be scheduled to be activated only when the node needs to handle a query. The duration for which this module remains active, after it has been activated, is the parameter of interest in this paper. We refer to this duration as the *waiting time*, , of a node (Figure 2). During its , the node coordinates with the querying WAP and waits to receive the query from it. At the end of its , it activates the sensing module to collect samples until time . The waiting time must be large enough for coordination to occur with the querying WAP and for the node to receive the query from the WAP. The waiting time must be small enough for the listening energy consumed during the coordination process to be minimized. In this work, we focus on the design and analysis of waiting time, specifically suitable for the dissemination of a query with temporal constraints, in a single-hop cell phone sensor network (CpSN).

In [12], a randomized waiting (RW) time is proposed for supporting data aggregation in static wireless sensor networks. Adopting a randomized waiting time at nodes for the query dissemination application in CpSN would be an inefficient approach, as it is not tailored to address the following design challenges in CpSN. (i)Nonuniform node distribution: in this work, we assume a random waypoint (RWP) [13, 14] distribution of cell phone users, where node density decays from the center of the cell, towards the boundaries. Therefore, the waiting time of nodes near boundaries must be large to ensure connectivity. On the other hand, waiting time of nodes closer to the center can be small, since nodes will have sufficient connectivity. Thus, the waiting time must vary spatially. (ii)Dynamic topology: the mobility of cell phone users causes a time-varying connectivity between users. We hence adopt a velocity-dependent waiting time for each node. (iii)Temporal constraints of the query: the sampled data needs to belong to the time window . If the query arrives at the WAP from the network, at , where , the residual time of the application is defined as . Existing approaches [11, 15], *adapt the query broadcast range* at the querying WAP, based on the application-dependent residual time, in order to maximize the number of nodes queried within . ADAPT, proposed in [15], incorporates a temporally adaptive broadcast range at the querying WAP for query dissemination in the hybrid Metrosense architecture [16] comprising of static as well as hand-held sensing elements. ADAPT does not assume any underlying mobility model. A multihop CpSN (MCpSN), where spatio-temporal adaptation of broadcast range is done at the querying WAP and at intermediate nodes, was advocated in [11], for the RWP mobility model. While a high broadcast range in a single-hop CpSN (as in [15]) causes increased energy dissipation and interference; a MCpSN which uses multiple short-range broadcasts (as in [11]), is prone to path vulnerability and entails on-the-fly route discovery. In this paper, we propose a novel approach, where the *waiting time of nodes is adapted*, based on the application-dependent residual time of the query, in a single-hop CpSN.

The contributions of the paper can be summarized as follows: (i)design and analysis of the proposed *spatio-temporally adaptive-distributed velocity-dependent *(STA-DVD) waiting time for a Random Waypoint (RWP) [13] distribution of cell phone users, (ii)analytical comparison of the proposed *spatio-temporally adaptive-distributed velocity dependent *(STA-DVD) waiting time with the *spatially adaptive-distributed velocity-dependent *(SA-DVD) waiting time which had been considered in [9–11], (iii)development of STA-DVD waiting time-based protocol for query dissemination, (iv)simulation-based perturbation analysis of the STA-DVD, SA-DVD, and ADAPT protocols.

The analytical and simulation results show that the proposed STA-DVD protocol has a querying performance, in terms of number of samples procured, superior to that of SA-DVD protocol at relatively higher energy costs. For small application-dependent residual times, the proposed STA-DVD protocol yields a comparable querying performance to that of ADAPT, however, with a significantly lower energy dissipation. It must be noted that, even though the STA-DVD protocol has been developed in this paper for single-hop CpSN, it can be extended to the case of multihop CpSN (MCpSN). Since the waiting time, (and *not* the broadcast power) is adapted in STA-DVD, the STA-DVD-based MCpSN would only differ from the single-hop CpSN in terms of the smaller range of broadcast powers available at the WAP or at an intermediate node and the additional requirement of an on-the-fly relay node discovery process (as in [11]).

The organization of the paper is as follows. The cell phone sensor network (CpSN) architecture and the system model are described in Sections 2 and 3, respectively. The waiting time in the *spatio-temporally adaptive-distributed velocity-dependent *(STA-DVD) and *spatially adaptive-distributed velocity-dependent *(SA-DVD) protocols is proposed in Section 4, while the protocol for query dissemination is described in Section 5. Section 6 analytically derives the time stationary waiting time distribution in SA-DVD and STA-DVD. Section 7 discusses the choice of broadcast range at the WAP for these protocols. Section 8 presents the simulation results. Section 9 briefly describes on-going research in cell phone-based sensor networks and Section 10 presents the conclusions of the paper.

#### 2. Architecture

In the cell phone sensor network (CpSN) architecture shown in Figure 1, the end-user application injects a query into the cell phone sensor cloud through a wired/wireless wide area network. The query is issued to a wireless access point (WAP) in the region of interest. The WAPs in this network, communicate with cell phones equipped with sensors, over a single-hop in half-duplex mode. Since sensor-based applications are in general low data-rate applications, we assume a multichannel, edium access control (MAC) scheme [17–19] for uplink communication in the CpSN framework. The multichannel MAC scheme assumed in this paper is similar to the hybrid-orthogonal frequency division multiple access (hybrid-OFDMA) scheme considered in [17]. For the CpSN, the channel bandwidth can be subdivided into orthogonal subchannels, with each subchannel constituted by a set of orthogonal subcarriers. The number of subcarriers within a subchannel, as well as the number of subchannels assigned to each user can be design parameters. If the number of subchannels is less than the number of users, contention can be implemented within each subchannel as in carrier sense multiple access (CSMA) schemes [17]. For low data rate sensing applications, such a scheme in the uplink results in fewer chances of collisions when nodes try to communicate independently and simultaneously with the WAP. The WAP in turn can use all the subchannels to communicate with nodes on the downlink.

#### 3. System Model

*Path Loss Model*. Since we consider a single-hop cell phone sensor network (CpSN), we assume a log-normal path loss model [20]. If is the known distance between source and destination, the transmission power at the source is computed as is the minimum received power required for successful reception at the destination. For a known receiver sensitivity in dBm, , is the wavelength of the Radio-Frequency (RF) signal, is the path-loss exponent, and the reference distance .

*Energy Model of Mobile Phones*

The sensing application is initiated by the mobile phone when it is activated by the querying application. At all other times, cell phone resources are used for regular (voice/text) applications. For any two time instants, and lying between two consecutive sensing application activation instants, we assume that the residual battery energy decays linearly in the following manner:
In (2), is the battery rating of the cell phone and . is the corresponding talktime rating which determines the maximum duration for which the cell phone can be powered while performing regular applications. Therefore, assuming that a residual energy of would decay within a time duration , the energy drained within a duration would be .

#### 4. Waiting Time-Based Query Dissemination

In this section, the waiting time framework is developed for a single-hop half-duplex cell phone sensor network (CpSN).

##### 4.1. Waiting Time Connectivity (WTC) in a Single-hop CpSN

The query processing module of each node is associated with a waiting time (Figure 2). During , the node waits to receive the query from the WAP and remains in a listening mode. Connectivity in a CpSN is defined based on the waiting time of nodes. We propose the following *waiting time connectivity *(WTC) rule.

Let be the waiting time of node and the broadcast range of the querying WAP. For node to be successfully queried by the WAP, the following condition must hold:
where is the radiowave propagation velocity. If the relation (3) holds, the *node ** is connected to the WAP*. Given that node is connected to the WAP, relation (3) implies the following,* Implication (a)*. If is small, * must be small*,* Implication (b)*. If is large, * can be large*.

Conversely,* Implication (c)*. If is small, * can be small*,* Implication (d)*. If is large, * must be large*.

The factor in relation (3) is considered due to the half-duplex assumption of the CpSN framework, as shall be explained in Section 5.

##### 4.2. Waiting Time in a CpSN

Connectivity of nodes to the WAP is essential in order to maximize the number of nodes that get successfully queried by the WAP. Large waiting times ensure high connectivity in the CpSN, as more number of nodes satisfy the relation (3). At the same time, very large waiting times lead to an increased dissipation of listening energy during the waiting time and of communication energy due to more number of nodes satisfying WTC with the WAP. Thus, the design of waiting time is a tradeoff between overall energy dissipated in the network and the number of nodes tasked by the querying WAP.

###### 4.2.1. Waiting Time in the Proposed STA-DVD Protocol

For a node, , we propose the following definition of waiting time for the spatio-temporally adaptive-distributed velocity-dependent (STA-DVD) waiting time-based protocol as , where is the estimated distance of node from base station (BS), which is assumed to be located at the center of the cell. is the instantaneous node velocity, is the maximum node velocity in the network, and is the fractional residual time of the application as defined in (5). The dependence of the STA-DVD waiting time, , on each of these factors is described in the following paragraphs.

*Distance from BS* ()

Owing to the RWP distribution, nodes occur sparsely at large distances from the center (BS location). A WAP located at this distance must, therefore, have a large broadcast radius, , in order to communicate the query to as many nodes as possible. Consequently, nodes must have large waiting times (*Implication (d)*) to ensure that they are connected to the WAP. Since node density is higher near the BS, a WAP located near the BS can have a small broadcast range, , in order to communicate the query to a sufficient number of nodes within its range circle. Nodes can, therefore, have small waiting times and yet be connected to the WAP (*Implication (c)*). Thus, in (4), waiting time of nodes is designed to progressively increase with distance from the centrally located BS.

*Instantaneous Velocity *

Fast-moving nodes stay within the WAP range circle for short durations of time, during which they can successfully communicate with the WAP. Therefore, such nodes are assigned small waiting times in order to minimize packet losses in this communication. Slow moving nodes, however, stay within the WAP range circle for longer durations and can, therefore, be assigned larger waiting times, during which they can successfully communicate with the WAP.

*Fractional Residual Time of the Application *

The application considered, requires data to be sensed within the time interval . Let the query arrive at the WAP located in the region of interest, at time , where, . Then, the residual time of the application is given by and the application-dependent fractional residual time, , is given by
when the residual time is low, the waiting time of nodes needs to be increased in order to increase the number of nodes that satisfy WTC in (3) (and are thus likely to be queried). In STA-DVD, the waiting time is made inversely proportional to the application-dependent fractional residual time, . Thus, in STA-DVD, the waiting time of nodes is made sensitive to the time specifications of the application.

###### 4.2.2. Waiting Time in SA-DVD Protocol

The purely location and velocity-dependent waiting time which had been proposed earlier in [9–11] *does not* consider the temporal constraints of the query. We refer to the protocol for a single-hop CpSN based on this spatially adaptive-distributed velocity-dependent (SA-DVD) waiting time (adopted in [9–11]), as the SA-DVD protocol. For a node, , the definition of waiting time for the SA-DVD protocol is given by , where is the estimated distance of node from BS, is the node velocity and is the maximum node velocity in the network. The dependence of on and is as described for STA-DVD in (4), and as explained in [9–11].

#### 5. Query Dissemination Protocol

The proposed *spatio-temporally adaptive-distributed velocity-dependent* (STA-DVD) protocol is based on the STA-DVD waiting time proposed in (4), while the *spatially adaptive-distributed velocity-dependent* (SA-DVD) protocol is based on the SA-DVD waiting time considered in [9–11] and discussed in (6). This being the primary distinction between the STA-DVD protocol and the SA-DVD protocol, the following steps and Figure 3 describe the steps in the query dissemination operation in STA-DVD and SA-DVD in a single-hop cell phone sensor network (CpSN).

The wireless access Point (WAP) which is injected with the query, broadcasts the *request to send query*, as shown in Figure 3(a). For STA-DVD, *RTS*: [*WAP location, sensor type, **, R*]; and for SA-DVD, *RTS*: [*WAP location, sensor type, R*]. For both STA-DVD and SA-DVD, the broadcast power corresponding to a transmission range , is computed as described in Section 7. After broadcasting the RTS, the WAP switches to the receive mode.

In the proposed *spatio-temporally adaptive-distributed velocity-dependent* (STA-DVD) protocol, the query processing module of a node which receives the RTS, computes a *spatio-temporally* adaptive waiting time, . In the *spatially adaptive-distributed velocity -dependent* (SA-DVD) protocol, the query processing module of a node which receives the RTS, computes a *spatially* adaptive waiting time, . In both cases, the node replies with a CTS: (*node location, WAP location, sensor availability bit*) if: (a) it is willing to participate in query dissemination, (b) it satisfies *waiting time connectivity *(WTC) with the WAP (3) and (c) the *sensor availability bit* = 1, indicating the presence of the desired sensor. Since we assume a multichannel MAC on the uplink [17–19], nodes can send CTS to the WAP simultaneously on different subchannels.

The query processing module of a node that has transmitted the CTS initiates a timer which has a value equal to the waiting time of the node (Figure 2). During this period, the node waits to receive the query from the WAP.

We assume half-duplex communication in the network. Hence, the WAP waits to receive CTS for the round-trip duration of from the time at which it broadcasts the RTS, in order to receive CTS even from nodes lying in the boundary of its range circle. After this duration, it sends the query to the nodes that have replied with CTS (Figure 3(c)). The duration also corresponds to the minimum duration for which a node must be in listening mode, from the time it replies with a CTS, in order to receive the query successfully from the WAP. Therefore, any node receiving compares its waiting time with to determine its connectivity with WAP (WTC in (3)).

A node which receives the query within its waiting time activates the sensing module at the end of its waiting time. Samples are collected at the sampling rate of the particular sensor, till the end, , of the sampling interval specified in the query.

The RTS-CTS scheme specifically considered in this protocol does not involve internode communication typically observed in wireless LAN protocols. RTS, in particular, refers to a broadcast packet sent by the WAP, while CTS pertains to a unicast transmission from a node to the WAP. Note that the delays incurred in switching between channels or in switching between the transmit/receive modes, both at the WAP and at nodes, have not been considered in this work while computing waiting times.

##### 5.1. Infimum of in a CpSN

In order to ensure that there is sufficient time available for the two-way signalling involved in the protocol, the application-dependent fractional residual time, , cannot be too small. Hence, we derive the greatest lower bound (infimum), , of , at any WAP which has a minimum broadcast range of . In this work, we consider the following constraint imposed by the query dissemination protocol.

*Statement 1. *For a given *,* the minimum time available for the sensing application, at any node located at the boundary of the WAP range circle, must be greater than 0.

The time at which the query arrives at a node at the boundary of the WAP range circle is given by

where is the time at which the query arrives at the WAP. The time available for the sensing application at such a node is

According to Statement 1, this duration must be greater than 0. Therefore, for a given , the application-dependent must satisfy the following condition: where , and is the radiowave propagation velocity.

Substituting in the relation (9), the greatest lower bound (infimum) of for the CpSN can be obtained as: In general, if an application has such that , it will be handled by the WAP in both STA-DVD and SA-DVD.

##### 5.2. Supremum of Waiting Time of a Node in STA-DVD

In STA-DVD, for the case of , and , (4) gives the least upper bound (supremum) of given by Therefore, taking into consideration the range of values that can belong to application queries arriving at the WAP, the waiting time, , of any node in STA-DVD would lie in the range, .

##### 5.3. Maximum Waiting Time of a Node in SA-DVD

In SA-DVD, the waiting time of a node is independent of the application-dependent . Therefore, even though Statement 1 must hold for SA-DVD protocol as well, the maximum waiting time of a node in an SA-DVD-based CpSN can be simply obtained when and in (6); that is,

#### 6. Time-Stationary Waiting-Time Distribution

In order to study the effect of context-dependent adaptation of waiting time on the performance of the querying protocols, we derive the probability density function () of the *normalized spatio-temporally adaptive-distributed velocity-dependent *(STA-DVD)* waiting time* of nodes. To derive the of the STA-DVD waiting time, we first derive the corresponding to the existing purely spatially adaptive waiting time, considered in [9–11] and adopted in the *spatially adaptive-distributed velocity-dependent *(SA-DVD) protocol.

##### 6.1. Normalized SA-DVD Waiting Time

For a node , with spatially adaptive waiting time , we define its *normalized spatially adaptive-distributed velocity-dependent *(SA-DVD)* waiting time*, as
where is the maximum value that can be assumed by the spatially adaptive waiting time in (6). Specifically, when and , where is the cell radius, in (6). Therefore, , as obtained in (12). Note that the normalization in the normalized *spatially adaptive-distributed velocity-dependent* (SA-DVD) waiting time in (13) has been done with respect to the cell radius. Equation (13) can be rewritten as
where . The of normalized waiting time for SA-DVD has to be derived for nodes *within the range circle of the *WAP, and not for nodes in the entire network. The for SA-DVD waiting time, is then used to obtain the of the proposed *normalized spatio-temporally adaptive-distributed velocity-dependent* STA-DVD waiting time as in Section 6.4.

##### 6.2. Probability Density Function of Normalized SA-DVD Waiting Time Within the WAP Range Circle

Equation (14) can be written in its generic form as where the velocity-dependent factor, (the index is dropped for brevity). Note that both and . Therefore, and . The probability density function is given by [21] where is the joint of and . Since and are independent (velocity chosen by a node and location of a node are independent of each other), (16) can be re-written as [21] where is the of and is the of node occurrence at a distance of from BS.

*Probability Density Function of *

From , it can be inferred that ([21]), where is the of node velocity. From [13], for a random-waypoint (RWP) model with pauses is given by
where is the probability of a node to be in *motion* state, while is the probability of a node to be in *pause* state. If is the maximum diameter of the area from which a node can choose its position, and if and represent the minimum and maximum pause durations, respectively, then [13]
where and for the cell of radius . Therefore,

*Probability Density of Node Location at a Distance from BS, Within the WAP Range Circle*

The probability of node occurrence at a distance from the origin in a cell of unit radius, is an angularly symmetric function for the RWP distribution [13]. Therefore, the probability of node occurrence would be the same within a circle centered at and within a circle centered at , where both these circles lie within the circle of unit radius over which the angularly symmetric function is defined. Without loss of generality, any circle centered at , where , can be rotated to the location for analytical simplicity. Let be the distance of the WAP from the BS and be the broadcast range of the WAP. Then, as shown in Figure 4, we define as the normalized distance of the WAP from the BS, and as the normalized broadcast range of the WAP (Figure 4). Here, we define the probability density function, , to be the probability of node occurrence at a normalized radial distance from the center (corresponding to the BS location), *within the broadcast range circle* of normalized radius, . For a circular disk of unit radius, from [13, 14]
where , and . The instantaneous angle is the angle inscribed at the center (BS location) by an arc within the range circle, which is located at a distance of from the center (as shown in Figure 4). The computation of this angle has been derived in the Appendix of this paper.

Therefore, using (20) and (21) in (17), the of normalized *spatially adaptive-distributed velocity-dependent* (SA-DVD) waiting time , is given by (22). The analytical plot of is shown in Figure 5, while the corresponding histogram plot obtained from simulations is shown in Figure 6. Figure 7 shows the analytical plot of the corresponding cumulative distribution function (CDF), .

##### 6.3. Proposed Normalized STA-DVD Waiting Time

In addition to spatial adaptation of waiting time to suit the RWP distribution, temporal adaptation of waiting time needs to be further incorporated in the *spatially adaptive-distributed velocity-dependent* (SA-DVD) waiting time, in order to meet the temporal constraints of the query. Specifically, if the query arrives at the WAP at , where , the application-dependent fractional residual time, (5), where and , can be used to tune the normalized SA-DVD waiting time, , in order to obtain the proposed *normalized spatio-temporally adaptive-distributed velocity-dependent* (STA-DVD) waiting time. We propose the following relation between the normalized SA-DVD waiting time, and normalized STA-DVD waiting time
This relationship is carried over to the actual values of the proposed STA-DVD and SA-DVD waiting times defined, in Sections 4.2.1 and 4.2.2 respectively.

Note that the normalization in has been done only with respect to the cell radius , as in the case of spatially adaptive waiting time. The waiting time in SA-DVD can be considered as a special case of waiting time in STA-DVD if is assumed to be 1, *irrespective* of the actual value of application-dependent , calculated at the WAP. In other words, the value of application-dependent calculated at the WAP, is not used by nodes while computing waiting time in SA-DVD. This also implies that the waiting time of nodes in STA-DVD reduces to the waiting time of nodes in SA-DVD, that is, , when the value of application-dependent calculated at the WAP is 1.

##### 6.4. Probability Density Function of Proposed Normalized STA-DVD Waiting Time Within the WAP Range Circle

The , of the proposed *normalized spatio-temporally adaptive-distributed velocity-dependent* STA-DVD waiting time, in the STA-DVD protocol, can be obtained from [21]
where and is as defined in (22).

In Figures 8 and 10, is evaluated for application-dependent and , respectively. The corresponding histogram plots, obtained by simulation are given in Figures 9 and 11, respectively. As can be seen, the waiting time range increases as decreases. Also shown in Figures 8 and 10 is corresponding to the of normalized waiting time in SA-DVD which is equivalent to the specific case of for .

##### 6.5. Mean and Variance of Waiting Time in STA-DVD and SA-DVD

Table 1 gives the mean and variance of normalized waiting time (through analysis and simulations) in STA-DVD for different . It also shows these values for application-dependent . This corresponds to the case when the waiting time in STA-DVD and SA-DVD are the same. As can be seen, the mean and variance of waiting time is minimum when and increases as decreases. Note that different values of are chosen for each of the values. For a particular value, there is a corresponding value which yields the best protocol performance in terms of number of samples procured. This choice of a suitable value at the WAP, as a function of the application-dependent , is explained in Section 7.

##### 6.6. Waiting Time Connectivity (WTC) Computation

As explained in Section 5, since we consider half-duplex operation, the nodes which can receive and process the query are those which have a waiting time greater than , which corresponds to a normalized waiting time .

The probability,(STA-DVD) in STA-DVD, that a node satisfies WTC, *given that* it lies within the range circle, is therefore given by
The corresponding probability in SA-DVD is given by
The probability that a node lies within the WAP range circle of normalized radius , with the WAP located at a normalized radial distance of from the center of the unit circle is given by
where is as defined in (21). The integral in (27) can be evaluated using the method described in the Appendix.

The joint probability, , of a node satisfying WTC (generically written as for STA-DVD and SA-DVD), *and* occurring within the range circle, is therefore given by
In (28), we make use of the fact that, the occurrence of a node within the WAP range circle is independent of its satisfying the relation (3).

The probability that a node in the network (unit circle in Figure 4) gets *queried* can be analytically obtained as
where is the probability of a node having the desired sensor.

The values of and obtained by analysis and simulation when and for the proposed STA-DVD waiting time, are given in Table 2. It also shows these values for application-dependent . This corresponds to the case when the waiting time in STA-DVD and SA-DVD are the same. It can be seen that both and increase as decreases. However, note that the increase in value of is not significant as compared to theincrease in , for a given . This is because of the small value of corresponding to . Therefore, in this work, the chosen at the WAP for a specific aims to maximize corresponding to the particular . The relation between the choice of at the WAP and the value calculated at the WAP, is explained in Section 7.

##### 6.7. Cumulative Distribution Function (CDF)

The Cumulative Distribution Function (CDF), , is evaluated as Suppose that and

It follows that

which implies that

Therefore, the probability of nodes having normalized waiting times* greater than * for , is less than the probability of nodes having normalized waiting times* greater than * for , where .

Such a case is observed in Figures 12 and 13, which evaluate the CDF for , respectively. As can be seen, for , for , respectively. Figures 12 and 13 also show the CDF corresponding to SA-DVD (equivalently, in STA-DVD when application-dependent ). For the case of , . Thus, decreases as decreases. In other words, the probability of nodes having normalized waiting times* greater than* 0.4 increases as the residual time of the application decreases. Since this observation can be made for every value of ; and for low values of in particular, it can be inferred that nodes tend to have higher waiting times as the residual time decreases. Hence, we state the following.

*Statement 2. *In spatio-temporally adaptive-distributed velocity-dependent (STA-DVD) protocol, nodes tend to have higher waiting times for low fractional residual times and lower waiting times for high fractional residual times.

#### 7. Choice of Broadcast Range at the WAP in SA-DVD and STA-DVD

In this section, we formulate a probabilistic estimate of the number of samples, , that can be procured for a particular , as a function of the broadcast range, at the WAP. The computed value of is used to determine the broadcast range chosen by the WAP to transmit the RTS.

##### 7.1. Dependence of on for a Particular

*Statement 3. *For a particular application-dependent , the number of samples, is maximum for the value corresponding to maximum .

The range must be chosen to maximize (29), so that a maximum number of nodes get queried for the particular . From (27), choosing a large increases , and hence, the number of nodes within the WAP range circle. The increased increases the probability in (29), equivalently increasing the chances of querying more number of nodes. At the same time, the number of nodes that will satisfy WTC with the WAP as per (3) may decrease if is very large, since nodes may not have large waiting times, as was required by *Implication (d)* in Section 4.1. This may happen if nodes tend to have low waiting times with a greater probability (as in SA-DVD, or if the particular is high in STA-DVD, Statement 2). Thus, a *large R* can lead to low (in both (25) and (26)) and consequently, low values (29). A comparison of Table 2 and Table 3 further illustrates this point. Table 3 gives the values of and for varying , while Table 2 provides the corresponding values for varying with . As can be seen, for , decreases from 0.8460 in Table 2 to 0.5958 in Table 3 when increases from 0.15 to 0.2. However, increases from in Table 2 to in Table 3, when increases from 0.15 to 0.2. A similar trend in and is also observed in the analytic and simulation values for . It can be inferred that although decreases when increases, increases due to the increase in , for a given value. Therefore, for a particular , must be large enough to ensure that is high and must be small enough so that does not deteriorate significantly. Thus, must be chosen such that it maximizes , for a given computed at the WAP.

##### 7.2. Dependence of on

In STA-DVD, , and consequently , depend on the application-dependent . Specifically, increases when decreases. For , this implies that . Even though more number of nodes get queried for , it *cannot* be concluded that . This is because for , the actual residual time available at each node to procure samples is low, even though the number of queried nodes is high. Therefore, we have the following.

*Statement 4. * must be a function of actual residual time .

Based on Statements 3 and 4, it can be concluded that * must be a function of ** and *. We consider the following probabilistic estimate of the number of samples, , that can be procured for a particular range . Assuming that the WAP can have processing capabilities, this estimate is computed at the WAP to determine
where, is the probability that a node is queried (29), is the number of nodes in the network, and is the sensor sampling rate. are assumed to be parameters provided to the WAP by the application. The factor

corresponds to the time that would be available for the sensing application at a node located at the boundary of the range circle, where is the time at which the node at the boundary of the range circle receives the query from the WAP. Thus, this factor represents the minimum time available at a node within the broadcast circle for sampling sensor data.

*Statement 5. *For a given application-dependent value computed at the WAP, the which maximizes is chosen as the broadcast range by the querying WAP.

In this work, we assume a discrete set of broadcast ranges for the WAP to choose from. Figures 14 and 15 plot with respect to (equivalently, , where is the cell radius) for SA-DVD and STA-DVD, respectively. The following inferences can be drawn from these figures.

*Implication (b) in Section 4.1*). The high values of (STA-DVD) and observed for low , start deteriorating only when becomes very high in (25). However, when is high, nodes tend to have lower waiting times (Statement 2). Therefore, must be small to ensure that does not deteriorate (

*Implication (a) in Section 4.1*).

The value chosen based on the maximization of in (34) for different in STA-DVD and SA-DVD are given in Table 4 in Section 8. Here, the value in *meters* belongs to the discrete set: .

##### 7.3. Variation of With

The variation of probability density function, with , in SA-DVD (where is assumed to be 1), and in STA-DVD for and , has been shown in Figures 16, 17 and 18, respectively. It can be inferred that in STA-DVD, for a given , the waiting time range increases as decreases, and consequently, the probability of nodes having higher waiting times also increases. As expected, it is observed that for a particular , the waiting time range also increases slightly with in both SA-DVD and STA-DVD.

#### 8. Simulation Results and Discussion

MATLAB has been used as the simulation tool in this work. We consider a circular area of radius with 1000 nodes whose locations, and velocities in the range 0.01–9.99 m/s, are drawn from the RWP steady state distribution [13] at sampling intervals of . The pause time of nodes is uniformly distributed between 0–100 s. The battery rating is , talktime is six hours and users recharge their batteries if the residual energy falls below 0.2 × *battery rating*. Initial residual energy of each cell phone is assumed to be different. Cell phone receiver sensitivity is chosen as , and duration of the application is . The minimum broadcast range of the WAP, , and power consumed in listening is assumed to be . A path-loss exponent of is considered for the log-normal fading model. 1000 different seeds were chosen to evaluate average performances. Confidence intervals of are further evaluated to study the robustness of the average performances. A cell-phone is considered to have the desired sensor with probability .

ADAPT [15] is considered for the case of a single query over a single hop. In ADAPT, the WAP chooses the th power level from a set of power levels, where . In our simulations, we consider . Table 4 gives the value determined by the WAP in ADAPT for different values. For fairness of comparison, we modify ADAPT by considering a uniformly distributed random waiting (RW) time [12] drawn from , where is given by (11). For the current simulation setup, . The proposed *spatio-temporally adaptive-distributed velocity-dependent* (STA-DVD) protocol is compared with ADAPT-RW and *spatially adaptive-distributed velocity-dependent* (SA-DVD) protocol.

Simulations have been carried out by varying at the WAP, and of nodes. The value is chosen at the WAP for each , in both STA-DVD and SA-DVD, based on the discussion in Section 7 and is tabulated in Table 4. The performances of the protocols can be explained based on the effects of , which depicts the time constraints of the query, and the probability, , of a node having the desired sensor. Note that in all the simulation plots, the confidence intervals obtained were very small (of the order of the marker size), hence demonstrating the robustness in the average performances obtained.

##### 8.1. Effect of

As decreases, the waiting time of nodes in STA-DVD increases. Therefore, more number of nodes satisfies WTC with the WAP. Thus, as seen in Figure 19, the number of queried nodes increases with decrease in . Since waiting time in SA-DVD is independent of , remains the same for all . As seen in Figure 19, is lesser for SA-DVD than in STA-DVD, as the waiting time range of nodes is also correspondingly lesser. In ADAPT-RW, the broadcast range chosen by the WAP is time adaptive. A small corresponds to a higher broadcast range, and therefore to a high value of (27). The number of nodes satisfying WTC is also higher in ADAPT-RW, as the average normalized waiting time in RW () is more than that in STA-DVD and SA-DVD (Table 1). Thus, due to high , and a large number of nodes satisfying WTC in ADAPT-RW, , and therefore , is maximum in ADAPT-RW, as seen in Figure 20. Note that the waiting time RW is *not* adaptive and is chosen from a uniform distribution.

Since is larger in STA-DVD compared to SA-DVD, the energy dissipated in communication by nodes is also larger in STA-DVD, as seen in Figure 21. The communication energy dissipated is highest (Figure 22) in ADAPT-RW as its highest. The waiting time range in STA-DVD is greater than in SA-DVD. This manifests in the listening energy consumed by nodes which is greater in STA-DVD compared to SA-DVD, for all , as seen in Figure 23. Further, in STA-DVD, the listening energy consumed increases with decrease in , as the waiting time also increases. The listening energy remains a constant with varying in SA-DVD, as it adopts a waiting time independent of in SA-DVD. As seen in Figure 24, the listening energy is highest in ADAPT-RW as the average normalized waiting time of nodes () is maximum in ADAPT-RW when compared to that of STA-DVD and SA-DVD.

As observed from Figures 26 and 25, respectively, the number of samples procured is maximum in ADAPT-RW, and is greater in STA-DVD, than in SA-DVD. This is because is maximum for ADAPT-RW, and is greater in STA-DVD than in SA-DVD. Further, in STA-DVD, SA-DVD and ADAPT-RW, the number of samples procured is higher for large values. This is because, for a constant sensor sampling rate, , the sensing time window available at nodes in all protocols, is largest for the largest application-dependent value. This is despite the fact that is smallest when is largest.

##### 8.2. Effect of

The number of nodes queried and the number of samples procured increase linearly with for all schemes as seen in Figures 19, 20, 25, and 26. The energy dissipated and the listening energy consumed by nodes also correspondingly increase with , as the number of queried nodes increase with . This is observed in Figures 21, 22, 23, and 24.

##### 8.3. Effect of

We assume that cell phones are equipped with GPS and velocities are computed from consecutive location measurements. Since location and velocity measurements are prone to error, we consider the following *Gaussian perturbation model*. If in general represents either location or velocity, then the measured for node is , where is the actual value of , is the perturbation fraction and . For simplicity, we assume the same value of for location and velocity perturbations, while is node and parameter-specific.

The number of nodes queried and hence the number of samples procured in all schemes decreases for , as seen in Figures 27, 28, 33, and 34, respectively. This is because of RTS-CTS packet losses due to erroneous location and velocity estimates. Therefore, the total energy dissipated and the listening energy consumed by the fewer number of nodes involved in the application also correspondingly decrease. This can be inferred from Figures 29, 30, 31, and 32.

Based on the effect of , , and , it can be concluded that, incorporating time adaptiveness to the waiting time of nodes enhances the performance for applications that involve time constraints. Although the cost in terms of energy dissipated and listening energy increases, the proposed STA-DVD scheme has a significant performance improvement especially when the residual time is high and more nodes have the desired sensor. Further, for critical applications with very low residual time (small ), or which involve sensors that users generally do not possess (small ), the proposed STA-DVD scheme still exhibits a better performance than SA-DVD at comparable energy costs. The ADAPT-RW scheme has the best performance in terms of number of samples obtained. However, the communication energy and listening energy consumed by resource-constrained cell phones in ADAPT-RW are significantly higher than in STA-DVD and SA-DVD.

Table 4 shows a comparison of the broadcast ranges in SA-DVD and STA-DVD at which (34) is maximum as well as the ranges corresponding to the temporally adaptive broadcast power levels chosen in ADAPT-RW. It is observed that the range remains the same for all values in SA-DVD, where no temporal waiting time adaptation is performed. Further, for ; that is, when residual time is small, ADAPT-RW chooses a range of 300 m compared to 250 m chosen in STA-DVD. Moreover, for , Figures 25 and 26 show that SA-DVD procures more number of samples compared to ADAPT-RW at much lower energy costs (Figures 21, 23, 22, 24). The results clearly demonstrate that the proposed STA-DVD protocol is suitable for the query dissemination application at a higher energy efficiency compared to ADAPT-RW, especially for applications with low residual times.

#### 9. Some Recent Works in Cell Phone Based Sensor Networks

Research and development, academic, industrial, and governmental partnerships have recently recognized the enormous potential of cell phone-based sensor networks in *urban, mobile, participatory, *or *people-centric sensing *applications [1, 3, 4, 16, 22–25]. In addition to protocol design, various challenges involved in the design and development of these networks have been identified in [1, 26–30]. Here, we have attempted to include as many references as we can on these networks. In Accra, Ghana, pollution data was captured, throughout the day by GPS-supported carbon monoxide sensor kits carried by taxi drivers and students [31–33]. Ten other cases where cell phones contribute to assistance in the areas of public health, security and environmental conservation have been presented in [31]. The *urban sensing *group at *UCLA*, [34], works on a large number of areas like public health, community cultural expression and well-being, environmental monitoring and urban planning. The *Mobile Millennium *project uses positioning data from GPS-enabled cell phones mounted on vehicles, to get real-time traffic information [6]. In [35], a system, UbiFit garden, has been developed for people to monitor lifestyle and to encourage physical activity. In [5], projects ranging from personal sensing systems to sensing terrain are under research, while [36] studies the realtime movement patterns in Rome. The Campaignr framework, [37], was proposed to enable users to upload sensor data, yet concealing the complexities of the underlying embedded mobile phone environment. Tackling security-related issues is considered in [38], while [39] proposes a continuous queryprocessing system for intermittently connected mobile sensor networks. Handling of spatio-temporal queries efficiently from the sensors is described in [40]. Data inferencing using cooperative techniques to overcome device heterogeneity is considered in [41].

#### 10. Conclusions

In this paper, a short-range communications based Cell phone Sensor Network (CpSN) had been considered for a query dissemination application. The main contribution of this paper was the development of an energy-efficient, waiting time-based scheme, where the waiting time is adapted based on the temporal specifications of the query for a random waypoint distribution of cell phone users. The proposed spatio-temporally adaptive-distributed velocity-dependent (STA-DVD) waiting time based scheme outperforms a spatially adaptive-distributed velocity-dependent (SA-DVD) waiting time-based scheme in terms of number of samples procured from the network at a cost of slightly higher energy dissipation. However, the proposed STA-DVD protocol is especially suitable for applications where the residual time is very low and the procurement of samples becomes a priority. The existing temporally adaptive scheme, ADAPT-RW, caters to the temporal specifications by varying the range of the querying WAP. Our results show that the proposed STA-DVD scheme has a significantly higher energy efficiency than ADAPT-RW. STA-DVD has a slightly poorer performance (in terms of number of samples procured) than ADAPT-RW for high residual times, and a better performance (in terms of number of samples procured) than ADAPT-RW, for low residual times. Hence, the proposed STA-DVD scheme is an energy-efficient viable solution for time-constrained query dissemination in CpSN.

**APPENDIX**

#### Computation of Probability Mass of an Angularly Symmetric Function over a Circle of Radius

Our aim is to evaluate the probability mass of any probability density function over a circle centered at of radius . Note that we consider to be independent of angle , where . We approximate the circle by a series of curved strips of width . In Figure 35, one such strip at a radial distance of from the origin and subtending an angle (which again is a function of ) is shown. Therefore probability mass, is given by In (A.1), note that as is a function of , it can be expressed in terms of . The integration of the probability density function, , can be done by varying alone. Note that due to the assumption of angular symmetry of , without loss of generality, any circle centered at , where can be rotated to the location for analytical simplicity. The value of obtained will be the same for both cases.

In (A.1), is obtained as follows.

The equation of the circle centered at is given by

A fictitious circle centered at the origin with radius is considered. This circle is given by is varied from () to ) in order to obtain the integral in (A.1).

The instantaneous angle, , subtended by an arc of length at the origin is given by , where is a point of intersection of the circle of radius , with the circle with radius centered at . Solving (A.3) and (A.2), we obtain as follows. There can be two possible points of intersection of the two circles in (A.3) and (A.2). Both the points have the same value for . The two values obtained for have the same magnitude but differ in sign

Then, .

#### Acknowledgments

This work is supported by DST under the IU-ATC (India-UK Advanced Technology Center) sponsored project on “Pervasive Sensor Environments”. Deepthi Chander acknowledges the TCS Research Fellowship for her Ph.D.

#### References

- T. Abdelzaher, Y. Anokwa, J. Burke, et al., “Mobiscopes for human spaces,”
*IEEE Pervasive Computing*, vol. 6, no. 2, pp. 20–29, 2007. - R. J. Honicky, “N-SMARTS: networked suite of mobile atmospheric real-time sensors,” November 2010, http://www.cs.berkeley.edu/ honicky/nsmarts/.
- E. Paulos, R. J. Honicky, and B. Hooker, “Citizen science: enabling participatory urbanism,” in
*Handbook of Research on Urban Informatics: The Practice and Promise of the Real-Time City*, M. Foth, Ed., pp. 414–436, Idea Group, Alberta, Canada, 2008. - A. Kansal, M. Goraczko, and F. Zhao, “Building a sensor network of mobile phones,” in
*Proceedings of the 6th International Symposium on Information Processing in Sensor Networks (IPSN '07)*, Cambridge, Mass, USA, April 2007. View at Publisher · View at Google Scholar · View at Scopus - MetroSense, 2010, http://metrosense.cs.dartmouth.edu/.
- M. Millennium, “Mobile millennium: using cell phones as mobile traffic sensors,” 2010, http://traffic.berkeley.edu/theproject.html.
- A. A. Somasundara, A. Kansal, D. D. Jea, D. Estrin, and M. B. Srivastava, “Controllably mobile infrastructure for low energy embedded networks,”
*IEEE Transactions on Mobile Computing*, vol. 5, no. 8, pp. 958–973, 2006. View at Publisher · View at Google Scholar · View at Scopus - M. Zhang, X. Du, and K. Nygard, “Improving coverage performance in sensor networks by using mobile sensors,” in
*Proceedings of the Military Communications Conference (MILCOM '05)*, Atlantic, NJ, USA, October 2005. View at Publisher · View at Google Scholar · View at Scopus - D. Chander, B. G. Jagyasi, U. B. Desai, and S. N. Merchant, “DVD based moving event localization in multihop cellular sensor networks,” in
*Proceedings of the IEEE International Conference on Communications (ICC '09)*, Dresden, Germany, June 2009. View at Publisher · View at Google Scholar · View at Scopus - D. Chander, B. Jagyasi, U. B. Desai, and S. N. Merchant, “Distributed velocity-dependent protocol for multihop cellular sensor networks,”
*EURASIP Journal on Wireless Communications and Networking*, vol. 2009, Article ID 192985, 17 pages, 2009. View at Publisher · View at Google Scholar · View at Scopus - D. Chander, B. G. Jagyasi, U. B. Desai, and S. N. Merchant, “Spatio-temporal power adaptive (STPA) protocol for MCpSN,” in
*Proceedings of the International Conference on Communications (ICC '10)*, Cape Town, South Africa, May 2010. - K.-W. Fan, S. Liu, and P. Sinha, “Structure-free data aggregation in sensor networks,”
*IEEE Transactions on Mobile Computing*, vol. 6, no. 8, pp. 929–942, 2007. View at Publisher · View at Google Scholar · View at Scopus - J.-Y. L. Boudec and M. Vojnovic, “Perfect simulation and stationarity of a class of mobility models,” in
*Proceedings of the IEEE Infocom*, Miami, Fla, USA, March 2005. View at Scopus - J.-Y. L. Boudec, “Understanding the simulation of mobility models with palm calculus,” Tech. Rep. IC/2004/53, EPFL, 2004.
- S. B. Eisenman, “People-centric mobile sensing networks,” , Ph.D. dissertation, 2008.
- A. T. Campbell, S. B. Eisenman, N. D. Lane, E. Miluzzo, and R. A. Peterson, “People-centric urban sensing,” in
*Proceedings of the 2nd Annual International Wireless Internet Conference (WICON '06)*, Boston, Mass, USA, August 2006. - H. M. Alnuweiri, Y. P. Fallah, P. Nasiopoulos, and S. Khan, “OFDMA-based medium access control for next-generation WLANs,”
*EURASIP Journal on Wireless Communications and Networking*, vol. 2009, Article ID 512865, 9 pages, 2009. View at Publisher · View at Google Scholar · View at Scopus - J. So and N. H. Vaidya, “Multi-channel MAC for ad hoc networks: handling multi-channel hidden terminals using a single transceiver,” in
*Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MoBiHoc '04)*, pp. 222–233, New York, NY, USA, May 2004. View at Scopus - J. Mo, H. S. W. So, and J. Walrand, “Comparison of multichannel MAC protocols,”
*IEEE Transactions on Mobile Computing*, vol. 7, no. 1, pp. 50–65, 2008. View at Publisher · View at Google Scholar · View at Scopus - W. C. Y. Lee,
*Wireless and Cellular Communications*, McGraw-Hill, 2005. - A. Papoulis and U. S. Pillai,
*Probability, Random Variables and Stochastic Processes with Errata Sheet*, McGraw-Hill, 2001. - J. Burke, D. Estrin, M. Hansen, et al., “Participatory sensing,” in
*Proceedings of the Workshop on World-Sensor-Web: Mobile Device Centric Sensor Networks and Applications (WSW '06)*, pp. 117–134, Boulder, Colo, USA, October 2006. - B. Hull, V. Bychkovsky, Y. Zhang et al., “CarTel: a distributed mobile sensor computing system,” in
*Proceedings of the 4th ACM International Conference on Embedded Networked Sensor Systems (SenSys '06)*, pp. 125–138, Boulder, Colo, USA, November 2006. View at Publisher · View at Google Scholar · View at Scopus - G. Gartner, W. E. Cartwright, and M. P. Peterson, Eds.,
*Location Based Services and TeleCartography*, Lecture Notes in Geoinformation and Cartography, Springer, 2007. - “Nokia’s Eco-Sensor concept,” 2010, http://www.nokia.com/corporateresponsibility/environment/sustainable-products/eco-sensor-concept.
- E. Miluzzo, N. D. Lane, K. Fodor, et al., “Sensing meets mobile social networks: the design, implementation and evaluation of the cenceme application,” in
*Proceedings of the 6th ACM Conference on Embedded Network Sensor Systems (SenSys '08)*, pp. 337–350, ACM, Raleigh, NC, USA, November 2008. - J. C. Herrera, D. B. Work, R. Herring, X. J. Ban, and A. M. Bayen, “Evaluation of traffic data obtained via GPS-enabled mobile phones: the mobile century field experiment,”
*Working Papers*Proceedings 978957, Institute of Transportation Studies, UC Berkeley, 2009. - P. Johnson, A. Kapadia, D. Kotz, and N. Triandopoulos, “People-centric urban sensing: security challenges for the new paradigm,” Tech. Rep. TR2007-586, Darmouth Computer Science, 2007.
- A. T. Campbell, S. B. Eisenman, N. D. Lane et al., “The rise of people-centric sensing,”
*IEEE Internet Computing*, vol. 12, no. 4, pp. 12–21, 2008. View at Publisher · View at Google Scholar · View at Scopus - D. B. Work and A. M. Bayen, “Impacts of the mobile internet on transportation cyberphysical systems: traffic monitoring using smartphones,” in
*Proceedings of the National Workshop for Research on High-Confidence Transportation Cyber-Physical Systems: Automotive, Aviation and Rail*, Washington, DC, USA, November 2008. - S. Kinkade and K. Verclas, “Wireless technology for social change: trends in mobile use by NGOs,” 2008, http://mobileactive.org/files/MobilizingSocialChange_full.pdf.
- R. J. Honicky, E. Brewer, E. Paulos, and R. White, “N-SMARTS: networked suite of mobile atmospheric real-time sensors,” in
*Proceedings of the 2nd ACM SIGCOMM Workshop on Networked Systems for Developing Regions*, Seattle, Wash, USA, August 2008. - E. Paulos, R. J. Honicky, and E. Goodman, “Sensing atmosphere,” in
*Proceedings of the Workshop Position Paper for the Sensing on Everyday Mobile Phones in Support of Participatory Research at ACM (SenSys '08)*, November 2007. - CENS: UCLA (Technologies), 2010, http://urban.cens.ucla.edu/technology/.
- S. Consolvo, D. W. McDonald, T. Toscos et al., “Activity sensing in the wild: a field trial of ubiFit garden,” in
*Proceedings of the 26th Annual CHI Conference on Human Factors in Computing Systems (CHI '08)*, pp. 1797–1806, Florence, Italy, April 2008. View at Publisher · View at Google Scholar · View at Scopus - F. Calabrese, K. Kloeckl, and C. Ratti, “Wikicity: real-time urban environments,”
*IEEE Pervasive Computing*, vol. 6, no. 3, pp. 52–53, 2007. - A. Joki, J. A. Burke, and D. Estrin, “Campaignr: a framework for participatory data collection on mobile phones,”
*Paper*770, Center for Embdedded Network Sensing, 2007. - C. Cornelius, A. Kapadia, D. Kotz, D. Peebles, M. Shin, and N. Triandopoulos, “AnonySense: privacy-aware people-centric sensing,” in
*Proceedings of the 6th International Conference on Mobile Systems, Applications, and Services (MobiSys '08)*, pp. 211–224, ACM Press, Breckenridge, Colo, USA, June 2008. View at Publisher · View at Google Scholar · View at Scopus - Y. Zhang, B. Hull, H. Balakrishnari, and S. Madden, “ICEDB: intermittently-connected continuous query processing,” in
*Proceedings of the 23rd International Conference on Data Engineering (ICDE '07)*, pp. 166–175, Istanbul, Turkey, April 2007. View at Publisher · View at Google Scholar · View at Scopus - Y. Ahmad and S. Nath, “COLR-Tree: communication-efficient spatio-temporal indexing for a sensor data web portal,” in
*Proceedings of the 24th International Conference on Data Engineering (ICDE '08)*, pp. 784–793, Cancun, Mexico, April 2008. View at Publisher · View at Google Scholar · View at Scopus - N. D. Lane, H. Lu, S. B. Eisenman, and A. T. Campbell, “Cooperative techniques supporting sensor-based people-centric inferencing,” in
*Proceedings of the 6th International Conference on Pervasive Computing (Pervasive '08)*, pp. 75–92, Springer, Sydney, Australia, May 2008.