Advanced Energy Efficient Master/Slave Algorithm in Wireless Sensor Networks

Author(s):  
Vageesh Kattimani

The nodes in WSNs are densely deployed and lots of redundancy exists during the data gathering and sending perceived data straightforwardly to the base station, which leading to consumption of energy in nodes. Existing Clustering algorithms in WSN selects just one group head in the each cluster, where it devours more energy at Cluster head(CH) quickly and which condenses lifetime of the network incredibly. The paper proposes the Advanced and Energy Efficient Master/Slave algorithm to solve this problem. The algorithm reduces the energy consumption of each node by minimizing the direct communication of the nodes with the Base station or CHs by changing the hierarchy in WSN. The moto of the algorithm is to select one master Cluster Head and remaining slave CHs. The algorithm will select Master Cluster Head based on more residual energy, distance, and low packet drop; the remaining become Slave Cluster Heads. The simulation results prove that the Advanced and Energy Efficient Master/Slave algorithm improves throughput and packet delivery ratio(PDR) by decreasing the energy consumption.

2021 ◽  
Author(s):  
Pogula Sreed ◽  
S. Venkateswarlu

Abstract Recently, the research area interest towards the development of wireless sensor network (WSN) has increased. However, WSNs have one of significant issues as improving an energy-efficient routing protocol. A WSN has a crucial problem of energy consumption that effects the network lifetime as sensor nodes have a limitation of power. To overcome these limitations, it’s required to improve energy-efficient communication protocols for WSNs. Different types of techniques have considered by various research communities for providing energy-efficient solutions for WSNs. The energy consumption reduces using the clustering as an efficient data collection method and the collected data forward to a cluster-head which belong to the nodes in clustered networks. The information transmits to BS (base station) either in an uncompressed or compressed manner after collecting all data by a cluster-head from all member nodes. Based on other cluster-heads, the data transmit in a multi-hop network. Due to the heavy inter-cluster relay, earlier death happens to the cluster-heads (CHs) that locates very closely to the sink. Therefore, a fuzzy optimal CH selection algorithm has proposed to select the optimal CHs to improve the lifetime. Based on different parameters like cluster load, communication cost, neighbour density, node degree, inter and intra cluster distance, and node energy, the proposed algorithm of CH selection chooses the CHs. To determine an optimal route for transmitting the data from CH to sink, the modified Emperor Penguin Optimization (EPO) uses after selecting the CH. The proposed technique implements and compares with other earlier methods in terms of packet delivery ratio, lifetime, energy consumption, end to end delay and throughput. The proposed approach shows best performance than the other methods based on the simulation results.


Author(s):  
Hardeep S. Saini ◽  
Dinesh Arora

Background & Objective: The operating efficiency of a sensor network totally relies upon the energy that is consumed by the nodes to perform various tasks like data transmission etc. Thus, it becomes mandatory to consume the energy in an intelligent way so that the network can run for a long period. This paper proposed an energy efficient Cluster Head (CH) selection mechanism by considering the distance to Base Station (BS), distance to node and energy as major factors. The concept of volunteer node is also introduced with an objective to reduce the energy consumption of the CH to transmit data from source to BS. The role of the volunteer node is to transmit the data successfully from source to destination or BS. Conclusion: The results are observed with respect to the Alive nodes, dead nodes and energy consumption of the network. The outcome of the proposed work proves that it outperforms the traditional mechanisms.


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.


2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zuo Chen ◽  
Min He ◽  
Wei Liang ◽  
Kai Chen

Wireless sensor network (WSN) is a kind of distributed and self-organizing networks, in which the sensor nodes have limited communication bandwidth, memory, and limited energy. The topology construction of this network is usually vulnerable when attacked by malicious nodes. Besides, excessive energy consumption is a problem that can not be ignored. Therefore, this paper proposes a secure topology protocol of WSN which is trust-aware and of low energy consumption, called TLES. The TLES considers the trust value as an important factor affecting the behavior of node. In detail, the TLES would take trust value, residual energy of the nodes, and node density into consideration when selecting cluster head nodes. Then, TLES constructs these cluster head nodes by choosing the next hop node according to distance to base station (BS), nodes’ degrees, and residual energy, so as to establish a safe, reliable, and energy saving network. Experimental results show that the algorithm can effectively isolate the malicious node in the network and reduce the consumption of energy of the whole network.


2018 ◽  
Vol 2018 ◽  
pp. 1-23 ◽  
Author(s):  
Mingfeng Huang ◽  
Anfeng Liu ◽  
Tian Wang ◽  
Changqin Huang

Energy-efficient data gathering techniques play a crucial role in promoting the development of smart portable devices as well as smart sensor devices based Internet of Things (IoT). For data gathering, different applications require different delay constraints; therefore, a delay Differentiated Services based Data Routing (DSDR) scheme is creatively proposed to improve the delay differentiated services constraint that is missed from previous data gathering studies. The DSDR scheme has three advantages: first, DSDR greatly reduces transmission delay by establishing energy-efficient routing paths (E2RPs). Multiple E2RPs are established in different locations of the network to forward data, and the duty cycles of nodes on E2RPs are increased to 1, so the data is forwarded by E2RPs without the existence of sleeping delay, which greatly reduces transmission latency. Secondly, DSDR intelligently chooses transmission method according to data urgency: the direct-forwarding strategy is adopted for delay-sensitive data to ensure minimum end-to-end delay, while wait-forwarding method is adopted for delay-tolerant data to perform data fusion for reducing energy consumption. Finally, DSDR make full use of the residual energy and improve the effective energy utilization. The E2RPs are built in the region with adequate residual energy and they are periodically rotated to equalize the energy consumption of the network. A comprehensive performance analysis demonstrates that the DSDR scheme has obvious advantages in improving network performance compared to previous studies: it reduces transmission latency of delay-sensitive data by 44.31%, reduces transmission latency of delay-tolerant data by 25.65%, and improves network energy utilization by 30.61%, while also guaranteeing the network lifetime is not lower than previous studies.


2013 ◽  
Vol 787 ◽  
pp. 1050-1055 ◽  
Author(s):  
Zhi Gui Lin ◽  
Hui Qi Zhang ◽  
Xu Yang Wang ◽  
Fang Qin Yao ◽  
Zhen Xing Chen

To the disadvantages, such as high energy consumption and the energy consumption imbalance, we proposed an energy-efficient routing protocol on mobile sink (MSEERP) in this paper. In the MSEERP, the network is divided into several square virtual grids based on GAF, each grid is called a cluster, and the cluster head election method of GAF is improved. In addition, the MSEERP introduces a mobile sink in the network, the sink radios in limited number of hops and uses control moving strategy, namely the sink does not collect the information until it moves to a cluster with highest residual energy. We applied NS2 to evaluate its performance and analyze the simulation results by the energy model. Simulation results show that the MSEERP balances the energy consumption of the network, saves nodes energy and extends the network lifetime.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jun Wang ◽  
Zhuangzhuang Du ◽  
Zhengkun He ◽  
Xunyang Wang

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.


2019 ◽  
Vol 8 (4) ◽  
pp. 11996-12003

Wireless Sensor network becomes an essential part of Internet of things paradigm due their scalability, ease of deployment and user-friendly interface. However, certain issues like high energy consumption, low network lifetime and optimum quality of service requirement force researchers to develop new routing protocols. In WSNs, the routing protocols are utilized to obtain paths having high quality links and high residual energy nodes for forwarding data towards the sink. Clustering provide the better solution to the WSN challenges by creating access points in the form of cluster head (CH). However, CH must tolerate additional burden for coordinating network activities. After considering these issues, the proposed work designs a moth flame optimization (MFO) based Cross Layer Clustering Optimal (MFO-CLCO) algorithm to consequently optimize the network energy, network lifetime, network delay and network throughput. Multi-hop wireless communication between cluster heads (CHs) and base station (BS) is employed along with MFO to attain optimum path cost. The simulation results demonstrate that the proposed scheme outperforms existing schemes in terms of energy consumption, network lifetime, delay and throughput.


2021 ◽  
Author(s):  
Mohaideen Pitchai K

Abstract Appropriate cluster head selection can significantly reduce energy consumption and enhance the lifetime of the WSN. The choice of cluster heads, which is a pivotal step in the cluster-based algorithm, can seriously influence the performance of the clustering algorithm. Under normal circumstances, whether a node can be a cluster head or not depends not only on its energy level but also on the other factors such as energy consumption, channel lost, neighbor density, etc. In this sense, the selection of the cluster head can be regarded as a multiple criteria decision-making issue. This paper presents an Energy efficient Cluster Head selection using Fuzzy Logic (ECHFL) protocol, which combines the approaches of the fuzzy and IDA-star algorithm. This protocol selects the appropriate cluster head by using fuzzy inference rules. It uses three parametric descriptors such as residual energy, expected residual energy, and node centrality for the cluster formation and cluster head selection processes. These parameters contribute mainly for avoiding over-dissipation of energy in the network by selecting the suitable cluster head for the network. This protocol shows how fuzzy logic can be used in the cluster formation process to distribute the tasks and energy consumption over all the nodes. As a summary, the proposed protocol gives good performance results in comparison with the other protocols.


2016 ◽  
Vol 13 (10) ◽  
pp. 7184-7188
Author(s):  
Hong Dai ◽  
Heng Hui Ge

For LEACH routing protocol in the clustering routing protocol of wireless sensors, the network energy consumption inequality, node energy inequality and deficiency of cluster head election, this paper proposes the method of improving the cluster head election through node residual energy and the distance between the nodes. To balance the network energy consumption, improves the algorithm of stable data transmission phase. The simulation experiment results prove the fact that the improved algorithm is better than the original algorithm through comparing the node mortality, receiving data amount of base station and residual energy of the node.


Sign in / Sign up

Export Citation Format

Share Document