Enhanced Adaptive Distributed Energy-Efficient Clustering (EADEEC) for Wireless Sensor Networks

2020 ◽  
Vol 13 (2) ◽  
pp. 168-172
Author(s):  
Ravi Kumar Poluru ◽  
M. Praveen Kumar Reddy ◽  
Syed Muzamil Basha ◽  
Rizwan Patan ◽  
Suresh Kallam

Background:Recently Wireless Sensor Network (WSN) is a composed of a full number of arbitrarily dispensed energy-constrained sensor nodes. The sensor nodes help in sensing the data and then it will transmit it to sink. The Base station will produce a significant amount of energy while accessing the sensing data and transmitting data. High energy is required to move towards base station when sensing and transmitting data. WSN possesses significant challenges like saving energy and extending network lifetime. In WSN the most research goals in routing protocols such as robustness, energy efficiency, high reliability, network lifetime, fault tolerance, deployment of nodes and latency. Most of the routing protocols are based upon clustering has been proposed using heterogeneity. For optimizing energy consumption in WSN, a vital technique referred to as clustering.Methods:To improve the lifetime of network and stability we have proposed an Enhanced Adaptive Distributed Energy-Efficient Clustering (EADEEC).Results:In simulation results describes the protocol performs better regarding network lifetime and packet delivery capacity compared to EEDEC and DEEC algorithm. Stability period and network lifetime are improved in EADEEC compare to DEEC and EDEEC.Conclusion:The EADEEC is overall Lifetime of a cluster is improved to perform the network operation: Data transfer, Node Lifetime and stability period of the cluster. EADEEC protocol evidently tells that it improved the throughput, extended the lifetime of network, longevity, and stability compared with DEEC and EDEEC.

2021 ◽  
Vol 10 (5) ◽  
pp. 2643-2651
Author(s):  
Noor Alhuda F. Abbas ◽  
Jaber H. Majeed ◽  
Waleed Khalid Al-Azzawi ◽  
Adnan Hussein Ali

There are certain challenges faced with wireless sensor networks (WSNs) performances, consumption can be seen amongst all these challenges as a serious area of research. Data from sensor nodes are transmitted by most WSN energy either among many nodes or to the base station (BS), and due this connection, several routing protocols were developed for supporting in data transmission in the WSNs. Extending network lifetime in an operational environment is the major objective of the wireless sensor network. Charging or exchanging sensor node batteries is almost impossible. Energy balancing and energy efficiency are significant research scopes as per designing of routing protocols aimed at self-organized WSNs. A heterogeneous WSN is one where every node has different amount of energy linked to it before it is deployed in a network. Therefore, different energy efficient routing protocols have been proposed which enables lesser consumption of energy, longer stability period which leads to the network lifetime increasing. In this study, the average energy of a WSN is computed after every logical round of operation for our protocol-HPEEA and compare it with two well-known heterogeneous protocols namely-SEP and CCS. At the end of the considered number of logical operations, MATLAB with simulation results confirm that HPEEA protocol have a reduction in the energy consumption compared to other protocols.


Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.


Author(s):  
Mohit Kumar ◽  
Sonu Mittal ◽  
Md. Amir Khusru Akhtar

Background: This paper presents a novel Energy Efficient Clustering and Routing Algorithm (EECRA) for WSN. It is a clustering-based algorithm that minimizes energy dissipation in wireless sensor networks. The proposed algorithm takes into consideration energy conservation of the nodes through its inherent architecture and load balancing technique. In the proposed algorithm the role of inter-cluster transmission is not performed by gateways instead a chosen member node of respective cluster is responsible for data forwarding to another cluster or directly to the sink. Our algorithm eases out the load of the gateways by distributing the transmission load among chosen sensor node which acts as a relay node for inter-cluster communication for that round. Grievous simulations show that EECRA is better than PBCA and other algorithms in terms of energy consumption per round and network lifetime. Objective: The objective of this research lies in its inherent architecture and load balancing technique. The sole purpose of this clustering-based algorithm is that it minimizes energy dissipation in wireless sensor networks. Method: This algorithm is tested with 100 sensor nodes and 10 gateways deployed in the target area of 300m × 300m. The round assumed in this simulation is same as in LEACH. The performance metrics used for comparisons are (a) network lifetime of gateways and (b) energy consumption per round by gateways. Our algorithm gives superior result compared to LBC, EELBCA and PBCA. Fig 6 and Fig 7 shows the comparison between the algorithms. Results: The simulation was performed on MATLAB version R2012b. The performance of EECRA is compared with some existing algorithms like PBCA, EELBCA and LBCA. The comparative analysis shows that the proposed algorithm outperforms the other existing algorithms in terms of network lifetime and energy consumption. Conclusion: The novelty of this algorithm lies in the fact that the gateways are not responsible for inter-cluster forwarding, instead some sensor nodes are chosen in every cluster based on some cost function and they act as a relay node for data forwarding. Note the algorithm does not address the hot-spot problem. Our next endeavor will be to design an algorithm with consideration of hot-spot problem.


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.


Author(s):  
Tanya Pathak ◽  
Vinay Kumar Singh ◽  
Anurag Sharma

In the recent years, an efficient design of a Wireless Sensor Network has become important in the area of research. The major challenges in the design of Wireless Sensor Network is to improve the network lifetime. The main difficulty for sensor node is to survive in that monitoring area for the longer time that means there is a need to increase the lifetime of the sensor nodes by optimizing the energy and distance. There are various existing routing protocols in which optimal routing can be achieved like Data-Centric, Hierarchical and Location-based routing protocols. In this paper, new power efficient routing protocol is being proposed that not only select the shortest path between the source node and sink node for data transmission but also maximizes the lifetime of the participating nodes by selecting the best path for sending the data packet across the network. The main objective of this research is to develop a faster algorithm to find the energy efficient route for Wireless Sensor Network. Simulation results shows that this strategy achieves long network lifetime when compared to the other standard protocols.


2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Sercan Vançin ◽  
Ebubekir Erdem

Due to the restricted hardware resources of the sensor nodes, modelling and designing energy efficient routing methods to increase the overall network lifetime have become one of the most significant strategies in wireless sensor networks (WSNs). Cluster-based heterogeneous routing protocols, a popular part of routing technology, have proven effective in management of topology, energy consumption, data collection or fusion, reliability, or stability in a distributed sensor network. In this article, an energy efficient three-level heterogeneous clustering method (DEEC) based distributed energy efficient clustering protocol named TBSDEEC (Threshold balanced sampled DEEC) is proposed. Contrary to most other studies, this study considers the effect of the threshold balanced sampled in the energy consumption model. Our model is compared with the DEEC, EDEEC (Enhanced Distributed Energy Efficient Clustering Protocol), and EDDEEC (Enhanced Developed Distributed Energy Efficient Clustering Protocol) using MATLAB as two different scenarios based on quality metrics, including living nodes on the network, network efficiency, energy consumption, number of packets received by base station (BS), and average latency. After, our new method is compared with artificial bee colony optimization (ABCO) algorithm and energy harvesting WSN (EH-WSN) clustering method. Simulation results demonstrate that the proposed model is more efficient than the other protocols and significantly increases the sensor network lifetime.


2012 ◽  
Vol 8 (4) ◽  
pp. 751784 ◽  
Author(s):  
Imanishimwe Jean de Dieu ◽  
Nyirabahizi Assouma ◽  
Maniraguha Muhamad ◽  
Wang Jin ◽  
Sungyoung Lee

To collect the data and transmit them on the base station is the main task of the sensor nodes in wireless sensor networks (WSNs). This transmission requires a specific routing algorithm. To prolong the network lifetime, sensor nodes need a secure load-balancing route. In this paper, we investigate the facts of ensuring secure sensed data in a balanced energy network backbone, and propose energy-efficient secure path algorithm (ESPA) for WSNs. It is a process of ensuring sensed data authenticity and integrity under a well-structured energy-efficient routing. To overcome the limitation caused by the symmetric key cryptography algorithms for securing data in WSNs, we proposed a mechanism for checking data integrity in a balanced energy network backbone. On this basis, we use the combined version of distance energy aware routing and a checking data integrity method for WSNs. ESPA provides a better performance in maximizing the network lifetime.


Sensors ◽  
2022 ◽  
Vol 22 (2) ◽  
pp. 478
Author(s):  
Xiao Yan ◽  
Cheng Huang ◽  
Jianyuan Gan ◽  
Xiaobei Wu

Energy efficiency is one of the critical challenges in wireless sensor networks (WSNs). WSNs collect and transmit data through sensor nodes. However, the energy carried by the sensor nodes is limited. The sensor nodes need to save energy as much as possible to prolong the network lifetime. This paper proposes a game theory-based energy-efficient clustering algorithm (GEC) for wireless sensor networks, where each sensor node is regarded as a player in the game. According to the length of idle listening time in the active state, the sensor node can adopt favorable strategies for itself, and then decide whether to sleep or not. In order to avoid the selfish behavior of sensor nodes, a penalty mechanism is introduced to force the sensor nodes to adopt cooperative strategies in future operations. The simulation results show that the use of game theory can effectively save the energy consumption of the sensor network and increase the amount of network data transmission, so as to achieve the purpose of prolonging the network lifetime.


Author(s):  
Ali Mahani ◽  
Ebrahim Farahmand ◽  
Saeide Sheikhpour ◽  
Nooshin Taheri-Chatrudi

Wireless sensor networks (WSNs) are beginning to be deployed at an accelerated pace, and they have attracted significant attention in a broad spectrum of applications. WSNs encompass a large number of sensor nodes enabling a base station (BS) to sense and transmit data over the area where WSN is spread. As most sensor nodes have a limited energy capacity and at the same time transmit critical information, enhancing the lifetime and the reliability of WSNs are essential factors in designing these networks. Among many approaches, clustering of sensor nodes has proved to be an effective method of reducing energy consumption and increasing lifetime of WSNs. In this paper, a new energy-efficient clustering protocol is implemented using a two-step Genetic Algorithm (GA). In the first step of GA, cluster heads (CHs) are selected, and in the second step, cluster members are chosen based on their distance to the selected CHs. Compared to other clustering protocols, the lifetime of WSNs in the proposed clustering is improved. This improvement is the consequence of the fact that this clustering considers energy efficient parameters in clustering protocol.


Wireless sensor network environment based on limited resources technology. Energy is one of the most significant resources in such systems, so ideal utilization of energy is essential. A high energy efficient with trustable routingprotocol for Wireless_Sensor_Networks covered under this_paper. The protocol is trustworthy as far as data conveyance at the Base_Station. We assumed about portability in sensor nodes and in the base station. The proposed protocol depends on the cluster and hierarchical routing protocols. All clusters comprises of unique cluster-head-node and two-deputy-clusterhead-nodes, and several normal sensor-nodes. The cluster-head panel model introduced to optimize the re-clustering time and energy prerequisites. As consider the protocol trustworthiness, it lays finest exertion to guarantee a predetermined level of performance at the base-station. Contingent upon the network topology, transmit data from cluster head node to base station that done either by direct or indirect i.e. multi-hop way. Also, substitute ways are utilized for data transmission between a cluster head node and the base station. Thorough NS2 simulation-results delineate energy-efficiency, throughput, and delayed-lifetime of sensor-nodes affected by the proposedprotocol.


Sign in / Sign up

Export Citation Format

Share Document