IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v12y2016i3p9821289.html
   My bibliography  Save this article

λ-Augmented Tree for Robust Data Collection in Advanced Metering Infrastructure

Author

Listed:
  • Joseph Kamto
  • Lijun Qian
  • Wei Li
  • Zhu Han

Abstract

Tree multicast configuration of smart meters (SMs) can maintain the connectivity and meet the latency requirements for the Advanced Metering Infrastructure (AMI). However, such topology is extremely weak as any single failure suffices to break its connectivity. On the other hand, the impact of a SM node failure can be more or less significant: a noncut SM node will have a limited local impact compared to a cut SM node that will break the network connectivity. In this work, we design a highly connected tree with a set of backup links to minimize the weakness of tree topology of SMs. A topology repair scheme is proposed to address the impact of a SM node failure on the connectivity of the augmented tree network. It relies on a loop detection scheme to define the criticality of a SM node and specifically targets cut SM node by selecting backup parent SM to cover its children. Detailed algorithms to create such AMI tree and related theoretical and complexity analysis are provided with insightful simulation results: sufficient redundancy is provided to alleviate data loss at the cost of signaling overhead. It is however observed that biconnected tree provides the best compromise between the two entities.

Suggested Citation

  • Joseph Kamto & Lijun Qian & Wei Li & Zhu Han, 2016. "λ-Augmented Tree for Robust Data Collection in Advanced Metering Infrastructure," International Journal of Distributed Sensor Networks, , vol. 12(3), pages 9821289-982, March.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:3:p:9821289
    DOI: 10.1155/2016/9821289
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2016/9821289
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/9821289?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:12:y:2016:i:3:p:9821289. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.