# Adaptive Reward Allocation for Participatory Sensing

Authors: Martin Connolly; Ivana Dusparic; Georgios Iosifidis; Melanie Bouroche
Journal: Wireless Communications and Mobile Computing
 (2018)

---

## Abstract

Participatory sensing is a paradigm through which mobile device users (or participants) collect and share data about their environments. The data captured by participants is typically submitted to an intermediary (the service provider) who will build a service based upon this data. For a participatory sensing system to attract the data submissions it requires, its users often need to be incentivized. However, as an environment is constantly changing (for example, an accident causing a buildup of traffic and elevated pollution levels), the value of a given data item to the service provider is likely to change significantly over time, and therefore an incentivization scheme must be able to adapt the rewards it offers in real-time to match the environmental conditions and current participation rates, thereby optimizing the consumption of the service provider’s budget. This paper presents adaptive reward allocation (ARA), which uses the Lyapunov Optimization method to provide adaptive reward allocation that optimizes the consumption of the service provider’s budget. ARA is evaluated using a simulated participatory sensing environment with experimental results showing that the rewards offered to participants are adjusted so as to ensure that the data captured matches the dynamic changes occurring in the sensing environment and takes the response rate into account while also seeking to optimize budget consumption.


---

## Body

## 1. Introduction

Participatory sensing is a form of crowdsourcing whereby individuals and communities submit scalar and/or multimedia data from mobile devices such as personal smart phones. The submitted data can be GPS coordinates revealing location or trajectory, a sensed data measurement, or multimedia content such as photos, sound clips, or video. The wide range of data that can be captured by participatory sensing is reflected in the diversity of its applications including, among others, smart cities [1], air pollution exposure [2], and health [3].The key to the success of a participatory sensing application is attracting a critical mass of relevant data. However, while participants may be willing to make data submissions, the majority expect some form of reward in return [4]. These rewards could be monetary [4] or credit tokens that can then be used to claim a reward [5].The issue of incentivization has direct implications for the quality of a service provider’s dataset. Users who are paid for assigned tasks complete them significantly more quickly than volunteer users [6]. In the case of participatory sensing and other similar data sharing environments, it has been found that proper incentive allocation improves data quality ([7, 8]). However, incentivization schemes for participatory sensing face a number of challenges to ensure that the service provider’s dataset is relevant and timely. In particular, the conditions in a participatory sensing environment can suddenly change; for example, a bridge connecting two areas of a city being closed due to high winds would result in a buildup of traffic. As a result of such sudden changes, the utility value of a particular type of data submission to the service provider can also change significantly. Moreover, as participation rates will vary over time, the service provider needs the ability to adapt the level of reward it offers to match the current response rate. At the same time, a service provider will have a finite budget and will want to optimize its consumption of this budget. This is of benefit not only to the service provider but also to those participants who want to consume the data and will therefore want it to be as relevant and timely as possible. Finally, any incentivization scheme should not have any negative impact upon other areas of concern in participatory sensing. For example, while there are reputation based incentivization schemes in the state of the art (for example, [9, 10]) that address the issue of data quality, this is typically at the expense of participant privacy.This paper presents adaptive reward allocation (ARA), an incentivization scheme that is designed for participatory sensing environments. The approach is designed in such a way that it can be integrated for any type of participatory sensing system application without impinging upon other issues of concern such as privacy. ARA addresses the need for ongoing reward computation and allocation in a way that adapts to the detection of sudden changes in the dynamic fast moving environment in which participatory sensing applications operate. In particular, the reward level is adapted on the basis of the response rate to an offer previously made by the service provider and on the basis of the utility of the data.


## 2. Related Work

The majority of incentivization schemes in the state of the art for participatory sensing use microeconomics, statistics, or a combination of both for reward computation. Section2.1 describes the economic approaches used for incentivization while Section 2.2 explores the options available from the field of statistics.


### 2.1. Economic Approaches to Incentivization

Several economic approaches in the state of the art use auctions ([8, 11–14]). There are many merits to the use of auctions including the diverse set of approaches that are available and its well-established use in incentive computation. However, auctions are vulnerable to collusion attacks [15]. In a participatory sensing environment, this means that colluding participants could consume a disproportionate amount of the service provider’s budget, thus diminishing the quality of the overall dataset. Auctions also entail a high level of overhead [16] as, in a participatory sensing environment, the service provider will typically need to gather all bids before deciding which participants to select. Moreover, auction-based schemes violate privacy as, even if pseudonyms are used, the service provider can monitor participants’ bid activity.In addition, some of the auction-based incentivization approaches in the state of the art have attributes which further limit their efficacy. For example, the Vickrey-Clarke-Groves (VCG) auction policy [11], a type of sealed bid auction, assumes that participants do not consider future benefits when making a bid. The potential for this assumption to be violated is acknowledged by the authors themselves who point out that the service provider’s budget would not be optimally consumed as a result. Similarly, the Cooperative Incentive Mechanism [13] exhibits some key limitations as its primary objective is to ensure that as many participants as possible are rewarded. While the authors justify this goal in terms of motivating participation, it does not take the optimization of budget consumption or the quality of the data submitted into account.Other approaches in the state of the art use principles of microeconomics to construct their incentivization schemes. For example, SenseUtil [17] uses the concepts of supply and demand and marginal utility to determine the value of sensed data but does not attempt to optimize rewards to determine a level at which data submissions will be made below that value. Moreover, neither the independent utility metric (which is used to evaluate the uniqueness of the sensed data) nor the history-based utility metric (which evaluates the similarity of sensed data to other data submissions) seeks to capture sudden changes in the participatory sensing environment as budget consumption and adaptiveness to response rate are not considered.Elementary supply and demand is also used to determine the grades of data being sought [18] where the incentivization approach is alluded to as a market mechanism, albeit without any further details. Similarly, SEQTGREEDY also applies microeconomics in its incentivization approach. In this case, the concept of marginal utility is used to maximize the service provider’s marginal gain [19]. However, the means by which the reward level can be adapted to capture sudden changes in the participatory sensing environment and reflect current participation rates is not addressed by either approach.


### 2.2. Statistical Approaches to Incentivization

The statistical methods used for incentive computation in the state of the art for participatory sensing are principally based on probability ([20, 21]), optimization ([22, 23]), and stochastics ([11, 19, 21, 24, 25]). Many of these approaches use a combination of these methods for their incentivization mechanism, often in conjunction with microeconomic techniques.There are a number of statistical-based incentivization approaches in the state of the art that seek to optimize budget consumption. For example, simulated annealing, a probabilistic optimization method, is used by EPPI [23] to minimize the levels of reward given to participants. The constrained budget of service providers is also taken into account. However, the approach does not consider the current participation rate and the dynamic changes that may occur in the participatory sensing environment.Other approaches do consider the quality of the data submitted. For example, the Bayesian Truth Serum incentive scheme [20] evaluates the data submitted using a probabilistic scoring system. There is also a Gur Game based approach [22] (a mathematical modelling of what is termed reward and punishment) in the state of the art that takes the quality of data into account. However, these approaches neither address the optimal consumption of the service provider’s budget nor adapt the reward level to reflect environmental changes or participation rates.The stochastic-based “Backpressure Meets Taxes” (BMT) mechanism [24], which uses Lyapunov Optimization in conjunction with Mechanism Design (the former is used for sensing rate control and routing, not reward computation), also does not consider how to optimize the level of reward to offer to participants and hence does not address the optimizing of budget consumption. Rather, BMT seeks to maximize what it terms the gross profit of participants. In contrast, the Markov Model based incentivization negotiation mechanism outlined in the state of the art [21] estimates the probability of data collection using this model and also applies the economic concept of supply and demand to create a budget optimization policy that takes the quality of the data submitted into account. However, while this approach does take budget constraints into account, its focus is on reward allocation fairness and the geographical distribution of the budget across the subregions of the sensed environment rather than the data that is of most relevance to a service provider at a particular point in time.SEQTGREEDY [19] also uses stochastics in conjunction with microeconomic concepts. In this case, the Stochastic Submodular Maximization method is used to enable privacy trade-offs in return for a reward. However, the assumption of diminishing returns inherent in the submodular functions used for this technique (i.e., incremental returns are lower over time) is not appropriate to adaptive reward allocation as, in the case of participatory sensing, this implies that the service provider could pay a higher level of reward over time.The STOC-PISCES algorithm [25] applies binary search and the Multi-Armed Bandit (MAB) Framework, a probabilistic method of resource allocation, to the stochastic (i.e., uncertain) setting of reward minimization. STOC-PISCES addresses the problem of determining the optimal reward level and also takes the utility of data (characterized as the demand for a particular type of data submission) into account when computing rewards. Moreover, the participation rate is taken into account as the underlying PISCES framework defines a reward for data submission at the beginning of a number of what it terms a trial and then adapts the reward for subsequent trials until the desired number of data submissions is obtained. However, while the approach sets a minimum and maximum range for the reward to offer, it does not seek to optimize budget consumption. As illustrated elsewhere in the state of the art, the goal of budget optimization would require substantial modification of the underlying MAB algorithm [23].To conclude, incentivization has been considered in the state of the art with SenseUtil and the STOC-PISCES approaches in particular addressing the need to consider participation rates and data utility. However, there is a need for an adaptive reward allocation scheme that not only takes both participation rates and data utility into account but also seeks to optimize consumption of a finite budget, i.e., an approach that seeks to optimize the trade-off between the number of responses received and the budget consumption.


## 2.1. Economic Approaches to Incentivization

Several economic approaches in the state of the art use auctions ([8, 11–14]). There are many merits to the use of auctions including the diverse set of approaches that are available and its well-established use in incentive computation. However, auctions are vulnerable to collusion attacks [15]. In a participatory sensing environment, this means that colluding participants could consume a disproportionate amount of the service provider’s budget, thus diminishing the quality of the overall dataset. Auctions also entail a high level of overhead [16] as, in a participatory sensing environment, the service provider will typically need to gather all bids before deciding which participants to select. Moreover, auction-based schemes violate privacy as, even if pseudonyms are used, the service provider can monitor participants’ bid activity.In addition, some of the auction-based incentivization approaches in the state of the art have attributes which further limit their efficacy. For example, the Vickrey-Clarke-Groves (VCG) auction policy [11], a type of sealed bid auction, assumes that participants do not consider future benefits when making a bid. The potential for this assumption to be violated is acknowledged by the authors themselves who point out that the service provider’s budget would not be optimally consumed as a result. Similarly, the Cooperative Incentive Mechanism [13] exhibits some key limitations as its primary objective is to ensure that as many participants as possible are rewarded. While the authors justify this goal in terms of motivating participation, it does not take the optimization of budget consumption or the quality of the data submitted into account.Other approaches in the state of the art use principles of microeconomics to construct their incentivization schemes. For example, SenseUtil [17] uses the concepts of supply and demand and marginal utility to determine the value of sensed data but does not attempt to optimize rewards to determine a level at which data submissions will be made below that value. Moreover, neither the independent utility metric (which is used to evaluate the uniqueness of the sensed data) nor the history-based utility metric (which evaluates the similarity of sensed data to other data submissions) seeks to capture sudden changes in the participatory sensing environment as budget consumption and adaptiveness to response rate are not considered.Elementary supply and demand is also used to determine the grades of data being sought [18] where the incentivization approach is alluded to as a market mechanism, albeit without any further details. Similarly, SEQTGREEDY also applies microeconomics in its incentivization approach. In this case, the concept of marginal utility is used to maximize the service provider’s marginal gain [19]. However, the means by which the reward level can be adapted to capture sudden changes in the participatory sensing environment and reflect current participation rates is not addressed by either approach.


## 2.2. Statistical Approaches to Incentivization

The statistical methods used for incentive computation in the state of the art for participatory sensing are principally based on probability ([20, 21]), optimization ([22, 23]), and stochastics ([11, 19, 21, 24, 25]). Many of these approaches use a combination of these methods for their incentivization mechanism, often in conjunction with microeconomic techniques.There are a number of statistical-based incentivization approaches in the state of the art that seek to optimize budget consumption. For example, simulated annealing, a probabilistic optimization method, is used by EPPI [23] to minimize the levels of reward given to participants. The constrained budget of service providers is also taken into account. However, the approach does not consider the current participation rate and the dynamic changes that may occur in the participatory sensing environment.Other approaches do consider the quality of the data submitted. For example, the Bayesian Truth Serum incentive scheme [20] evaluates the data submitted using a probabilistic scoring system. There is also a Gur Game based approach [22] (a mathematical modelling of what is termed reward and punishment) in the state of the art that takes the quality of data into account. However, these approaches neither address the optimal consumption of the service provider’s budget nor adapt the reward level to reflect environmental changes or participation rates.The stochastic-based “Backpressure Meets Taxes” (BMT) mechanism [24], which uses Lyapunov Optimization in conjunction with Mechanism Design (the former is used for sensing rate control and routing, not reward computation), also does not consider how to optimize the level of reward to offer to participants and hence does not address the optimizing of budget consumption. Rather, BMT seeks to maximize what it terms the gross profit of participants. In contrast, the Markov Model based incentivization negotiation mechanism outlined in the state of the art [21] estimates the probability of data collection using this model and also applies the economic concept of supply and demand to create a budget optimization policy that takes the quality of the data submitted into account. However, while this approach does take budget constraints into account, its focus is on reward allocation fairness and the geographical distribution of the budget across the subregions of the sensed environment rather than the data that is of most relevance to a service provider at a particular point in time.SEQTGREEDY [19] also uses stochastics in conjunction with microeconomic concepts. In this case, the Stochastic Submodular Maximization method is used to enable privacy trade-offs in return for a reward. However, the assumption of diminishing returns inherent in the submodular functions used for this technique (i.e., incremental returns are lower over time) is not appropriate to adaptive reward allocation as, in the case of participatory sensing, this implies that the service provider could pay a higher level of reward over time.The STOC-PISCES algorithm [25] applies binary search and the Multi-Armed Bandit (MAB) Framework, a probabilistic method of resource allocation, to the stochastic (i.e., uncertain) setting of reward minimization. STOC-PISCES addresses the problem of determining the optimal reward level and also takes the utility of data (characterized as the demand for a particular type of data submission) into account when computing rewards. Moreover, the participation rate is taken into account as the underlying PISCES framework defines a reward for data submission at the beginning of a number of what it terms a trial and then adapts the reward for subsequent trials until the desired number of data submissions is obtained. However, while the approach sets a minimum and maximum range for the reward to offer, it does not seek to optimize budget consumption. As illustrated elsewhere in the state of the art, the goal of budget optimization would require substantial modification of the underlying MAB algorithm [23].To conclude, incentivization has been considered in the state of the art with SenseUtil and the STOC-PISCES approaches in particular addressing the need to consider participation rates and data utility. However, there is a need for an adaptive reward allocation scheme that not only takes both participation rates and data utility into account but also seeks to optimize consumption of a finite budget, i.e., an approach that seeks to optimize the trade-off between the number of responses received and the budget consumption.


## 3. System Model and Assumptions

The participatory system model assumed for ARA has two actors: the service provider and the participant. A typical service provider wants to receive timely and relevant scalar and/or multimedia data pertaining to an environment. The service provider will publish the data it is interested in as a task to which participants can elect to respond in return for a reward. A task can consist of single or multiple types of sensed scalar or multimedia data. Depending on the nature of the service provider, data submissions can then be consumed by other users (for example, current pollution levels in a city) or used for data analytics purposes (for example, to build a climate model).The participatory sensing environment used for ARA is modelled as a service provider issuing offers to participants with offers consisting of the data being sought and the reward given for data matching that is requested by the offer. If the reward is greater than or equal to the minimum reward expected by a participant, that participant will then decide whether to make a data submission in response to this offer. It is assumed that participants are rational; i.e., the higher the reward offered for a particular type of data, the larger the number of responses (assuming other factors such as privacy perceptions remain constant). The participants are also assumed to incur costs (for example, battery consumption, consumption of network provider’s user data allocation) when making data submissions.It is assumed that the service provider’s budget is finite. This budget will either be a monetary one or consist of tangible rewards (for example, Wi-Fi access). A participant only receives a reward on full completion of a task with rewards only being allocated until the service provider has received its desired number of responses.The fundamental problem being addressed by ARA is a time average cost minimization one as the service provider is seeking to set the offered reward and corresponding budget consumption at the minimum level that will attract an acceptable level of relevant responses from participants. To model the problem, it is assumed that the service provider operates in discrete time over slotst∈1,2… with the reward level being reviewed at the start of each time slot. The service provider can issue one or more offers seeking data submissions in a time slot, t. Offers can be categorised by different levels of granularity of the service provider’s choosing, for example, the level of privacy to be ceded or location accuracy.


## 4. Adaptive Reward Allocation (ARA)

This section describes the adaptive reward allocation (ARA) scheme for computing rewards in participatory sensing environments. Section4.1 discusses why Lyapunov Optimization is used as the foundation for ARA’s incentivization scheme while Section 4.2 describes how supply curves are used to estimate the number of responses. Section 4.3 outlines how the participatory sensing environment is modelled in order to determine the number of responses that will be made for different levels of reward. Section 4.4 then formulates the budget optimization problem to be addressed. Sections 4.5 and 4.6 describe the offline and online budget consumption problems, respectively, while the design of the online algorithm is outlined in Section 4.7. Finally, the incorporation of data utility into the algorithm is discussed in Section 4.8.


### 4.1. Lyapunov Optimization

The method used by ARA for ongoing reward allocation is based upon Lyapunov Optimization. Lyapunov Optimization is a method that is particularly suitable for the controlling of dynamic systems. It is used for the computation of incentives and pricing in communication networks and has been previously used for incentive design for participatory sensing [26] (though not reward computation). It can be used to minimize dynamic costs [27] and is suitable for rapid changes over time in the environment in which it is applied [28]. These attributes are directly relevant given the desire by service providers that budget consumption be optimized.Lyapunov Optimization is particularly appropriate for ARA as the approach seeks to dynamically adapt rewards so as to respond to sudden and rapid changes in an environment with the nature, accuracy, quality, and level of detail of the data varying depending on the circumstances. Furthermore, the fact that a Lyapunov Optimization solution at any one time affects the constraint to be applied the next time the optimization is carried out is important for ARA as the service provider’s budget is being consumed with each optimization solution that results in accepted offers. Finally, the use of Lyapunov Optimization does not require future knowledge of the rate of response to offers made by the service provider. This is crucial for ARA’s reward model.As Lyapunov Optimization is principally used for resource allocation problems in domains such as computer networking [29], its use must be modified for the problem ARA is seeking to address. This is principally because there are a number of differentiating attributes of an economic market in participatory sensing. In particular, the data being sought by the service provider (equivalent to the product in other economic markets) can potentially change suddenly and its value to the service provider will change depending on that party’s needs at a particular point in time. While demand may change in other price optimization scenarios such as wind power or cloud infrastructure rental, the product does not. In participatory sensing, the “product” (type of data sought) not only changes over time but is time sensitive and needs to match the information sought by the service provider [30]. It is thus an appropriate candidate for a market-based model.


### 4.2. Estimating the Number of Responses

The reward included in the offer published by the service provider is a key factor in determining the number of responses,NO(t), for each offer O. It is therefore assumed that NO(t) is a function f of the offered reward denoted by RO(t) (all participants are offered the same reward):(1)NOt=fROtTo estimate NO(t), ARA requires a dataset that it can use to compute the appropriate value for ROt. In microeconomic terms, this is thereservation price at which the participant is willing to “sell” data. While the reservation price is typically computed by methods such as the Conjoint Analysis [31] and Contingent Valuation methods [29], these methods are dependent upon surveying potential customers (or participants in this case) which is not a practical option for meeting the requirement for adaptive reward allocation in a participatory sensing environment. Instead, ARA builds up a picture of participants’ willingness to accept offers at particular rates from supply curves that use previous data submissions from the service provider’s existing dataset. Previous data submissions thus act as a substitute for a survey to present an ongoing evolving picture of the willingness to accept offers at particular levels of reward.As the level of reward set by the service provider is a key determinant of the number of data submissions it obtains in response to an offer, the above function can be modelled using the microeconomic concept of a supply curve. The formal definition of a supply curve is a graphic representation of the relationship between product price and the quantity of the product that a seller is willing and able to supply. In terms of the ARA model, a number of supply curves are used to estimate the relationship between the reward offered and the number of responses different categories of offers attract from participants. These supply curves evolve over time as more offers are made by the service provider and more responses to offers are received. The relationship between the number of responses and the reward level thus serves as ever evolving training data (a set of data used to discover relationships) to enable the service provider to more accurately estimate the reward that will generate its desired number of responses.Each supply curve is modelled using regression analysis to predict the willingness of participants to accept offers at different reward levels. Typically, both demand and supply are modelled as a function of price and cost, respectively, using linear regression in the field of Econometrics [32] (see also, for example, [33]). However, to facilitate the incorporation of other predictors that will not necessarily have a linear relationship (for example, the effort involved in capturing the data), a nonlinear multiple regression method is used to predict the number of responses, Npredict. Specifically, a rolling window time series regression model is used to construct the prediction model so that only the most recent data is taken into account in the simulation. The size of the rolling window used can be altered depending on the circumstances in the participating sensing environment without impacting the algorithm. Indeed, any form of predictive modelling technique can be used to update the supply curves, thus allowing the service provider to evaluate which is the best predictive model to use [34].As noted in Section3, the participant will incur costs when submitting data resulting in different willingness to make data submissions. These costs can be considered as random effects that are summarized as a cost parameter C, which is random, i.i.d (independent and identically distributed) and varies between time slots. When the cost is high (for example, the smartphone is required for the user’s own needs; the battery is low), the user needs a higher reward to participate. When C is low (for example, the device is idle; the user has time to complete the task) then even a low reward might be enough. While the service provider does not have access to each individual participant’s circumstances during a particular time slot, it can nevertheless estimate C in terms of, for example, battery consumption, data transmission costs, and latency, i.e., the time taken to accept a task, carry out a task, make a data submission, and receive the reward for the completion of the task.The number of current active participantsP in each time slot t is another parameter of interest when predicting the number of responses. For example, when there are many active participants, a small reward that can motivate only 10% of these users might be enough in order to ensure the required number of responses. On the other hand, a higher per user reward is necessary for a participatory system with less active participants.Therefore,Npredict can be defined in terms of the rewards offeredR, the cost of carrying out the task, -C, and the ratio of the number of responses sought to the current number of participants, Pratio. Using X to denote this set of predictors as a vector and β to denote a vector of parameter coefficients, Npredict can be expressed as follows:(2)Npredict=fX,β+εwhere ε is an error term.Equation (2) can be expanded to incorporateR, -C, and Pratio. In addition, while the problem is nonlinear, it can be expressed in epigraph form as follows:(3)Npredict=β0R-β1C+β2Pratiowhereβ0 is the regression coefficient for R.β1 is the regression coefficient for –C.β2 is the regression coefficient for Pratio.Equation (3) can be extended by the service provider to incorporate other coefficients if there are other factors that determine the number of responses, for example, the level of privacy to be ceded. In addition, the service provider can remove what it deems to be irrelevant predictors without impacting the underlying reward model. For example, a service provider who is only seeking scalar data such as temperature might consider the task cost to be broadly similar between time slots.It should be noted that if the number of responses is greater thanNdesired, it will only be desirable from the service provider’s perspective to reward some of the responses to an offer. Moreover, while it may be possible to attract Ndesiredt, this might necessitate a reward level that is not consistent with optimal consumption of the service provider’s budget. Hence, while the supply curves can be used to determine reward levels, the trade-off between achieving Ndesiredt and budget consumption must be addressed. It is thus necessary to model this trade-off for the participatory sensing environment.


### 4.3. Modelling the Environment for Reward Determination

The relationship assumed by (1) is used to build up a picture of the (estimated) number of participant responses to a particular reward. However, there will be a point at which increasing the reward will not lead to an increase in the number of responses even if parameters such as C remain unchanged. This is because the maximum number of responses is equal to the number of participants in the participatory sensing system P(t) and varies over time as participants join and leave the system (either by formally deregistering or ceasing to participate). Thus for every time slott(4)0≤NOt≤PtRP(t) denotes the reward level when the number of responses equals the number of participants, i.e., when demand equals supply in economic terms:(5)NOt=PtP(t) is upper bounded by a constant Pmax which corresponds to the number of participants potentially active on the system. This leads to the following constraint for every time slott: (6)0≤Pt≤PmaxUsing the supply curves, ARA can estimate the number of responses that should be received at different levels of rewards for different categories of data. For example, the service provider estimates that it will receive NO number of responses when the reward level is set to RO. Taking (5) and (6) into account, RO should not exceed RP(t) as exceeding RP(t) will not increase the number of responses:(7)0≤RO≤RPtAs the supply curves evolve over time, the process of updating each curve is undertaken at the beginning of each time slot when reviewing the reward level. The service provider uses the reward-response data it has observed over previous time periods and, accordingly, updates the supply curve for this time slot.The problem ARA is seeking to address can thus be defined as follows:Problem Definition. For a given number of responses in a time slot t that follows an i.i.d. process with mean cost C, and for a certain level of minimum participants that the system should recruit, design a dynamic algorithm that finds the optimal level of reward so as to satisfy the above constraints while minimizing the budget consumption of the service provider.To achieve a trade-off between minimizing the number of offers forfeited due to too low a reward and optimizing budget consumption, the former is defined as a queue for a time slott, Zforfeit(t)  (Z is used to denote a virtual queue as this notation corresponds to that used in [35]). The number of forfeited responses is what is termed a “virtual queue”. As the name implies, virtual queues do not exist in reality and are only implemented in software to facilitate the definition of the Lyapunov Optimization-based model [29].Z f o r f e i t ( t ) is computed in terms of the number of responses desired by the service provider, Ndesired. Thus, in any time slot,t, Zforfeit(t) is the difference between the actual number of responses received Nreceived(t) and the desired number of responses Ndesired(t):(8)Zforfeitt=0Nreceivedt≥Ndesiredtmin⁡Ndesiredt,Pt-NreceivedtNreceivedt<Ndesiredt


### 4.4. Modelling the Environment for Budget Optimization

As originally formulated, Lyapunov Optimization is used to minimize the backlog of a queue for the purposes of optimizing resource allocation [35]. In mathematical terms, the method is the sum of squares of the queue (multiplied by 1/2) arising from a resourcing problem:(9)Lt=12∑iZit2Equation (9) measures the queue backlog for the system model, the queue being the number of forfeited responses as defined by (8).The computation ofNdesired(t) is dependent upon the requirements of the service provider. In a fast changing environment, it could decide that its desired number of responses is determined by its needs at a particular time; i.e., for every time slott, the desired number of responses is independent of previous timeslots: (10)Ndesiredt⊥Ndesiredt-1In such a case, it is assumed that Ndesiredt is i.i.d. over the time slots. Furthermore, unlike other scenarios typically modelled using Lyapunov Optimization (for example, [27]), Zforfeitt is, for every time slott, independent of queue backlogs from previous timeslots:(11)Zforfeitt⊥Zforfeitt-1Alternatively, the service provider may decide that if, for a previous timeslot t-1, Ndesired(t-1) < Nreceivedt-1, Ndesired(t) is determined by Ndesired(t-1); i.e., for every time slott(12)Ndesiredt=Ndesiredt-1-Nreceivedt-1s.t.Ndesiredt-1>Nreceivedt-1This then implies that the value of Zforfeit(t) is determined by Zforfeit(t-1); i.e.,(13)Zforfeitt=fZforfeitt-1While the underlying probability distribution and other statistical characteristics of Ndesiredt are not known by the service provider and are not required for Lyapunov Optimization, it must be assumed that its maximum value is finite:(14)0≤Ndesiredt≤NdesiredmaxMoreover, a further assumption is that the number of received responses to offers is bounded by the number of potentially active participants in the system. Thus, the expected values (the long run average values) of Ndesiredt+1 and P(t) adhere to the following rule:(15)ENdesiredt+1≤EPtThis inequality ensures that there is a reward allocation schedule that ensures the stability of Zforfeit(t). Using the rate stability theorem [35], Z-forfeit is used to denote the time average queue backlog for the forfeited responses. The stability of the queue is equal by definition as follows:(16)Z-forfeitk≜limt→∞⁡1t∑t=0t-1EZforfeitkt<∞It is assumed that the reward is upper bounded by a constantRmax. This means that for all time slotst(17)0≤Rt≤RmaxIn addition, the service provider can also set the maximum of proportion of the budget, Bproportionmax, that can be consumed for an offer in a given time slot: (18)0≤NtRt≤Bproportionmax


### 4.5. Formulating the Offline Problem

Before modelling the budget consumption problem for ARA, it is necessary to establish benchmarks to evaluate the approach. This section formulates the problem of reward allocation as two offline problems with complete future information and stochastic information, respectively, as benchmarks. These benchmark cases assume information symmetry; i.e., the service provider knows the response rate for a particular reward in the case of full information and knows the budget consumption under different scenarios in the case of stochastic future information.


#### 4.5.1. Complete Future Information

With complete future information, the service provider can determine the response rate jointly in all time slots to minimize budget consumption. To formulate the offline budget consumption problem,Τ is defined as the set of all time slots 1..tn during the sensing period where tn represents the final time slot. As no linear relationship is assumed between the number of responses and the reward offered, the problem is a nonlinear convex optimization problem and can be formulated as follows for an individual timeslot t:(19)mint∈TN1tR1t…NmaxtRmaxts.t.Rt≤RmaxNt≥NdesiredNtRt≤Bremainwhere Rmax is the maximum reward.N m a x is the number of responses received for Rmax.B r e m a i n is the remaining budget.The problem of minimizing the budget consumption over the entire set of time slotsΤ is subject to the same constraints and is formulated as follows:(20)1T∑t∈TNtRtThe offline reward allocation problem solved in (20) incorporates the explicit response rate of every time slot in advance. There are a wide range of optimization methods that can be used to solve (20), for example, the first fit and best fit algorithms, nonlinear programming methods, mixed integer linear programming methods (by formulating the problem in linear epigraph form), or, by using the linear programming relaxation, the simplex method or KKT analysis [8].The formulation and solving of (20) require complete knowledge of the future response rate in every time slot t, which is obviously impractical. For this reason, a model which only requires certain future information is defined.


#### 4.5.2. Stochastic Future Information

This section proposes a benchmark based on stochastic future information where the response rate for each time slot follows the same probability space. With stochastic information only, the service provider cannot decide the reward for a timeslot in advance as it does not have complete future information. This case focuses on the expected budget consumption optimization based on stochastic information.Θ defines the set of possible scenarios (or information realizations) that can occur when a service provider makes an offer at a particular reward level, R. Rθ and Nθ, respectively, denote the reward level and the number of expected responses to that reward under a particular information realization θ. Budget consumption under θ is NθRθ. Therefore, the expected budget optimization problem can be defined as follows:(21)min∫θ∈ΘNθRθLike (20), (21) is an offline problem subject to the same constraints that in this case defines a contingency plan that specifies the budget consumption under each information realization θ. It is a nonlinear programming problem with an infinite number of variables as θ is continuous.


#### 4.5.3. Analysing the Benchmarks

The next step is to analyse the gap between the minimum budget consumption with complete future information derived from (20) and the minimum budget consumption with stochastic future information derived from (21). These are denoted by Bo and B∗, respectively. As indicated in the state of the art [8], this can be expressed formally as follows.Lemma 1.
IfT→∞, then Bo→B∗.Lemma1 indicates that as long as the total sensing period T is of sufficient length, the diminution in budget consumption optimality caused by the loss of complete future information is negligible. Hence, both Bo and B∗ can serve as the same benchmark for an online policy that does not require future information. An online policy is necessary as the stochastic future information required by (21) may not be available in practice. ARA is thus modelled as an online problem of reward allocation, i.e., with no future information. The offline problem serves as a benchmark only.


### 4.6. Online Budget Consumption Optimization Problem

The Lyapunov Optimization-based budget optimization problem formulated in this section relies only on past response rates to particular rewards and does not require any future information. The goal of the service provider is to minimize the time average reward and hence optimize its budget consumption. The service provider’s budget (B) consumed in time slot t is given by(22)Bt=RtNtLyapunov Optimization requires a control decision. For ARA, the control decision refers to the setting of an optimal reward level R(t) for a particular time slot t. Thus, R(t) is the control decision made in time slot t. The resultant reward allocation policy arising from R(t) must meet constraints (14), (15), (16), and (17).The time average budget consumption of this policy can then be defined as(23)BAV≜limt→∞⁡1t∑t=0t-1ERtNtThe goal of ARA’s reward model is to determine a reward level R(t) that minimizes the time average budget consumption subject to constraints (14), (15), (16), and (17).


### 4.7. Designing the Reward Algorithm

The virtual queue,Zforfeit(t),in the modelled system is the dimension that has to be considered to achieve an optimal reward for a time slot t. As a result, from (9), the Lyapunov function for t can then be defined as(24)Lt≜12Zforfeitt2Equation (24) is a quadratic Lyapunov function, a scalar measure of the total queue backlog in the participatory sensing system. The expected change in the Lyapunov function over one time slot t is referred to as the one-slot conditional Lyapunov drift and is defined as(25)Δt≜Lt+1-LtTo achieve adaptive reward allocation that minimizes the reward offered for a data submission (and thus optimizes budget consumption) and still obtain meaningful and timely responses for the service provider’s dataset, (25) must be greedily minimized for each timeslott (i.e., the solution that is the best for the current timeslot is chosen) so as to minimize the queue backlog. In queuing theory terms, this means that the queue backlogs are pushed towards a lower congestion state on an ongoing basis with the goal of achieving queue stability. Therefore the budget consumption term B(t) is incorporated into (25) to produce adrift-plus-penalty expression:(26)Δt+VBtGiven that the overall objective is to minimize budget consumption, it should be minimized at the same time as the queue backlog is being minimized. This minimization objective is known as apenalty under Lyapunov Optimization. The fundamental objective of Lyapunov Optimization is to minimize the bound (limit) on the drift-plus-penalty expression [35].V is a nonnegative control parameter that is used to incorporate the weighted budget consumption term in the control decision. This facilitates the trade-off required by the service provider between reducing the backlog of Zforfeit and minimizing B. Thus, in statistical terms, the goal is to find the upper bound for (26).The drift-plus-penalty bound for a general case [35] can be extended for the environment in which ARA operates. The number of responses received for an offer, Nreceivedt, is assumed to be i.i.d. over time slots. Therefore, under any control algorithm that seeks to minimize the reward allocated, R(t), the drift-plus-penalty expression used for Lyapunov Optimization [35] can be formulated for ARA with the following upper bound:(27)Δt+VBt≤Bconstant+VEBt∣Zt+ZtENreceivedt-1-Ndesiredt∣ZtIt should be noted that Bconstant is a positive number used in the Lyapunov Optimization computation and is defined by (28)Bconstant≜12Nreceivedt-1-Ndesiredt2Like other Lyapunov Optimization-based models [35], the objective of the reward allocation algorithm presented for ARA is not to directly minimize (26). The goal rather is to minimize the upper bound on the right hand side of (27). Therefore, the reward allocation algorithm observes the queue backlog Z(t) in every time slot t and adapts the Lyapunov Optimization approach [35] to choose the budget consumption B(t) as the solution to the following problem: (29)minNtVRt+ZtAs was noted in (1), N(t) is a function of R(t). This constraint is ensured by the supply curves and thus the solution to problem (29) must be one of the rewards depicted on the relevant curve for the current time slot. This means that the reward to be allocated, R(t), can only be one of a number of possible values for each time slot t. The algorithm evaluates (29) for all possible levels of budget consumption and selects the reward corresponding to the optimal level of consumption. After this reward is selected, the responses are processed and rewarded by the service provider. The appropriate supply curve is then updated to reflect N(t), the number of responses received. The execution of the algorithm is repeated for every time slot in which an offer is made.A typical Lyapunov Optimization model only requires the current system state. This is modified for ARA as the algorithm determines the rewardR(t) to offer on the basis of the number of responses received in previous timeslots. In other words, the algorithm offers higher rewards when the backlog for Zforfeit is large and lowers the level of reward to offer when the backlog for Zforfeit is small.The optimality of (29) can be proven using standard Lyapunov Optimization theory [35]. B†(t) denotes the budget consumption in a timeslot t. Using B∗, the budget consumption benchmark that assumes stochastic future information, the following theorem can be presented.Theorem 2 (adapted from [35]).
(30) lim t → ∞ ⁡ ∑ t ∈ Τ E B † t ≥ B ∗ - B c o n s t a n t ϕEquation (30) implies that the formulation for the online budget consumption optimization converges to the minimum budget consumption asymptotically (as time tends towards infinity), with a controllable error bound O(1/ϕ).


### 4.8. Incorporating Data Utility

The value ofV is a key factor in devising an optimal budget consumption policy [33]. Specifically, if Bav∗ is the objective value of the time average maximization problem under an optimal policy, the following theorem holds [36].Theorem 3 (adapted from [36]).
Suppose the number of responses receivedNreceivedt-1 and the number of desired responses Ndesiredt are i.i.d. for each time slot. If there exists an δ>0 such that(31)ENreceivedt-1≤ENdesiredt-δthe following performance guarantees are then realized:(32)limt→∞⁡1t∑t=0t-1EptNt<Bav∗+BconstantVZ-≜limt→∞⁡1t∑t=0t-1EZt≤Bconstant+Bconstant+VRmaxPmaxϵ+Nmaxpt is the penalty used for achieving queue stability in Lyapunov Optimization (budget consumption in this case) while ϵ represents a constant >0.Theorem3 indicates that, by choosing a large value for V, the budget consumption can be arbitrarily close to the optimal solution. However, the average queue backlogs increase as the value of V is increased. This means that there is a trade-off between budget consumption and the size of Zt that can be tuned by the service provider depending on the significance of the data it is seeking in a particular timeslot, t.As the importance of data being sought will vary for the service provider, it can set a utility weightingU for these data submissions. The utility weighting increases with the importance of the data to the service provider and can be used to capture dynamic changes in the participating sensing environment. To reflect the importance of the data being sought, the value of U is mapped to that of V. Specifically, the value of V is increased in accordance with the data utility weighting so as to prioritize attracting data submissions over budget consumption, i.e.,(33)U∝1VUtility weighting can thus be used to capture dynamic changes in the participating sensing environment. It should be noted that the predictive model could also be used to tune the utility of the sought data submission without the need to modify the ARA algorithm. For example, the most recent data received could be weighted when constructing the predictive model if data is being sought on the basis of the most recent submissions.Algorithm1 presents the algorithm for reward computation. Table 1 presents the additional notations used in this algorithm.Table 1
Notations.
DPPLSH Left hand side of Drift Plus Penalty expression.  DPPRSH Right hand side of Drift Plus Penalty expression.  L l a s t(R) Last Lyapunov function calculated for a particular reward.  Ototal Total Number of Offers  OPTcurrent Current Lyapunov Optimization calculation.  OPTsolution Lyapunov Optimization solution.  Pcount Number of Participants.  predict Predict using Linear Regression model.  Roptimal The optimal value for the reward.  [R] Set of possible reward values.  R(t) The optimal reward to offer in a particular timeslot,t.  [R, Npredict, Zforfeit(t), Zlower(t)] Reward, number of predicted responses and queuing state variables for this reward.  [R, Npredict, Zforfeit(t)] The set of rewards, their respective queuing state variables and number of predicted responses.  N a c t u a l , R Actual responses for the different reward levels.  N p r e d i c t , R The number of predicted responses for the different reward levels.  Ntotal Total number of responses  [U,V] A map of data utility weightings and the constantVused for computing the Lyapunov Drift.  ΔX One-slot conditional Lyapunov Drift.Algorithm 1:Reward computation.
// Construct a Linear Regression model from the supply curve. Create Supply Curve forNactual,R from Historical Dataset Prediction_Model = Linear Regression Model for Supply Curve Nactual,R // Predict the responses for different reward levels. [ R ] = 0..Rmax [ N p r e d i c t , R] = predict(Prediction_Model, [R]) // Construct the queuing state variables for each reward. foreach R Z f o r f e i t = Npredict - Ndesired [ R , N p r e d i c t , Z f o r f e i t ( t ) ) ] + = [R, Npredict, Zforfeit(t)] end foreach // Compute the constant used for Lyapunov Optimization. B c o n s t a n t = 0.5 ∗ (Nreceived(t-1) - Ndesired(t))2 // Map the data utility weighting U to the value of V V=[U,V] // Evaluate each reward using Lyapunov Optimization. foreach[R, Npredict, Zforfeit(t)] // Compute the Budget used by this reward. B = R ∗Npredict //Check that the budget consumption // does not exceed the set maximum. if B > Bproportionmax then break // Carry out the Lyapunov Optimization // computation. L = 1/2 ∗Zforfeit(t)2 // Compute the one slot conditional Lyapunov drift. Δ ( t ) = L - Llast(R) // Evaluate the drift plus penalty expression. D P P L H S = Δ(t)+(V∗B) D P P R H S = Bconstant + (V ∗ B) + Z(t)(Nreceived(t-1) - Ndesired(t))) if DPPLHS >= DPPRHS then continue end if // Evaluate the current optimization // computation. O P T c u r r e n t= Npredict∗ ((V ∗ R) + Z(t)) if OPTcurrent > OPTsolution then O P T s o l u t i o n = O P T c u r r e n t R o p t i m a l = R end if end foreach


## 4.1. Lyapunov Optimization

The method used by ARA for ongoing reward allocation is based upon Lyapunov Optimization. Lyapunov Optimization is a method that is particularly suitable for the controlling of dynamic systems. It is used for the computation of incentives and pricing in communication networks and has been previously used for incentive design for participatory sensing [26] (though not reward computation). It can be used to minimize dynamic costs [27] and is suitable for rapid changes over time in the environment in which it is applied [28]. These attributes are directly relevant given the desire by service providers that budget consumption be optimized.Lyapunov Optimization is particularly appropriate for ARA as the approach seeks to dynamically adapt rewards so as to respond to sudden and rapid changes in an environment with the nature, accuracy, quality, and level of detail of the data varying depending on the circumstances. Furthermore, the fact that a Lyapunov Optimization solution at any one time affects the constraint to be applied the next time the optimization is carried out is important for ARA as the service provider’s budget is being consumed with each optimization solution that results in accepted offers. Finally, the use of Lyapunov Optimization does not require future knowledge of the rate of response to offers made by the service provider. This is crucial for ARA’s reward model.As Lyapunov Optimization is principally used for resource allocation problems in domains such as computer networking [29], its use must be modified for the problem ARA is seeking to address. This is principally because there are a number of differentiating attributes of an economic market in participatory sensing. In particular, the data being sought by the service provider (equivalent to the product in other economic markets) can potentially change suddenly and its value to the service provider will change depending on that party’s needs at a particular point in time. While demand may change in other price optimization scenarios such as wind power or cloud infrastructure rental, the product does not. In participatory sensing, the “product” (type of data sought) not only changes over time but is time sensitive and needs to match the information sought by the service provider [30]. It is thus an appropriate candidate for a market-based model.


## 4.2. Estimating the Number of Responses

The reward included in the offer published by the service provider is a key factor in determining the number of responses,NO(t), for each offer O. It is therefore assumed that NO(t) is a function f of the offered reward denoted by RO(t) (all participants are offered the same reward):(1)NOt=fROtTo estimate NO(t), ARA requires a dataset that it can use to compute the appropriate value for ROt. In microeconomic terms, this is thereservation price at which the participant is willing to “sell” data. While the reservation price is typically computed by methods such as the Conjoint Analysis [31] and Contingent Valuation methods [29], these methods are dependent upon surveying potential customers (or participants in this case) which is not a practical option for meeting the requirement for adaptive reward allocation in a participatory sensing environment. Instead, ARA builds up a picture of participants’ willingness to accept offers at particular rates from supply curves that use previous data submissions from the service provider’s existing dataset. Previous data submissions thus act as a substitute for a survey to present an ongoing evolving picture of the willingness to accept offers at particular levels of reward.As the level of reward set by the service provider is a key determinant of the number of data submissions it obtains in response to an offer, the above function can be modelled using the microeconomic concept of a supply curve. The formal definition of a supply curve is a graphic representation of the relationship between product price and the quantity of the product that a seller is willing and able to supply. In terms of the ARA model, a number of supply curves are used to estimate the relationship between the reward offered and the number of responses different categories of offers attract from participants. These supply curves evolve over time as more offers are made by the service provider and more responses to offers are received. The relationship between the number of responses and the reward level thus serves as ever evolving training data (a set of data used to discover relationships) to enable the service provider to more accurately estimate the reward that will generate its desired number of responses.Each supply curve is modelled using regression analysis to predict the willingness of participants to accept offers at different reward levels. Typically, both demand and supply are modelled as a function of price and cost, respectively, using linear regression in the field of Econometrics [32] (see also, for example, [33]). However, to facilitate the incorporation of other predictors that will not necessarily have a linear relationship (for example, the effort involved in capturing the data), a nonlinear multiple regression method is used to predict the number of responses, Npredict. Specifically, a rolling window time series regression model is used to construct the prediction model so that only the most recent data is taken into account in the simulation. The size of the rolling window used can be altered depending on the circumstances in the participating sensing environment without impacting the algorithm. Indeed, any form of predictive modelling technique can be used to update the supply curves, thus allowing the service provider to evaluate which is the best predictive model to use [34].As noted in Section3, the participant will incur costs when submitting data resulting in different willingness to make data submissions. These costs can be considered as random effects that are summarized as a cost parameter C, which is random, i.i.d (independent and identically distributed) and varies between time slots. When the cost is high (for example, the smartphone is required for the user’s own needs; the battery is low), the user needs a higher reward to participate. When C is low (for example, the device is idle; the user has time to complete the task) then even a low reward might be enough. While the service provider does not have access to each individual participant’s circumstances during a particular time slot, it can nevertheless estimate C in terms of, for example, battery consumption, data transmission costs, and latency, i.e., the time taken to accept a task, carry out a task, make a data submission, and receive the reward for the completion of the task.The number of current active participantsP in each time slot t is another parameter of interest when predicting the number of responses. For example, when there are many active participants, a small reward that can motivate only 10% of these users might be enough in order to ensure the required number of responses. On the other hand, a higher per user reward is necessary for a participatory system with less active participants.Therefore,Npredict can be defined in terms of the rewards offeredR, the cost of carrying out the task, -C, and the ratio of the number of responses sought to the current number of participants, Pratio. Using X to denote this set of predictors as a vector and β to denote a vector of parameter coefficients, Npredict can be expressed as follows:(2)Npredict=fX,β+εwhere ε is an error term.Equation (2) can be expanded to incorporateR, -C, and Pratio. In addition, while the problem is nonlinear, it can be expressed in epigraph form as follows:(3)Npredict=β0R-β1C+β2Pratiowhereβ0 is the regression coefficient for R.β1 is the regression coefficient for –C.β2 is the regression coefficient for Pratio.Equation (3) can be extended by the service provider to incorporate other coefficients if there are other factors that determine the number of responses, for example, the level of privacy to be ceded. In addition, the service provider can remove what it deems to be irrelevant predictors without impacting the underlying reward model. For example, a service provider who is only seeking scalar data such as temperature might consider the task cost to be broadly similar between time slots.It should be noted that if the number of responses is greater thanNdesired, it will only be desirable from the service provider’s perspective to reward some of the responses to an offer. Moreover, while it may be possible to attract Ndesiredt, this might necessitate a reward level that is not consistent with optimal consumption of the service provider’s budget. Hence, while the supply curves can be used to determine reward levels, the trade-off between achieving Ndesiredt and budget consumption must be addressed. It is thus necessary to model this trade-off for the participatory sensing environment.


## 4.3. Modelling the Environment for Reward Determination

The relationship assumed by (1) is used to build up a picture of the (estimated) number of participant responses to a particular reward. However, there will be a point at which increasing the reward will not lead to an increase in the number of responses even if parameters such as C remain unchanged. This is because the maximum number of responses is equal to the number of participants in the participatory sensing system P(t) and varies over time as participants join and leave the system (either by formally deregistering or ceasing to participate). Thus for every time slott(4)0≤NOt≤PtRP(t) denotes the reward level when the number of responses equals the number of participants, i.e., when demand equals supply in economic terms:(5)NOt=PtP(t) is upper bounded by a constant Pmax which corresponds to the number of participants potentially active on the system. This leads to the following constraint for every time slott: (6)0≤Pt≤PmaxUsing the supply curves, ARA can estimate the number of responses that should be received at different levels of rewards for different categories of data. For example, the service provider estimates that it will receive NO number of responses when the reward level is set to RO. Taking (5) and (6) into account, RO should not exceed RP(t) as exceeding RP(t) will not increase the number of responses:(7)0≤RO≤RPtAs the supply curves evolve over time, the process of updating each curve is undertaken at the beginning of each time slot when reviewing the reward level. The service provider uses the reward-response data it has observed over previous time periods and, accordingly, updates the supply curve for this time slot.The problem ARA is seeking to address can thus be defined as follows:Problem Definition. For a given number of responses in a time slot t that follows an i.i.d. process with mean cost C, and for a certain level of minimum participants that the system should recruit, design a dynamic algorithm that finds the optimal level of reward so as to satisfy the above constraints while minimizing the budget consumption of the service provider.To achieve a trade-off between minimizing the number of offers forfeited due to too low a reward and optimizing budget consumption, the former is defined as a queue for a time slott, Zforfeit(t)  (Z is used to denote a virtual queue as this notation corresponds to that used in [35]). The number of forfeited responses is what is termed a “virtual queue”. As the name implies, virtual queues do not exist in reality and are only implemented in software to facilitate the definition of the Lyapunov Optimization-based model [29].Z f o r f e i t ( t ) is computed in terms of the number of responses desired by the service provider, Ndesired. Thus, in any time slot,t, Zforfeit(t) is the difference between the actual number of responses received Nreceived(t) and the desired number of responses Ndesired(t):(8)Zforfeitt=0Nreceivedt≥Ndesiredtmin⁡Ndesiredt,Pt-NreceivedtNreceivedt<Ndesiredt


## 4.4. Modelling the Environment for Budget Optimization

As originally formulated, Lyapunov Optimization is used to minimize the backlog of a queue for the purposes of optimizing resource allocation [35]. In mathematical terms, the method is the sum of squares of the queue (multiplied by 1/2) arising from a resourcing problem:(9)Lt=12∑iZit2Equation (9) measures the queue backlog for the system model, the queue being the number of forfeited responses as defined by (8).The computation ofNdesired(t) is dependent upon the requirements of the service provider. In a fast changing environment, it could decide that its desired number of responses is determined by its needs at a particular time; i.e., for every time slott, the desired number of responses is independent of previous timeslots: (10)Ndesiredt⊥Ndesiredt-1In such a case, it is assumed that Ndesiredt is i.i.d. over the time slots. Furthermore, unlike other scenarios typically modelled using Lyapunov Optimization (for example, [27]), Zforfeitt is, for every time slott, independent of queue backlogs from previous timeslots:(11)Zforfeitt⊥Zforfeitt-1Alternatively, the service provider may decide that if, for a previous timeslot t-1, Ndesired(t-1) < Nreceivedt-1, Ndesired(t) is determined by Ndesired(t-1); i.e., for every time slott(12)Ndesiredt=Ndesiredt-1-Nreceivedt-1s.t.Ndesiredt-1>Nreceivedt-1This then implies that the value of Zforfeit(t) is determined by Zforfeit(t-1); i.e.,(13)Zforfeitt=fZforfeitt-1While the underlying probability distribution and other statistical characteristics of Ndesiredt are not known by the service provider and are not required for Lyapunov Optimization, it must be assumed that its maximum value is finite:(14)0≤Ndesiredt≤NdesiredmaxMoreover, a further assumption is that the number of received responses to offers is bounded by the number of potentially active participants in the system. Thus, the expected values (the long run average values) of Ndesiredt+1 and P(t) adhere to the following rule:(15)ENdesiredt+1≤EPtThis inequality ensures that there is a reward allocation schedule that ensures the stability of Zforfeit(t). Using the rate stability theorem [35], Z-forfeit is used to denote the time average queue backlog for the forfeited responses. The stability of the queue is equal by definition as follows:(16)Z-forfeitk≜limt→∞⁡1t∑t=0t-1EZforfeitkt<∞It is assumed that the reward is upper bounded by a constantRmax. This means that for all time slotst(17)0≤Rt≤RmaxIn addition, the service provider can also set the maximum of proportion of the budget, Bproportionmax, that can be consumed for an offer in a given time slot: (18)0≤NtRt≤Bproportionmax


## 4.5. Formulating the Offline Problem

Before modelling the budget consumption problem for ARA, it is necessary to establish benchmarks to evaluate the approach. This section formulates the problem of reward allocation as two offline problems with complete future information and stochastic information, respectively, as benchmarks. These benchmark cases assume information symmetry; i.e., the service provider knows the response rate for a particular reward in the case of full information and knows the budget consumption under different scenarios in the case of stochastic future information.


### 4.5.1. Complete Future Information

With complete future information, the service provider can determine the response rate jointly in all time slots to minimize budget consumption. To formulate the offline budget consumption problem,Τ is defined as the set of all time slots 1..tn during the sensing period where tn represents the final time slot. As no linear relationship is assumed between the number of responses and the reward offered, the problem is a nonlinear convex optimization problem and can be formulated as follows for an individual timeslot t:(19)mint∈TN1tR1t…NmaxtRmaxts.t.Rt≤RmaxNt≥NdesiredNtRt≤Bremainwhere Rmax is the maximum reward.N m a x is the number of responses received for Rmax.B r e m a i n is the remaining budget.The problem of minimizing the budget consumption over the entire set of time slotsΤ is subject to the same constraints and is formulated as follows:(20)1T∑t∈TNtRtThe offline reward allocation problem solved in (20) incorporates the explicit response rate of every time slot in advance. There are a wide range of optimization methods that can be used to solve (20), for example, the first fit and best fit algorithms, nonlinear programming methods, mixed integer linear programming methods (by formulating the problem in linear epigraph form), or, by using the linear programming relaxation, the simplex method or KKT analysis [8].The formulation and solving of (20) require complete knowledge of the future response rate in every time slot t, which is obviously impractical. For this reason, a model which only requires certain future information is defined.


### 4.5.2. Stochastic Future Information

This section proposes a benchmark based on stochastic future information where the response rate for each time slot follows the same probability space. With stochastic information only, the service provider cannot decide the reward for a timeslot in advance as it does not have complete future information. This case focuses on the expected budget consumption optimization based on stochastic information.Θ defines the set of possible scenarios (or information realizations) that can occur when a service provider makes an offer at a particular reward level, R. Rθ and Nθ, respectively, denote the reward level and the number of expected responses to that reward under a particular information realization θ. Budget consumption under θ is NθRθ. Therefore, the expected budget optimization problem can be defined as follows:(21)min∫θ∈ΘNθRθLike (20), (21) is an offline problem subject to the same constraints that in this case defines a contingency plan that specifies the budget consumption under each information realization θ. It is a nonlinear programming problem with an infinite number of variables as θ is continuous.


### 4.5.3. Analysing the Benchmarks

The next step is to analyse the gap between the minimum budget consumption with complete future information derived from (20) and the minimum budget consumption with stochastic future information derived from (21). These are denoted by Bo and B∗, respectively. As indicated in the state of the art [8], this can be expressed formally as follows.Lemma 1.
IfT→∞, then Bo→B∗.Lemma1 indicates that as long as the total sensing period T is of sufficient length, the diminution in budget consumption optimality caused by the loss of complete future information is negligible. Hence, both Bo and B∗ can serve as the same benchmark for an online policy that does not require future information. An online policy is necessary as the stochastic future information required by (21) may not be available in practice. ARA is thus modelled as an online problem of reward allocation, i.e., with no future information. The offline problem serves as a benchmark only.


## 4.5.1. Complete Future Information

With complete future information, the service provider can determine the response rate jointly in all time slots to minimize budget consumption. To formulate the offline budget consumption problem,Τ is defined as the set of all time slots 1..tn during the sensing period where tn represents the final time slot. As no linear relationship is assumed between the number of responses and the reward offered, the problem is a nonlinear convex optimization problem and can be formulated as follows for an individual timeslot t:(19)mint∈TN1tR1t…NmaxtRmaxts.t.Rt≤RmaxNt≥NdesiredNtRt≤Bremainwhere Rmax is the maximum reward.N m a x is the number of responses received for Rmax.B r e m a i n is the remaining budget.The problem of minimizing the budget consumption over the entire set of time slotsΤ is subject to the same constraints and is formulated as follows:(20)1T∑t∈TNtRtThe offline reward allocation problem solved in (20) incorporates the explicit response rate of every time slot in advance. There are a wide range of optimization methods that can be used to solve (20), for example, the first fit and best fit algorithms, nonlinear programming methods, mixed integer linear programming methods (by formulating the problem in linear epigraph form), or, by using the linear programming relaxation, the simplex method or KKT analysis [8].The formulation and solving of (20) require complete knowledge of the future response rate in every time slot t, which is obviously impractical. For this reason, a model which only requires certain future information is defined.


## 4.5.2. Stochastic Future Information

This section proposes a benchmark based on stochastic future information where the response rate for each time slot follows the same probability space. With stochastic information only, the service provider cannot decide the reward for a timeslot in advance as it does not have complete future information. This case focuses on the expected budget consumption optimization based on stochastic information.Θ defines the set of possible scenarios (or information realizations) that can occur when a service provider makes an offer at a particular reward level, R. Rθ and Nθ, respectively, denote the reward level and the number of expected responses to that reward under a particular information realization θ. Budget consumption under θ is NθRθ. Therefore, the expected budget optimization problem can be defined as follows:(21)min∫θ∈ΘNθRθLike (20), (21) is an offline problem subject to the same constraints that in this case defines a contingency plan that specifies the budget consumption under each information realization θ. It is a nonlinear programming problem with an infinite number of variables as θ is continuous.


## 4.5.3. Analysing the Benchmarks

The next step is to analyse the gap between the minimum budget consumption with complete future information derived from (20) and the minimum budget consumption with stochastic future information derived from (21). These are denoted by Bo and B∗, respectively. As indicated in the state of the art [8], this can be expressed formally as follows.Lemma 1.
IfT→∞, then Bo→B∗.Lemma1 indicates that as long as the total sensing period T is of sufficient length, the diminution in budget consumption optimality caused by the loss of complete future information is negligible. Hence, both Bo and B∗ can serve as the same benchmark for an online policy that does not require future information. An online policy is necessary as the stochastic future information required by (21) may not be available in practice. ARA is thus modelled as an online problem of reward allocation, i.e., with no future information. The offline problem serves as a benchmark only.


## 4.6. Online Budget Consumption Optimization Problem

The Lyapunov Optimization-based budget optimization problem formulated in this section relies only on past response rates to particular rewards and does not require any future information. The goal of the service provider is to minimize the time average reward and hence optimize its budget consumption. The service provider’s budget (B) consumed in time slot t is given by(22)Bt=RtNtLyapunov Optimization requires a control decision. For ARA, the control decision refers to the setting of an optimal reward level R(t) for a particular time slot t. Thus, R(t) is the control decision made in time slot t. The resultant reward allocation policy arising from R(t) must meet constraints (14), (15), (16), and (17).The time average budget consumption of this policy can then be defined as(23)BAV≜limt→∞⁡1t∑t=0t-1ERtNtThe goal of ARA’s reward model is to determine a reward level R(t) that minimizes the time average budget consumption subject to constraints (14), (15), (16), and (17).


## 4.7. Designing the Reward Algorithm

The virtual queue,Zforfeit(t),in the modelled system is the dimension that has to be considered to achieve an optimal reward for a time slot t. As a result, from (9), the Lyapunov function for t can then be defined as(24)Lt≜12Zforfeitt2Equation (24) is a quadratic Lyapunov function, a scalar measure of the total queue backlog in the participatory sensing system. The expected change in the Lyapunov function over one time slot t is referred to as the one-slot conditional Lyapunov drift and is defined as(25)Δt≜Lt+1-LtTo achieve adaptive reward allocation that minimizes the reward offered for a data submission (and thus optimizes budget consumption) and still obtain meaningful and timely responses for the service provider’s dataset, (25) must be greedily minimized for each timeslott (i.e., the solution that is the best for the current timeslot is chosen) so as to minimize the queue backlog. In queuing theory terms, this means that the queue backlogs are pushed towards a lower congestion state on an ongoing basis with the goal of achieving queue stability. Therefore the budget consumption term B(t) is incorporated into (25) to produce adrift-plus-penalty expression:(26)Δt+VBtGiven that the overall objective is to minimize budget consumption, it should be minimized at the same time as the queue backlog is being minimized. This minimization objective is known as apenalty under Lyapunov Optimization. The fundamental objective of Lyapunov Optimization is to minimize the bound (limit) on the drift-plus-penalty expression [35].V is a nonnegative control parameter that is used to incorporate the weighted budget consumption term in the control decision. This facilitates the trade-off required by the service provider between reducing the backlog of Zforfeit and minimizing B. Thus, in statistical terms, the goal is to find the upper bound for (26).The drift-plus-penalty bound for a general case [35] can be extended for the environment in which ARA operates. The number of responses received for an offer, Nreceivedt, is assumed to be i.i.d. over time slots. Therefore, under any control algorithm that seeks to minimize the reward allocated, R(t), the drift-plus-penalty expression used for Lyapunov Optimization [35] can be formulated for ARA with the following upper bound:(27)Δt+VBt≤Bconstant+VEBt∣Zt+ZtENreceivedt-1-Ndesiredt∣ZtIt should be noted that Bconstant is a positive number used in the Lyapunov Optimization computation and is defined by (28)Bconstant≜12Nreceivedt-1-Ndesiredt2Like other Lyapunov Optimization-based models [35], the objective of the reward allocation algorithm presented for ARA is not to directly minimize (26). The goal rather is to minimize the upper bound on the right hand side of (27). Therefore, the reward allocation algorithm observes the queue backlog Z(t) in every time slot t and adapts the Lyapunov Optimization approach [35] to choose the budget consumption B(t) as the solution to the following problem: (29)minNtVRt+ZtAs was noted in (1), N(t) is a function of R(t). This constraint is ensured by the supply curves and thus the solution to problem (29) must be one of the rewards depicted on the relevant curve for the current time slot. This means that the reward to be allocated, R(t), can only be one of a number of possible values for each time slot t. The algorithm evaluates (29) for all possible levels of budget consumption and selects the reward corresponding to the optimal level of consumption. After this reward is selected, the responses are processed and rewarded by the service provider. The appropriate supply curve is then updated to reflect N(t), the number of responses received. The execution of the algorithm is repeated for every time slot in which an offer is made.A typical Lyapunov Optimization model only requires the current system state. This is modified for ARA as the algorithm determines the rewardR(t) to offer on the basis of the number of responses received in previous timeslots. In other words, the algorithm offers higher rewards when the backlog for Zforfeit is large and lowers the level of reward to offer when the backlog for Zforfeit is small.The optimality of (29) can be proven using standard Lyapunov Optimization theory [35]. B†(t) denotes the budget consumption in a timeslot t. Using B∗, the budget consumption benchmark that assumes stochastic future information, the following theorem can be presented.Theorem 2 (adapted from [35]).
(30) lim t → ∞ ⁡ ∑ t ∈ Τ E B † t ≥ B ∗ - B c o n s t a n t ϕEquation (30) implies that the formulation for the online budget consumption optimization converges to the minimum budget consumption asymptotically (as time tends towards infinity), with a controllable error bound O(1/ϕ).


## 4.8. Incorporating Data Utility

The value ofV is a key factor in devising an optimal budget consumption policy [33]. Specifically, if Bav∗ is the objective value of the time average maximization problem under an optimal policy, the following theorem holds [36].Theorem 3 (adapted from [36]).
Suppose the number of responses receivedNreceivedt-1 and the number of desired responses Ndesiredt are i.i.d. for each time slot. If there exists an δ>0 such that(31)ENreceivedt-1≤ENdesiredt-δthe following performance guarantees are then realized:(32)limt→∞⁡1t∑t=0t-1EptNt<Bav∗+BconstantVZ-≜limt→∞⁡1t∑t=0t-1EZt≤Bconstant+Bconstant+VRmaxPmaxϵ+Nmaxpt is the penalty used for achieving queue stability in Lyapunov Optimization (budget consumption in this case) while ϵ represents a constant >0.Theorem3 indicates that, by choosing a large value for V, the budget consumption can be arbitrarily close to the optimal solution. However, the average queue backlogs increase as the value of V is increased. This means that there is a trade-off between budget consumption and the size of Zt that can be tuned by the service provider depending on the significance of the data it is seeking in a particular timeslot, t.As the importance of data being sought will vary for the service provider, it can set a utility weightingU for these data submissions. The utility weighting increases with the importance of the data to the service provider and can be used to capture dynamic changes in the participating sensing environment. To reflect the importance of the data being sought, the value of U is mapped to that of V. Specifically, the value of V is increased in accordance with the data utility weighting so as to prioritize attracting data submissions over budget consumption, i.e.,(33)U∝1VUtility weighting can thus be used to capture dynamic changes in the participating sensing environment. It should be noted that the predictive model could also be used to tune the utility of the sought data submission without the need to modify the ARA algorithm. For example, the most recent data received could be weighted when constructing the predictive model if data is being sought on the basis of the most recent submissions.Algorithm1 presents the algorithm for reward computation. Table 1 presents the additional notations used in this algorithm.Table 1
Notations.
DPPLSH Left hand side of Drift Plus Penalty expression.  DPPRSH Right hand side of Drift Plus Penalty expression.  L l a s t(R) Last Lyapunov function calculated for a particular reward.  Ototal Total Number of Offers  OPTcurrent Current Lyapunov Optimization calculation.  OPTsolution Lyapunov Optimization solution.  Pcount Number of Participants.  predict Predict using Linear Regression model.  Roptimal The optimal value for the reward.  [R] Set of possible reward values.  R(t) The optimal reward to offer in a particular timeslot,t.  [R, Npredict, Zforfeit(t), Zlower(t)] Reward, number of predicted responses and queuing state variables for this reward.  [R, Npredict, Zforfeit(t)] The set of rewards, their respective queuing state variables and number of predicted responses.  N a c t u a l , R Actual responses for the different reward levels.  N p r e d i c t , R The number of predicted responses for the different reward levels.  Ntotal Total number of responses  [U,V] A map of data utility weightings and the constantVused for computing the Lyapunov Drift.  ΔX One-slot conditional Lyapunov Drift.Algorithm 1:Reward computation.
// Construct a Linear Regression model from the supply curve. Create Supply Curve forNactual,R from Historical Dataset Prediction_Model = Linear Regression Model for Supply Curve Nactual,R // Predict the responses for different reward levels. [ R ] = 0..Rmax [ N p r e d i c t , R] = predict(Prediction_Model, [R]) // Construct the queuing state variables for each reward. foreach R Z f o r f e i t = Npredict - Ndesired [ R , N p r e d i c t , Z f o r f e i t ( t ) ) ] + = [R, Npredict, Zforfeit(t)] end foreach // Compute the constant used for Lyapunov Optimization. B c o n s t a n t = 0.5 ∗ (Nreceived(t-1) - Ndesired(t))2 // Map the data utility weighting U to the value of V V=[U,V] // Evaluate each reward using Lyapunov Optimization. foreach[R, Npredict, Zforfeit(t)] // Compute the Budget used by this reward. B = R ∗Npredict //Check that the budget consumption // does not exceed the set maximum. if B > Bproportionmax then break // Carry out the Lyapunov Optimization // computation. L = 1/2 ∗Zforfeit(t)2 // Compute the one slot conditional Lyapunov drift. Δ ( t ) = L - Llast(R) // Evaluate the drift plus penalty expression. D P P L H S = Δ(t)+(V∗B) D P P R H S = Bconstant + (V ∗ B) + Z(t)(Nreceived(t-1) - Ndesired(t))) if DPPLHS >= DPPRHS then continue end if // Evaluate the current optimization // computation. O P T c u r r e n t= Npredict∗ ((V ∗ R) + Z(t)) if OPTcurrent > OPTsolution then O P T s o l u t i o n = O P T c u r r e n t R o p t i m a l = R end if end foreach


## 5. Evaluation of ARA

ARA is evaluated through a series of experiments carried out in a simulated participatory sensing environment. The algorithm has been implemented for the simulation using the C++ and Statistical R programming languages.Section5.1 presents the experimental setup for this environment. Section 5.2 evaluates the adaptiveness of ARA with respect to the response rate and the utility of the data sought while Section 5.3 assesses the budget consumption of the approach. The SenseUtil approach [17] and the STOC-PISCES algorithm [25] are used as the baselines for comparison as the objective of the former is to compute incentives on the basis of data utility while the goal of the latter in adapting rewards to the response rate and utility is similar to that of ARA.


### 5.1. Experimental Setup

ARA is evaluated in a simulated participatory sensing environment. In this simulation, the service provider makes a series of offers over the duration of the simulation. 100 responses are sought for each offer. While the number of responses sought will vary among participatory sensing applications as well as over time, this figure is chosen to clearly determine whether the reward level is adapting to the response rate and the utility of the data sought. The maximum reward to be set for an offer is 200 units. Each simulation runs for one hour with offers being generated every 30 seconds. For the purposes of the simulation, it is assumed that each offer corresponds to one timeslott (i.e., one offer is produced per timeslot) with the reward being reevaluated with each offer.The simulation is run in two types of environment, one with a high initial number of responses (referred to as the “high response environment”) and one with a low initial number of responses low (referred to as the “low response environment”). The initial response rate ranges between 70% and 200% and 10% and 50%, respectively, for these environments. The participant response rate is generated using a continuous uniform distribution. The simulation model varies this response rate using a randomly generated increment to evaluate how the reward adapts to these changes in the response rate. This randomness is incorporated to reflect other factors in the participatory sensing environment that may affect the response rate.For the purposes of the simulation, the response rate is calculated simply as the ratio of the number of responses submitted to the number of responses sought. However, the response rate could be defined using other metrics such as the coverage of a particular area ([37, 38]) without impacting the underlying algorithm.As noted in Section4.8, the value of V can be tuned to reflect the data attributes that are of most interest to a service provider at a particular point in time. For the purposes of the evaluation, the value of V for each offer is set either to 0 to prioritize attracting data submissions or 1000 to prioritize budget consumption. As V is set to 0 for the majority of experiments, the value of V is only indicated when its value is 1000.Finally, the size of the rolling window used for predicting the number of responses is set to the last 100 responses while the budget is set to 50,000 units for those experiments that evaluate budget consumption. Table2 presents the parameters used for the simulation.Table 2
Simulation parameters.
Simulation Duration 3600 seconds Offer Interval 30 seconds No. of Responding Participants 10-200 Initial Reward 105 No. of Responses Sought 100 Initial Response Rate (i) High Response Environment 70%-200% (ii) Low Response Environment 10%-50% Maximum Reward for an Offer 200 Service Provider Budget 50,000 V 0,1000 Rolling Window for Regression 100While the similar objectives of ARA and STOC-PISCES mean that the latter can be integrated in the modelled participatory sensing environment without customization of the underlying algorithm, this is not the case for SenseUtil as the latter does not adapt rewards to the response rate. Rather, SenseUtil determines the reward to offer on the basis of the number of potential participants. To ensure a valid comparison, the SenseUtil model is simulated in a participatory sensing environment with the number of potential participants set to 50 (the figure used by the authors) and 200 (which, according to the authors of the approach, should lead to lower rewards), respectively. The computed utility, as is the case for the simulation used by the authors, is mapped on a one-to-one basis to an economic point system which in turn determines the reward to be offered. A one-to-one mapping between this economic point system and the reward to be offered is used for the simulation with the utility range being set from 10 to 200 to correspond to the reward range used for ARA and STOC-PISCES. Distance between sensed locations is used by SenseUtil to determine data utility with the minimum distance used to compute the location utility in the simulation being (like the authors’ simulation) set to 50 m and 100 m.


### 5.2. Adaptiveness and Utility

Figure1 presents the adaptiveness of ARA to the response rate. It can be seen from the graph that the reward is increased so as to attract more data submissions at low response rates while the reward is reduced where the response rate approaches or exceeds 100%. Moreover, the reward settles on a value over time that generates a response rate close to 100%. It should be noted that the reward is not always immediately adapted after a change in the response rate for a particular offer as the regression model used for the supply curves ensures that the focus is on changes that occur over time rather than sudden changes that may be outliers, thus ensuring that the budget is not needlessly consumed.Figure 1
Adapting the reward to the response rate.Figures2–6 compare the adaptiveness of ARA with the STOC-PISCES algorithm. The number of initial trials used by STOC-PISCES is set to 10, which is the figure used by the approach’s authors in their evaluation. To ensure a fair comparison, the initial reward for ARA is set to an initial value of 105 units. This is because the STOC-PISCES algorithm initially runs a number of trials offering an initially higher reward at the median (105 for a range of 10-200).Figure 2
ARA adaptiveness (high response environment).Figure 3
ARA adaptiveness (low response environment).Figure 4
ARA adaptiveness (low response environment, V = 1000).Figure 5
STOC-PISCES adaptiveness (high response environment).Figure 6
STOC-PISCES adaptiveness (low response environment).It can be seen from Figures2 and 5 that STOC-PISCES adapts to the response rate at a much slower rate than ARA in a high response environment. This is reflected in the average reward offered by STOC-PISCES which, at 102.87 units, is substantially higher than the figure of 12.53 units for IPPI.The findings for a low response environment for ARA and STOC-PISCES are presented in Figures3 and 6, respectively. In this environment, STOC-PISCES rapidly and substantially increases the reward it offers so as to attract more submissions. This leads to much higher rewards being offered for the equivalent response rate received by ARA. ARA offers a substantially higher average reward of 48.26 units in this environment which is, nonetheless, still much lower than the average of 175.25 units offered by STOC-PISCES.Figure4 shows that the average reward is significantly lower (11.08 units) when, by setting the value of V to 1000, budget consumption is prioritized over attracting data submissions in a low response environment. This highlights how ARA not only adapts its reward to response rates but also uses the value of V to take data utility into account.


### 5.3. Budget Consumption

Figure7 presents the average reward for ARA, STOC-PISCES, and SenseUtil. It can be seen that the average reward for ARA is lower than that computed by the other two approaches. This is the case even in a low response environment with V being set to zero so as to attract as many responses as possible.Figure 7
Average reward.Figures8 and 9 present a comparison of the budget consumption by ARA and the STOC-PISCES algorithm. The SenseUtil approach is not used for this experiment as integrating adaptiveness to the response rate would have required modification and extension of the underlying algorithm. Each simulation has been run until the allocated budget has been consumed.Figure 8
Responses and offers.
(a)
Total no. of responses (b)
Total no. of offersFigure 9
Budget consumption.
(a)
Rate of budget consumption (high response environment) (b)
Rate of budget consumption (low response environment)It can be seen from Figure8(a) that, with a budget of 50,000 units, ARA generates 3325 responses in a high response environment. This figure is significantly larger than that for STOC-PISCES at 598. Moreover, in a low response environment, ARA generates over 3682 responses, albeit with a much higher number of offers than in the high response environment. It should also be noted that, in both the low and high response environment, the budget optimization of ARA is superior to that of STOC-PISCES as the former generates a higher number of offers (as shown in Figure 8(b), the number of offers is 31 and 102, respectively, for ARA; the number of offers is 6 and 13, respectively, for STOC-PISCES) with the same budget.The higher number of responses generated by ARA appears to result from STOC-PISCES not taking budget consumption into account. Specifically, the offering of the same reward for a number of trials regardless of the response rate results in a higher overall average reward and more rapid budget consumption. In contrast, ARA reduces the reward it offers more quickly in a high response environment and while it does increase its reward in a low response environment, it does so more prudently than STOC-PISCES which tends to raise the level of reward offered close to the maximum reward more quickly than ARA. This is borne out by the budget consumption which is much steadier for ARA in both a low and a high response environment as shown in Figure9.


## 5.1. Experimental Setup

ARA is evaluated in a simulated participatory sensing environment. In this simulation, the service provider makes a series of offers over the duration of the simulation. 100 responses are sought for each offer. While the number of responses sought will vary among participatory sensing applications as well as over time, this figure is chosen to clearly determine whether the reward level is adapting to the response rate and the utility of the data sought. The maximum reward to be set for an offer is 200 units. Each simulation runs for one hour with offers being generated every 30 seconds. For the purposes of the simulation, it is assumed that each offer corresponds to one timeslott (i.e., one offer is produced per timeslot) with the reward being reevaluated with each offer.The simulation is run in two types of environment, one with a high initial number of responses (referred to as the “high response environment”) and one with a low initial number of responses low (referred to as the “low response environment”). The initial response rate ranges between 70% and 200% and 10% and 50%, respectively, for these environments. The participant response rate is generated using a continuous uniform distribution. The simulation model varies this response rate using a randomly generated increment to evaluate how the reward adapts to these changes in the response rate. This randomness is incorporated to reflect other factors in the participatory sensing environment that may affect the response rate.For the purposes of the simulation, the response rate is calculated simply as the ratio of the number of responses submitted to the number of responses sought. However, the response rate could be defined using other metrics such as the coverage of a particular area ([37, 38]) without impacting the underlying algorithm.As noted in Section4.8, the value of V can be tuned to reflect the data attributes that are of most interest to a service provider at a particular point in time. For the purposes of the evaluation, the value of V for each offer is set either to 0 to prioritize attracting data submissions or 1000 to prioritize budget consumption. As V is set to 0 for the majority of experiments, the value of V is only indicated when its value is 1000.Finally, the size of the rolling window used for predicting the number of responses is set to the last 100 responses while the budget is set to 50,000 units for those experiments that evaluate budget consumption. Table2 presents the parameters used for the simulation.Table 2
Simulation parameters.
Simulation Duration 3600 seconds Offer Interval 30 seconds No. of Responding Participants 10-200 Initial Reward 105 No. of Responses Sought 100 Initial Response Rate (i) High Response Environment 70%-200% (ii) Low Response Environment 10%-50% Maximum Reward for an Offer 200 Service Provider Budget 50,000 V 0,1000 Rolling Window for Regression 100While the similar objectives of ARA and STOC-PISCES mean that the latter can be integrated in the modelled participatory sensing environment without customization of the underlying algorithm, this is not the case for SenseUtil as the latter does not adapt rewards to the response rate. Rather, SenseUtil determines the reward to offer on the basis of the number of potential participants. To ensure a valid comparison, the SenseUtil model is simulated in a participatory sensing environment with the number of potential participants set to 50 (the figure used by the authors) and 200 (which, according to the authors of the approach, should lead to lower rewards), respectively. The computed utility, as is the case for the simulation used by the authors, is mapped on a one-to-one basis to an economic point system which in turn determines the reward to be offered. A one-to-one mapping between this economic point system and the reward to be offered is used for the simulation with the utility range being set from 10 to 200 to correspond to the reward range used for ARA and STOC-PISCES. Distance between sensed locations is used by SenseUtil to determine data utility with the minimum distance used to compute the location utility in the simulation being (like the authors’ simulation) set to 50 m and 100 m.


## 5.2. Adaptiveness and Utility

Figure1 presents the adaptiveness of ARA to the response rate. It can be seen from the graph that the reward is increased so as to attract more data submissions at low response rates while the reward is reduced where the response rate approaches or exceeds 100%. Moreover, the reward settles on a value over time that generates a response rate close to 100%. It should be noted that the reward is not always immediately adapted after a change in the response rate for a particular offer as the regression model used for the supply curves ensures that the focus is on changes that occur over time rather than sudden changes that may be outliers, thus ensuring that the budget is not needlessly consumed.Figure 1
Adapting the reward to the response rate.Figures2–6 compare the adaptiveness of ARA with the STOC-PISCES algorithm. The number of initial trials used by STOC-PISCES is set to 10, which is the figure used by the approach’s authors in their evaluation. To ensure a fair comparison, the initial reward for ARA is set to an initial value of 105 units. This is because the STOC-PISCES algorithm initially runs a number of trials offering an initially higher reward at the median (105 for a range of 10-200).Figure 2
ARA adaptiveness (high response environment).Figure 3
ARA adaptiveness (low response environment).Figure 4
ARA adaptiveness (low response environment, V = 1000).Figure 5
STOC-PISCES adaptiveness (high response environment).Figure 6
STOC-PISCES adaptiveness (low response environment).It can be seen from Figures2 and 5 that STOC-PISCES adapts to the response rate at a much slower rate than ARA in a high response environment. This is reflected in the average reward offered by STOC-PISCES which, at 102.87 units, is substantially higher than the figure of 12.53 units for IPPI.The findings for a low response environment for ARA and STOC-PISCES are presented in Figures3 and 6, respectively. In this environment, STOC-PISCES rapidly and substantially increases the reward it offers so as to attract more submissions. This leads to much higher rewards being offered for the equivalent response rate received by ARA. ARA offers a substantially higher average reward of 48.26 units in this environment which is, nonetheless, still much lower than the average of 175.25 units offered by STOC-PISCES.Figure4 shows that the average reward is significantly lower (11.08 units) when, by setting the value of V to 1000, budget consumption is prioritized over attracting data submissions in a low response environment. This highlights how ARA not only adapts its reward to response rates but also uses the value of V to take data utility into account.


## 5.3. Budget Consumption

Figure7 presents the average reward for ARA, STOC-PISCES, and SenseUtil. It can be seen that the average reward for ARA is lower than that computed by the other two approaches. This is the case even in a low response environment with V being set to zero so as to attract as many responses as possible.Figure 7
Average reward.Figures8 and 9 present a comparison of the budget consumption by ARA and the STOC-PISCES algorithm. The SenseUtil approach is not used for this experiment as integrating adaptiveness to the response rate would have required modification and extension of the underlying algorithm. Each simulation has been run until the allocated budget has been consumed.Figure 8
Responses and offers.
(a)
Total no. of responses (b)
Total no. of offersFigure 9
Budget consumption.
(a)
Rate of budget consumption (high response environment) (b)
Rate of budget consumption (low response environment)It can be seen from Figure8(a) that, with a budget of 50,000 units, ARA generates 3325 responses in a high response environment. This figure is significantly larger than that for STOC-PISCES at 598. Moreover, in a low response environment, ARA generates over 3682 responses, albeit with a much higher number of offers than in the high response environment. It should also be noted that, in both the low and high response environment, the budget optimization of ARA is superior to that of STOC-PISCES as the former generates a higher number of offers (as shown in Figure 8(b), the number of offers is 31 and 102, respectively, for ARA; the number of offers is 6 and 13, respectively, for STOC-PISCES) with the same budget.The higher number of responses generated by ARA appears to result from STOC-PISCES not taking budget consumption into account. Specifically, the offering of the same reward for a number of trials regardless of the response rate results in a higher overall average reward and more rapid budget consumption. In contrast, ARA reduces the reward it offers more quickly in a high response environment and while it does increase its reward in a low response environment, it does so more prudently than STOC-PISCES which tends to raise the level of reward offered close to the maximum reward more quickly than ARA. This is borne out by the budget consumption which is much steadier for ARA in both a low and a high response environment as shown in Figure9.


## 6. Conclusion

This paper proposes ARA, an adaptive incentivization scheme that uses the Lyapunov Optimization method to provide rewards that seek to capture data that reflects the dynamic environment in which many participatory sensing applications operate. Experimental results show that ARA performs ongoing reward computation on the basis of response rates and data utility.This work addresses the fundamental challenge of rewarding participants in a way that ensures that the service provider’s dataset is reflective of the participatory sensing environment. Further challenges to be addressed include the need to make ARA privacy aware, secure, and incentive compatible so as to provide untraceable rewards and preserve identity privacy as well as evaluating the approach’s robustness to collusion attacks that artificially raise reward prices.



---

*Source: 6353425-2018-08-07.xml*