Theoretical modeling for performance analysis of IEEE 1901 power-line communication networks in the multi-hop environment

被引:8
作者
Hao, Sheng [1 ]
Zhang, Hu-yin [1 ]
机构
[1] Wuhan Univ, Sch Comp, Wuhan 430079, Hubei, Peoples R China
基金
中国国家自然科学基金;
关键词
Power-line communication (PLC); IEEE 1901 MAC protocol; Multi-hop environment; CSMA/CA; Performance analysis; Markov chain; Queueing theory; CSMA/CA;
D O I
10.1007/s11227-019-03065-4
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
As one of the most promising networking technologies, power-line communication (PLC) networks have been gradually used not only in home networking systems but also in industrial IoT (Internet of things). Current studies of PLC medium access control (MAC) protocol (i.e., IEEE 1901) only focus on the single-hop environment; however, in practical industrial IoT and home access communication systems, PLC networks generally utilize a multi-hop architecture. In addition, due to the difference in the MAC standard between 802 series and 1901, existing analytical models of multi-hop IEEE 802.11 wireless networks are not suitable for multi-hop IEEE 1901 PLC networks. In this paper, we propose a theoretical model for performance analysis of multi-hop IEEE 1901 PLC networks, where the impacts of traffic rate (containing relay traffic), buffer size, deferral counter process of 1901, hidden terminal problem and multi-hop environment are comprehensively considered. The modeling process is divided into two parts. In the local modeling part, we construct a brand-new Markov chain model to investigate the carrier sense multiple access with collision avoidance process of IEEE 1901 protocol under the multi-hop environment. In the coupling queueing modeling part, we employ queueing theory to analyze the packet transmission procedure between successive hops. On the basis, we derive the closed-form expressions of throughput, medium access delay, packet blocking probability, end-to-end successful transmission delay and goodput. Through extensive simulations, we verify that our theoretical model can accurately estimate the MAC performance of IEEE 1901 PLC networks in the multi-hop environment.
引用
收藏
页码:2715 / 2747
页数:33
相关论文
共 27 条
  • [1] Abreu T., 2014, ACM MSWIM, P159
  • [2] Abreu T., 2013, ACM MSWIM, P143
  • [3] [Anonymous], 2010, IEEE Std.1044-2009, P1, DOI [DOI 10.1109/IEEESTD.2010.5439063, DOI 10.1109/IEEESTD.2010.5553440]
  • [4] A New Low Cost Power Line Communication Solution for Smart Grid Monitoring and Management
    Artale, Giovanni
    Cataliotti, Antonio
    Cosentino, Valentina
    Di Cara, Dario
    Fiorelli, Riccardo
    Guaiana, Salvatore
    Panzavecchia, Nicola
    Tine, Giovanni
    [J]. IEEE INSTRUMENTATION & MEASUREMENT MAGAZINE, 2018, 21 (02) : 29 - 33
  • [5] Goodput and throughput comparison of single-hop and multi-hop routing for IEEE 802.11 DCF-based wireless networks under hidden terminal existence
    Aydogdu, Canan
    Karasan, Ezhan
    [J]. WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2016, 16 (09) : 1078 - 1094
  • [6] An Analysis of IEEE 802.11 DCF and Its Application to Energy-Efficient Relaying in Multihop Wireless Networks
    Aydogdu, Canan
    Karasan, Ezhan
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2011, 10 (10) : 1361 - 1373
  • [7] Optimal Placement of Relay Nodes Over Limited Positions in Wireless Sensor Networks
    Bagaa, Miloud
    Chelli, Ali
    Djenouri, Djamel
    Taleb, Tarik
    Balasingham, Ilangko
    Kansanen, Kimmo
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (04) : 2205 - 2219
  • [8] Performance analysis of multi-hop flows in IEEE 802.11 networks: A flexible and accurate modeling framework
    Begin, Thomas
    Baynat, Bruno
    Lassous, Isabelle Guerin
    Abreu, Thiago
    [J]. PERFORMANCE EVALUATION, 2016, 96 : 12 - 32
  • [9] Bolch G., 1998, Queuing Networks and Markov Chains
  • [10] Rate Adaptation, Scheduling, and Mode Selection in D2D Systems With Partial Channel Knowledge
    Bulusu, Saikiran
    Mehta, Neelesh B.
    Kalyanasundaram, Suresh
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (02) : 1053 - 1065