scholarly journals Optimal Sensor Placement for Underground Tunnel Monitoring via Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Yonggang Li ◽  
Bin He ◽  
Youming Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underground Tunnel ◽  
Deployment Strategy ◽  
Human Labor ◽  
Tunnel Monitoring ◽  
Sensor Node Placement

In replace of human labor, wireless sensor networks (WSNs) are increasingly being utilized to perform structural health monitoring of underground tunnel. Due to its complex environment, the deployment of sensor nodes poses a big challenge to related staff. How to use the optimal number of sensor nodes deployed in the underground tunnel to obtain a satisfactory monitoring is our main consideration. In this paper, we propose a deployment strategy based on the optimal index to provide guidelines for sensor node placement. The objective of the strategy is to put sensor nodes in a proper site to gain maximum sensing information, thus eliminating redundant sensor nodes as well as saving costs.

Energy Efficient Multi-Hop Wireless Sensor Networks with CMIMO-SM Scheme

2014 ◽  
Vol 666 ◽  
pp. 322-326
Author(s):  
Yu Yang Peng ◽  
Jae Ho Choi
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Improve Energy Efficiency ◽  
Output System

Energy efficiency is one of the important hot issues in wireless sensor networks. In this paper, a multi-hop scheme based on a cooperative multi-input multi-outputspatial modulation technique is proposed in order to improve energy efficiency in WSN. In this scheme, the sensor nodes are grouped into clusters in order to achieve a multi-input multi-output system; and a simple forwarding transmission scenario is considered so that the intermediate clusters only forward packets originated from the source cluster down to the sink cluster. In order to verify the performance of the proposed system, the bit energy consumption formula is derived and the optimal number of hopsis determined. By qualitative experiments, the obtained results show that the proposed scheme can deliver the data over multiple hops consuming optimal energy consumption per bit.

scholarly journals A Novel Deployment Scheme Based on Three-Dimensional Coverage Model for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Fu Xiao ◽  
Yang Yang ◽  
Ruchuan Wang ◽  
Lijuan Sun
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Three Dimensional ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Computing Power ◽  
Deployment Strategy ◽  
Coverage Model ◽  
Minimum Number ◽  
Random Method

Coverage pattern and deployment strategy are directly related to the optimum allocation of limited resources for wireless sensor networks, such as energy of nodes, communication bandwidth, and computing power, and quality improvement is largely determined by these for wireless sensor networks. A three-dimensional coverage pattern and deployment scheme are proposed in this paper. Firstly, by analyzing the regular polyhedron models in three-dimensional scene, a coverage pattern based on cuboids is proposed, and then relationship between coverage and sensor nodes’ radius is deduced; also the minimum number of sensor nodes to maintain network area’s full coverage is calculated. At last, sensor nodes are deployed according to the coverage pattern after the monitor area is subdivided into finite 3D grid. Experimental results show that, compared with traditional random method, sensor nodes number is reduced effectively while coverage rate of monitor area is ensured using our coverage pattern and deterministic deployment scheme.

An Improvement Routing Protocol Based LEACH for Wireless Sensor Networks

2014 ◽  
Vol 614 ◽  
pp. 472-475 ◽  
Author(s):  
Jin Gang Cao
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Base Station ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Number Of Clusters ◽  
Cluster Heads

Due to limited energy, computing ability, and memory of Wireless sensor Networks(WSN), routing issue is one of the key factors for WSN. LEACH is the first clustering routing protocol, which can efficiently reduce the energy consumption and prolong the lifetime of WSN, but it also has some disadvantage. This paper proposed an improvement based LEACH, called LEACH-T. According to different number of clusters, LEACH-T uses variable time slot for different clusters in steady-state phase, and single-hop or multi-hop to transmit data between cluster heads and Base Station. Also it considered residual energy of sensor nodes and the optimal number of clusters during selection of the cluster heads. The simulation results show that LEACH-T has better performance than LEACH for prolonging the lifetime and reducing the energy consumption.

scholarly journals An Optimal Task Scheduling Algorithm in Wireless Sensor Networks

2011 ◽  
Vol 6 (1) ◽  
pp. 101 ◽  
Author(s):  
Liang Dai ◽  
Yilin Chang ◽  
Zhong Shen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Resource ◽  
Task Scheduling Algorithm ◽  
Two Phases

Sensing tasks should be allocated and processed among sensor nodes in minimum times so that users can draw useful conclusions through analyzing sensed data. Furthermore, finishing sensing task faster will benefit energy saving, which is critical in system design of wireless sensor networks. To minimize the execution time (makespan) of a given task, an optimal task scheduling algorithm (OTSA-WSN) in a clustered wireless sensor network is proposed based on divisible load theory. The algorithm consists of two phases: intra-cluster task scheduling and inter-cluster task scheduling. Intra-cluster task scheduling deals with allocating different fractions of sensing tasks among sensor nodes in each cluster; inter-cluster task scheduling involves the assignment of sensing tasks among all clusters in multiple rounds to improve overlap of communication with computation. OTSA-WSN builds from eliminating transmission collisions and idle gaps between two successive data transmissions. By removing performance degradation caused by communication interference and idle, the reduced finish time and improved network resource utilization can be achieved. With the proposed algorithm, the optimal number of rounds and the most reasonable load allocation ratio on each node could be derived. Finally, simulation results are presented to demonstrate the impacts of different network parameters such as the number of clusters, computation/communication latency, and measurement/communication speed, on the number of rounds, makespan and energy consumption.

Joint Deployment Strategy of Battery-Free Sensor Networks with Coverage Guarantee

2021 ◽  
Vol 17 (4) ◽  
pp. 1-29
Author(s):  
Tuo Shi ◽  
Zhipeng Cai ◽  
Jianzhong Li ◽  
Hong Gao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Architecture ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Free Node ◽  
Deployment Strategy ◽  
Energy Limitation ◽  
Coverage Quality ◽  
Important Measurement

The energy limitation of wireless sensors limits the lifetime of the traditional wireless sensor networks. The <b>Battery-Free Sensor Network (BF-WSN)</b> is a new network architecture proposed in recent years to address the limitation of wireless sensor networks. In a BF-WSN, the battery-free node can harvest energy from the ambient environment, and thus the lifetime of a BF-WSN is unlimited in terms of energy. The coverage quality is an important measurement of BF-WSNs. Considering the specific features of BF-WSNs, we propose a new deployment concept for BF-WSNs, named <i>Joint Deployment</i>. It aims to determine the locations and working schedules of sensor nodes to maximize network coverage quality. Based on the joint deployment concept, we propose a new deployment problem of battery-free sensor nodes. We prove that this problem is at least NP-Hard. We also analyze the upper bound of this problem. Furthermore, we propose an approximated algorithm to solve this problem and analyze the time complexity and the ratio bound of the algorithm. Extensive simulations are carried out to examine the performance of the proposed algorithm. The simulation results show that the algorithm is efficient and effective.

DENSITY DOMINATION OF QoS CONTROL IN WIRELESS SENSOR NETWORKS

2006 ◽  
Vol 03 (04) ◽  
pp. 283-300
Author(s):  
JUEJIA ZHOU ◽  
CHUNDI MU
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Base Station ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Embedded Devices ◽  
Light Pressure ◽  
Linear Networks ◽  
Energy Store

Wireless sensor networks (WSN) are a kind of networks made of tiny sensing embedded devices with processors, memories and short-range wireless communication modules. They are planted for sensing the area which people mostly care about and to send data of light, pressure, sound, and so on, back to people to make further analyses. Differing from normal linear networks, WSN are usually restricted by energy store, plethoric information flow, and short communication distance. So, there are many research hotpots in WSN such as routing, economization of energy, adaptive self-configuration, etc. Among these aspects, the area of quality of service (QoS) remains largely open. This is due to that the optimal alive sensor nodes number is difficult to determine in a certain focused area which satisfies the requirement of QoS. In order to make an optimal number of nodes to power up in a focused area, the paper proposes the density domination strategy with location information and localized information based on the modified Gur Game which is embedded with gradient mechanism. In the strategies, the base station receives the QoS feedback and gives the dynamic density domination information. The simulation results about the two kinds of density domination strategies are given. The results show that both of the strategies can effectively control the density of power-up nodes and meet the requirement of QoS.

scholarly journals Mathematical Modeling of Optimal Node Deployment for Indoor Wireless Sensor Networks

2020 ◽  
Vol 14 ◽  
Keyword(s):  
Mathematical Modeling ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Connectivity ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Node Deployment ◽  
Indoor Wireless ◽  
Optimal Node

Wireless Sensor Network (WSN) has been utilized in environmental monitoring where large number of connected sensor nodes collaboratively sense and report conditions of the monitoring area. Indoor event sensing and tracking is one of WSN applications that has a significant effect on saving cost economically and humanitarianly. Efficient sensor node deployment can ensure coverage, connectivity, and stability of the network. This paper presents the mathematical modeling of a node deployment for indoor wireless sensor networks where the optimal number of nodes required to satisfy the coverage of the indoor area and network connectivity requirements is determined. The proposed solution contributes to the reduction in the cost and maintenance of the network as less number of sensors is needed, compared to the traditional grid node deployment.

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.

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.

Energy Efficient Group Based Linear Wireless Sensor Networks for Application in Pipeline Monitoring

2020 ◽  
Vol 10 ◽  
Author(s):  
Chinedu Duru ◽  
Neco Ventura ◽  
Mqhele Dlodlo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Remote Monitoring ◽  
Linear Array ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Pipeline Monitoring

Background: Wireless Sensor Networks (WSNs) have been researched to be one of the ground-breaking technologies for the remote monitoring of pipeline infrastructure of the Oil and Gas industry. Research have also shown that the preferred deployment approach of the sensor network on pipeline structures follows a linear array of nodes, placed a distance apart from each other across the infrastructure length. The linear array topology of the sensor nodes gives rise to the name Linear Wireless Sensor Networks (LWSNs) which over the years have seen themselves being applied to pipelines for effective remote monitoring and surveillance. This paper aims to investigate the energy consumption issue associated with LWSNs deployed in cluster-based fashion along a pipeline infrastructure. Methods: Through quantitative analysis, the study attempts to approach the investigation conceptually focusing on mathematical analysis of proposed models to bring about conjectures on energy consumption performance. Results: From the derived analysis, results have shown that energy consumption is diminished to a minimum if there is a sink for every placed sensor node in the LWSN. To be precise, the analysis conceptually demonstrate that groups containing small number of nodes with a corresponding sink node is the approach to follow when pursuing a cluster-based LWSN for pipeline monitoring applications. Conclusion: From the results, it is discovered that energy consumption of a deployed LWSN can be decreased by creating groups out of the total deployed nodes with a sink servicing each group. In essence, the smaller number of nodes each group contains with a corresponding sink, the less energy consumed in total for the entire LWSN. This therefore means that a sink for every individual node will attribute to minimum energy consumption for every non-sink node. From the study, it can be concurred that energy consumption of a LWSN is inversely proportional to the number of sinks deployed and hence the number of groups created.

Sign in / Sign up

Export Citation Format

Share Document