Lifetime Of WSN Research Articles

Sector-Based Efficient Trust Routing Protocol (SETRP) with Text Based Compression for Maximizing the Lifetime of WSN

WSN is distributed for the dispersion of different sensor nodes in a predetermined topology to sense the environment with finite resources, and by using cluster head the perceived data is communicated with the base station. WSN is a wireless network which consists of base stations and various sensor nodes. WSN can implement different functions like cluster’s head modification, avert redundant messages, resource reservation mechanism and resource cancellation mechanism. There is a major problem in the distribution of WSN i.e., ‘Non-uniform terrain structure’. Because of the irregular terrain structure, distribution of sensor nodes is stochastic in nature and due to this stochastic distribution, nodes are not properly arranged in a distributed way. A Sector-Based Efficient Trust Routing Protocol (SETRP) with Text based Compression is proposed by splitting the network into distinct clusters and then dividing the clusters into sub-clusters. Each sub-clusters are again classified into distinct sectors and each sector is designated with a sector head. The attainment of proposed approach is to compare this protocol with similar protocols (like GEED-M, EETRP, and FERP) accomplished for peculiar terrain structure like plateaus and military areas. A Sector-based Efficient Trust Routing Protocol (SETRP) with Text based Compression is to boost up the lifetime of the network by 69%, and to diminish the energy consumption of the network by 30%.

A New Method to Find a High Reliable Route in IoT by Using Reinforcement Learning and Fuzzy Logic

Recently, Internet is moving quickly toward the interaction of objects, computing devices, sensors, and which are usually indicated as the Internet of things (IoT). The main monitoring infrastructure of IoT systems main monitoring infrastructure of IoT systems is wireless sensor networks. A wireless sensor network is composed of a large number of sensor nodes. Each sensor node has sensing, computing, and wireless communication capability. The sensor nodes send the data to a sink or a base station by using wireless transmission techniques However, sensor network systems require suitable routing structure to optimizing the lifetime. For providing reasonable energy consumption and optimizing the lifetime of WSNs, novel, efficient and economical schemes should be developed. In this paper, for enhancing network lifetime, a novel energy-efficient mechanism is proposed based on fuzzy logic and reinforcement learning. The fuzzy logic system and reinforcement learning is based on the remained energies of the nodes on the routes, the available bandwidth and the distance to the sink. This study also compares the performance of the proposed method with the fuzzy logic method and IEEE 802.15.4 protocol. The simulations of the proposed method which were carried out by OPNET (Optimum Network performance) indicated that the proposed method performed better than other protocols such as fuzzy logic and IEEE802.15.4 in terms of power consumption and network lifetime.

A Novel Distributed CDS Algorithm for Extending Lifetime of WSNs With Solar Energy Harvester Nodes for Smart Agriculture Applications

Recent improvements in computer and software technologies affect different areas of production systems. The productivity of an agricultural process can be accepted as one of the many domains affected by these improvements. The production volume is increased not only with new designs of agricultural machines, but also by utilizing communication technologies in the production process. Even the wireless sensor technologies have started to be used for gathering some environmental features in order to optimize production parameters as well as preserving the product in determined quality levels. However, nodes which play an important part of such systems are prone to battery depletions. To alleviate this battery problem, incorporating harvester nodes into the system has been recently considered. However, only including such nodes is not sufficient for improving the lifetime of the system. In this paper, a new distributed connected dominating set algorithm on WSNs with solar energy harvester nodes for precision agriculture applications is proposed. The novel distributed connected dominating set construction with solar energy harvesting in smart agriculture applications algorithm, namely CDSSEHA, is compared with the traditional flooding methods and with an energy efficient CDS algorithm. According to the results, the proposed algorithm increased the WSNs' lifetime by up to approximately 6 times and 1.4 times compared to the traditional flooding methods and CDS based method, respectively. Furthermore, the CDS construction process constitutes only about 15% of the whole lifetime.

Barrier Coverage Mechanism Using Adaptive Sensing Range for Renewable WSNs

Barrier coverage aims at constructing defense barriers to detect the intruder crossing the predefined boundary in a given wireless sensor network. In literature, most studies considered the battery-powered sensors and applied the Boolean Sensing Model (BSM). The battery-powered sensors have the constraint of limited lifetime while the BSM will affect the actual surveillance quality evaluation because it cannot reflect the physical features of sensing. This paper applies the Probabilistic Sensing Model (PSM) and proposes an algorithm, called BSAS , which considers the solar-powered sensors with adjustable sensing radius to construct the defense barriers. Two main challenges should be overcome. The first one is the cooperative working between sensors to achieve the highest intruder detection probability for a given boundary curve. The BSAS identifies the bottleneck segment with the minimal surveillance quality and schedules as many as possible sensors to improve the bottleneck segment. In addition, a space-time transformation scheme which further adjusts the sensing radius of some sensors is proposed, aiming at improving the detection probability of the bottleneck segment. Consequently, the minimal surveillance quality of the barrier can be maximized. The second challenge is to maintaining the perpetual lifetime of WSNs. The BSAS takes into account the recharging and discharging ratio and time length of daytime in a day in its energy management which guarantees that the sensor energy can always satisfy the energy consumption for sensor working even in the nighttime. Experimental studies reveal that the proposed algorithm outperforms the existing studies in terms of surveillance quality and stability.

Energy Efficient Model for Maximizing the Network Coverage Time in Non-Deterministic WSN Model

WSN are the group nodes and these nodes are grouped into several clusters, each cluster has its own CH (Cluster Head). Moreover, each cluster Head collects the data and sends either through the corresponding CH or through the CH. Moreover, the clustering plays one of the eminent role in WSN, since Clustering reduces the energy consumption in the cluster Head and improvises the lifetime and scalability of WSN. However, this maximizes the burden on the CH and certainly, it causes the coverage loss. Hence, in this paper we design a model named as EE-NCT (Energy Efficient model for maximizing the network coverage time) which helps in increasing the Network Coverage time for the non-deterministic model, i.e. Sensor nodes location are not known. Non –deterministic model makes hard to maximize, as the node placement is not known. Moreover, this is achieved through monitoring the sensor node location and applying the routing based clustering scheme. Our model is evaluated by considering the various constraint such as first sensor node death, 75% of node death and loss of connectivity by considering the parameter as energy consumption and average number of failed nodes.

A Method in Collaborative Hybrid Routing Protocol for Next Generation WSN by using Fuzzy Logic

Remote sensor systems will be frameworks of free halfway fact points castoff for inspecting a state of affairs. Specialists of WSNs face troubles that rise up out of correspondence interface disillusionments, memory and computational goals, and confined imperativeness. Various issues in WSNs are point by point as multidimensional streamlining issues, and moved closer through bio pushed strategies. There are various strategies which are fundamental, fruitful, and computationally capable improvement estimation. It has been associated with location WSN issues, for instance, perfect association, center constrainment, Clustering, and statistics accumulation. Thusly, this proposition work plots problems in WSNs, well-knownshows usually energized figuring which assist us hip improving the freestyle lifespan of the Feeler middle points, and appears at its fittingness for WSN bids. It furthermore affords a short audit way the usually impelled estimations are uniquely suited to deal with these issues. Bio breathed lifestyles into upgrade strategies are computationally succesful picks in preference to logical systems. Sensors are seen as imperative pieces of electronic contraptions. In much use of remote sensor frameworks (WSNs), imperative and essential information must be passed on to the sink in a multi-bob and essentialness successful way. See that the essentialness of sensor center points is limited; hauling out framework lifetime in WSNs is seen as a fundamental issue. In order to extend the framework lifetime, authorities should consider imperativeness use in directing shows of WSNs. In this paper, another essentialness capable guiding show (EERP) has been proposed for WSNs using A-star figuring. The proposed coordinating arrangement improves the framework lifetime by sending data distributes the perfect most restricted way. The perfect way can be found as for the most extraordinary outstanding imperativeness of the accompanying hop sensor center, high association quality, support inhabitance and least skip counts. Amusement results show that the proposed arrangement improves compose lifetime in connection with A-star and feathery logic(A&F) show.

2720 Published By: Blue Eyes Intelligence Engineering & Sciences Publication Retrieval Number: A9752109119/2019©BEIESP DOI: 10.35940/ijeat.A9752.109119 Journal Website: www.ijeat.org AN Improved Energy Aware Secure Cluster Based Multiple Hop Routing Protocol for Wireless Sensor Network

Due to the technological advancement in wireless communication, energy-efficient power supply, and semiconductor technology, the smart sensor becomes popular in many applications. In WSN, the private data collected and processed by the sensor node must be protected from the malicious attack. Due to the resource constraint nature of WSN, the traditional security protocols do not apply to this network as it involves huge and complex computation. Furthermore, the energy supplied by the battery is not renewable. This paper proposes a secure cluster-based multiple-hop routing protocol for prolonging the lifetime of WSN and securing the data in transit and storage. This protocol proposes the matrix transposition cryptographic techniques for securing the sensor data. This protocol compares the energy consumption and throughput of two secure routing protocols.

Hierarchical Energy Efficient Routing in Wireless Sensor Networks and its Challenges

Wireless sensor network consists of various sensor nodes connected through wireless media. Sensor nodes are tiny devices having lesser energy capabilities. Sensor nodes are either ad-hoc or mobile in their environment. Wireless sensor network route of transmission media is discovered by routing protocols and responsible for secure communication between sensor nodes. Energy is a precious resource of sensor nodes, and the entire lifetime of WSNs is depending on the energy capability of the sensor nodes. The fundamental problem is how to organize topology of WSN for deployed sensor nodes with lesser power consumption as possible. Major problems in wireless sensor networks which consume extra energy are interference, control message overhead, packet delay, unnecessary transmission, and bandwidth utilization. Therefore, energy efficient techniques are needed to overcome these problems. Hierarchical routing is the best routing method for finding optimal path between sensor nodes which enhance the lifetime of the network. This paper focuses towards various hierarchical energy efficient routing in wireless sensor networks and analyzes various features of WSN that should consider during designing of routing protocols.

Extension of Lifespan in WSN

Objectives: Since Wireless Sensor Network has played a crucial role in our life, further research is needed to enhance its performance. For missions to be accomplished successfully, the lifetime span has to be prolonged. The lifetime of WSNs is considered a crucial issue that has to be studied further. Methods/Findings: Thus, numerous researches from different perspectives have been proposed. In this study and research, it has been found that there is a harmful process called sink isolation (hotspot zone) because of neighbor nodes of sink running out of energy more than the others. Our point of view is that these hotspot zones are of more concern than far away zones. Thus, a pioneering Q-metric is studied which tackles the energy consumption at each hotspot zone relative to the dimension of its interconnected nodes at the far away zone. Application: Accordingly, the Q can be manipulated to switch data traffic to alternative routes lead to a more proper hotspot zone and hence an exhausted hotspot zones will be avoided and consequently lifetime of this network will be extended. Keywords: Hotspot, Lifetime, Tree Topology, Route Metric, WSN

Mutual Exclusive Sleep Awake Energy Efficient Distributive (MESAEED) Clustering: An Approach for Enhancing Lifetime of Wireless Sensor Network

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.

Research on routing optimization of WSNs based on improved LEACH protocol

LEACH routing protocol equalizes the energy consumption of the network by randomly selecting cluster head nodes in a loop, which will lead to the defect of unstable network operation. Therefore, in order to solve this problem, it is necessary to reduce the energy consumption of data transmission in the routing protocol and increase the network life cycle. However, there is also a problem that cluster heads count with a wide range and the cluster head forwarding data consumed greatly power in the LEACH, which remains to be solved. In this paper, we put forward an approach to optimize the routing protocol. Firstly, the optimal number of cluster head is calculated according to the overall energy consumption per round to reduce the probability of excessive cluster head distribution. Then, the cluster head is used as the core to construct the Voronoi Diagram. The nodes in the same Voronoi diagram become a cluster, that the energy consumption communication in intra-cluster would be less. Finally, in order to optimize the multi-hop routing protocol, an ant colony algorithm is added using a cluster head near the BS to receive and forward it from a remote cluster head. According to the MATLAB simulation data, the protocol can significantly prolong the lifetime of WSNs compared with the LEACH protocol and increase the energy efficiency per unit node in per round. Energy consumption of the proposed approach is only. The approach improved the First Node Death (FND) time by 127%, 22.2%, and 14.5% over LEACH, LEACH-C, and SEP, respectively.

Energy‐balanced and energy‐efficient clustering routing protocol for wireless sensor networks

Prolonging the network lifetime for a reasonable period while meeting users' needs is key in developing a data gathering algorithm for WSNs. Clustered sensor networks are considered as an efficient approach for extending the network lifetime of WSNs. In clustering, sensor devices are arranged in clusters. Inside the cluster, non-cluster head nodes transmit data to the cluster head ( C H ) nodes while the C H forward the message to the sink. Irrespective of how the clusters are formed, a clustered WSN requires sturdy energy-balanced (EB) and energy-efficient (EE) communication protocol. Different from the previous clustered based routing protocol, this paper develops and analyses a selective-path priority table EB and EE clustering based routing protocol, which employs a mobile sink. The priority table is formed by prioritising the two shortest paths to the C H or sink according to some simple but efficient rules. The rules are derived using some routing metrics such as transmission range/power and residual energy. The simulation results show that the proposed routing protocol can be integrated with most clustering formation algorithms, even in large scale WSNs. Besides, results show that this routing protocol improve the network lifetime and throughput as compared to similar schemes.

An Efficient Energy Saving Sink Selection Scheme with the Best Base Station Placement Strategy Using Tree Based Self Organizing Protocol for IoT

Wireless sensor networks using sink node increases the effectiveness in collecting data from various detecting and sensing fields. Sink node acts as an interface between the sensing field and the user agents. The data collected by sensor nodes is send to the sink nodes. The sink is base station, which collect and process data in the centralized mode. So base station is a special node which has unlimited energy and is active all the time. Placement of the base station will have great impact on the energy consumption and lifetime of WSNs. This paper proposes an efficient sink selection scheme (ES3) with proper ase station placement, for sensor network of IoT. In ES3 two kinds of nodes exist (1) network node, (2) non-network node. Network nodes involve in transmission of packets from sensing area to the base station. Non-network nodes will be waiting to join the sensing field and to select proper sink node after receiving broadcast packets. based on the placement of the base station, residual energy of network nodes, distance between the sensor node and the sink node, selection of sink node by each sensor node, routing structure is created. By considering 100 sensor nodes in NS2 a simulation is carried out to evaluate ES3. Simulation results proved that the ES3 will be more energy saving when the base station is placed in the middle of the sensing field. By using performance metrics like, average energy consumption of network, delay in processing packet, dropping ratio of the packet, jitter, packet delivery ratio, residual energy of network nodes, throughput an analysis is done using two scenarios, when the base station is placed in middle and in outskirts of sensing field.

Multiple Parameter Based Energy Balanced and Optimized Clustering for WSN to Enhance the Lifetime Using MADM Approaches

Efficient utilization of power has recently emerged as a critical issue in sensor networks that is addressed by efficient clustering techniques. In WSN, clustering process selects cluster heads (CHs) to control the topology and consumes the power effectively. The comprehensive evolution of CH selection process increases the lifetime of sensor nodes resulting in total enhancement of the lifetime of WSN. The efficiency of clustering is affected by many attributes like higher residual energy, distance from a normal node to CH, distance from CH to the Base Station, etc. The conflicting nature of these attributes makes it difficult to find the cooperation among these attributes for optimal clustering. In this paper, we have applied MADM approaches for optimal CH selection to enhance the lifetime of WSN by utilizing eleven attributes, these attributes have very important role in efficient power consumption during data set collection. The MADM approaches employed for ranking and choosing optimal CHs are: Technique for Order Preference by Similarity to Ideal Solution, Preference Ranking Organization METHod for Enrichment Evaluations, and Analytic Hierarchy Process. Results reveal that these eleven attributes helps the proposed approach to outperform over the other approaches such as LEACH, LEACH-C and EECS in terms of lifetime.

Enhanced LEACH protocol for increasing a lifetime of WSNs

WSNs that stand for wireless sensor networks and include many low-cost and low power-sensing tools, local processing, and the capacity of wireless communication face some problems in two aspects: the lifetime of the network and its energy. Therefore, the aim of this paper is to overcome these limitations through enhancing the LEACH (low energy adaptive clustering hierarchy) protocol, the protocol of cluster routing, in which, LEACH is extended by identifying a cluster head according to the lowest degree of distance from the base station in order to decrease power consumption in cluster head nodes and in the whole network. Hence, the results clarify the ability of LEACH in enhancing the network lifetime as well as in reducing and minimizing the consumption of power.

Efficient energy, cost reduction, and QoS based routing protocol for wireless sensor networks

<span lang="EN-US">Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.</span>

DBDC: A Distributed Bus-Based Data Collection Mechanism for Maximizing Throughput and Lifetime in WSNs

Data collection is one of the most important research topics in WSNs. In literature, many studies have proposed centralized solutions to cope with the data collection problem. However, most of them considered controllable mobile sink which is controlled by an algorithm to determine its speed, path, stop locations as well as the performed task. In fact, the uncontrollable mobile sink can be also applied to collect data from a given set of deployed sensors. A number of studies assumed that the sink is fixed and all sensors transmit their data to the sink. However, it leads to the problems of unbalanced workload and network disconnection. Some other studies scheduled the controllable mobile sink. However, the algorithms developed by adopting the controllable mobile sink cannot be applied to the scenarios where the uncontrollable mobile sink is adopted. The main reason is that the stops and arrival time of the uncontrollable mobile sink are unknown. In addition, the problems including the high hardware cost and energy limitation of the controllable mobile sink are still needed to be overcome. This paper proposes a distributed data collection mechanism, called Distributed Bus-based Data Collection (DBDC) algorithm, which considers the bus as mobile sink aiming to maximize the amount of collected data and the network lifetime of wireless sensor networks. Applying the proposed DBDC, each sensor negotiates with its neighbors based on a bidding procedure such that the sensor that buffers more data can obtain more sharing slots instead of increasing its power level. To prolong the network lifetime, the sensor with higher remaining energy can enlarge its transmission power, aiming to release more sharing slots to cooperatively help the neighbor that buffers more data. Experimental study reveals that the proposed DBDC algorithm outperforms related works in terms of throughput, network lifetime and fairness.

MPF-LEACH: modified probability function for cluster head election in LEACH protocol

In this research, we enhance the LEACH protocol by updating Cluster Head (CH) election probability function (thresholds). More probability was given to an out-of-service CH to be elected again. The idea is to get benefit from CH residual energy in order to extend the network lifetime. A new threshold was introduced which guarantees a non-zero probability value of a CH. We proposed a newly developed research technique to enhance the original LEACH protocol. The enhancement focuses on extending a WSN's lifetime, and increasing its throughput. It is achieved by giving more probability to re-elect the expired CH that has been removed from CHs list because of its insufficient residual energy. Several experiments were conducted to evaluate the efficiency of our proposed MPF-LEACH approach. From the experimental results, a remarkable enhancement in the network lifetime and throughput is achieved. We have improved the election probability threshold for the original LEACH protocol by benefiting from the CH residual energy. As a result, the whole network lifetime was increased due to the extra chance that is given to a CH to be elected again.

MPF-LEACH: modified probability function for cluster head election in LEACH protocol

In this research, we enhance the LEACH protocol by updating Cluster Head (CH) election probability function (thresholds). More probability was given to an out-of-service CH to be elected again. The idea is to get benefit from CH residual energy in order to extend the network lifetime. A new threshold was introduced which guarantees a non-zero probability value of a CH. We proposed a newly developed research technique to enhance the original LEACH protocol. The enhancement focuses on extending a WSN's lifetime, and increasing its throughput. It is achieved by giving more probability to re-elect the expired CH that has been removed from CHs list because of its insufficient residual energy. Several experiments were conducted to evaluate the efficiency of our proposed MPF-LEACH approach. From the experimental results, a remarkable enhancement in the network lifetime and throughput is achieved. We have improved the election probability threshold for the original LEACH protocol by benefiting from the CH residual energy. As a result, the whole network lifetime was increased due to the extra chance that is given to a CH to be elected again.

Lifetime improvement of wireless sensor network by information sensitive aggregation method for railway condition monitoring

Lifetime maximization is an important issue while designing wireless sensor network. One of the ways to increase the lifetime of WSN is to reduce the energy demand of the sensor nodes and cluster head nodes, which can be decreased by filtering out redundant data traffic. A Two-Layer Hierarchal Aggregation (TLHA) protocol has been proposed, which filter out redundant data traffic. Simple aggregation algorithm has been used to classify the sensed data based on their normalized standard deviation for efficient data filtration. The algorithm also performs k-Means based re-classification of data to improve the efficiency of the algorithm. Two-layered redundant data filtration technique has been proposed to classify the data. Aggregation protocol reduces data traffic in lower layer hierarchy (sensor nodes to cluster head node) as well as upper layer hierarchy (cluster head nodes to base station node). In former, Energy efficient Time Division Multiple Access (EA-TDMA) Medium Access Control (MAC) protocol is used while in latter Bit-Map-Assisted (BMA) MAC protocol is used for transmission of data. Simulation and experimental results show that TLHA saves an enormous amount of energy, which finally increases the lifetime of the sensor network. The performance of the proposed TLHA protocol has been compared with already existing protocols viz. Data Aggregation Window Function (DAWF) and Spatial-Temporal Correlation Algorithm (STCA).