# American Institute of Mathematical Sciences

• Previous Article
Stochastic machine breakdown and discrete delivery in an imperfect inventory-production system
• JIMO Home
• This Issue
• Next Article
Performance analysis of binary exponential backoff MAC protocol for cognitive radio in the IEEE 802.16e/m network
July  2017, 13(3): 1495-1510. doi: 10.3934/jimo.2017004

## Effect of mobility of smart meters on performance of advanced metering infrastructure

 1 Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan 2 Center for Technology Innovation -System Research & Development Group, Hitachi, Ltd Yoshida-Cho, Totsuka-ku, Yokohama-shi, Kanagawa 244-0817, Japan 3 Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan

* Corresponding author: Shunsuke Matsuzawa

The reviewing process of the paper was handled by Wuyi Yue as Guest Editor

Received  October 2015 Published  December 2016

In order to realize a smart grid, Advanced Metering Infrastructure (AMI) has started to be deployed. AMI automates meter reading operations and enables real-time monitoring of power usage. Monitoring power consumption data will be useful for power generation planning, power demand control, and peak shift. In addition to monitoring power consumption, in AMI networks, other types of communication (e.g., gas and water consumption, demand response for electricity, and inquiries to electric power companies) can be accommodated by using surplus bandwidth. An essential part of AMI is a set of electricity meters with communication functions, called smart meters, which transmit power consumption data to electric power companies periodically with fixed intervals. They have been installed in houses, factories, or buildings, and are expected to be equipped with electric vehicles in a future. We can also save energy by turning off smart meters when it is not necessary to communicate. In this paper, we present an analytical model to evaluate the performance of AMI taking the randomness of the number of smart meters into consideration, caused by the turn on/off of meters and mobility of meters across the AMI network coverage.

Citation: Shunsuke Matsuzawa, Satoru Harada, Kazuya Monden, Yukihiro Takatani, Yutaka Takahashi. Effect of mobility of smart meters on performance of advanced metering infrastructure. Journal of Industrial & Management Optimization, 2017, 13 (3) : 1495-1510. doi: 10.3934/jimo.2017004
##### References:

show all references

##### References:
Transmission schedule for AMI
State transition diagram of smart meters
Throughput vs. number of smart meters. $(L=5)$
Throughput vs. number of smart meters. $(L=20)$
Maximum throughput vs. number of time slots
Throughput vs. number of smart meters. ($T/P_{\rm off}=18000$)
Successful transmission probability vs. number of smart meters. ($T/P_{\rm off}=18000$)
Mean transmission delay vs. number of smart meters. ($T/P_{\rm off}=18000$)
Coefficient of variation of transmission delay vs. number of smart meters. ($T/P_{\rm off}=18000$)
Throughput vs. number of smart meters. ($T/P_{\rm off}:T/P_{\rm on}=1:4$)
Successful transmission probability vs. number of smart meters. ($T/P_{\rm off}:T/P_{\rm on}=1:4$)
Mean transmission delay vs. number of smart meters. ($T/P_{\rm off}:T/P_{\rm on}=1:4$)
Coefficient of variation of transmission delay vs. number of smart meters. ($T/P_{\rm off}:T/P_{\rm on}=1:4$)
Parameter setting
 Number of smart meters $N_{\rm RA}$ 5-1000 Length of a check cycle $T$ (sec) 1800 Duration of a polling period $T_{\rm P}$ (sec) 1500-1792.5 Duration of a random access period $T_{\rm RA}$ (sec) 7.5-300 Number of time slots of a random access period $L$ 5-200 Length of a time slot of a random access period $t_{\rm RA}$ (sec) 1.5 Mean duration of on-state periods $T/P_{\rm off}$ (sec) 18000-180000 Mean duration of off-state periods $T/P_{\rm on}$ (sec) 4500-72000 Mean generation interval of transmission requests $T/\lambda$ (sec) 3600
 Number of smart meters $N_{\rm RA}$ 5-1000 Length of a check cycle $T$ (sec) 1800 Duration of a polling period $T_{\rm P}$ (sec) 1500-1792.5 Duration of a random access period $T_{\rm RA}$ (sec) 7.5-300 Number of time slots of a random access period $L$ 5-200 Length of a time slot of a random access period $t_{\rm RA}$ (sec) 1.5 Mean duration of on-state periods $T/P_{\rm off}$ (sec) 18000-180000 Mean duration of off-state periods $T/P_{\rm on}$ (sec) 4500-72000 Mean generation interval of transmission requests $T/\lambda$ (sec) 3600
 [1] Jiuping Xu, Pei Wei. Production-distribution planning of construction supply chain management under fuzzy random environment for large-scale construction projects. Journal of Industrial & Management Optimization, 2013, 9 (1) : 31-56. doi: 10.3934/jimo.2013.9.31 [2] Jinsong Xu. Reversible hidden data access algorithm in cloud computing environment. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1219-1232. doi: 10.3934/dcdss.2019084 [3] Samuel N. Cohen, Lukasz Szpruch. On Markovian solutions to Markov Chain BSDEs. Numerical Algebra, Control & Optimization, 2012, 2 (2) : 257-269. doi: 10.3934/naco.2012.2.257 [4] Mario Roy, Mariusz Urbański. Random graph directed Markov systems. Discrete & Continuous Dynamical Systems - A, 2011, 30 (1) : 261-298. doi: 10.3934/dcds.2011.30.261 [5] Colin Little. Deterministically driven random walks in a random environment on $\mathbb{Z}$. Discrete & Continuous Dynamical Systems - A, 2016, 36 (10) : 5555-5578. doi: 10.3934/dcds.2016044 [6] Johnathan M. Bardsley. Gaussian Markov random field priors for inverse problems. Inverse Problems & Imaging, 2013, 7 (2) : 397-416. doi: 10.3934/ipi.2013.7.397 [7] Manfred Denker, Yuri Kifer, Manuel Stadlbauer. Thermodynamic formalism for random countable Markov shifts. Discrete & Continuous Dynamical Systems - A, 2008, 22 (1&2) : 131-164. doi: 10.3934/dcds.2008.22.131 [8] Felix X.-F. Ye, Yue Wang, Hong Qian. Stochastic dynamics: Markov chains and random transformations. Discrete & Continuous Dynamical Systems - B, 2016, 21 (7) : 2337-2361. doi: 10.3934/dcdsb.2016050 [9] Manfred Denker, Yuri Kifer, Manuel Stadlbauer. Corrigendum to: Thermodynamic formalism for random countable Markov shifts. Discrete & Continuous Dynamical Systems - A, 2015, 35 (1) : 593-594. doi: 10.3934/dcds.2015.35.593 [10] Jingzhi Tie, Qing Zhang. An optimal mean-reversion trading rule under a Markov chain model. Mathematical Control & Related Fields, 2016, 6 (3) : 467-488. doi: 10.3934/mcrf.2016012 [11] Ralf Banisch, Carsten Hartmann. A sparse Markov chain approximation of LQ-type stochastic control problems. Mathematical Control & Related Fields, 2016, 6 (3) : 363-389. doi: 10.3934/mcrf.2016007 [12] Kun Fan, Yang Shen, Tak Kuen Siu, Rongming Wang. On a Markov chain approximation method for option pricing with regime switching. Journal of Industrial & Management Optimization, 2016, 12 (2) : 529-541. doi: 10.3934/jimo.2016.12.529 [13] Nguyen Huu Du, Nguyen Hai Dang. Asymptotic behavior of Kolmogorov systems with predator-prey type in random environment. Communications on Pure & Applied Analysis, 2014, 13 (6) : 2693-2712. doi: 10.3934/cpaa.2014.13.2693 [14] Jean-Pierre Conze, Y. Guivarc'h. Ergodicity of group actions and spectral gap, applications to random walks and Markov shifts. Discrete & Continuous Dynamical Systems - A, 2013, 33 (9) : 4239-4269. doi: 10.3934/dcds.2013.33.4239 [15] Peter E. Kloeden, Victor Kozyakin. Asymptotic behaviour of random tridiagonal Markov chains in biological applications. Discrete & Continuous Dynamical Systems - B, 2013, 18 (2) : 453-465. doi: 10.3934/dcdsb.2013.18.453 [16] Tom Goldstein, Xavier Bresson, Stan Osher. Global minimization of Markov random fields with applications to optical flow. Inverse Problems & Imaging, 2012, 6 (4) : 623-644. doi: 10.3934/ipi.2012.6.623 [17] Tomasz Komorowski, Stefano Olla, Marielle Simon. Macroscopic evolution of mechanical and thermal energy in a harmonic chain with random flip of velocities. Kinetic & Related Models, 2018, 11 (3) : 615-645. doi: 10.3934/krm.2018026 [18] Lin Xu, Rongming Wang. Upper bounds for ruin probabilities in an autoregressive risk model with a Markov chain interest rate. Journal of Industrial & Management Optimization, 2006, 2 (2) : 165-175. doi: 10.3934/jimo.2006.2.165 [19] Kazuhiko Kuraya, Hiroyuki Masuyama, Shoji Kasahara. Load distribution performance of super-node based peer-to-peer communication networks: A nonstationary Markov chain approach. Numerical Algebra, Control & Optimization, 2011, 1 (4) : 593-610. doi: 10.3934/naco.2011.1.593 [20] Olli-Pekka Tossavainen, Daniel B. Work. Markov Chain Monte Carlo based inverse modeling of traffic flows using GPS data. Networks & Heterogeneous Media, 2013, 8 (3) : 803-824. doi: 10.3934/nhm.2013.8.803

2018 Impact Factor: 1.025

## Tools

Article outline

Figures and Tables