scholarly journals Clustering Routing Protocol for Mobile Wireless Sensor Networks Based on Dynamic Network Partition

2018 ◽  
Vol 14 (11) ◽  
pp. 103
Author(s):  
Luzhou Cao
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Dynamic Network ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Mobile Wireless ◽  
Leach Protocol ◽  
Mobile Wireless Sensor

<p class="0abstract"><span lang="EN-US">To prolong the network life and improve the network performance, a new clustering routing protocol which uses dynamic network to divide and consider the residual energy of sensor nodes is proposed. The design and simulation of the clustering scheme for mobile wireless sensor networks are also studied. The results show that the protocol controls the number of cluster heads by region division of the network and balances its distribution in wireless sensor networks according to the latest location of the sink node. At the same time, the residual energy of nodes is considered to balance the energy consumption of the network when the cluster head is elected. The protocol effectively solves the problem of uneven distribution of cluster heads in time and space and energy consumption of each node in the LEACH protocol. Compared with the LEACH protocol, M-LEACH effectively prolongs the network life. From this, it is seen that the application of M-LEACH protocol in mobile wireless sensor network clustering routing is effective.</span></p>

scholarly journals A Cluster-Head Rotating Election Routing Protocol for Energy Consumption Optimization in Wireless Sensor Networks

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jun Wang ◽  
Zhuangzhuang Du ◽  
Zhengkun He ◽  
Xunyang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Cluster Head Election

Balancing energy consumption using the clustering routing algorithms is one of the most practical solutions for prolonging the lifetime of resource-limited wireless sensor networks (WSNs). However, existing protocols cannot adequately minimize and balance the total network energy dissipation due to the additional tasks of data acquisition and transmission of cluster heads. In this paper, a cluster-head rotating election routing protocol is proposed to alleviate the problem. We discovered that the regular hierarchical clustering method and the scheme of cluster-head election area division had positive effects on reducing the energy consumption of cluster head election and intracluster communication. The election criterion composed of location and residual energy factor was proved to lower the probability of premature death of cluster heads. The chain multihop path of intercluster communication was performed to save the energy of data aggregation to the base station. The simulation results showed that the network lifetime can be efficiently extended by regulating the adjustment parameters of the protocol. Compared with LEACH, I-LEACH, EEUC, and DDEEC, the algorithm demonstrated significant performance advantages by using the number of active nodes and residual energy of nodes as the evaluation indicators. On the basis of these results, the proposed routing protocols can be utilized to increase the capability of WSNs against energy constraints.

IBRE-LEACH: Improving The Performance of The BRE-LEACH For Wireless Sensor Networks

2021 ◽  
Author(s):  
Ikram DAANOUNE ◽  
Abdennaceur BAGHDAD
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Network Clustering ◽  
Clustering Protocol ◽  
Leach Protocol ◽  
Limited Power ◽  
The Stability

Abstract Wireless Sensor Networks (WSNs) are extensively used in diferent areas and especially in severe and harsh environments such as battlegrounds, volcanic areas, healthcare, and so on. The major constraint in WSNs is the limited power supply, which impacts the lifeycle of the entire network. Clustering is a performing method used in WSN to optimize power consumption and extend the lifetime of WSNs. LEACH is considered as the first classical clustering protocol used in WSN to optimize energy consumption. Many protocols had been developed to enhance the conventional LEACH protocol. BRE-LEACH (Balanced Residual Energy LEACH) is one of them. It serves to enhance the performance of the LEACH protocol. In this paper, we suggest a new improved BRE-LEACH protocol called IBRE-LEACH (Improved Balanced Residual Energy LEACH), which ameliorates the performance of the BRE-LEACH approach. The IBRE-LEACH combines clustering and multi-hop techniques. It elects CHs according to the residual energy, limits the maximum number of nodes in each cluster to balance energy consumption. Thus, IBRE-LEACH gives the Abandoned Nodes (ANs) the chance to send their data to the BS. Furthermore, it routes the gathered data using the CHs, ANs, and a root node, which is a node with maximum residual energy and minimum distance to the BS. The simulation results in MATLAB exhibit that the IBRE-LEACH increases the throughput, optimizes energy consumption, extends the network lifetime, and ameliorates the stability up to 81.99%, 94.33%, and up to 91.47% compared with BRE-LEACH, LEACH-C, and LEACH, respectively.

Genetic optimization of hybrid clustering algorithm in mobile wireless sensor networks

Sensor Review ◽  
2018 ◽  
Vol 38 (4) ◽  
pp. 526-533 ◽  
Author(s):  
Sangeetha M. ◽  
Sabari A.
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Clustering Algorithm ◽  
Wireless Sensor ◽  
Mobile Wireless ◽  
Content Type ◽  
Mobile Wireless Sensor

Purpose This paper aims to provide a prolonging network lifetime and optimizing energy consumption in mobile wireless sensor networks (MWSNs). MWSNs have characteristics of dynamic topology due to the factors such as energy consumption and node movement that lead to create a problem in lifetime of the sensor network. Node clustering in wireless sensor networks (WSNs) helps in extending the network life time by reducing the nodes’ communication energy and balancing their remaining energy. It is necessary to have an effective clustering algorithm for adapting the topology changes and improve the network lifetime. Design/methodology/approach This work consists of two centralized dynamic genetic algorithm-constructed algorithms for achieving the objective in MWSNs. The first algorithm is based on improved Unequal Clustering-Genetic Algorithm, and the second algorithm is Hybrid K-means Clustering-Genetic Algorithm. Findings Simulation results show that improved genetic centralized clustering algorithm helps to find the good cluster configuration and number of cluster heads to limit the node energy consumption and enhance network lifetime. Research limitations/implications In this work, each node transmits and receives packets at the same energy level throughout the solution. The proposed approach was implemented in centralized clustering only. Practical implications The main reason for the research efforts and rapid development of MWSNs occupies a broad range of circumstances in military operations. Social implications The research highly gains impacts toward mobile-based applications. Originality/value A new fitness function is proposed to improve the network lifetime, energy consumption and packet transmissions of MWSNs.

Sign in / Sign up

Export Citation Format

Share Document