scholarly journals Event Reliability in Wireless Sensor Networks

2021 ◽  
Author(s):  
◽  
Muhammad Mahmood
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Flow ◽  
Packet Transmission ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Event Identification ◽  
Unique Event ◽  
Area Of Interest ◽  
Energy Congestion

<p>Ensuring reliable transport of data in resource-constrained Wireless Sensor Networks (WSNs) is one of the primary concerns to achieve a high degree of efficiency in monitoring and control systems. The two reliability mechanisms typically used in WSNs are packet reliability and event reliability. Packet reliability, which requires all packets from all the sensor nodes to reach the sink, can result in wastage of the sensors' limited energy resources. Event reliability, which only requires that one packet related to each event reaches the sink, exploits the overlap of the sensing regions of densely deployed sensor nodes to eliminate redundant packets from nodes in close proximity that contain duplicate information about an event.  The majority of previous research in this area focuses on packet reliability rather than event reliability. Moreover, the research that does focus on event reliability relies on the sink to impose some form of control over the flow of data in the network. The sinks' centralized control and decision-making increases the transmission of unnecessary packets, which degrades overall network performance in terms of energy, congestion and data flow.  This thesis proposes a distributed approach to the control of the flow of data in which each node makes in-node decisions using data readily available to it. This reduces the transmission of unnecessary packets, which reduces the network cost in terms of energy, congestion, and data flow. The major challenges involved in this research are to: (i) accurately identify that multiple packets are carrying information about the same event, (ii) reliably deliver the packets carrying information about the unique event, (iii) ensure that enough information about the area of interest is reliably delivered to the sink, and (iv) maintain the event coverage throughout the network.  This thesis presents the Event Reliability Protocol (ERP) and its extension, the Enhanced Event Reliability Protocol (EERP). The protocols aim for the reliable transmission of a packet containing information about each unique event to the sink while identifying and minimizing the unnecessary transmission of similar redundant packets from nodes in the region of the event. In this way, the sensor nodes consume less energy and increase the overall network lifetime. EERP uses a multilateration technique to identify multiple packets containing similar event information and thus is able to filter redundant packets of the same event. It also makes use of implicit acknowledgment (iACKs) for reliable delivery of the packets to the sink node. The process is based on the hop-by-hop mechanism where the decisions are made locally by the intermediate nodes.  The thesis reports on simulations in QualNet 5.2 for verifying the accuracy of our event identification and event reliability mechanisms employed in the ERP and EERP. The results show that EERP performs better in terms of minimizing overall packet transmission and hence the energy consumption at the sensor nodes in a WSN. Also, the results for event identification mechanism and reliable event delivery show that EERP considerably improves upon other protocols in terms of unique events delivery.</p>

scholarly journals Event Reliability in Wireless Sensor Networks

2021 ◽  
Author(s):  
◽  
Muhammad Mahmood
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Flow ◽  
Packet Transmission ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Event Identification ◽  
Unique Event ◽  
Area Of Interest ◽  
Energy Congestion

<p>Ensuring reliable transport of data in resource-constrained Wireless Sensor Networks (WSNs) is one of the primary concerns to achieve a high degree of efficiency in monitoring and control systems. The two reliability mechanisms typically used in WSNs are packet reliability and event reliability. Packet reliability, which requires all packets from all the sensor nodes to reach the sink, can result in wastage of the sensors' limited energy resources. Event reliability, which only requires that one packet related to each event reaches the sink, exploits the overlap of the sensing regions of densely deployed sensor nodes to eliminate redundant packets from nodes in close proximity that contain duplicate information about an event.  The majority of previous research in this area focuses on packet reliability rather than event reliability. Moreover, the research that does focus on event reliability relies on the sink to impose some form of control over the flow of data in the network. The sinks' centralized control and decision-making increases the transmission of unnecessary packets, which degrades overall network performance in terms of energy, congestion and data flow.  This thesis proposes a distributed approach to the control of the flow of data in which each node makes in-node decisions using data readily available to it. This reduces the transmission of unnecessary packets, which reduces the network cost in terms of energy, congestion, and data flow. The major challenges involved in this research are to: (i) accurately identify that multiple packets are carrying information about the same event, (ii) reliably deliver the packets carrying information about the unique event, (iii) ensure that enough information about the area of interest is reliably delivered to the sink, and (iv) maintain the event coverage throughout the network.  This thesis presents the Event Reliability Protocol (ERP) and its extension, the Enhanced Event Reliability Protocol (EERP). The protocols aim for the reliable transmission of a packet containing information about each unique event to the sink while identifying and minimizing the unnecessary transmission of similar redundant packets from nodes in the region of the event. In this way, the sensor nodes consume less energy and increase the overall network lifetime. EERP uses a multilateration technique to identify multiple packets containing similar event information and thus is able to filter redundant packets of the same event. It also makes use of implicit acknowledgment (iACKs) for reliable delivery of the packets to the sink node. The process is based on the hop-by-hop mechanism where the decisions are made locally by the intermediate nodes.  The thesis reports on simulations in QualNet 5.2 for verifying the accuracy of our event identification and event reliability mechanisms employed in the ERP and EERP. The results show that EERP performs better in terms of minimizing overall packet transmission and hence the energy consumption at the sensor nodes in a WSN. Also, the results for event identification mechanism and reliable event delivery show that EERP considerably improves upon other protocols in terms of unique events delivery.</p>

Deterministic Deployment for Wireless Image Sensor Nodes

2014 ◽  
Vol 8 (1) ◽  
pp. 668-674
Author(s):  
Junguo Zhang ◽  
Yutong Lei ◽  
Fantao Lin ◽  
Chen Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Visual Information ◽  
Image Sensor ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Effective Coverage ◽  
Area Of Interest ◽  
Key Issues

Wireless sensor networks composed of camera enabled source nodes can provide visual information of an area of interest, potentially enriching monitoring applications. The node deployment is one of the key issues in the application of wireless sensor networks. In this paper, we take the effective coverage and connectivity as the evaluation indices to analyze the effect of the perceivable angle and the ratio of communication radius and sensing radius for the deterministic circular deployment. Experimental results demonstrate that the effective coverage area of the triangle deployment is the largest when using the same number of nodes. When the nodes are deployed in the same monitoring area in the premise of ensuring connectivity, rhombus deployment is optimal when √2 < rc / rs < √3 . The research results of this paper provide an important reference for the deployment of the image sensor networks with the given parameters.

scholarly journals Optimal Cluster Head Positioning Algorithm for Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (13) ◽  
pp. 3719 ◽  
Author(s):  
Ala’ Khalifeh ◽  
Husam Abid ◽  
Khalid A. Darabkh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Expert Systems ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Communication Link ◽  
Area Of Interest ◽  
Cluster Communication ◽  
Positioning Algorithm

Wireless sensor networks (WSNs) are increasingly gaining popularity, especially with the advent of many artificial intelligence (AI) driven applications and expert systems. Such applications require specific relevant sensors’ data to be stored, processed, analyzed, and input to the expert systems. Obviously, sensor nodes (SNs) have limited energy and computation capabilities and are normally deployed remotely over an area of interest (AoI). Therefore, proposing efficient protocols for sensing and sending data is paramount to WSNs operation. Nodes’ clustering is a widely used technique in WSNs, where the sensor nodes are grouped into clusters. Each cluster has a cluster head (CH) that is used to gather captured data of sensor nodes and forward it to a remote sink node for further processing and decision-making. In this paper, an optimization algorithm for adjusting the CH location with respect to the nodes within the cluster is proposed. This algorithm aims at finding the optimal CH location that minimizes the total sum of the nodes’ path-loss incurred within the intra-cluster communication links between the sensor nodes and the CH. Once the optimal CH is identified, the CH moves to the optimal location. This suggestion of CH re-positioning is frequently repeated for new geometric position. Excitingly, the algorithm is extended to consider the inter-cluster communication between CH nodes belonging to different clusters and distributed over a spiral trajectory. These CH nodes form a multi-hop communication link that convey the captured data of the clusters’ nodes to the sink destination node. The performance of the proposed CH positioning algorithm for the single and multi-clusters has been evaluated and compared with other related studies. The results showed the effectiveness of the proposed CH positioning algorithm.

Improving Area Coverage With Mobile Nodes in Wireless Sensor Networks

2021 ◽  
Vol 13 (1) ◽  
pp. 36-48
Author(s):  
Dhruvi Patel ◽  
Arunita Jaekel
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Mobile Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Area Of Interest ◽  
Adequate Coverage ◽  
Considerable Work

Wireless sensor networks (WSN) consist of sensor nodes that detect relevant events in their vicinity and relay this information for further analysis. Considerable work has been done in the area of sensor node placement to ensure adequate coverage of the area of interest. However, in many applications it may not be possible to accurately place individual sensor nodes. In such cases, imprecise placement can result in regions, referred to as coverage holes, that are not monitored by any sensor node. The use of mobile nodes that can ‘visit' such uncovered regions after deployment has been proposed in the literature as an effective way to maintain adequate coverage. In this paper, the authors propose a novel integer linear programming (ILP) formulation that determines the paths the mobile node(s) should take to realize the specified level of coverage in the shortest time. The authors also present a heuristic algorithm that can be used for larger networks.

scholarly journals Energy-Efficient Broadcasting Scheme for Smart Industrial Wireless Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-17 ◽  
Author(s):  
Zhuangbin Chen ◽  
Anfeng Liu ◽  
Zhetao Li ◽  
Young-June Choi ◽  
Hiroo Sekiya ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Packet Transmission ◽  
Link Quality ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Smart Devices ◽  
Industrial Wireless Sensor Networks ◽  
Network Upgrade

In smart Industrial Wireless Sensor Networks (IWSNs), sensor nodes usually adopt a programmable technology. These smart devices can obtain new or special functions by reprogramming: they upgrade their soft systems through receiving new version of program codes. If sensor nodes need to be upgraded, the sink node will propagate program code packets to them through “one-to-many” broadcasting, and therefore new capabilities can be obtained, forming the so-called Software Defined Network (SDN). However, due to the high volume of code packet, the constraint energy of sensor node, and the unreliable link quality of wireless network, rapidly broadcasting the code packets to all nodes in network can be a challenge issue. In this paper, a novel Energy-efficient Broadcast scheme with adjustable broadcasting radius is proposed aiming to improve the performance of network upgrade. In our scheme, the nonhotspots sensor nodes take full advantage of their residual energy caused in data collection period to improve the packet reception probability and reduce the broadcasting delay of code packet transmission by enlarging the broadcasting radius, that is, the transmitting power. The theoretical analyses and experimental results show that, compared with previous work, our approach can averagely reduce the Network Upgrade Delay (NUD) by 14.8%–45.2% and simultaneously increase the reliability without harming the lifetime of network.

scholarly journals A2CDC: Area Coverage, Connectivity and Data Collection in Wireless Sensor Networks

2019 ◽  
Vol 10 (4) ◽  
pp. 20 ◽  
Author(s):  
Alain Bertrand Bomgni ◽  
Garrik Brel Jagho Mdemaya
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Information Need ◽  
Quality Of Data ◽  
Area Of Interest

Wireless sensor networks are increasingly being deployed in areas where several types of information need to be harvested. Monitoring a given area is one of the main goals of this technology. This consists in deploying sensor nodes in the Area of Interest (AoI) in order to detect any event occurring in this area, collect information and send them to the base station. However, in this type of configuration, the quantity and the quality of data collected are important factors in making better decisions by the end user. It therefore becomes crucial to deploy sensors in the AoI so that the latters can cover as much as possible the AoI, and propose mechanism to collect and send data to the base station while minimizing the energy consumption of the sensors. In this paper, we bring into focus a solution (A2CDC) to resolve this problem which performs in two main stages: in the first stage, we propose an algorithm that guarantees a maximal coverage of the AoI after a random deployment of static sensors and mobile sensors; and in the second stage, we propose a node activity scheduling that minimizes energy consumption of both static and mobile nodes while sending collected data to the base station. Compared to many other algorithms in the literature, our solution is better in term of coverage percentage of the AoI, data received by the base station and in term of energy minimization.

scholarly journals Energy and Delay Constrained Packet Transmission MAC Protocol for Wireless Sensor Networks

2018 ◽  
Vol 7 (4.4) ◽  
pp. 33
Author(s):  
Jin Young Lee ◽  
Seong Cheol Kim ◽  
Hye Yun Kim
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mac Protocol ◽  
Packet Transmission ◽  
Transmission Delay ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Destination Node ◽  
Event Driven ◽  
Burst Data

In this paper, we present an energy and time constrained packet transmission MAC Protocol which we call ED-MAC for event-driven applications such as fire detection in wireless sensor networks (WSNs). In this kind of WSNs, sensor nodes send a burst data when there is an event in the measuring field. These events are usually critical, so the measured burst data should be transmitted in limited time to their final destination node, sink node. Therefore, the packet transmission delay is considered to be a crucial requirement in event-driven applications. The ED-MAC protocol reduces the packet transmission delay and average node energy consumption in comparison to existing related MAC protocols. 

Energy-Efficient and Secure Data Forwarding Mechanism for Balancing Cluster Lifetime for Huge Size Wireless Sensor Networks

2019 ◽  
Vol 16 (9) ◽  
pp. 3961-3964
Author(s):  
Charu Sharma ◽  
Rohit Vaid
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Energy Efficient ◽  
Base Station ◽  
Packet Transmission ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor

In designing Wireless Sensor Networks, energy efficiency and security should be considered very critically. Energy efficiency is achieved through data aggregation which eliminates the transmission of redundant data while security is achieved by preserving confidentiality among sensor node and the base station. In this paper, an energy efficient and secure cluster based aggregation mechanism is presented. In this model, for energy efficiency the network is divided into tracks and sectors so the cluster head’s are uniformly selected from the whole network. To achieve security the cluster head’s perform data aggregation with the help of some pattern codes and only distinctive data is transmitted from sensor nodes in encrypted form. To perform aggregation, the sensor nodes do not need to know about the actual sensor data therefore there is no need to use any encryption or decryption schemes between nodes and cluster head. Performance evaluation shows proposed model works better to enhance the network lifetime, security, average residual energy, and average packet transmission ratio than conventional data aggregation models.

scholarly journals WSN Routing Protocol Using a Multiobjective Greedy Approach

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Seyed Reza Nabavi ◽  
Nafiseh Osati Eraghi ◽  
Javad Akbari Torkestani
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Communication Networks ◽  
Optimal Path ◽  
Base Station ◽  
Packet Transmission ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Greedy Approach

Due to the widespread use of communication networks and the ease of transmitting and gathering information through these networks, wireless sensor networks (WSN) have become increasingly popular. Usability in any environment without the need for environmental monitoring and engineering of these networks has led to their increasing usage in various fields. Routing information from the sensor node to sink, so that node energy is consumed uniformly and network life is not reduced, is one of the most important challenges in wireless sensor networks. Most wireless networks have no infrastructure, and embedded sensor nodes have limited power. Thus, the early termination of the wireless node’s energy based on the transmission of messages over the network can disrupt the entire network process. In this paper, the object is designed to find the optimal path in WSN based on the multiobjective greedy approach to the near optimal path. The proposed model is presented in this method to transfer sensed data of the sensor network to the base station for the desired applications. In this method, the sensor nodes are identified as adjacent nodes based on their distance. The energy of all nodes initially is approximately equal, which decreases with the transfer of information between the nodes. In this way, when a node senses a message, it checks several factors for transmitting information to its adjacent nodes and selects the node with the largest amount of factors as the next hop. The simulation results show that the energy consumption in the network grids is almost symmetrically presented, and the network lifetime is reduced with a gentle slope that provides optimum energy consumption in the networks. Also, the packet transmission delay in the network reaches 450 milliseconds for the transmission of information between 15 nodes and 650 connections. Besides, network throughput increases by approximately 97%. It also shows better performance compared to other previous methods in terms of evaluation criteria.

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

Sign in / Sign up

Export Citation Format

Share Document