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

Collection Tree Extension of Reactive Routing Protocol for Low-Power and Lossy Networks

Author

Listed:
  • Jiazi Yi
  • Thomas Clausen

Abstract

This paper proposes an extension to reactive routing protocol, for efficient construction of a collection tree for data acquisition in sensor networks. The Lightweight On-Demand Ad hoc Distance Vector Routing Protocol-Next Generation (LOADng) is a reactive distance vector protocol which is intended for use in mobile ad hoc networks and low-power and lossy networks to build paths between source-destination pairs. In 2013, ITU-T has ratified the recommendation G.9903 Amendment 1, which includes LOADng in a specific normative annex for routing protocol in smart grids. The extension uses the mechanisms from LOADng, imposes minimal overhead and complexity, and enables a deployment to efficiently support “sensor-to-root†traffic, avoiding complications of unidirectional links in the collection tree. The protocol complexity, security, and interoperability are examined in detail. The simulation results show that the extension can effectively improve the efficiency of data acquisition in the network.

Suggested Citation

  • Jiazi Yi & Thomas Clausen, 2014. "Collection Tree Extension of Reactive Routing Protocol for Low-Power and Lossy Networks," International Journal of Distributed Sensor Networks, , vol. 10(3), pages 352421-3524, March.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:3:p:352421
    DOI: 10.1155/2014/352421
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/352421
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/352421?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:10:y:2014:i:3:p:352421. 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.