z-logo
open-access-imgOpen Access
A Radical Study of Energy Efficient Hierarchical Cluster-Based Routing Protocols for WSN
Author(s) -
Vikram Dhiman,
M. Kumar,
Ajay Sharma
Publication year - 2020
Publication title -
international journal on electrical engineering and informatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 18
ISSN - 2085-6830
DOI - 10.15676/ijeei.2020.12.3.4
Subject(s) - routing protocol , computer science , wireless sensor network , hierarchical routing , routing (electronic design automation) , protocol (science) , computer network , domain (mathematical analysis) , efficient energy use , wireless , distributed computing , link state routing protocol , telecommunications , engineering , electrical engineering , medicine , mathematical analysis , alternative medicine , mathematics , pathology
For many decades, researchers and vendors are continually developing and designing sensors and wireless network devices for countless applications. These low power wireless sensor network devices have designed to gather and propagate data for applications such as environment, industry, habitat, patient monitoring, and many more to excel humankind— however, these devices also inherent many challenges and drawbacks due to the default hardware design. Subsequently, to mitigate limitations and enhance the capability, authors and researchers have investigated and conferred that minor optimization in modeling or routing techniques gradually elevates the performance of WSN. One of the primary concerns which remain on top of the Domain for discussion is energy conservation in WSN devices. Our primary goal is to analyze and design a cluster-based routing protocol for WSN, An efficient way to elevate the network performance. Finally, the emanate results showcase that the performance of the proposed protocol is much more optimized and favorable when combined with soft-computing tactics when compared to the conventional paradigm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here