A Routing Protocol Based on Both of Density Variation and Distance-Aware for WSNs

A hierarchical routing algorithm for wireless sensor networks (WSNs) is discussed. We select cluster heads according to related distances and residual energy. Both effects of the number of nodes dissipated and the energy consumption act on propagation distances. In addition, the related density effects on the propagation distance. We Define comprehensive influence factor and propagation influence factor, adjust the initial probability of nodes participating in cluster heads’ election, make propagation distances of nodes gradually increase within a certain range. Simulation results show that both cluster heads and failure nodes are evenly distributed in the whole sensor network. The residual energy of nodes are balanced inter the living nodes, which extends the survival time of the network. The routing algorithm we have designed has the characteristics of better balanced energy consumption.

WN-LEACH: A Weighted Residual Energy Based Cluster-Heads Selection Algorithm for Wireless Sensor Network

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.765-767.980 ◽

2013 ◽

Vol 765-767 ◽

pp. 980-984

Author(s):

Xi Rong Bao ◽

Jia Hua Xie ◽

Shuang Long Li

Keyword(s):

Energy Consumption ◽

Wireless Sensor Network ◽

Sensor Network ◽

Routing Algorithm ◽

Cluster Head ◽

Residual Energy ◽

Base Station ◽

Wireless Sensor ◽

Cumulative Number ◽

Cluster Heads

This article focused on the energy limit property of Wireless Sensor Network, and proposed a residual energy based algorithm WN-LEACH, with the classic network mode of LEACH routing algorithm. The algorithm combines the proportion of residual energy in the total energy with the cumulative number of the normal nodes supported by the cluster heads as a cluster selection reference. In order to balance the energy consumption of each cluster-head, the algorithm took both the different positions of the base station and the initial energy of the network into consideration, and weighted the two factors to balance the energy consumption between transmitting the signals and data fusion. Simulation results show that the algorithm can promote the lifetime of the uneven energy network and does not impair the effects of the LEACH algorithm.

Load-balanced routing algorithm based on cluster heads optimization for wireless sensor networks

MATEC Web of Conferences ◽

10.1051/matecconf/201823204050 ◽

2018 ◽

Vol 232 ◽

pp. 04050

Author(s):

Yong-wen Du ◽

Zhang-min Wang ◽

Gang Cai ◽

Jun-hui Gong

Keyword(s):

Energy Consumption ◽

Wireless Sensor Network ◽

Sensor Networks ◽

Sensor Network ◽

Routing Algorithm ◽

Residual Energy ◽

Base Station ◽

Wireless Sensor ◽

Cluster Heads

In order to solve the problem of unbalanced load consumption of nodes for wireless sensor networks (WSNs), this paper proposes a load-balanced routing algorithm based on cluster heads optimization for wireless sensor network. The proposed algorithm first applies first-order wireless transmission model to calculate the optimal number of clusters, then calculate nodes competitiveness rating by fuzzy algorithm considering the residual energy of node and distance from the node to base station, cluster head selection uses unequal clustering algorithm according to the competitiveness of nodes. By node competitiveness and energy management mechanism which cooperate with each other to select the best cluster heads. Use connected optimization between clusters to search multi-hop paths base station for reducing energy consumption of node, and consider transmission energy consumption, residual energy, transmission distance and other factors. The experimental results show that the proposed algorithm compared with LEACH and UCDP algorithm, can balance loading and effectively extend the life cycle of wireless sensor network.

Routing Algorithm with Uneven Clustering for Energy Heterogeneous Wireless Sensor Networks

Journal of Sensors ◽

10.1155/2016/7542907 ◽

2016 ◽

Vol 2016 ◽

pp. 1-9 ◽

Cited By ~ 4

Author(s):

Ying Zhang ◽

Wei Xiong ◽

Dezhi Han ◽

Wei Chen ◽

Jun Wang

Keyword(s):

Sensor Networks ◽

Data Transmission ◽

Routing Algorithm ◽

Residual Energy ◽

Wireless Sensor ◽

Cluster Heads ◽

Heterogeneous Wireless Sensor Networks ◽

Transmission Stage ◽

Aiming at the “hotspots” problem in energy heterogeneous wireless sensor networks, a routing algorithm of heterogeneous sensor network with multilevel energies based on uneven clustering is proposed. In this algorithm, the energy heterogeneity of the nodes is fully reflected in the mechanism of cluster-heads’ election. It optimizes the competition radius of the cluster-heads according to the residual energy of the nodes. This kind of uneven clustering prolongs the lifetime of the cluster-heads with lower residual energies or near the sink nodes. In data transmission stage, the hybrid multihop transmission mode is adopted, and the next-hop routing election fully takes account of the factors of residual energies and the distances among the nodes. The simulation results show that the introduction of an uneven clustering mechanism and the optimization of competition radius of the cluster-heads significantly prolonged the lifetime of the network and improved the efficiency of data transmission.

A Cross Unequal Clustering Routing Algorithm for Sensor Network

Measurement Science Review ◽

10.2478/msr-2013-0029 ◽

2013 ◽

Vol 13 (4) ◽

pp. 200-205 ◽

Cited By ~ 13

Author(s):

Wang Tong ◽

Wu Jiyi ◽

Xu He ◽

Zhu Jinghua ◽

Charles Munyabugingo

Keyword(s):

Energy Consumption ◽

Wireless Sensor Network ◽

Energy Loss ◽

Sensor Network ◽

Routing Algorithm ◽

High Energy ◽

Wireless Sensor ◽

Unequal Clustering ◽

Long Distance ◽

Cluster Heads

In the routing protocol for wireless sensor network, the cluster size is generally fixed in clustering routing algorithm for wireless sensor network, which can easily lead to the “hot spot” problem. Furthermore, the majority of routing algorithms barely consider the problem of long distance communication between adjacent cluster heads that brings high energy consumption. Therefore, this paper proposes a new cross unequal clustering routing algorithm based on the EEUC algorithm. In order to solve the defects of EEUC algorithm, this algorithm calculating of competition radius takes the node’s position and node’s remaining energy into account to make the load of cluster heads more balanced. At the same time, cluster adjacent node is applied to transport data and reduce the energy-loss of cluster heads. Simulation experiments show that, compared with LEACH and EEUC, the proposed algorithm can effectively reduce the energy-loss of cluster heads and balance the energy consumption among all nodes in the network and improve the network lifetime

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

Complexity ◽

10.1155/2020/6660117 ◽

2020 ◽

Vol 2020 ◽

pp. 1-13

Author(s):

Jun Wang ◽

Zhuangzhuang Du ◽

Zhengkun He ◽

Xunyang Wang

Keyword(s):

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.

Energy Balance Routing Algorithm Based on Energy Heterogeneous WSN

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.687-691.3976 ◽

2014 ◽

Vol 687-691 ◽

pp. 3976-3979 ◽

Cited By ~ 1

Author(s):

Ming Xin Liu ◽

Xiao Meng Wang

Keyword(s):

Energy Balance ◽

Routing Algorithm ◽

Cluster Head ◽

Residual Energy ◽

Wireless Sensor ◽

Energy Balancing ◽

Network Nodes ◽

Cluster Head Election ◽

Balancing Energy ◽

Balancing energy load is a key problem in wireless sensor network (WSN) research. For balancing node energy consumption and prolong the network lifetime, this paper proposes an improved routing algorithm EBRA (Energy Balancing Routing Algorithm) based on energy heterogeneous WSN. To maximize the energy efficiency of network nodes, the EBRA weights the probability of cluster head election. According to the estimate value of the network average remaining energy and the residual energy of network nodes, we can calculate the new cluster head election threshold. The simulation results show that the utilization of energy balance of EBRA algorithm is improved 74%, 30% and 23%, compare with LEACH, SEP and DCHS, respectively.

Optimization of Sports Event Management System Based on Wireless Sensor Network

Journal of Sensors ◽

10.1155/2021/1174351 ◽

2021 ◽

Vol 2021 ◽

pp. 1-11

Author(s):

Yuan Zhang ◽

Xuanli Zhao ◽

Jing Shen ◽

Kaixuan Shi ◽

Yang Yu

Keyword(s):

Energy Consumption ◽

Wireless Sensor Network ◽

Sensor Network ◽

Routing Protocol ◽

Residual Energy ◽

Simulation Software ◽

Wireless Sensor ◽

Advantages And Disadvantages ◽

Cluster Heads ◽

Network Load

In recent years, wireless sensor network technology has developed rapidly and its role in managing systems for sports events has been widely used. Wireless sensor networks not only have low wiring cost, high monitoring accuracy, and good fault tolerance but also can be monitored remotely and have outstanding advantages in fault diagnosis and safety monitoring. In this paper, firstly, the wireless sensor network hierarchical routing protocol is studied and its network model and workflow are analyzed; according to the energy consumption of the wireless sensor network, the selection method of the optimal number of cluster heads is proposed to analyze the advantages and disadvantages existing in the protocol. Secondly, the improvement of the routing protocol is proposed to address the problems of uneven distribution of cluster heads and cluster head election without considering the residual energy of nodes in the protocol. When dividing clusters, the number of neighboring nodes is considered so that cluster heads are distributed more evenly in the network; when electing cluster heads, the residual energy of nodes in the cluster is considered to balance the whole network load, and when electing cluster heads, the residual energy of nodes in the cluster is considered to balance the whole network load. Finally, simulation experiments are conducted in this paper using simulation software, and the simulation results show that the data fusion algorithm is more effective than the protocol in reducing the average energy consumption of nodes and extending the network lifetime; these features make wireless sensors more beneficial for better management of sporting events as well as better optimization.

Clustered Wireless Sensor Network Assisted the Design of Intelligent Art System

Journal of Sensors ◽

10.1155/2022/3216727 ◽

2022 ◽

Vol 2022 ◽

pp. 1-11

Author(s):

Yue Zhao

Keyword(s):

Energy Consumption ◽

Wireless Sensor Network ◽

Sensor Network ◽

Routing Algorithm ◽

Base Station ◽

Network Protocol ◽

Wireless Sensor ◽

Intelligent Node ◽

Simulation Results ◽

Clustered Network

Based on the principle of cluster wireless sensor network, this article introduces typical routing protocols in wireless sensors, and wireless sensor network protocol in detail analyzes their advantages and disadvantages and addresses their shortcomings. First, in the clustering network, a uniform clustering protocol with multiple hops in the circular network is proposed. The circular network is divided into rings of equal width, and clusters of equal size are set on different rings. Secondly, the ordinary nodes on each layer of the ring send the collected data to the auxiliary intelligent nodes in the cluster in a single-hop manner, and the auxiliary intelligent nodes located on the outer ring transfer the data to the auxiliary intelligent nodes located on the adjacent inner ring. Finally, on the basis of studying the clustering network protocol, this paper proposes a new clustering routing algorithm, a multihop adaptive clustering routing algorithm. The simulation results show that the algorithm can effectively extend the life of the network, save network energy consumption, and achieve network load balance. At the same time, the initial energy of the auxiliary intelligent node is set according to the energy consumption of the ordinary node and the relative distance between the auxiliary intelligent node and the base station on each layer of the ring. The theoretical and simulation results prove that, compared with the clustered network and auxiliary intelligent nodes, the clustered network can extend the life of the network.

Efficient Routing In Wsn Using Enhanced Fuzzy Logic

International Journal of Engineering & Technology ◽

10.14419/ijet.v7i2.17.11719 ◽

2018 ◽

Vol 7 (2.17) ◽

pp. 108

Author(s):

A Sarath kumar ◽

M Durga Kaveri ◽

K B.V Bhargavi ◽

N Naga Swetha ◽

K Priyanka

Keyword(s):

Fuzzy Logic ◽

Energy Consumption ◽

Distributed Algorithms ◽

Associate Degree ◽

Cluster Head ◽

Residual Energy ◽

Left Behind ◽

Cluster Heads ◽

In order to gather info additional precisely, wireless detector networks (WSNs) square measure divided into clusters. The cluster provides a good merit to make longer the period of WSNs. Topical clump comes close to usually use 2 methods: choosing cluster heads with additional enduring energy, and turning cluster heads sporadically, to distribute the energy consumption among nodes in every cluster and extend the network period. However, most of the previous algorithms haven't thought of the expected residual energy, that is, that the predicated left behind energy for being hand-picked as a cluster head and running around. During this paper, a fuzzy-logic-based clump approach [22] with associate degree conservatory to the energy postulation has been planned to lengthen the period of WSNs by equally distributing the work. The simulation results show that the planned come close to is additional more economical than alternative distributed algorithms. It's believed that the practice given during this paper can be any applied to extensive wireless detector networks.

An Equilibrium Strategy-Based Routing Optimization Algorithm for Wireless Sensor Networks

Sensors ◽

10.3390/s18103477 ◽

2018 ◽

Vol 18 (10) ◽

pp. 3477 ◽

Cited By ~ 4

Author(s):

Liangrui Tang ◽

Zhilin Lu ◽

Jinqi Cai ◽

Jiangyu Yan

Keyword(s):

Energy Consumption ◽

Sensor Networks ◽

Routing Algorithm ◽

Residual Energy ◽

Wireless Sensor ◽

Equilibrium Strategy ◽

Term Operation ◽

Link Cost ◽

Transmission Energy Consumption

In energy-constrained wireless sensor networks (WSNs), the design of an energy-efficient smart strategy is a key to extend the network lifetime, but the unbalance of energy consumption and node load severely restrict the long-term operation of the network. To address these issues, a novel routing algorithm which considers both energy saving and load balancing is proposed in this paper. First of all, the transmission energy consumption, node residual energy and path hops are considered to create the link cost, and then a minimum routing graph is generated based on the link cost. Finally, in order to ensure the balance of traffic and residual energy of each node in the network, an “edge-cutting” strategy is proposed to optimize the minimum routing graph and turn it into a minimum routing tree. The simulation results show that, the proposed algorithm not only can balance the network load and prolong the lifetime of network, but meet the needs of delay and packet loss rate.