scholarly journals A Heterogeneous Energy Wireless Sensor Network Clustering Protocol

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Mengjia Zeng ◽  
Xu Huang ◽  
Bo Zheng ◽  
Xiangxiang Fan

The Low-Efficiency Adaptive Clustering Hierarchical (LEACH) protocol, a hierarchical routing protocol, has the advantage of simple implementation and can effectively balance network loads. However, to date there has been a lack of consideration for its use in heterogeneous energy network environments. To solve this problem, the Energy-Coverage Ratio Clustering Protocol (E-CRCP) is proposed, which is based on reducing the energy consumption of the system and utilizing the regional coverage ratio. First, the energy model is designed. The optimal number of clusters is determined based on the principle of “minimum energy consumption”, and the cluster head selection is based on the principle of “regional coverage maximization”. In order to balance the network load as much as possible, in the next iteration of cluster head selection, the cluster head with the lowest residual energy and the highest energy consumption is replaced to prolong the network’s life. Our simulated results demonstrate that the proposed method has some advantages in terms of longer network life, load balancing, and overall energy consumption in the environment of a heterogeneous energy wireless sensor network.

Robust and efficient algorithms for routing and other process for a wireless sensor network are under active development due to technological advancements on wireless transmission systems. Each of the sensor nodes in a wireless sensor network either transmits or forwards the data packets to the base station. The main objective of the majority of the work in the literature is to save the energy consumption efficiently. The cluster based routing mechanism helps to achieve low energy consumption within the network. The network organizes its nodes as a cluster and selects a particular node as cluster head to manage the transmission within and between clusters. The majority of the clustering approach selects the cluster head using a thresholding based approach. Nodes having energy level higher than the threshold are the candidates for the cluster head selection. In the proposed approach the nodes remaining energy and the sum of distance between individual nodes to the cluster head node is considered. Optimal cluster head selection will help to increase the overall life time of the network. The distance between the sensor nodes is estimated using RSSI (Received Signal Strength Indicator) and other parameters measured from the physical layer. Experiments are conducted with simulation environment created with the NS-2 simulator and efficiency of the approach is analyzed in detail.


2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Chi Zhang

This paper takes e-commerce as the research object, based on the combination of wireless sensor network research results, using relevant theoretical analysis tools to identify several major problems in the marketing of enterprises. Then, the internal environment conditions of developing e-commerce are comprehensively analyzed through human resources, financial resources, marketing ability, and platform building ability, and the advantages and disadvantages of the enterprise itself are presented in a three-dimensional manner to help the enterprise understand its situation. Firstly, the overall hardware structure design of this paper is analyzed, and the network marketing node hardware design is proposed as the core of the system hardware design, and the marketing node hardware design circuit diagram is given through the selection of marketing node sensors, the selection of wireless communication modules, and the selection of marketing node microprocessors. Based on the specific application of the wireless sensor network in the e-commerce marketing system, the number of cluster selection is reduced by calculating and setting the remaining energy threshold of the cluster head for the whole network. The optimal cluster head is searched for based on the density of marketing nodes in different regions and the minimum energy consumption of the cluster after the division of the region within the cluster, and the original cluster head is replaced; the density of marketing nodes in different e-commerce is different, and the optimal number of cluster heads is searched for based on the minimum energy consumption of the network. In summary, three strategies are implemented to improve the design of wireless sensor network routing, and the effectiveness of the algorithm is verified through experimental simulation. Through the analysis of e-commerce operation, the intracluster congestion control is achieved by a dual-cluster head strategy with intracluster push selection of subcluster heads; the network nonuniform hierarchy and resource scheduling strategy achieve intercluster congestion mitigation and decongestion. A minimum energy consumption multihop path tree is also proposed here, which can achieve the lowest energy consumption of marketing nodes and networks and improve the link quality relative to other transmission paths. After simulation experiments, the effectiveness and reliability of the congestion algorithm are verified. A guarantee scheme is provided for the development of e-commerce marketing strategies to help breakthroughs and developments in marketing management, and an attempt is also made to provide a template for other enterprises to follow.


2013 ◽  
Vol 846-847 ◽  
pp. 910-913
Author(s):  
Kai Guo Qian

A reprograming code distribution algorithm for wireless sensor network based on hierarchy structure (RCDABHS) is proposed to improve the nodes energy efficiency and extend the lifetime of wireless sensor network .The algorithm choices portion of nodes with more residual energy to form code distribution tree with minimum energy consumption cost, which completes the code distribution to all heads. Other nodes request the new code from the local cluster head nearby principle. Cluster heads were dynamically elected according to residual energy and distance from base stations to implement the entire network node load balancing, reduce the energy consumption and prolong the network life cycle effectively. The performance analysis and simulation experiments show that the new algorithm effectiveness.


2020 ◽  
Author(s):  
Hamid Reza Farahzadi ◽  
Mostafa Langarizadeh ◽  
Mohammad Mirhosseini ◽  
Seyed Ali Fatemi Aghda

AbstractWireless sensor network has special features and many applications, which have attracted attention of many scientists. High energy consumption of these networks, as a drawback, can be reduced by a hierarchical routing algorithm. The proposed algorithm is based on the Low Energy Adaptive Clustering Hierarchy (LEACH) and Quadrant Cluster based LEACH (Q-LEACH) protocols. To reduce energy consumption and provide a more appropriate coverage, the network was divided into several regions and clusters were formed within each region. In selecting the cluster head (CH) in each round, the amount of residual energy and the distance from the center of each node were calculated by the base station (including the location and residual energy of each node) for all living nodes in each region. In this regard, the node with the largest value had the highest priority to be selected as the CH in each network region. The base station calculates the CH due to the lack of energy constraints and is also responsible for informing it throughout the network, which reduces the load consumption and tasks of nodes in the network. The information transfer steps in this protocol are similar to the LEACH protocol stages. To better evaluate the results, the proposed method was implemented with LEACH LEACH-SWDN, and Q-LEACH protocols using MATLAB software. The results showed better performance of the proposed method in network lifetime, first node death time, and the last node death time.


Sign in / Sign up

Export Citation Format

Share Document