Analyzing the Performance of Centralized Clustering Techniques for Realistic Wireless Sensor Network Topologies

AbstractClustering techniques in wireless sensor networks enables energy efficient coordination among the densely deployed nodes for data delivery till the base station. Many clustering protocols have been suggested in the recent past. The topology of the nodes, mostly seen in the literature, is of random type. This paper analyzes the performance aspects of various centralized clustering techniques for wireless sensor networks. LEACH-Centralized, KMeans-CP, FCM-CP and HSA-CP protocols have been compared with respect to clustering and data delivery process for various realistic topologies. The simulations were performed for these protocols and performance of the protocols has been critically analyzed. HSA-CP clustering method performs better compared to other techniques for almost each topology examined in the paper

Energy efficient chain based routing protocol for deterministic node deployment in wireless sensor networks

Wireless Sensor Network (WSN) consists of small sensor devices, which are connected wirelessly for sensing and delivering specific data to Base Station (BS). Routing protocols in WSN becomes an active area for both researchers and industrial, due to its responsibility for delivering data, extending network lifetime, reducing the delay and saving the node’s energy. According to hierarchical approach, chain base routing protocol is a promising type that can prolong the network lifetime and decrease the energy consumption. However, it is still suffering from long/single chain impacts such as delay, data redundancy, distance between the neighbors, chain head (CH) energy consumption and bottleneck. This research proposes a Deterministic Chain-Based Routing Protocol (DCBRP) for uniform nodes deployment, which consists of Backbone Construction Mechanism (BCM), Chain Heads Selection mechanism (CHS) and Next Hop Connection mechanism (NHC). BCM is responsible for chain construction by using multi chain concept, so it will divide the network to specific number of clusters depending on the number of columns. While, CHS is answerable on the number of chain heads and CH nodes selection based on their ability for data delivery. On the other hand, NHC is responsible for next hop connection in each row based on the energy and distance between the nodes to eliminate the weak nodes to be in the main chain. Network Simulator 3 (ns-3) is used to simulate DCBRP and it is evaluated with the closest routing protocols in the deterministic deployment in WSN, which are Chain-Cluster Mixed protocol (CCM) and Two Stage Chain based Protocol (TSCP). The results show that DCBRP outperforms CCM and TSCP in terms of end to end delay, CH energy consumption, overall energy consumption, network lifetime and energy*delay metrics. DCBRP or one of its mechanisms helps WSN applications by extending the sensor nodes lifetime and saving the energy for sensing purposes as long as possible

Definition of an energy optimization protocol of a wireless sensor network

International audienceNowadays the WSN (Wireless Sensor Network) implemented in different domains such as environment, medical, military, etc. At the same time, the WSN has some limitations, among them and the major one is the energy resource and limitation in the battery's lifetime due to the fact of the small size of the sensor node. The clustering is the most efficient method for increasing the network's lifetime which most routing protocols based on it and LEACH (Low Energy Adaptive Clustering Hierarchy) are the first energy-efficient clustering hierarchical routing protocol. This clustering programs choose randomly the CH (Cluster Head) and just if the sensor node has a few energy. Thus in LEACH transmission, every CH sends data immediately to the BS (Base Station), so they consume more energy that decreases the network lifetime.In this paper, we propose a new approach based on LEACH protocol that purpose to extend the network's lifetime by balancing the energy of sensor nodes. Our model allows to chose CHs according to the current energy. Thus, data archives the BS by multi-hop method

Enhancing the Stability of the Improved-LEACH Routing Protocol for WSNs

Recently, increasing battery lifetime in wireless sensor networks has turned out to be one of the major challenges faced by researchers. The sensor nodes in wireless sensor networks use a battery as their power source, which is hard to replace during deployment. Low Energy Adaptive Clustering Hierarchy (LEACH) is one of the most prominent wireless sensor network routing protocols that have been proposed to improve network lifetime by utilizing energy-efficient clustering. However, LEACH has some issues related to cluster-head selection, where the selection is done randomly. This leads to rapid loss of energy in the network. Improved LEACH is a LEACH alternative that has the ability to increase network lifetime by using the nodes' residual energy and their distance to the base station to select cluster-head nodes. However, Improved LEACH causes reduced stability, where the stability period is the duration before the death of the first node. The network stability period is important for applications that require reliable feedback from the network. Thus, we were motivated to investigate the Improved LEACH algorithm and to try to solve the stability problem. A new protocol is proposed in this paper: Stable Improved Low Energy Adaptive Clustering Hierarchy (SILEACH), which was developed to overcome the flaws of the Improved LEACH protocol. SILEACH balances the load between the nodes by utilizing an optimized method that considers the nodes' distance to the base station and their residual energy to select the cluster-head nodes and considers the nodes' distance to the cluster head and the base station to form clusters. The simulation results revealed that SILEACH is significantly more efficient than Improved LEACH in terms of stability period and network lifetime

Energy Efficient Clustered Routing Strategy For WSN

Wireless sensor network alludes in the route of a group of spatially dedicated sensors for screening, accumulating the normal information in distant zones and sending the gathered knowledge to a central region. In past a few methodologies that cut back the vitality utilization by actualizing efficient steering conventions had been presented. Every sensor hub detects learning and transmits it to its bunch head. Bunch head mix information from its group and transmit the gathered learning to the base station. A few vitality sparing gradable directing conventions are upheld inside the past like LEACH, HEED, PEGASIS, and TBC. TBC (Tree-based for the most part Clustering) convention is another change over HEED convention that executes intra-bunch correspondence to downsize vitality utilization. each bunch head go about as the root hub of the tree and every sensor hub transmit information to close hub that lies on the on account of the root hub. This convention circulates the vitality stack over all part hubs and thusly adjusts the general vitality utilization of the system. To draw out the system life, this work executes another tree-based bunch steering technique called Tree-Based Energy Efficient Clustering Protocol (TBEEC) (TBEEC). Amid this work, the hub having the lesser separation to the base station and preferable vitality over the contrary hubs of the bunch is hoisted as the group set out toward aspherical. All hubs of group forward their insight to the bunch head by exploitation elective halfway hubs that lie on the on account of the bunch head. Further, amid this work between bunch correspondence is authorized to downsize the vitality utilization. Each group head as opposed to sending blend information on to the base station appearance for halfway bunch head that untruths nearly the base station. This form information must go at the lesser separation that finishes in vitality sparing that delays the system life. The arranged convention beats the confinement of existing TBC convention. The reproduction comes about demonstrate that the arranged convention performs higher than the predominant directing conventions like LEACH, HEED, PEGASIS, and TBC