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

RCTP: An Enhanced Routing Protocol Based on Collection Tree Protocol

Author

Listed:
  • Fariborz Entezami
  • Martin Tunicliffe
  • Christos Politis

Abstract

Due to implementation of routing protocols in limited power supply devices in wireless sensor networks (WSNs), this paper presents and evaluates Rainbow Collection Tree Protocol (RCTP) as an enhanced version of Collection Tree Protocol (CTP). CTP is a lightweight, efficient, robust, and also reliable routing protocol for WSNs. CTP as a cross layer routing protocol is also a platform-independent protocol. It uses Trickle Algorithm to optimize the overhead cost and also makes it quickly adaptable to changes in topology. The basic foundation of CTP is on link quality identification and it uses expected transmission count (ETX). ETX is not stable during the time in real environments and ETX fluctuations cause the routing protocols to not work in optimum level. RCTP uses average expected transmission count (AETX) as link quality metric that has shown it is more stable than ETX. It also uses a new mechanism in parent selection to make it more accurate. Rainbow mechanism is used in RCTP to detect and route around connectivity nodes and avoid route through dead end paths. The Omnet++ has been used as a simulator and the results show RCTP performs more efficiently than CTP in dynamic and crowded environments.

Suggested Citation

  • Fariborz Entezami & Martin Tunicliffe & Christos Politis, 2015. "RCTP: An Enhanced Routing Protocol Based on Collection Tree Protocol," International Journal of Distributed Sensor Networks, , vol. 11(4), pages 363107-3631, April.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:4:p:363107
    DOI: 10.1155/2015/363107
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/363107
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/363107?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:11:y:2015:i:4:p:363107. 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.