A QoS-Guaranteed Coverage Precedence Routing Algorithm for Wireless Sensor Networks

Over the past decades, hardware and software technologies for wireless sensor networks (WSNs) have significantly progressed, and WSNs are widely used in various areas including Internet of Things (IoT). In general, existing WSNs are mainly used for applications that require delay-tolerance and low-computation due to the poor resources of traditional sensor nodes in WSNs. However, compared to the traditional sensor nodes, today’s devices for WSNs have more powerful resource. Thus, sensor nodes these days not only conduct sensing and transmitting data to servers but also are able to process many operations, so more diverse applications can be applied to WSNs. Especially, many applications using audio data have been proposed because audio is one of the most widely used data types, and many mobile devices already have a built-in microphone. However, many of the applications have a requirement that heavy-operations should be done by a tight deadline, so it is difficult for a single node in WSNs to run relatively heavy applications by itself. In this paper, to overcome this limitation of WSNs, we propose a new emerging system, HeaLow, a cooperative computing system for heavy-computation and low-latency processing in WSNs. We designed HeaLow and carried out the practical implementation on real devices. We confirmed the effectiveness of HeaLow through various experiments using the real devices and simulations. Using HeaLow, nodes in WSNs are able to perform heavy-computation processes while satisfying a completion time requirement.

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.

Wireless Sensor Networks (WSNs) is an evolving technology used in a diverse set of applications. WSN might be applied in isolated or hazard areas where it is hard and costly to reach the nodes. Maintaining the sensor nodes in WSN is generally a complex and difficult task especially when the size of the network is large. Energy maintenance of the sensor nodes is one of the challenging tasks in WSN. Supply energy for WSN using energy harvesting is a promising approach. It enables the sensor nodes to exploit the renewable ambient energy sources such as solar, temperature, sound and pressure to achieve a continual energy source. AODV is a routing protocol that was adopted by Zigbee for mesh network. However, not much work exists in literature that explores deeply the capabilities of AODV under energy harvesting. In this paper, extensive simulation experiments have been conducted using ns-3 to study the behavior of ADOV for energy-harvested and limited-battery WSN assuming total supply energy is the same for both approaches. We have compared AODV for both approaches using different performance metrics.

This chapter presents a combined approach to visualize the IoT and cyber-physical system in any wireless communication networks. The brief overview of IoT and its applications in wireless sensor network (WSN) are elaborated in current era. In today’s present situation and the challenges faced during COVID-19 pandemic how the things can be monitored through IoT is being focused in this chapter. Also, the threats challenges and monitoring of cyber-physical system for security is presented in analysis form. WSN provides a bridge between the physical and virtual world and finds use in numerous applications like environmental monitoring, civil structural health monitoring and industrial process monitoring. Lately, it has found much use in the latest technology called Internet of Things (IoT). It seems that IoT has a great potential in shaping our future where everything will be connected together all the time. The major challenges faced by WSN include energy-efficiency, heterogeneity, and systematic design. WSN comprise of autonomous sensors which are capable of wirelessly transmitting their sensed parameter-values (also called packets) to remotely 188located sink node. The sink node is a WSN node which has the capability to assemble the data from all the nodes and forward it to farther distances to the remote base station through wired connections. The data transmission from source node to sink node is done by taking multi-hops which means that data is not sent directly to the destination node but through jumping from one intermediate node to another until the sink is reached. The sensor nodes also act as wireless routers which transmit data to other sensor-routers. So, sensor devices are very useful in deployment, collection of data, act as a IoT sensor devices as an application in technology. IoT is a device which can be used as application while a cyber-physical system is a collection of various mechanical components which are controlled and managed by different devices and algorithms. An IFM (Information Flow Monitor) is an application to backtrack queries and find the culprit in an error that has occurred in the cyber system. However, while backtracking and flow monitoring is not always guaranteed in terms of secure and efficient transaction. In some cases, the sender may deny the authority of the data so the information flow monitors may fail to provide a trustful and authentic source of data. Thus, the chapter focuses on both the issues of IoT integration with cyber-physical security (CPS) system. The key challenges and some solutions are proposed for the researchers for future work.

A scheme for WSNs (wireless sensor networks) security is given by dividing sensing tetrahedron into clusters and using the symmetric polynomials in this paper.The sensing tetrahedron is divided into a number of small grids.All those sensor nodes, both ordinary sensor nodes and heterogeneous sensor nodes are distributed in the sensing tetrahedron.In a grid, all ordinary sensor nodes and heterogeneous sensor nodes establish their shared keys through using the symmetric polynomials.All the heterogeneous sensor nodes establish their shared keys through using the symmetric polynomials.At last, all sensor nodes establish their keys directly or indirectly in the whole sensing tetrahedron.Analysis and comparison demonstrate this scheme enhances the WSN security, has good network connectivity, saves node storage, reduces network computing load, and extends the network lifetime.

In mobility-centric environments, wireless sensor networks are designed to accommodate energy efficiency, dynamic self-organization and mobility. In typical applications of wireless sensor networks, fixed sensor nodes are mixed with mobile sensor nodes in "hot areas". Also, as they move, network topology needs to be reconstructed by reacting upon the mobility of sensor nodes quickly. In this paper we proposed an improved protocol called "LEACH-Mobile" for mobile nodes to declare the membership of a cluster as they move, and to confirm whether a mobile sensor node is able to communicate with a specific cluster head within a time slot allocated in TDMA schedule. The LEACH-Mobile protocol achieved definite improvement in data transfer success rate as mobile nodes increased compared to the non-mobility centric LEACH protocol

Background: Event detection and monitoring applications involve highly populated sensor nodes in Wireless Sensor Networks (WSNs). Dense deployment of nodes leads to correlated sensor observations in the spatial and temporal domain. Most of the previous works focused on constant sensing radii for spatially correlated sensor observations. However, in real time scenario, the sensor nodes may have variable sensing coverage areas, which comprise a Heterogeneous WSN. background: Spatial correlation model discussed in prior literature focused on Homogeneous sensing of sensor nodes. But, real time scenario the condition changes due to interferences obstructing sensing areas. Also, different manufacturers may provide different specifications for sensing areas, thus resulting into Heterogeneous sensing. Objective: To address this issue, we present an Enhanced Weighted Spatial Correlation Model for Heterogeneous sensor nodes in WSNs. Method: The mathematical framework considers the spatial coordinates of sensor nodes, the distances between the sensor nodes, and their sensing coverage. Furthermore, the correlation coefficient is calculated in terms of overlapping areas for randomly deployed nodes. Performance of the correlation model is evaluated and analyzed in terms of event distortion function. In addition to this, a macro and micro-zone concept is introduced, wherein sensor information is weighted for better event estimation at the sink node. Moreover, dynamic weighing of nodes like Inverse, Shepard’s and Gaussian distance weighing algorithms are simulated and analyzed for minimal event distortion. Over and above, the system performance is evaluated for different approaches considering reporting nodes with and without clustering of sensor nodes for macro and micro-zone concept. Simulation results for the Enhanced Weighted Spatial Correlation Model developed are obtained using MATLAB software. method: In order to evaluate the performance of the enhanced correlation model considering Macro and Micro-zone concept, simulations are carried out inMATLAB. Simulations are performed for ‚ trials and averaging of the values are finally used for analysis of results. Results: The comparative study shows an improved system performance in terms of minimal distortion obtained for non-clustered nodes; thereby reducing the computational complexity of cluster formation. Furthermore, the dynamic weighing algorithms outperform the existing fixed weighing algorithms for the correlation model with the lowest distortion function. Conclusion: Moreover, in the above algorithms, the event distortion gradually decreases and later becomes constant with the increase in the number of representative nodes. Hence, it illustrates that minimal distortion can be achieved by activating lesser number of representative nodes, thereby preserving the energy of other sensor nodes and increasing the lifetime of WSNs.

Wireless sensor network (WSN) with several sensors is used to group measurements of certain physical quantities or environmental conditions, including sound, temperature, pressure, vibration, motion, or pollution, at various locations and ranges. In WSNs, several protocols address the issue of routing. Sensor nodes in WSN usually have limited energy resources and storage capacities. Therefore, the issue of energy usage in sensors and protocols is very important. This paper analyzes and compares the quality of service (QoS) performances of three important routing protocols of the mobile ad-hoc network (MANET) including Ad-hoc on-demand distance vector (AODV), dynamic source routing (DSR), and destination sequenced distance vector (DSDV), in a smart building case study. The QoS evaluation metrics include residual energy of nodes, instant throughput (IT), average throughput (AT), packet delivery ratio (PDR), packet loss ratio (PLR), and route discovery latency (RDL) based on IEEE 802.15.4 MAC protocol standard. The simulation is carried out using NS2, and the WSN has 16 fixed and 4 mobility nodes with different speeds and paths. The simulation results illustrate that average throughput in AODV is 1.985118 (kbps), however, the figures for DSR and DSDV are 1.977780 and 1.720700 (kbps), respectively. PDR, also, in DSR stands at 1.0, but the figures for AODV and DSDV are lower with the range of 0.999572 and 0.997930, respectively. Overall, The DSR protocol provides a better performance compared to AODV and DSDV routing protocols in terms of PLR and PDR. Also, AODV has better efficiency in RDL and AT compared to other assumed protocols.

In real time scenario Wireless Sensor Network (WSN) applications involve densely deployed system of sensor nodes. To design an energy aware network challenge lies in efficient resource utilization for accurate reporting of event occurrence. Appropriate connectivity of nodes in WSN with optimal energy routing is the motivation of our work. Vicinity based routing algorithms with varied node deployment is implemented and the results are analyzed in the light of energy and network efficiency. The nodes in the Region of Interest (RoI) are hierarchically categorized into different levels. For multihop communication, nodes search only in their vicinity for the next higher-level nodes. Position of sink and distance between the nodes along with residual energy are the key parameters considered for evaluation and analysis.

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

Many distributed monitoring applications of Wireless Sensor Networks (WSNs) require the location information of a sensor node. In this article, we address the problem of enabling nodes of Wireless Sensor Networks to determine their location in an untrusted environment, known as the secure localization problem. We propose a novel range-independent localization algorithm called SeRLoc that is well suited to a resource constrained environment such as a WSN. SeRLoc is a distributed algorithm based on a two-tier network architecture that allows sensors to passively determine their location without interacting with other sensors. We show that SeRLoc is robust against known attacks on a WSNs such as the wormhole attack , the Sybil attack , and compromise of network entities and analytically compute the probability of success for each attack. We also compare the performance of SeRLoc with state-of-the-art range-independent localization schemes and show that SeRLoc has better performance.

Current and potential applications of wireless sensor networks (WSNs) include military sensing, physical security, traffic surveillance, and environment monitoring, etc. Due to the fact that WSNs are composed of a large number of low-cost but energy constrained nodes, scalable and energy-efficient routing protocols are requisite for the WSN applications. In this paper, we study energy-efficient geographic routing protocols in environmentally powered WSNs, where the sensor nodes are capable of extracting energy from the environment. We propose a protocol, geographic energy-aware blacklisting routing with energy supply (GEBRES), which makes routing decision locally by jointly taking into account multiple factors-the realistic wireless channel condition, packets advancement to the destination, the energy availability on the node with environmental energy supply. Simulation results show that GEBRES is more energy efficient than the corresponding residual energy based protocols without considering the property of the energy changing (including recharging and consuming) rate. In particular, given the same energy and traffic models, GEBRES maintains higher minimum residual energy on nodes and achieves better load balancing in terms of having a smaller standard deviation of residual energy among nodes. GEBRES exhibits a little degradation on end-to-end delay, but does not compromise the end-to-end throughput performance

A Wireless Sensor Network (WSN) is a group of autonomous sensors that are distributed geographically. However, sensor nodes in WSNs are battery-powered, and the energy drainage is a significant issue. The clustering approach holds an imperative part in boosting the lifespan of WSNs. This approach gathers the sensors into clusters and selects the cluster heads (CHs). CHs accumulate the information from the cluster members and transfer the data to the base station (BS). Yet, the most challenging task is to select the optimal CHs and thereby to enhance the network lifetime. This article introduces an optimal cluster head selection framework using hybrid opposition-based learning with the gray wolf optimization algorithm. The hybrid technique dynamically trades off between the exploitation and exploration search strategies in selecting the best CHs. In addition, the four different metrics such as energy consumption, minimal distance, node centrality and node degree are utilized. This proposed selection mechanism enhances the network efficiency by selecting the optimal CHs. In addition, the proposed algorithm is experimented on MATLAB (2018a) and validated by different performance metrics such as energy, alive nodes, BS position, and packet delivery ratio. The obtained results of the proposed algorithm exhibit better outcome in terms of more alive nodes per round, maximum number of packets delivery to the BS, improved residual energy and enhanced lifetime. At last, the proposed algorithm has achieved a better lifetime of ≈20%, ≈30% and ≈45% compared to grey wolf optimization (GWO), Artificial bee colony (ABC) and Low-energy adaptive clustering hierarchy (LEACH) techniques.

Motivation: In the last couple of decades, Wireless Sensor Networks (WSNs) have been used in a variety of applications which include military, agriculture, environment monitoring, home automation, smart transportation etc [1]. The sensor nodes in WSN are battery driven devices which collect data from the environment and forward this data to the sink for further processing leading to the energy consumption of their batteries. The batteries may be difficult to replace or recharge in certain environments. These problems have lead the path to the design of new protocols for energy-efficiency of the sensor nodes. In a typical environment, the sensor nodes exhibit many-to-one communication with the sink, resulting in faster energy depletion of the sensor nodes near the vicinity of the sink which is famously known as the energy-hole problem or the Hot-Spot problem [1]. Sink mobility can help in the balancing of the energy dissipation of the sensor nodes [1].

The ability of wireless sensor network (WSN) can be observed in different fields like patient wearable monitoring, health applications, intruder detection, combat monitoring and battlefield surveillance in the last few years. In such applications, WSN contains a wide range of sensor nodes, which will monitor continuously, and passes the data to end-user through base station (BS) or sink node (SN). In such applications where users are unattended to replace the sensor node frequently, that indicates users can expect long-lasting of WSN. So in this paper, we concentrated on long-lasting of WSN, by minimizing the energy utilization of sensor node in WSN. So we are applying the clustering technique. So, clustering will minimize the energy usage of the sensor node, such that it will improve the lifetime of WSN. In this, we introduced our proposed protocol “Low Energy Utilization with Dynamic Cluster Head (LEU-DCH)” which reduces the energy consumption of sensor nodes. Besides, we also have shown the best way of selecting how many clusters we need.