scholarly journals HETRP: High Energy Efficient Trustable Routing Protocol for Wireless Sensor Network

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.

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.


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.


2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Asis Kumar Tripathy ◽  
Suchismita Chinara

Wireless sensor network swears an exceptional fine-grained interface between the virtual and physical worlds. The clustering algorithm is a kind of key technique used to reduce energy consumption. Many clustering, power management, and data dissemination protocols have been specifically designed for wireless sensor network (WSN) where energy awareness is an essential design issue. Each clustering algorithm is composed of three phases cluster head (CH) selection, the setup phase, and steady state phase. The hot point in these algorithms is the cluster head selection. The focus, however, has been given to the residual energy-based clustering protocols which might differ depending on the application and network architecture. In this paper, a survey of the state-of-the-art clustering techniques in WSNs has been compared to find the merits and demerits among themselves. It has been assumed that the sensor nodes are randomly distributed and are not mobile, the coordinates of the base station (BS) and the dimensions of the sensor field are known.


21st century is considered as the era of communication, and Wireless Sensor Networks (WSN) have assumed an extremely essential job in the correspondence period. A wireless sensor network is defined as a homogeneous or heterogeneous system contains a large number of sensors, namely called nodes used to monitor different environments in cooperatives. WSN is composed of sensor nodes (S.N.), base stations (B.S.), and cluster head (C.H.). The popularity of wireless sensor networks has been increased day by day exponentially because of its wide scope of utilizations. The applications of wireless sensor networks are air traffic control, healthcare systems, home services, military services, industrial & building automation, network communications, VAN, etc. Thus the wide range of applications attracts attackers. To secure from different types of attacks, mainly intruder, intrusion detection based on dynamic state context and hierarchical trust in WSNs (IDSHT) is proposed. The trust evaluation is carried out in hierarchical way. The trust of sensor nodes is evaluated by cluster head (C.H.), whereas the trust of the cluster head is evaluated by a neighbor cluster head or base station. Hence the content trust, honest trust, and interactive trust are put forward by combining direct evaluation and feedback based evaluation in the fixed hop range. In this way, the complexity of trust management is carried in a hierarchical manner, and trust evaluation overhead is minimized.


Author(s):  
Ekaterina Andreevna Evstifeeva ◽  
Valeriy Dmitrievich Semeykin

Clustering, as one of the energy-efficient approaches, is widely used in wireless sensor networks. This method is based on creating clusters and selecting cluster head nodes in a wireless sensor network. Clustering saves network energy because data transfer is restricted between multiple nodes. Thus, clustering is provided between several nodes, and the service life of the wireless sensor network can be extended. Since the parent cluster node interacts with other nodes of the network, a node with a high level of residual energy must be selected to perform this role. When the energy level of the selected cluster head node becomes lower than the threshold value, then the re-election of this node takes place. It should be noted that multiple patterns of choosing cluster head nodes built using various parameters (residual node energy, distance from the base station to a node, distance between the head node and a cluster member, the number and proximity of neighboring nodes, etc.) lacked for a factor of energy consumption, i.e. how many times nodes communicated to each other. To cope with the problem, this paper presents a prognostic algorithm for selecting a cluster head node using fuzzy logic. This algorithm suggests using a number of input parameters, such as the residual energy of the node, the proximity of neighboring nodes, and the centralization of the node in the cluster. The proposed algorithm has been implemented using the software package MATLAB Fuzzy Logic Toolbox. The simulation results prove the advantages of the proposed technique; application of the input parameters mentioned above helps select optimal cluster head nodes in a wireless sensor network, which increases power efficiency of a wireless sensor network.


Author(s):  
Gaurav Kumar Nigam ◽  
Chetna Dabas

Background & Objective: Wireless sensor networks are made up of huge amount of less powered small sensor nodes that can audit the surroundings, collect meaningful data, and send it base station. Various energy management plans that pursue to lengthen the endurance of overall network has been proposed over the years, but energy conservation remains the major challenge as the sensor nodes have finite battery and low computational capabilities. Cluster based routing is the most fitting system to help for burden adjusting, adaptation to internal failure, and solid correspondence to draw out execution parameters of wireless sensor network. Low energy adaptive clustering hierarchy is an efficient clustering based hierarchical protocol that is used to enhance the lifetime of sensor nodes in wireless sensor network. It has some basic flaws that need to be overwhelmed in order to reduce the energy utilization and inflating the nodes lifetime. Methods : In this paper, an effective auxiliary cluster head selection is used to propose a new enhanced GC-LEACH algorithm in order to minimize the energy utilization and prolonged the lifespan of wireless sensor network. Results & Conclusion: Simulation is performed in NS-2 and the outcomes show that the GC-LEACH outperforms conventional LEACH and its existing versions in the context of frequent cluster head rotation in various rounds, number of data packets collected at base station, as well as reduces the energy consumption 14% - 19% and prolongs the system lifetime 8% - 15%.


Author(s):  
Md. Habibur Rahman ◽  
Md. Ibrahim Abdullah

The nodes within a cluster of Wireless Sensor Network deployed in adverse areas face the security threats of eavesdropping and capturing. The fundamental issue in wireless sensor network security is to initialize secure communication between sensor nodes by setting up secret keys between communicating nodes. Because of limited hardware capacity, conventional network cryptography is infeasible for sensor network. In this paper a key management technique is proposed for clustered sensor network that uses some cryptographic operation to generate secret keys. This key is updated in response to the message of cluster head or base station. The key update instructions are stored in each sensor nodes before deployed in sensor field. The updated secret key is used to communicate between nodes and cluster head.


2019 ◽  
Vol 16 (9) ◽  
pp. 3925-3931
Author(s):  
Bhupesh Gupta ◽  
Sanjeev Rana

For resource constraint network, one uses wireless sensor network in which limited resources are there for sensor nodes. Basic aim of sensor node is to sense something, monitor it and explain it. The issue arises for sensor node is its battery endurance. The battery endurance of sensor node is consuming in communication instead of sensing. In this regard clustering is using now a day’s which reduces endurance consumption. This paper comes with a new clustering protocol MESAEED (Mutual Exclusive Sleep Awake Energy Efficient Distributed clustering), which helps in saving endurance of sensor nodes so that network lifetime will prolong. It is an extension work of previous work MESADC. In previous work cluster head is chooses on the basis of sleep awake mode in mutual exclusive way under communication range and the results were obtained with the help of comparison graph between HEED and MESADC. The proposed MESAEED protocol provides benefit of A* algorithm of heuristic search, HEED and MESADC. MATLAB 8.3 is use for simulation purpose. The comparison graph between HEED, MESADC and proposed MESAEED were shown. Parameters for comparison include alive nodes versus number of rounds taken and number of nodes dead versus number of rounds taken. The graph shows improvement in performance over HEED and MESADC, which results in enhancing lifetime of WSN.


2013 ◽  
Vol 321-324 ◽  
pp. 515-522 ◽  
Author(s):  
Kou Lin Yuan ◽  
Lin Qiao ◽  
Lei Han

This paper proposes a level and cluster based routing approach for a wireless sensor network. Nodes in the network are divided into several levels according to their hops to sink node. Every sensor node has a level number. Using level information, a sensor node can send messages to a sink node in a more efficient way, and a sink node can easily locate other sensor nodes. To make network more balanced, the paper introduces a cluster method, which splits nodes in the same level into different clusters, and chooses a cluster head for every cluster, to switch nodes in the cluster to work in turn. Unlike all other cluster routing methods, a cluster head node takes schedule jobs of sensor nodes in the cluster according to their energy left, instead of sensing. The paper also presents several algorithms for constructing a wireless sensor network, querying and scheduling. The simulation experiment shows that the scalability of our method is approximately linear.


2020 ◽  
Vol 2020 ◽  
pp. 1-9 ◽  
Author(s):  
Aruna Pathak

In wireless sensor network, replacement of node’s battery is very tough task in hostile environments. Therefore, to maximize network lifetime is the ultimate solution. Dividing the sensing region of wireless sensor network into clusters is an excellent approach to gain high energy efficiency and to enhance lifetime of the network. On the other hand, heads of the cluster need additional energy because of additional work such as obtaining data from its member nodes, aggregation of their data, and finally sending it to the base station. To enhance the lifetime of these networks, proper selection of heads plays a vital role. In this paper, we propose proficient bee colony-clustering protocol (PBC-CP) which is based on artificial bee colony algorithm. In PBC-CP approach, we have taken important factors for selection of heads such as node’s energy, degree of node, and distance from base station to node. For transmitting the data from cluster head to base station, it chooses the energy-efficient path which further minimizes the energy consumption of sensor network. Simulation experiments show the effectiveness of our proposed approach.


Sign in / Sign up

Export Citation Format

Share Document