Abstract:
Wireless Sensor Networks (WSNs) has gained a great significance from researchers and industry due to its wide applications. The discovery of effective service and removing redundancy area key to achieve a higher level of ubiquity. Nevertheless, clustering techniques offer many solutions to address the WSN issues, such as energy efficiency, service redundancy, routing delay, scalability, and making WSNs more efficient. Unfortunately, WSNs are still immature and suffering in several aspects.Clustering systems divide sensor networks into many groups. Each group may elect a specific node as a cluster head (CH) to represent the group in the data sending process and the remaining nodes are regular nodes. The CH election approach is playing a key role in improving the network lifetime and reducing the network delay. This research study presents a comprehensive survey, discussing the various issues and challenges facing the design and selection of the appropriate service discovery and cluster-based routing protocols. Additionally,it investigates available clustering techniques. Moreover, to solve the downsides in existing Cluster-based routing protocols in WSNs, a Lightweight and Efficient Dynamic Cluster Head Election Routing (LEDCHE-WSN) Protocol is proposed. The proposed routing algorithm comprises two integrated methods, electing the optimum cluster head, and organizing the re-clustering process dynamically. Finally, the proposed algorithm’s mathematical modeling and analysis are introduced. The experimental results reveal the proposed protocol outperforms the LEACH protocol by approximately 32% and the FBCFP protocol by 8%, in terms of power consumption and network lifetime. In terms of Mean Package Delay, LEDCHE-WSN improves the LEACH protocol by 42% and the FBCFP protocol by 15%, and regarding Loss Ratio, it improves the LEACH protocol by approximately 46% and FBCFP protocol by 25%.
