scholarly journals Lattice-Based 3-Dimensional Wireless Sensor Deployment

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Zhigang Wang ◽  
Liqin Tian ◽  
Lianhai Lin ◽  
Yinghua Tong

With the wide application of wireless sensor networks (WSNs) in real space, there are numerous studies on 3D sensor deployments. In this paper, the k -connectivity theoretical model of fixed and random nodes in regular lattice-based deployment was proposed to study the coverage and connectivity of sensor networks with regular lattice in 3D space. The full connectivity range and cost of the deployment with sensor nodes fixed in the centers of four regular lattices were quantitatively analyzed. The optimal single lattice coverage model and the ratio of the communication range to the sensing range   r c / r s were investigated when the deployment of random nodes satisfied the k -connectivity requirements for full coverage. In addition, based on the actual sensing model, the coverage, communication link quality, and reliability of different lattice-based deployment models were determined in this study.

Author(s):  
Ranjana Thalore ◽  
Partha Pratim Bhattacharya ◽  
Manish Kumar Jha

Recent developments in wireless sensor networks include their applications in safety, medical monitoring, environment monitoring and many more. Limited battery energy and efficient data delivery are most considered constraints for sensor nodes. Depletion of node battery ceases functioning of the node. The network lifetime can be enhanced with the help of Multi-Layer protocol (ML-MAC). This paper presents a practical approach including 3-dimensional deployment of sensor nodes and analyzes two different types of networks – homogeneous and heterogeneous WSNs. To analyze various QoS parameters, two types of nodes are considered in a heterogeneous network. The performance of both the networks is compared through simulations. The results show that ML-MAC performs better for a 3D heterogeneous WSNs.


Sensors ◽  
2020 ◽  
Vol 20 (13) ◽  
pp. 3719 ◽  
Author(s):  
Ala’ Khalifeh ◽  
Husam Abid ◽  
Khalid A. Darabkh

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.


2017 ◽  
Vol 2017 ◽  
pp. 1-17 ◽  
Author(s):  
Zhuangbin Chen ◽  
Anfeng Liu ◽  
Zhetao Li ◽  
Young-June Choi ◽  
Hiroo Sekiya ◽  
...  

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.


Energies ◽  
2020 ◽  
Vol 13 (15) ◽  
pp. 3952 ◽  
Author(s):  
Gun Wook Gil ◽  
Minjae Kang ◽  
Younghyun Kim ◽  
Ikjune Yoon ◽  
Dong Kun Noh

In solar-powered wireless sensor networks (SP-WSNs), the best use of harvested energy is more important than minimizing energy consumption since energy can be supplied periodically. Meanwhile, as is well known, the reliability of the communication between sensor nodes is very limited due to the resource constraints of sensor nodes. In this paper, we propose an efficient forward error correction (FEC) scheme which can give solar-powered wireless sensor networks more reliable communication. First, the proposed scheme provides energy-adaptive operation for the best use of solar energy. It calculates the amount of surplus energy which can be used for extra operations and then determines the number of additional parity bits for FEC according to this amount of surplus energy. At the same time, it also provides a link quality model that is used to calculate the appropriate number of parity bits for error recovery required for the current data communication environment. Finally, by considering these two parity sizes, it is possible to determine the number of parity bits that can maximize the data reliability without affecting the blacking out of nodes. The evaluation of the performance of the approach was performed by comparing the amount of data collected at the sink node and the number of blackout nodes with other schemes.


Author(s):  
Xiaoli Song ◽  
Yunzhan Gong ◽  
Dahai Jin ◽  
Qiangyi Li ◽  
Hengchang Jing

In diverse application fields, the increasing requisitions of Wireless Sensor Networks (WSNs) have more and more research dedicated to the question of sensor nodes’ deployment in recent years. For deployment of sensor nodes, some key points that should be taken into consideration are the coverage area to be monitored, energy consumed of nodes, connectivity, amount of deployed sensors and lifetime of the WSNs. This paper analyzes the wireless sensor network nodes deployment optimization problem. Wireless sensor nodes deployment determines the nodes’ capability and lifetime. For node deployment in heterogeneous sensor networks based on different probability sensing models of heterogeneous nodes, the author refers to the organic small molecule model and proposes a molecule sensing model of heterogeneous nodes in this paper. DSmT is an extension of the classical theory of evidence, which can combine with any type of trust function of an independent source, mainly concentrating on combined uncertainty, high conflict, and inaccurate source of evidence. Referring to the data fusion model, the changes in the network coverage ratio after using the new sensing model and data fusion algorithm are studied. According to the research results, the nodes deployment scheme of heterogeneous sensor networks based on the organic small molecule model is proposed in this paper. The simulation model is established by MATLAB software. The simulation results show that the effectiveness of the algorithm, the network coverage, and detection efficiency of nodes are improved, the lifetime of the network is prolonged, energy consumption and the number of deployment nodes are reduced, and the scope of perceiving is expanded. As a result, the coverage hole recovery algorithm can improve the detection performance of the network in the initial deployment phase and coverage hole recovery phase.


Author(s):  
Ms.Tejashri H. Mohite, Prof. Dr. Noorullah Shariff

Wireless Sensor Networks (WSNs) have used worldwide in the past few years and are now being used in health monitoring ,disaster management, defense, telecommunications, etc. Such networks are used in many industrial and consumer applications such as industrial process and environment monitoring, among others. A WSN network is a collection of specialized transducers known as sensor nodes with a communication link distributed randomly in any locations to monitor environmental parameters such as water level, and temperature. Each sensor node is equipped with a transducer, a signal processor, a power unit, and a transceiver. WSNs are now being widely used to monitor environmental parameters, including the amount of gas, water, temperature, humidity, oxygen level, dust, etc. The WSN for environment monitoring can be equivalently replaced by a multiple-input multiple-output (MIMO) relay network. Multi-hop relay networks have attracted significant research interest in recent years for their capability in increasing the coverage range. The network communication link from a source to a destination is implemented using the amplify-and-forward (AF) or decode-and-forward (DF) schemes. The AF relay receives information from the previous relay and simply amplifies the received signal and then forwards it to the next relay. On the other hand, the DF relay first decodes the received signal and then forwards it to the next relay in the second stage if it can perfectly decode the incoming signal. For analytical simplicity, in this thesis, we consider the AF relaying scheme and the results of this work can also be developed for the DF relay.


2021 ◽  
Vol 6 (2) ◽  
pp. 798
Author(s):  
Kamaldeen Ayodele Raji ◽  
Ayisat Wuraola Asaju-Gbolagade ◽  
Kazeem Alagbe Gbolagade

Wireless Sensor Networks (WSNs) consist of huge number of sensor nodes dispersed in a domain of enthusiasm with at least one sink for watching the environment and physical situation. These sensor hubs are circulated in threatening conditions and are unprotected to deficiencies, for example, power dissemination, equipment glitches, communication link errors and malicious attacks, among others. It has been established that essentialness, speed and unwavering quality are the chief test in the usefulness of WSNs as they are controlled with compelled imperativeness and restricted equipment assets. Accordingly, it is necessary to structure vitality proficient steering conventions for WSNs applications. Chinese Remainder Theorem (CRT)- based packet splitting integrated with Low-Energy Adaptive Clustering Hierarchy (LEACH) algorithm routing protocol was proposed so as to decrease vitality utilization during correspondence and improve message dependability in WSNs. The consequences of exploratory reproductions show that the proposed structure delivered powerful directing convention for WSNs when contrasted with existing routing protocols to the extent essentialness usage, speed, equipment necessities and transformation delay continuously WSNs.


2021 ◽  
Vol 5 (3) ◽  
pp. 1-24
Author(s):  
Jianjun Wen ◽  
Waltenegus Dargie

Wireless sensor networks accommodating the mobility of nodes will play important roles in the future. In residential, rehabilitation, and clinical settings, sensor nodes can be attached to the body of a patient for long-term and uninterrupted monitoring of vital biomedical signals. Likewise, in industrial settings, workers as well as mobile robots can carry sensor nodes to augment their perception and to seamlessly interact with their environments. Nevertheless, such applications require reliable communications as well as high throughput. Considering the primary design goals of the sensing platforms (low-power, affordable cost, large-scale deployment, longevity, operating in the ISM band), maintaining reliable links is a formidable challenge. This challenge can partially be alleviated if the nature of link quality fluctuation can be known or estimated on time. Indeed, higher-level protocols such as handover and routing protocols rely on knowledge of link quality fluctuation to seamlessly transfer communication to alternative routes when the quality of existing routes deteriorates. In this article, we present the result of extensive experimental study to characterise link quality fluctuation in mobile environments. The study focuses on slow movements (<5 km h -1 ) signifying the movement of people and robots and transceivers complying to the IEEE 802.15.4 specification. Hence, we deployed mobile robots that interact with strategically placed stationary relay nodes. Our study considered different types of link quality characterisation metrics that provide complementary and useful insights. To demonstrate the usefulness of our experiments and observations, we implemented a link quality estimation technique using a Kalman Filter. To set up the model, we employed two link quality metrics along with the statistics we established during our experiments. The article will compare the performance of four proposed approaches with ours.


Author(s):  
A. Radhika ◽  
D. Haritha

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.


2014 ◽  
Vol 8 (1) ◽  
pp. 668-674
Author(s):  
Junguo Zhang ◽  
Yutong Lei ◽  
Fantao Lin ◽  
Chen Chen

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.


Sign in / Sign up

Export Citation Format

Share Document