• DocumentCode
    1996403
  • Title

    QoS Routing in Smart Grid

  • Author

    Li, Husheng ; Zhang, Weiyi

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., Univ. of Tennessee, Knoxville, TN, USA
  • fYear
    2010
  • fDate
    6-10 Dec. 2010
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    Smart grid is an emerging technology which is able to control the power load via price signaling. The communication between the power supplier and power customers is a key issue in smart grid. Performance degradation like delay or outage may cause significant impact on the stability of the pricing based control and thus the reward of smart grid. Therefore, a QoS mechanism is proposed for the communication system in smart grid, which incorporates the derivation of QoS requirement and applies QoS routing in the communication network. For deriving the QoS requirement, the dynamics of power load and the load-price mapping are studied. The corresponding impacts of different QoS metrics like delay are analyzed. Then, the QoS is derived via an optimization problem that maximizes the total revenue. Based on the derived QoS requirement, a simple greedy QoS routing algorithm is proposed for the requirement of high speed routing in smart grid. It is also proven that the proposed greedy algorithm is a K-approximation. Numerical simulation shows that the proposed mechanism and algorithm can effectively derive and secure the communication QoS in smart grid.
  • Keywords
    quality of service; smart power grids; telecommunication network routing; telecommunication security; QoS routing algorithm; load price mapping; optimization; power load; power supplier; price signaling; secure communication; smart grid; stability; Approximation algorithms; Delay; Home appliances; Quality of service; Routing; Smart grids;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
  • Conference_Location
    Miami, FL
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-5636-9
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2010.5683884
  • Filename
    5683884