arXiv subjects

David B. Smith

Publications and source records attributed to David B. Smith.

18 recordsLinked to original sources

arXiv2020

An Incentive-compatible Energy Trading Framework for Neighborhood Area Networks with Shared Energy Storage

Here, a novel energy trading system is proposed for demand-side management of a neighborhood area network (NAN) consisting of a shared energy storage (SES) provider, users with non-dispatchable energy generation, and an electricity retailer. In a leader-follower Stackelberg game, the SES provider first maximizes their revenue by setting a price signal and trading energy with the grid. Then, by following the SES provider's actions, the retailer minimizes social cost for the users, i.e., the sum of the total users' cost when they interact with the SES and the total cost for supplying grid energy to the users. A pricing strategy, which incorporates mechanism design, is proposed to make the system incentive-compatible by rewarding users who disclose true energy usage information. A unique Stackelberg equilibrium is achieved where the SES provider's revenue is maximized and the user-level social cost is minimized, which also rewards the retailer. A case study with realistic energy demand and generation data demonstrates 28\%~-~45\% peak demand reduction of the NAN, depending on the number of participating users, compared to a system without SES. Simulation results confirm that the retailer can also benefit financially, in addition to the SES provider and the users.

eess.SY↗

arXiv2019

A Survey of Algorithms for Distributed Charging Control of Electric Vehicles in Smart Grid

Electric vehicles (EVs) are an eco-friendly alternative to vehicles with internal combustion engines. Despite their environmental benefits, the massive electricity demand imposed by the anticipated proliferation of EVs could jeopardize the secure and economic operation of the power grid. Hence, proper strategies for charging coordination will be indispensable to the future power grid. Coordinated EV charging schemes can be implemented as centralized, decentralized, and hierarchical systems, with the last two, referred to as distributed charging control systems. This paper reviews the recent literature of distributed charging control schemes, where the computations are distributed across multiple EVs and/or aggregators. First, we categorize optimization problems for EV charging in terms of operational aspects and cost aspects. Then under each category, we provide a comprehensive discussion on algorithms for distributed EV charge scheduling, considering the perspectives of the grid operator, the aggregator, and the EV user. We also discuss how certain algorithms proposed in the literature cope with various uncertainties inherent to distributed EV charging control problems. Finally, we outline several research directions that require further attention.

eess.SY↗

arXiv2019

Towards Smart Wireless Body-Centric Networks

We investigate the existence of 'long-memory' or long-range dependence (LRD) of the wireless body-centric channels, e.g., on-body, body-to-body (B2B), with real-life experimental dataset collected from 10 co-located wireless body area networks or BANs (people fitted with wearable sensors). We examine two different factors on that purpose such as: the pattern of the decaying autocorrelation function (ACF) and the Hurst exponent. From the experimental outcome, we show that, the ACF decay of the body-centric channels follows a power-like decay and the channels have a Hurst exponent much greater than 0.5 on average. These results indicate that the body-centric channels can possess long-memory or LRD characteristic which can be used for predictive analysis and intelligent decision making to build futuristic wireless human-centered networks that can sense and act autonomously. We also clarify whether the presence of the LRD property is sufficient for reliable prediction of the body-centric channels.

eess.SP↗

arXiv2019

Experimentally-based Cross-layer Optimization for Distributed Wireless Body-to-body Networks

We investigate cross-layer optimization to route information across distributed wireless body-to-body networks, based on real-life experimental measurements. At the network layer, the best possible route is selected according to channel state information (e.g., expected transmission count, hop count) from the physical layer. Two types of dynamic routing are applied: shortest path routing (SPR), and cooperative multi-path routing (CMR) associated with selection combining. An open-access experimental dataset incorporating `everyday' mixed-activities is used for analyzing and comparing the cross-layer optimization with different wireless sensor network protocols (i.e., ORPL, LOADng). Negligible packet error rate is achieved by applying CMR and SPR techniques with reasonably sensitive receivers. Moreover, at 10% outage probability, CMR gains up to 8, 7, and 6 dB improvements over ORPL, SPR, and LOADng, respectively. We show that CMR achieves the highest throughput (packets/s) while providing acceptable amount of average end-to-end delay (47.5 ms), at -100 dBm receive sensitivity. The use of alternate paths in CMR reduces retransmissions and increases packet success rate, which significantly reduces the maximum amount of end-to-end delay and energy consumption for CMR with respect to other protocols. It is also shown that the combined channel gains across SPR and CMR are gamma and Rician distributed, correspondingly.

cs.NI↗

arXiv2018

Wide-Sense-Stationarity of Everyday Wireless Channels for Body-to-Body Networks

The existence of wide-sense-stationarity (WSS) in narrowband wireless body-to-body networks is investigated for "everyday" scenarios using many hours of contiguous experimental data. We employ different parametric and non-parametric hypothesis tests for evaluating mean and variance stationarity, along with distribution consistency, of several body-to-body channels found from different on-body sensor locations. We also estimate the variation of power spectrum to evaluate the time independence of the auto-covariance function. Our results show that, with 95% confidence, the assumption of WSS is met for at most 90% of the cases with window lengths of 5 seconds for the channels between the hubs of different BANs. Additionally, in the best-case scenario, the hub-to-hub channel remains reasonably stationary (with more than 80% probability of satisfying the null hypothesis) for longer window lengths of more than 10 seconds. The short time power spectral variation for body-to-body channels is also shown to be negligible. Moreover, we show that body-to-body channels can be considered wide-sense-stationary over significantly longer periods than on-body channels.

eess.SP↗

arXiv2018

Cross-Layer Designs for Body-to-Body Networks: Adaptive CSMA/CA with Distributed Routing

In this paper, we propose a novel adaptive carrier sense multiple access scheme with collision avoidance (CSMA/CA) to perform efficient and reliable data transfer with increased throughput across multiple coexisting wireless body area networks (BANs) in a tiered architecture. We investigate the proposed scheme using two distributed cross-layer optimized dynamic routing techniques, i.e., shortest path routing (SPR) and cooperative multi-path routing (CMR). The channel state information from the physical layer is passed on to the network layer using an adaptive cross-layer carrier sensing mechanism between the physical and MAC layer, which adjusts the carrier sense threshold (e.g., RSSI) periodically based on the slowly-varying channel condition. An open-access experimental dataset of 'everyday' mixed-activities is used for analyzing the cross-layer optimization. Our proposed optimization using adaptive carrier sensing performs better than static carrier sensing with CSMA/CA as it reduces the continuous back-off duration and latency as well as significantly increases the throughput (in successful packets/s) by more than 50%. Adaptive CSMA/CA also shows 20% and 6% improvement over a coordinated TDMA approach with higher duty cycle for throughput and spectral efficiency, respectively, and provides acceptable packet delivery ratio and outage probability with respect to SINR.

cs.NI↗

arXiv2018

Evolutionary Games for Correlation-Aware Clustering in Massive Machine-to-Machine Networks

In this paper, the problem of self-organizing, correlation-aware clustering is studied for a dense network of machine-type devices (MTDs) deployed over a cellular network. In dense machine-to-machine networks, MTDs are typically located within close proximity and will gather correlated data, and, thus, clustering MTDs based on data correlation will lead to a decrease in the number of redundant bits transmitted to the base station. To analyze this clustering problem, a novel utility function that captures the average MTD transmission power per cluster is derived, as a function of the MTD location, cluster size, and inter-cluster interference. Then, the clustering problem is formulated as an evolutionary game, which models the interactions among the massive number of MTDs, in order to decrease MTD transmission power. To solve this game, a distributed algorithm is proposed to allow the infinite number of MTDs to autonomously form clusters. It is shown that the proposed distributed algorithm converges to an evolutionary stable strategy (ESS), that is robust to a small portion of MTDs deviating from the stable cluster formation at convergence. The maximum fraction of MTDs that can deviate from the ESS, while still maintaining a stable cluster formation is derived. Simulation results show that the proposed approach can effectively cluster MTDs with highly correlated data, which, in turn, enables those MTDs to eliminate a large number of redundant bits. The results show that, on average, using the proposed approach yields reductions of up to 23.4% and 9.6% in terms of the transmit power per cluster, compared to forming clusters with the maximum possible size and uniformly selecting a cluster size, respectively.

cs.GT↗

arXiv2017

Game-Theoretic Electric Vehicle Charging Management Resilient to Non-Ideal User Behavior

In this paper, an electric vehicle (EV) charging competition, among EV aggregators that perform coordinated EV charging, is explored while taking into consideration potential non-ideal actions of the aggregators. In the coordinated EV charging strategy presented in this paper, each aggregator determines EV charging start time and charging energy profiles to minimize overall EV charging energy cost by including consideration of the actions of the neighboring aggregators. The competitive interactions of the aggregators are modeled by developing a two-stage non-cooperative game among the aggregators. The game is then studied under prospect theory to examine the impacts of non-ideal actions of the aggregators in selecting EV charging start times according to subjectively evaluating their opponents' actions. It is shown that the non-cooperative interactions among the aggregators lead to a subgame perfect $\epsilon$-Nash equilibrium when the game is played with either ideal, or non-ideal, actions of the aggregators. A case study presented demonstrates that the benefits of the coordinated EV charging strategy, in terms of energy cost savings and peak-to-average ratio reductions, are significantly resilient to non-ideal actions of the aggregators.

cs.GT↗

arXiv2017

More Flexible Differential Privacy: The Application of Piecewise Mixture Distributions in Query Release

There is an increasing demand to make data "open" to third parties, as data sharing has great benefits in data-driven decision making. However, with a wide variety of sensitive data collected, protecting privacy of individuals, communities and organizations, is an essential factor in making data "open". The approaches currently adopted by industry in releasing private data are often ad hoc and prone to a number of attacks, including re-identification attacks, as they do not provide adequate privacy guarantees. While differential privacy has attracted significant interest from academia and industry by providing rigorous and reliable privacy guarantees, the reduced utility and inflexibility of current differentially private algorithms for data release is a barrier to their use in real-life. This paper aims to address these two challenges. First, we propose a novel mechanism to augment the conventional utility of differential privacy by fusing two Laplace or geometric distributions together. We derive closed form expressions for entropy, variance of added noise, and absolute expectation of noise for the proposed piecewise mixtures. Then the relevant distributions are utilised to theoretically prove the privacy and accuracy guarantees of the proposed mechanisms. Second, we show that our proposed mechanisms have greater flexibility, with three parameters to adjust, giving better utility in bounding noise, and mitigating larger inaccuracy, in comparison to typical one-parameter differentially private mechanisms. We then empirically evaluate the performance of piecewise mixture distributions with extensive simulations and with a real-world dataset for both linear count queries and histogram queries. The empirical results show an increase in all utility measures considered, while maintaining privacy, for the piecewise mixture mechanisms compared to standard Laplace or geometric mechanisms.

cs.CR↗

arXiv2017

Cross-layer optimized routing with low duty cycle TDMA across multiple wireless body area networks

In this paper, we study the performance of two cross-layer optimized dynamic routing techniques for radio interference mitigation across multiple coexisting wireless body area networks (BANs), based on real-life measurements. At the network layer, the best route is selected according to channel state information from the physical layer, associated with low duty cycle TDMA at the MAC layer. The routing techniques (i.e., shortest path routing (SPR), and novel cooperative multi-path routing (CMR) incorporating 3-branch selection combining) perform real-time and reliable data transfer across BANs operating near the 2.4 GHz ISM band. An open-access experimental data set of 'everyday' mixed-activities is used for analyzing the proposed cross-layer optimization. We show that CMR gains up to 14 dB improvement with 8.3% TDMA duty cycle, and even 10 dB improvement with 0.2% TDMA duty cycle over SPR, at 10% outage probability at a realistic signal-to-interference-plus-noise ratio (SINR). Acceptable packet delivery ratios (PDR) and spectral efficiencies are obtained from SPR and CMR with reasonably sensitive receivers across a range of TDMA low duty cycles, with up to 9 dB improvement of CMR over SPR at 90% PDR. The distribution fits for received SINR through routing are also derived and validated with theoretical analysis.

cs.NI↗

arXiv2017

Competitive Energy Trading Framework for Demand-side Management in Neighborhood Area Networks

This paper, by comparing three potential energy trading systems, studies the feasibility of integrating a community energy storage (CES) device with consumer-owned photovoltaic (PV) systems for demand-side management of a residential neighborhood area network. We consider a fully-competitive CES operator in a non-cooperative Stackelberg game, a benevolent CES operator that has socially favorable regulations with competitive users, and a centralized cooperative CES operator that minimizes the total community energy cost. The former two game-theoretic systems consider that the CES operator first maximizes their revenue by setting a price signal and trading energy with the grid. Then the users with PV panels play a non-cooperative repeated game following the actions of the CES operator to trade energy with the CES device and the grid to minimize energy costs. The centralized CES operator cooperates with the users to minimize the total community energy cost without appropriate incentives. The non-cooperative Stackelberg game with the fully-competitive CES operator has a unique Stackelberg equilibrium at which the CES operator maximizes revenue and users obtain unique Pareto-optimal Nash equilibrium CES energy trading strategies. Extensive simulations show that the fully-competitive CES model gives the best trade-off of operating environment between the CES operator and the users.

cs.GT↗

arXiv2016

Game-theoretic Demand-side Management Robust to Non-Ideal Consumer Behavior in Smart Grid

This paper investigates effects of realistic, non-ideal, decisions of energy users as to whether to participate in an energy trading system proposed for demand-side management of a residential community. The energy trading system adopts a non-cooperative Stackelberg game between a community energy storage (CES) device and users with rooftop photovoltaic panels where the CES operator is the leader and the users are the followers. Participating users determine their optimal energy trading starting time to minimize their personal daily energy costs while subjectively viewing their opponents' actions. Following a non-cooperative game, we study the subjective behavior of users when they decide on energy trading starting time using prospect theory. We show that depending on the decisions of participating-time, the proposed energy trading system has a unique Stackelberg equilibrium at which the CES operator maximizes their revenue while users minimize their personal energy costs attaining a Nash equilibrium. Simulation results confirm that the benefits of the energy trading system are robust to decisions of participating-time that significantly deviate from complete rationality.

cs.GT↗

arXiv2014

Co-channel Interference Mitigation for Wireless Body Area Networks Coexistence Using a Non-Cooperative Game

In this paper, we enable the coexistence of multiple wireless body area networks (BANs) using a finite repeated non-cooperative game, in which BANs are rational players but act selfishly. A game-theoretic based transmit power control scheme employing a novel utility function is proposed to maximize each network's packet delivery ratio (PDR) at low transmit power. The proposed utility function penalizes players with high transmission power, which reduces the interference caused to other coexisting BANs. Considering the purpose of inter-BAN interference mitigation, PDR is expressed as a compressed exponential function of inverse signal-to-interference-and-noise ratio (SINR), so it is essentially a function of transmit powers of all coexisting BANs. It is proven that a unique Nash Equilibrium (NE) exists and hence there is a subgame-perfect equilibrium, considering best-response at each stage independent of history. Realistic and extensive on- and inter-body channel models are employed. Results confirm that the effectiveness of the proposed scheme in better interference management, greater reliability and reduced transmit power, comparing with other schemes commonly applied in BAN.

cs.NI↗

arXiv2014

Feasibility of Using Discriminate Pricing Schemes for Energy Trading in Smart Grid

This paper investigates the feasibility of using a discriminate pricing scheme to offset the inconvenience that is experienced by an energy user (EU) in trading its energy with an energy controller in smart grid. The main objective is to encourage EUs with small distributed energy resources (DERs), or with high sensitivity to their inconvenience, to take part in the energy trading via providing incentive to them with relatively higher payment at the same time as reducing the total cost to the energy controller. The proposed scheme is modeled through a two-stage Stackelberg game that describes the energy trading between a shared facility authority (SFA) and EUs in a smart community. A suitable cost function is proposed for the SFA to leverage the generation of discriminate pricing according to the inconvenience experienced by each EU. It is shown that the game has a unique sub-game perfect equilibrium (SPE), under the certain condition at which the SFA's total cost is minimized, and that each EU receives its best utility according to its associated inconvenience for the given price. A backward induction technique is used to derive a closed form expression for the price function at SPE, and thus the dependency of price on an EU's different decision parameters is explained for the studied system. Numerical examples are provided to show the beneficial properties of the proposed scheme.

eess.SY↗

arXiv2014

Synthetic Generation of Solar States for Smart Grid: A Multiple Segment Markov Chain Apptoach

The use of photovoltaic (PV) sources is becoming very popular in smart grid for their ecological benefits, with higher scalability and utilization for local generation and delivery. PV can also potentially avoid the energy losses that are normally associated with long-range grid distribution. The increased penetration of solar panels, however, has introduced a need for solar energy models that are capable of producing realistic synthetic data with small error margins. Such models, for instance, can be used to design the appropriate size of energy storage devices or to determine the maximum charging rate of a PV-powered electric vehicle (EV) charging station. In this regard, this paper proposes a stochastic model for solar generation using a Markov chain approach. Based on real data, it is first shown that the solar states are inter-dependent, and thus suitable for modeling using a Markov model. Then, the probabilities of transition between states are shown to be heterogeneous over different time segments. A model is proposed that captures the inter temporal dependency of solar irradiance through segmentation of the Markov chain across different times of the day. In the studied model, different state transition matrices are constructed for different time segments, which the proposed algorithm then uses to generate the solar states for different times of the day. Numerical examples are provided to show the effectiveness of the proposed synthetic generator.

cs.PF↗

arXiv2014

Three-Party Energy Management With Distributed Energy Resources in Smart Grid

In this paper, the benefits of distributed energy resources (DERs) are considered in an energy management scheme for a smart community consisting of a large number of residential units (RUs) and a shared facility controller (SFC). A non-cooperative Stackelberg game between RUs and the SFC is proposed in order to explore how both entities can benefit, in terms of achieved utility and minimizing total cost respectively, from their energy trading with each other and the grid. From the properties of the game, it is shown that the maximum benefit to the SFC in terms of reduction in total cost is obtained at the unique and strategy proof Stackelberg equilibrium (SE). It is further shown that the SE is guaranteed to be reached by the SFC and RUs by executing the proposed algorithm in a distributed fashion, where participating RUs comply with their best strategies in response to the action chosen by the SFC. In addition, a charging-discharging scheme is introduced for the SFC's storage device (SD) that can further lower the SFC's total cost if the proposed game is implemented. Numerical experiments confirm the effectiveness of the proposed scheme.

eess.SY↗

arXiv2014

Energy Management for a User Interactive Smart Community: A Stackelberg Game Approach

This paper studies a three party energy management problem in a user interactive smart community that consists of a large number of residential units (RUs) with distributed energy resources (DERs), a shared facility controller (SFC) and the main grid. A Stackelberg game is formulated to benefit both the SFC and RUs, in terms of incurred cost and achieved utility respectively, from their energy trading with each other and the grid. The properties of the game are studied and it is shown that there exists a unique Stackelberg equilibrium (SE). A novel algorithm is proposed that can be implemented in a distributed fashion by both RUs and the SFC to reach the SE. The convergence of the algorithm is also proven, and shown to always reach the SE. Numerical examples are used to assess the properties and effectiveness of the proposed scheme.

eess.SY↗

arXiv2013

Prioritizing Consumers in Smart Grid: Energy Management Using Game Theory

This paper explores an idea of demand-supply balance for smart grids in which consumers are expected to play a significant role. The main objective is to motivate the consumer, by maximizing their benefit both as a seller and a buyer, to trade their surplus energy with the grid so as to balance the demand at the peak hour. To that end, a Stackelberg game is proposed to capture the interactions between the grid and consumers, and it is shown analytically that optimal energy trading parameters that maximize customers utilities are obtained at the solution of the game. A novel distributed algorithm is proposed to reach the optimal solution of the game, and numerical examples are used to assess the properties and effectiveness of the proposed approach.

cs.GT↗