Sensitive Energy Efficient Sensor Network Research Articles

Optimization of wireless sensor networks energy consumption by the clustering method based on the firefly algorithm

Wireless sensor networks (WSNs) contain an inordinate number of sensor nodes that are spatially distributed. The network is composed of entities that determine its lifetime. The WSN nodes are equipped with a battery whose autonomy is limited in duration. In this paper, different solutions are introduced to improve the overall energy consumption of the network in order to improve its lifetime. Contrary to many works considering the clustering algorithm as one potential candidate to improve the network's lifetime, this study has investigated the firefly algorithm optimization where an optimal cluster head is selected from a group of nodes. The set-up process of the cluster head is based on a set of conditions. To measure the performance of the proposed approach, the number of dead nodes and data packets received by the base station (BS) or sink node are considered. The results are tested on 100 nodes for 5000 transmission rounds, the amount of data transported is 20 million bits a little more than the other methods. It has been shown that the proposed solution outperformed the traditional low energy adaptive clustering hierarchy (LEACH), threshold sensitive energy efficient sensor network (TEEN), and developed distributed energy-efficient clustering (DEEC) approaches.

Minimizing Energy Hole Problem Comparisons in Some Hierarchical WSN Routing Protocols

This paper study the efficient use of energy as a challenging task of designing these protocols. The energy holes are created due to non-uniform node distribution in the network when quickly drain the energy in a few nodes. It is studies removing energy holes by using sleep and awake mechanism for sensor nodes to save energy. This approach finds the maximum distance nodes to calculate the maximum energy for data. It intends to enumerate the dead nodes transmission, alive nodes, throughput, overhead and packet delivery ratio consumed by the entire network and affected by the network area changes. lastly, a brief performance analysis of Low Energy Adaptive Clustering Hierarchy (LEACH), Distributed Energy-Efficient Clustering (DEEC), Threshold sensitive Energy Efficient sensor Network protocol (TEEN) and Stable Election Protocol (SEP) is carried out considering metrics of the previous characteristics of wireless sensor network.

Energy Efficient Routing and Dynamic Cluster Head Selection Using Enhanced Optimization Algorithms for Wireless Sensor Networks

A large number of spatially dispersed nodes on the wireless network create Wireless Sensor Networks (WSNs) to collect and analyze the physical data from the environment. The issues that affected the network and had an impact on network energy consumption were cluster head random selection, working node redundancy, and cluster head transmission path construction. Consequently, this energy constraint also has an impact on the network lifetime and energy-efficient routing. Therefore, the primary goals of this research are to decrease energy consumption and lengthen the network’s lifespan. So, using improved optimization algorithms, this paper presents a dynamic cluster head-based energy-efficient routing system. The Improved Coyote Optimization Algorithm (ICOA), in this case, consists of three phases setup, transmission, and measurement phase. The Improved Jaya Optimization Algorithm with Levy Flight (IJO-LF) then determines the route between the BS and the CH. It selects the most effective course based on the distance, node degree, and remaining energy. The proposed approach is compared with traditional methods and the routing protocols Power-Efficient Gathering in Sensor Information Systems (PEGASIS) and Threshold sensitive Energy Efficient Sensor Network protocol (TEEN) during implementation on the MATLAB platform. Performance indicators for the suggested methodology are evaluated based on data packets collected by the BS, energy usage, alive nodes, and dead nodes. The outputs of the suggested methodology performed better than the conventional plans.

Energy efficient routing in wireless sensor network based on mobile sink guided by stochastic hill climbing

In Wireless Sensor Networks (WSNs), the reduction of energy consumption in the batteries of a sensor node is an important task. Sensor nodes of WSNs perform three significant functions such as data sensing, data transmitting and data relaying. Routing technique is one of the methods to enhance the sensor nodes battery lifetime. Energy optimization is done by using one of the heuristic routing methods for sensing and transmitting the data. To enhance the energy optimization mainly concentrated on data relaying. In this work stochastic hill climbing is adapted. The proposed solution for data relaying utilizes geographical routing and mobile sink technique. The sink collects the data from cluster heads and movement of the sink is routed by stochastic hill climbing. Network simulator 2 is used for experimentation purpose. This work also compares with the existing routing protocols like Energy-efficient Low Duty Cycle (ELDC), Threshold sensitive Energy Efficient sensor Network (TEEN) and Adaptive clustering protocol. The proposed work shows promising results with respect to lifetime, average energy of nodes and packet delivery ratio.

Energy Efficient Routing in Wireless Sensor Network Based on Composite Fuzzy Methods

Optimization of energy consumption in the batteries of a sensor node plays an essential role in wireless Sensor networks (WSNs). The longevity of sensor nodes depends on efficiency of energy utilization in batteries. Energy is consumed by sensor nodes in WSNs to perform three significant functions namely data sensing, transmitting and relaying. The battery energy in WSNs depletes mainly due to sampling rate and transmission rate. In the present work, the most important parameters affecting the longevity of network are indentified by modeling the energy consumption. The parameters are expressed as a fuzzy membership function of variables affecting the life time of network. Fuzzy logic is used at multiple levels to optimize the parameters. Network simulator-2 is used for experimentation purpose. The proposed work is also compared with the existing routing protocols like Enhanced Low Duty Cycle, Threshold Sensitive Energy Efficient Sensor Network and Distributed Energy Efficient Adaptive Clustering Protocol with Data Gathering. The proposed solution is found to be more energy efficient and hence ensures longer network lifetime.

Efficient and Secure Data Transmission and Sinkhole Detection in a Multi-Clustering Wireless Sensor Network Based on Homomorphic Encryption and Watermarking

In a wireless sensor network, the sensors periodically transmit sensed data from a specific environment to a centralized station by wireless communication. Deployment in an open environment leads to the potential of security attacks. A sinkhole attack is a destructive attack aimed at the network layer, where the sinkhole node attracts other nodes by advertising itself as the best path to the base station. Subsequently receiving other sensor node packets and compromising network security. Hence, this work proposes a lightweight, secure method based on the Threshold Sensitive Energy Efficient Sensor Network protocol and watermarking techniques to ensure data integrity during transmission. The homomorphic encryption used in this scheme is to provide fast and efficient and consumes less energy while identifying sensor nodes for the purpose of sinkhole detection and prevention. The proposed work has been evaluated using OMNET++ simulation environment to measure the proposed work performance in the following metrics: delay, packet delivery ratio, throughput, and average energy consumption. Compared with previous works, the proposed work shows better results in these metrics. In addition, the proposed scheme consumes less energy compared with similar works due to the use of lightweight watermarking and authentication techniques. The results show that the proposed scheme enhances security by detecting the sinkhole attacker node before the attack is even activated. In addition, the proposed method ensures the integrity and authenticity of the sensed data while transmitting them from the sensor node until receiving it in the base station, and it can detect any tampering of the data.

Optimization by Genetic Algorithm in Wireless Sensor Networks Utilizing Multiple Sinks

WSN (Wireless Sensor Network) comprises of small-sized and constraint-capability SN (Sensor Nodes) which record, send and receive data, sensed to a sink. The network lifetime and energy usability are important challenges to be dealt with. During the working of the SN, the maximum amount of energy is consumed than sensing and processing of data. Therefore, an efficient transmission of the data is required so that the energy can be saved. In this paper, a novel routing and scheduling method for WSNs using GA (Genetic Algorithm) is presented, where the sinks employed on four sides of the sensor field. These sinks collect the data from the SNs having the optimal distance towards the respective sink. The proposed scheme finds the optimized path using GA, during transmission of data from SN to the nearest sink. First, we run the GA for determination of routing paths, where a source SN finds the possible number of optimal hops. Second, the hops or intermediate relay SNs are assumed to relay the data towards the sink, efficiently. The performance is experimented and evaluated using MATLAB R2016b. The simulations have carried out through comparing the proposed scheme with TEEN (Threshold Sensitive Energy Efficient Sensor Network Protocol). The results of simulation comprise of 10 and 20 number of SNs, discretely. Additionally, the direct distance of each node is calculated and the distance through multiple hops from/to the nearest sink is also evaluated. The achievements of the proposed technique are to save both energy and distance for the sake of network longevity and optimal and precise data delivery by multiple hops.

Performance analysis of various hierarchical routing protocols using spatial correlation

In Wireless Sensor Networks (WSNs), the most significant task is to gather the data from the sensor nodes available in specific region available in event sensing field. The nodes in WSNs are energy constrained. To enhance the lifetime of WSNs, energy efficient protocols are needed. Spatial Correlation based Low Energy Adaptive Clustering Hierarchy (SCLEACH), Spatial Correlation based Power-efficient Gathering in Sensor Information Systems (SCPEGASIS), Spatial Correlation based Threshold Sensitive Energy Efficient Sensor Network Protocol (SCTEEN) are well-designed solutions to rectify this problem. These protocols minimize the overall dissipation by means of individual sensor nodes located in the network. Spatial correlation based Hierarchical Routing Protocols (SCHRP) adapt clustering concept and enhance the energy efficiency and the performance of over all network. The Performance of SCHRP model is compared with existing LEACH and PEGASIS, TEEN protocols and results have been taken for various parameters such as End-to-End delay, Packet drop, Packet delivery ratio, Throughput, Energy Efficiency and Energy Consumption. The proposed SCLEACH has 6.35% higher energy efficiency than the existing LEACH protocol. The impact of the proposed protocols are evaluated using various parameters and compared with k-d tree algorithm. The importance of spatial correlation based routing concept is analyzed with respect to k-d tree algorithm and the simulation results have been taken using Network Simulator tool.

Study on the Hierarchical Routing Protocols for Wireless Sensor Networks

Routing the sensed data is considered a main challenge in Wireless Sensor Networks (WSN) because the routing characteristics may vary depending on the network application and/or the network architecture. Since most sensor network applications work in clusters, hierarchical routing protocols have been developed to fit this network topology. This paper introduces the performance differentials for most common hierarchical routing protocols such as Low Energy Adaptive Clustering Hierarchy (LEACH) and Threshold sensitive Energy Efficient sensor Network protocol (TEEN). The design parameters of sensor networks are analyzed to present a classification and comparison of LEACH, TEEN routing protocols. The two protocols are analyzed using different mobility models using NS2 simulation tool. This comparison reveals the important features that need to be taken into consideration while designing and evaluating new routing protocols for sensor networks.

Dual-hop Routing Protocol for Improvement of Energy Consumption in Layered WSN Sensor Field

This paper proposes to increase the node energy efficiency, which rapidly drops during the transmission of L-TEEN (Layered Threshold sensitive Energy Efficient sensor Network protocol), using the method of DL-TEEN (Dual-hop Layered TEEN). By introducing dual-hop method in the data transmission, the proposed single-hop method for short-range transmission and multi-hop transmission method between the cluster heads for remote transmission was introduce. By introducing a partial multi-hop method in the data transmission, a single-hop method for short range transmission method between the cluster heads for remote transmission was introduces. In the proposed DL-TEEN, the energy consumption of cluster head for remote transmission reduces and increases the energy efficiency of sensor node by reducing the transmission distance and simplifying the transmission routine for short-range transmission. As compared the general L-TEEN, it was adapted to a wider sensor field.

Energy Efficient Clustering Scheme Menggunakan Square Cluster Model Untuk Wireless Sensor Network

The main goal of this research is concerning clustering protocols to minimize the energy consumption of each node, and reduce number of transmission in wireless sensor network. However, most existing clustering protocols consume large amounts of energy, incurred by cluster formation overhead and fixed-level clustering, particularly when sensor nodes are densely deployed in wireless sensor networks. In this paper, we propose TPR (Teen-Pegasis Routing) protocol, which is a low energy adaptive clustering hierarchy and threshold sensitive energy efficient sensor network protocol. This proposed algorithm combine both proactive and reactive routing protocol. Keywords: Wireless sensor networks (WSN), LEACH, PEGASIS, TEEN

DEAD NODE DETECTION IN TEEN PROTOCOL: SURVEY

Now a day’s wireless sensor network has become an interesting research field. Network life time and energy efficiency are one of the main concerns for wireless sensor networks. Sensors are constrained in terms of battery power, storage, limited processing capacity etc. Because of these reasons new protocols are proposed for wireless sensor network. This paper only deals with cluster based hierarchical protocol TEEN (Threshold Sensitive Energy Efficient Sensor Network Protocol). The sensor network architecture in TEEN is based on a hierarchical clustering. TEEN is data-centric, reactive, event-driven protocol which is best suited for time critical application. It transmits data based on hard threshold and soft threshold values. If the thresholds are not reached, then nodes will never communicate. The user will not get any data from network and will not come to know if all the nodes die. So, user will not be able to distinguish between how many nodes are alive or dead in network and will not be able to know about network lifetime. This paper deals with that node will be able to tell base station or sink before leaving network and base station will be aware of alive and dead nodes in the network.

Key Schemes for Security Enhanced TEEN Routing Protocol in Wireless Sensor Networks

In wireless sensor networks (WSNs), hierarchical routing protocol is commonly used for energy efficiency. In particular, the TEEN (Threshold sensitive Energy Efficient sensor Network) protocol is used widely as a basic clustered multihop routing protocol. However, energy efficient routing protocols without proper security suffer from many security vulnerabilities. Hence, in this paper, we propose a hybrid key scheme specially for the TEEN protocol: a symmetric key scheme for the intracluster and a public key scheme for the intercluster. The simulation results show that network lifetime of the proposed hybrid key scheme decreases about 8% than the TEEN protocol and about 4% compared with the TEEN protocol with symmetric key scheme. On the other hand, a hybrid key scheme provides better probability of successful transmission than that of the symmetric key scheme.