Optimal Threshold Coverage Area (OTCA) Algorithm for Random Deployment of Sensor Nodes in Large Asymmetrical Terrain

2018 ◽  
pp. 34-42 ◽  
Author(s):  
Anamika Sharma ◽  
Siddhartha Chauhan
Keyword(s):  
Sensor Nodes ◽  
Optimal Threshold ◽  
Coverage Area ◽  
Random Deployment

Node Placement Strategy in Wireless Sensor Network

2013 ◽  
Vol 5 (2) ◽  
pp. 18-31 ◽  
Author(s):  
Puteri Azwa Ahmad ◽  
M. Mahmuddin ◽  
Mohd Hasbullah Omar
Keyword(s):  
Sensor Networks ◽  
Region Of Interest ◽  
Target Position ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Node Placement ◽  
Random Deployment ◽  
Virtual Force ◽  
Coverage And Connectivity

The performance and quality of services in wireless sensor networks (WSNs) depend on coverage and connectivity. Node placement is a fundamental issue closely related to the coverage and connectivity in sensor networks. Node placement influences the target position, coverage area, and connectivity in sensor networks. In random deployment, sensor nodes are deployed randomly in a non-invasive way. The deployment process may cause issues like coverage holes, overlapping, and connectivity failure. Enhancing coverage and connectivity are important for sensor networks to provide a reliable communication within sensing. Placing many sensor nodes in a WSN application region area is not the best solution due to cost and it results in multiple sensors used. Mobile sensor node is used as an alternative to overcome the random deployment problem. The virtual force based self node deployment is used in the mobility sensor to improve the coverage and connectivity area. Virtual Force Algorithm (VFA) approach using virtual repulsive and attractive forces is used to find the optimal node placement to minimize the problems. Simulation results proofed that a uniform deployment achieved using VFA approach with an optimal sensing range to cover the region of interest.

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.

An Improved Greedy Algorithm for Coverage in Directional Sensor Networks

2013 ◽  
Vol 711 ◽  
pp. 440-445
Author(s):  
Xiang Fu ◽  
Chun Ping Lu ◽  
Hao Li
Keyword(s):  
Greedy Algorithm ◽  
Sensor Nodes ◽  
Network Coverage ◽  
Simulation Experiments ◽  
Directional Sensor Networks ◽  
Coverage Area ◽  
Priority Level ◽  
Coverage Ratio ◽  
Processing Order ◽  
Directional Sensor

DGreedy (distributed greedy) algorithm evaluates the priority level in view of remaining energy of terminals, and the relationships between neighbor nodes are not considered. At the same time, the adjustable sensing orientations of sensors are limited. Therefore, the network coverage ratio of DGreedy is affected usually by the processing order of sensor nodes. In this paper, an improved Greedy algorithm for the coverage in directional sensor network is proposed based on the principle of global greedy. The single coverage area of nodes is considered as priority. The direction of node with maximum single coverage area is deployed firstly. Thereby it reduces the sensing overlapping regions and accomplishes coverage enhancement of the networks. Meanwhile, in order to improve the network coverage ratio, the sensing orientations of sensors are adjustable continuously, so the best sensing orientation of node can be selected by considering the deployment of neighbor nodes. Simulation experiments show that the proposed algorithm can improve the coverage area effectively.

scholarly journals A Novel Positioning System Based on Coverage Area Pruning in Wireless Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (12) ◽  
pp. 4469 ◽  
Author(s):  
Shih-Chang Huang ◽  
Fu-Gong Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Positioning System ◽  
Angle Of Arrival ◽  
Coverage Area ◽  
Received Signal Strength Indicator ◽  
Centroid Point ◽  
Positioning Algorithm

Wireless sensor networks are commonly applied in environmental monitoring applications. The crucial factor in such applications is to accurately retrieve the location of a monitoring event. Although many technologies have been proposed for target positioning, the devices used in such methods require better computational abilities or special hardware that is unsuitable for sensor networks with limited ability. Therefore, a range-free positioning algorithm, named coverage area pruning positioning system (CAPPS), is proposed in this study. First, the proposed CAPPS approach determines the area that includes the target approximately by using sensor nodes that can detect the target. Next, CAPPS uses sensor nodes that cannot detect the target to prune the area to improve positioning accuracy. The radio coverage variation is evaluated in a practical scenario, and a heuristic mechanism is proposed to reduce false positioning probability. Simulation results show that the size of the positioning area computed by CAPPS is smaller than that computed using distance vector hop, angle of arrival, and received signal strength indicator by approximately 98%, 97%, and 93%, respectively. In the radio variation scenario, the probability of determining an area excluding the target can be reduced from 50%–95% to 10%–30% by applying the proposed centroid point mechanism.

scholarly journals A Research Protocol for Detection and Optimization of Overlapping Coverage in Wireless Sensor Networks

2019 ◽  
Vol 8 (6S) ◽  
pp. 1-6
Keyword(s):  
Human Life ◽  
Data Gathering ◽  
Fire Detection ◽  
Life Time ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Coverage Area ◽  
Random Manner ◽  
The Given

Wireless sensor network (WSN) is an emerging area in which numbers of sensor nodes are deployed in two ways random and deterministic for data gathering. WSNs have expedited human life in diverse emerging fields: military, agriculture, structural health, perimeter access control, forest fire detection. A physical stimulus such as pressure, sound, light act as an environmental parameter on which the system is design to monitor and detect it for controlling the coverage area for assigned task. The nodes are deployed in the random manner in the given area for gathering the information and they may be overlapped so that the total area may not be covered. The proposed protocol uses radius and the residual energy as a function to increase the total coverage area so that the whole coverage area may be achieved. It also increases the life time of the network using Sleep and Wakeup protocol. Therefore the overall life time of the network increases.

scholarly journals Energy Efficient Routing Protocall By One Way Multi-Hope Sensor Nodes

2021 ◽  
Vol 12 (7) ◽  
pp. 3401-3410
Author(s):  
Heba Hussain Hadi, Et. al.
Keyword(s):  
Data Transmission ◽  
Sensor Node ◽  
Cluster Head ◽  
Geographic Location ◽  
Life Time ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Energy Efficient Routing ◽  
Coverage Area ◽  
Aggregated Data

Multi-hope is widely used for data aggregation and transmission in various applications. The resource availability determines the life time of a WSN. Sensor nodes are powered by a tiny battery that supplies the required energy for the sensor and transmitter. The residual energy available at any moment decides the fitness of the sensor node. The sensor node senses the environment and transmits the data to the sink. Efficient data transmission and aggregation with less energy consumption can prolong the lifetime of the sensor network. The sensor node that is inside the coverage area of the sink can directly transmit the data to sink in a single-hop transmission. The sensor node that is not inside the coverage area should transmit the data to the neighbor node which is in the coverage area of the sink. The data is then turn transmitted by the node close to it fall in multi-hop transmission involving a number of intermediate nodes to forward the data to the sink and consumes extra energy for the forwarding process. The formation clusters and data transmission of data by Cluster Heads (CH) can eliminate many nodes involved in the transmission of same data. Clusters are a group of self-organized nodes in a geographic location that can communicate among them. A node in a cluster with higher residual energy will be acting as CH and all other nodes in the cluster transmit the data to the CH. The CH transmits the aggregated data to the sink. The CH transmits the data to the sink either in single-hop transmission or multi-hop transmission. The cluster head consumes more energy than other nodes in the cluster as it is involved in aggregation and transmission process.

scholarly journals An Efficient and Provable Multifactor Mutual Authentication Protocol for Multigateway Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Shuailiang Zhang ◽  
Xiujuan Du ◽  
Xin Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mutual Authentication ◽  
Authentication Protocol ◽  
Identity Authentication ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Authentication Protocols ◽  
Coverage Area ◽  
Secure Protocol

As the most popular way of communication technology at the moment, wireless sensor networks have been widely concerned by academia and industry and plays an important role in military, agriculture, medicine, and other fields. Identity authentication offers the first line of defence to ensure the security communication of wireless sensor networks. Since the sensor nodes are resource-limited in the wireless networks, how to design an efficient and secure protocol is extremely significant. The current authentication protocols have the problem that the sensor nodes need to execute heavy calculation and communication consumption during the authentication process and cannot resist node capture attack, and the protocols also cannot provide perfect forward and backward security and cannot resist replay attack. Multifactor identity authentication protocols can provide a higher rank of security than single-factor and two-factor identity authentication protocols. The multigateway wireless sensor networks’ structure can provide a larger communication coverage area than the single-gateway network structure, so it has become the focus of recent studies. Therefore, we design a novel multifactor authentication protocol for multigateway wireless sensor networks, which only apply the lightweight hash function and are given biometric information to achieve a higher level of security and efficiency and a larger communication coverage area. We separately apply BAN logic, random oracle model, and AVISPA tool to validate the security of our authentication protocol in Case 1 and Case 2. We put forward sixteen evaluation criteria to comprehensively evaluate our authentication protocol. Compared with the related authentication protocols, our authentication protocol is able to achieve higher security and efficiency.

Sign in / Sign up

Export Citation Format

Share Document