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.

Sensor Data Geographic Forwarding in Two-Dimensional and Three-Dimensional Spaces

2017 ◽  
pp. 317-352
Author(s):  
Habib M. Ammari ◽  
Amer Ahmed
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Three Dimensional ◽  
Geographic Routing ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Two Dimensional ◽  
Geographic Forwarding ◽  
Limited Power

A wireless sensor network is a collection of sensor nodes that have the ability to sense phenomena in a given environment and collect data, perform computation on the gathered data, and transmit (or forward) it to their destination. Unfortunately, these sensor nodes have limited power, computational, and storage capabilities. These factors have an influence on the design of wireless sensor networks and make it more challenging. In order to overcome these limitations, various power management techniques and energy-efficient protocols have been designed. Among such techniques and protocols, geographic routing is one of the most efficient ways to solve some of the design issues. Geographic routing in wireless sensor networks uses location information of the sensor nodes to define a path from source to destination without having to build a network topology. In this paper, we present a survey of the existing geographic routing techniques both in two-dimensional (2D) and three-dimensional (3D) spaces. Furthermore, we will study the advantages of each routing technique and provide a discussion based on their practical possibility of deployment.

scholarly journals A data forwarding algorithm based on Markov thought in underwater wireless sensor networks

2017 ◽  
Vol 13 (2) ◽  
pp. 155014771769198
Author(s):  
Dongwei Li ◽  
Jingli Du ◽  
Linfeng Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Success Rate ◽  
Three Dimensional ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Data Forwarding ◽  
Bottom To Top

The underwater wireless sensor networks composed of sensor nodes are deployed underwater for monitoring and gathering submarine data. Since the underwater environment is usually unpredictable, making the nodes move or be damaged easily, such that there are several vital objectives in the data forwarding issue, such as the delivery success rate, the error rate, and the energy consumption. To this end, we propose a data forwarding algorithm based on Markov thought, which logically transforms the underwater three-dimensional deployment model into a two-dimensional model, and thus the nodes are considered to be hierarchically deployed. The data delivery is then achieved through a “bottom to top” forwarding mode, where the delivery success rate is improved and the energy consumption is reduced because the established paths are more stable, and the proposed algorithm is self-adaptive to the dynamic routing loads.

A Hybrid Energy-Efficient Itinerary Planning for Mobile Agents in Wireless Sensor Networks

2013 ◽  
Author(s):  
Yu-Cheng Chou
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Large Scale ◽  
Evolutionary Process ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Computing Power ◽  
Itinerary Planning ◽  
Hybrid Energy

Wireless sensor networks (WSNs) are limited to resources including computing power, storage capacity, and especially energy supply. Thus, energy consumption of sensor nodes has become a dominant performance index for a WSN. In addition, data transmission between sensor nodes is a main energy consumer of WSNs. This paper presents a method called immune genetic algorithm based multiple-mobile-agent itinerary planning (IGA-M2IP) that addresses issues of energy consumption in large-scale WSNs. The IGA-M2IP preserves a GA’s advantages, and further improves a GA’s efficiency by restraining possible degenerative phenomena during the evolutionary process.

Delaunay Triangulation Based Key Distribution for Three-Dimensional Wireless Sensor Networks

2021 ◽  
pp. 2150009
Author(s):  
Monjul Saikia
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Delaunay Triangulation ◽  
Secure Communication ◽  
Three Dimensional ◽  
Key Distribution ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Secret Key ◽  
Symmetric Key

The security of wireless sensor networks is a significant concern and can be achieved by the application of cryptographic algorithms. The symmetric key encryption techniques are widely used cryptographic mechanisms for the security of sensor networks due to its low computational complexity. A symmetric key encryption technique requires a secret key to be shared between both parties for confidential communication. In a wireless sensor network, it is difficult to know which node is going to be in its communication range at the deployment phase. If prior knowledge of sensor location exists, it is an added advantage and helps in the distribution of secret keys among nodes. Even if with the expected location information, distributing the keys properly among the nodes is a challenging task. A proper algorithm must be used so that it gives the adequate utilization of the distributed keys with a minimal number of keys per sensor node. In this paper, we propose a location-dependent key distribution scheme. We use Delaunay Triangulation for the efficient distribution of keys among sensor nodes. The method gives a high probability of secure communication links among nodes with high resilience to the network.

Sensor Data Geographic Forwarding in Two-Dimensional and Three-Dimensional Spaces

2020 ◽  
pp. 1459-1493
Author(s):  
Habib M. Ammari ◽  
Amer Ahmed
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Three Dimensional ◽  
Geographic Routing ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Two Dimensional ◽  
Geographic Forwarding ◽  
Limited Power

A wireless sensor network is a collection of sensor nodes that have the ability to sense phenomena in a given environment and collect data, perform computation on the gathered data, and transmit (or forward) it to their destination. Unfortunately, these sensor nodes have limited power, computational, and storage capabilities. These factors have an influence on the design of wireless sensor networks and make it more challenging. In order to overcome these limitations, various power management techniques and energy-efficient protocols have been designed. Among such techniques and protocols, geographic routing is one of the most efficient ways to solve some of the design issues. Geographic routing in wireless sensor networks uses location information of the sensor nodes to define a path from source to destination without having to build a network topology. In this paper, we present a survey of the existing geographic routing techniques both in two-dimensional (2D) and three-dimensional (3D) spaces. Furthermore, we will study the advantages of each routing technique and provide a discussion based on their practical possibility of deployment.

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.

scholarly journals Transforming Area Coverage to Target Coverage to Maintain Coverage and Connectivity for Wireless Sensor Networks

2012 ◽  
Vol 8 (10) ◽  
pp. 254318 ◽  
Author(s):  
Xiu Deng ◽  
Jiguo Yu ◽  
Dongxiao Yu ◽  
Congcong Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Area Coverage ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Target Coverage ◽  
Coverage Problem ◽  
Minimum Number ◽  
New Perspective ◽  
Target Coverage Problem

Area coverage is one of the key issues for wireless sensor networks. It aims at selecting a minimum number of sensor nodes to cover the whole sensing region and maximizing the lifetime of the network. In this paper, we discuss the energy-efficient area coverage problem considering boundary effects in a new perspective, that is, transforming the area coverage problem to the target coverage problem and then achieving full area coverage by covering all the targets in the converted target coverage problem. Thus, the coverage of every point in the sensing region is transformed to the coverage of a fraction of targets. Two schemes for the converted target coverage are proposed, which can generate cover sets covering all the targets. The network constructed by sensor nodes in the cover set is proved to be connected. Compared with the previous algorithms, simulation results show that the proposed algorithm can prolong the lifetime of the network.

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.

scholarly journals A Mobility-Assisted Localization Algorithm for Three-Dimensional Large-Scale UWSNs

Sensors ◽  
2020 ◽  
Vol 20 (15) ◽  
pp. 4293
Author(s):  
Junhai Luo ◽  
Yang Yang ◽  
Zhiyan Wang ◽  
Yanping Chen ◽  
Man Wu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Large Scale ◽  
Time Synchronization ◽  
Three Dimensional ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Environment ◽  
Localization Scheme

As one of the important facilities for marine exploration, as well as environment monitoring, access control, and security, underwater wireless sensor networks (UWSNs) are widely used in related military and civil fields, since the sensor node localization is the basis of UWSNs’ application in various related fields. Therefore, the research of localization algorithms based on UWSNs has gradually become one of the research hotspots today. However, unlike terrestrial wireless sensor networks (WSNs), many terrestrial monitoring and localization technologies cannot be directly applied to the underwater environment. Moreover, due to the complexity and particularity of the underwater environment, the localization of underwater sensor nodes still faces challenges, such as the localization ratio of sensor nodes, time synchronization, localization accuracy, and the mobility of nodes. In this paper, we propose a mobility-assisted localization scheme with time synchronization-free feature (MALS-TSF) for three-dimensional (3D) large-scale UWSNs. In addition, the underwater drift of the sensor node is considered in this scheme. The localization scheme can be divided into two phases. In Phase I, anchor nodes are distributed in the monitoring area, reducing the monitoring cost. Then, we address a time-synchronization-free localization scheme, to obtain the coordinates of the unknown sensor nodes. In Phase II, we use the method of two-way TOA to locate the remaining ordinary sensor nodes. The simulation results show that MALS-TSF can achieve a relatively high localization ratio without time synchronization.

scholarly journals An Algorithmic Approach to the Node Selection Problem in Industrial Wireless Sensor Networks

2021 ◽  
Author(s):  
Veeramani Sonai ◽  
Indira Bharathi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Industrial Wireless Sensor Networks ◽  
Placement Problem ◽  
Node Placement ◽  
Minimum Number ◽  
Sink Node Placement

Industrial Wireless Sensor Networks (IWSN) are the special class of WSN where it faces many challenges like improving process efficiency and meet the financial requirement of the industry. Most of the IWSNs contains a large number of sensor nodes over the deployment field. Due to lack of predetermined network infrastructure demands, IWSNs to deploy a minimum number of sink nodes and maintain network connectivity with other sensor nodes. Capacitated Sink Node Placement Problem (CSNPP) finds its application in the Industrial wireless sensor network (IWSN), for the appropriate placement of sink nodes. The problem of placing a minimum number of sink nodes in a weighted topology such that each sink node should have a maximum number of sensor nodes within the given capacity is known as Capacitated Sink Node Placement Problem. This chapter proposes a heuristic based approach to solve Capacitated Sink Node Placement Problem.

Sign in / Sign up

Export Citation Format

Share Document