scholarly journals Intelligent On-Demand Connectivity Restoration for Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Khalid Mahmood ◽  
Muhammad Amir Khan ◽  
Mahmood ul Hassan ◽  
Ansar Munir Shah ◽  
Shahzad Ali ◽  
...  

Wireless sensor networks are envisioned to play a very important role in the Internet of Things in near future and therefore the challenges associated with wireless sensor networks have attracted researchers from all around the globe. A common issue which is well studied is how to restore network connectivity in case of failure of single or multiple nodes. Energy being a scarce resource in sensor networks drives all the proposed solutions to connectivity restoration to be energy efficient. In this paper we introduce an intelligent on-demand connectivity restoration technique for wireless sensor networks to address the connectivity restoration problem, where nodes utilize their transmission range to ensure the connectivity and the replacement of failed nodes with their redundant nodes. The proposed technique helps us to keep track of system topology and can respond to node failures effectively. Thus our system can better handle the issue of node failure by introducing less overhead on sensor node, more efficient energy utilization, better coverage, and connectivity without moving the sensor nodes.

Author(s):  
Amarasimha T. ◽  
V. Srinivasa Rao

Wireless sensor networks are used in machine learning for data communication and classification. Sensor nodes in network suffer from low battery power, so it is necessary to reduce energy consumption. One way of decreasing energy utilization is reducing the information transmitted by an advanced machine learning process called support vector machine. Further, nodes in WSN malfunction upon the occurrence of malicious activities. To overcome these issues, energy conserving and faulty node detection WSN is proposed. SVM optimizes data to be transmitted via one-hop transmission. It sends only the extreme points of data instead of transmitting whole information. This will reduce transmitting energy and accumulate excess energy for future purpose. Moreover, malfunction nodes are identified to overcome difficulties on data processing. Since each node transmits data to nearby nodes, the misbehaving nodes are detected based on transmission speed. The experimental results show that proposed algorithm provides better results in terms of reduced energy consumption and faulty node detection.


Wireless Sensor Networks (WSN ) provides virtual layer where knowledge regarding actual world can be retrieved by any computational arrangement as these operate as digital skin. These are irreplaceable possessions used for comprehending ideas of IoT as they are used to gather information about physical phenomenon. IoT offers virtual interpretation through Internet Protocol towards a huge variation of real-life objects from buses to saucer, from building to trees in woods. Its appeal is the universal widespread access to the status and location of anything we may be interested in. The Internet of Things (IoT) is the network of physical objects, devices, vehicles, buildings and other items which are embedded with electronics, software, sensors, and network connectivity, which enables these objects to collect and exchange data. WSNs are combined into the “IoT”, where sensor nodes join the Internet vigorously and use it to collaborate and carry out their tasks. Wireless sensor networks (WSN) are well suited for longterm environmental data acquisition for IoT representation. Weather conditions monitoring is made by gathering quantifiable information regarding prevailing condition of atmospheric procedure to venture how will it progress in that location


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%.


Symmetry ◽  
2018 ◽  
Vol 10 (10) ◽  
pp. 498 ◽  
Author(s):  
Sahar Shah ◽  
Anwar Khan ◽  
Ihsan Ali ◽  
Kwang-Man Ko ◽  
Hasan Mahmood

Mitigation of channel unfavorable circumstances during data routing in underwater wireless sensor networks (UWSNs) has utmost significance. It guarantees saving packet corruption along unfavorable channels so that vital data is not lost or become meaningless. This paper proposes two routing protocols for UWSNs: localization free energy efficient routing (LFEER) and its improved version, localization free energy efficient cooperative routing (Co-LFEER). The LFEER makes decision of choosing a relay based on its maximum residual energy, number of hops and the bit error rate of the link over which packets are transmitted. These metrics are chosen to save packets from corruption to the maximum limit and maintain stable paths (where nodes do not die soon). Since a single link is used in the LFEER for packets forwarding, the link may become worse with changing circumstances of the channel. To deal with this issue, cooperative routing is added to the LFFER to construct the Co-LFEER protocol, in which some copies of packets are received by destination to decide about packets quality. Converse to some prevalent protocols, both LFEER and Co-LFEER are independent of knowing the sensor nodes’ positions, which increases computational complexity and wasteful utilization of resources. Based on extensive simulations, the proposed schemes are better than Co-DBR in reducing energy utilization and advancing packets to the desired destination.


2018 ◽  
Vol 7 (2.7) ◽  
pp. 725
Author(s):  
V Appala Raju ◽  
V Sri Harsha ◽  
N Bhanu Deepthi ◽  
N Prasanth

Wireless sensor networks play a key role in communication. They are comprised of hundreds sensor nodes with limited energy. So energy utilization major issue in WSN for performing the given task. So most of the protocols are concentrate on energy consumption .Zonal mechanism is one popular WSN routing technique.    In this work we are mostly concentrating on optimization of stable election protocol for heterogeneous wireless sensor networks and compare the performance with LEACH and SEP. Most of the work to find stability period, alive nodes and dead nodes, throughput in LEACH, SEP, ZSEP.  We are stimulated in MATLAB tool. Stimulation results prove that improvement in stability period and through put is better in ZSEP when compared to LEACH and SEP.  


Author(s):  
Madhuri N. Khuspare ◽  
Dr. Awani S. Khobragade

Wireless sensor networks comprise of an expansive number of distributed sensor gadgets, which are associated and composed through multi-hop steering. Because of the presence of related data and excess in measuring data, data messages can be joined and converged by performing data aggregation work in the steering procedure. To diminish energy utilization is a noteworthy enhancement target of data aggregation approaches, which can be accomplished by diminishing the mandatory correspondence load of steering. To improvise the network lifetime as much as possible in Wireless Sensor Networks (WSNs) the ways for data move are picked in a way that the aggregate energy used along the way is limited. To help high adaptability and better data aggregation, sensor nodes are routinely collected into disjoint, non-covering subsets called clusters. Clusters make various leveled WSNs which consolidate proficient use of constrained assets of sensor nodes and in this manner broadens network lifetime. The objective of this paper is to demonstrate a forefront survey on clustering calculations announced in the writing of WSNs. This paper presents different energy effective clustering calculations in WSNs. From the hypothetical level, an energy show is proposed to approve the advantages of data aggregation on energy utilization. The key parameters which may affect the aggregation execution are additionally examined.


2019 ◽  
Vol 4 (3) ◽  
pp. 45-51
Author(s):  
Raj Kumar Pyage ◽  
H. G. Chandrakanth

In wireless sensor networks, sensor nodes play the most important role. These sensor nodes are mainly un-chargeable, so it an issue regarding lifetime of the network.  The main objective of this research is concerning clustering algorithms to minimize the energy utilization of each sensor node, and maximize the sensor network lifetime of WSNs. In this paper, we propose a novel clustering algorithm for wireless sensor networks (WSN) that decrease the networks energy consumption and significantly prolongs its lifetime. Here main role play distribution of CHs ( Cluster Heads) across the network. Our simulation result shows considerable decrease in network energy utilization and therefore increase the network lifetime.  


Author(s):  
Mahmood ul Hassan ◽  
Khalid Mahmood ◽  
Muhammad Kashif Saeed ◽  
Shahzad Ali ◽  
Safdar Zaman ◽  
...  

AbstractNode failures are inevitable in wireless sensor networks (WSNs) because sensor nodes in WSNs are miniature and equipped with small and often irreplaceable batteries. Due to battery drainage, sensor nodes can fail at any instance. Moreover, WSNs operate in hostile environments and environmental factors may also contribute to nodes failure. Failure of nodes leads to disruption of inter-node connectivity and might also lead to network partitioning. Failure to communicate with each other and with the base station can compromise the basic operation of the sensor network. For restoration of connectivity, a robust recovery mechanism is required. The existing connectivity restoration mechanisms suffer from shortcomings because they do not focus on energy-efficient operation and coverage-aware mechanisms while performing connectivity restoration. As a result, most of these mechanisms lead to the excessive mobility of nodes, which itself causes the utilization of excessive battery. In this work, we propose a novel technique called smart node relocation (SNR). SNR is capable of detecting and restoring the connectivity caused by either single or multiple node failures. For achieving energy efficiency, SNR relies on transmitting a lesser number of control packets. For achieving the goal of being coverage-aware, it tries to relocate only essential nodes while trying to restore connectivity. By performing extensive simulations, we prove that SNR outperforms the existing approaches concerning multiple performance metrics including but not limited to the total number of packets transmitted, total distance moved for connectivity restoration, the percentage reduction in field coverage.


2016 ◽  
Vol 12 (06) ◽  
pp. 10
Author(s):  
Hu Yanhua ◽  
Xincai Zhang

Abstract: In wireless sensor networks, efficient and effective data aggregation algorithms can prolong the network lifecycle by reducing communication of redundant data and improve the security of the networks. Tradition data aggregation algorithms in wireless sensor networks mainly aim to improve the energy utilization, and ignore the security and lifecycle. In order to get a good trade-off between these requirements, we proposed a data aggregation algorithm based on constructing a data aggregation tree. After give a formalism description of the problem, we proposed a data aggregation tree constructing algorithm. By minimize the maximal energy consumption of nodes, the algorithm can prolong the lifecycle. In data aggregation scheduling algorithm, we select the number of communications carefully to get the trade-off between low weighted delay and high network lifecycle. The simulation experiments show that, the proposed data aggregation algorithm consumes less energy while aggregating data from sensor nodes, and thus can prolong the network lifecycle.


Sign in / Sign up

Export Citation Format

Share Document