IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v13y2022i1d10.1007_s13198-021-01214-8.html
   My bibliography  Save this article

HETA: end-to-end delay analysis of enhanced centralized clustering protocol for wireless sensor networks

Author

Listed:
  • C. Ambika Bhuvaneswari

    (Vel Tech Rangarajan Dr.Sagunthala R&D Institute of Science and Technology)

  • E. D. Kanmani Ruby

    (Vel Tech Rangarajan Dr.Sagunthala R&D Institute of Science and Technology)

Abstract

Heterogeneous energy and traffic-aware (HETA), an efficient traffic scheduling algorithm is proposed for forecasting the data traffic and the time-sensitive data process. In this structure, the time of non-intermittent critical traffic delays and the time slots are allocated for the intermittent data traffic. Also, the central sleep scheduling algorithm is used to offer an efficient time scheduling mechanism for the priority and time intermittent data towards the central Base Station. In this paper, the queuing delay against the traffic near the Base Station and the processing delay has been considered. The analysis of end-to-end delay by performing well in simulation study through improved efficiency in the performance of the HETA algorithm 90% more in lifetime of the Network with consistent of 3.7 times increase in throughput.

Suggested Citation

  • C. Ambika Bhuvaneswari & E. D. Kanmani Ruby, 2022. "HETA: end-to-end delay analysis of enhanced centralized clustering protocol for wireless sensor networks," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(1), pages 49-53, March.
    • Handle: RePEc:spr:ijsaem:v:13:y:2022:i:1:d:10.1007_s13198-021-01214-8
    DOI: 10.1007/s13198-021-01214-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-021-01214-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-021-01214-8?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:ijsaem:v:13:y:2022:i:1:d:10.1007_s13198-021-01214-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.