C-EEUC: a Cluster Routing Protocol for Coal Mine Wireless Sensor Network Based on Fog Computing and 5G

Chen, Wei; Zhang, Bobin; Yang, Xiao; Fang, Weidong; Zhang, Wuxiong; Jiang, Xiaorong

doi:10.1007/s11036-019-01401-9

Cited by 10 publications

(6 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…EEUC transmits data in multi-hop fashion between elected cluster heads. Recently, C-EEUC [18], a centralized non-uniform clustering routing protocol, has been studied in consideration of the 5G network environment. However, both EEUC and C-EEUC have limitations that an enough number of nodes must be distributed within a radius where direct communication with the sink is possible to form several clusters, and the mobility of the sink is not considered.…”

Section: Routing Algorithms For the Hierarchical Clustering Protocolsmentioning

confidence: 99%

DDCP: The Dynamic Differential Clustering Protocol Considering Mobile Sinks for WSNs

2023

KSII TIIS

View full text Add to dashboard Cite

In this paper, we extended a hierarchical clustering technique, which is the most researched in the sensor network field, and studied a dynamic differential clustering technique to minimize energy consumption and ensure equal lifespan of all sensor nodes while considering the mobility of sinks. In a sensor network environment with mobile sinks, clusters close to the sinks tend to consume more forwarding energy. Therefore, clustering that considers forwarding energy consumption is desired. Since all clusters form a hierarchical tree, the number of levels of the tree must be considered based on the size of the cluster so that the cluster size is not growing abnormally, and the energy consumption is not concentrated within specific clusters. To verify that the proposed DDC protocol satisfies these requirements, a simulation using Matlab was performed. The FND (First Node Dead), LND (Last Node Dead), and residual energy characteristics of the proposed DDC protocol were compared with the popular clustering protocols such as LEACH and EEUC. As a result, it was shown that FND appears the latest and the point at which the dead node count increases is delayed in the DDC protocol. The proposed DDC protocol presents 66.3% improvement in FND and 13.8% improvement in LND compared to LEACH protocol. Furthermore, FND improved 79.9%, but LND declined 33.2% when compared to the EEUC. This verifies that the proposed DDC protocol can last for longer time with more number of surviving nodes.

show abstract

Section: Routing Algorithms For the Hierarchical Clustering Protocolsmentioning

confidence: 99%

DDCP: The Dynamic Differential Clustering Protocol Considering Mobile Sinks for WSNs

2023

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…A centralized nonuniform clustering routing protocol (C-EEUC) takes into account the residual energy of nodes and the cost of communication between nodes and cluster heads. However, the optimal number of cluster heads is not considered for clustering [15].…”

Section: Routing Algorithms Of Heterogeneous Wsnsmentioning

confidence: 99%

“…The homogeneous WSN routing algorithm [4][5][6][7][8][9][10] and the heterogeneous WSN routing algorithm [11][12][13][14][15] use the same first-order radio energy consumption model for analysis.…”

Section: Establishment Of Network Modelmentioning

confidence: 99%

Energy Balance Multihop Clustering Routing Protocol for Large-Scale Water Quality Monitoring

Gong

Cao

Han

et al. 2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Due to the influence of the environment on the water quality wireless sensor network, it is difficult to replace the node energy at any time, so it must make the most of the little energy available. This work provides a technique that combines cluster head selection, cluster structure creation, and data transmission into one optimal scheme. Firstly, we optimize the cluster head election probability threshold formula on the basis of LEACH and introduce overlap ratio in the competitive mechanism, to avoid excessive overlap between cluster heads. Subsequently, to alleviate the “hot spot” problem caused by multihop, the competitive mechanism of I-LEACH is optimized, which is based on the nonuniform competitive mechanism in the EEUC algorithm when electing the cluster head. Meanwhile, in the structural planning between cluster heads, the optimal path is searched based on the parallelism of genetic algorithm (variable path coding strategy); the combination of I-LEACH and EEUC-IGA, named Energy Balance Multihop Clustering Routing Protocol (BEBMCR), can avoid the emergence of “hot paths” and reduce running time. The simulation results show that BEBMCR still has a longer stable period and higher energy utilization rate under large-scale networks, and node energy consumption is more balanced.

show abstract

“…WSNs play a significant role in IoT environments where interoperability between diverse heterogeneous elements is needed. Overall battery power of data node is decreased during WSN [14] [15] operation according to the quantity of information it broadcasts. It is evident from this that a significant portion of a node's energy is used for communication.…”

Section: Introductionmentioning

confidence: 99%

Energy aware Cluster based Routing Algorithm for Optimal Routing and Fault Tolerance in Wireless Sensor Networks

Gorikapudi¹,

Kondaveeti²

2023

Preprint

View full text Add to dashboard Cite

In order to prevent the overloading, the routing algorithm aids in building productive paths both within and between clusters. When sending information from the source IoT device to a base station, not all IoT devices are utilized in the path. We introduced an energy aware cluster-based routing in this paper, in which Improved Fuzzy C-means model plays a major role in clustering initially. Meanwhile, the clustering procedure considers the factors like energy and distance. Subsequent to the clustering process, optimal routing will be takes place by a new hybrid optimization algorithm named Custom Honey Badger and Coot Optimization (CHBCO) that combines the models like Honey badger optimization and Coot optimization model, respectively. For routing, the model considers the constraints like Energy as well as link quality. Also, this model establishes the fault tolerance method, which ensures that the network will continue to operate normally even in the situation of a CH failure. During this, the cluster members switch to another CH. The performance of proposed CHBCO based routing model is compared over existing models with respect to convergence rate, distance evaluation, energy, alive nodes, distance, normalized energy and link quality under five scenarios such as 100, 500, 1000, 1500, and 2000. Moreover, the proposed model obtained 56 alive nodes in the round 1500 for scenario 1(i.e node 100). Also in the round 1500, the CHBCO model obtain a minimum distance as 25 however the existing models achieve higher distance like EHO as 50, HHO as 70, COOT as 40, HBA as 60, MFO as 75, DCPSO as 150, and HGS as 85 for the node setup 1000. The proposed method achieve a better normalized energy as 0.29 in the 2000 round along with node setup 100, while the conventional models reach the lowest normalized energy. Moreover, the CHBCO method fine link quality values such as 0.96, 0.96, 0.95, 0.97, and 0.97 at the node setups of 100, 500, 1000, 1500, 2000 respectively.

show abstract

C-EEUC: a Cluster Routing Protocol for Coal Mine Wireless Sensor Network Based on Fog Computing and 5G

Cited by 10 publications

References 24 publications

DDCP: The Dynamic Differential Clustering Protocol Considering Mobile Sinks for WSNs

DDCP: The Dynamic Differential Clustering Protocol Considering Mobile Sinks for WSNs

Energy Balance Multihop Clustering Routing Protocol for Large-Scale Water Quality Monitoring

Energy aware Cluster based Routing Algorithm for Optimal Routing and Fault Tolerance in Wireless Sensor Networks

Contact Info

Product

Resources

About