• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.11
• /
• pp.1138-1143
• /
• 2006

Sensor deployment is an important issue in the mobile wireless sensor network. In this paper, we propose a deployment algorithm for mobile sensor network to spread out mobile sensor nodes widely as well as regularly. Since the proposed algorithm uses tree topology in deploying the sensor nodes, calculating power as well as spreading speed can be reduced compare to other deployment algorithms. The performance of the proposed algorithm is simulated using NS-2 simulator and demonstrated.

• Journal of Korea Multimedia Society
• /
• v.16 no.3
• /
• pp.354-365
• /
• 2013

Node deployment is one of the important problems in achieving good quality of service in wireless sensor network. The purpose of this paper is to develop an interactive system that supports user's decision makings in designing sensor fields. The system provides grid-based initial deployment algorithm supporting three types of node deployment pattern, area-fill, path-cover, and barrier-cover deployment pattern. After initial deployment, an iterative refinement algorithm can be applied, which takes care of the irregularity of the deployment area and the heterogeneity of sensors. The proposed system helps users to effectively deploy nodes in the sensor field, analyse the detection performance of the deployment, and perform network simulations. The developed system can be utilized as a part of the development environment of the surveillance sensor network system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2173-2193
• /
• 2013

In order to reduce the distribution cost of sensor nodes, a mobile sensor deployment has been proposed. The mobile sensor deployment can be solved by finding the optimal layout and planning the movement of sensor nodes with minimum energy consumption. However, previous studies have not sufficiently addressed these issues with an efficient way. Therefore, we propose a new deployment approach satisfying these features, namely a tree-based approach. In the tree-based approach, we propose three matching schemes. These matching schemes match each sensor node to a vertex in a rake tree, which can be trivially transformed to the target layout. In our experiments, the tree-based approach successfully deploys the sensor nodes in the optimal layout and consumes less energy than previous works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1670-1679
• /
• 2011

In the area of wireless sensor networks, sensor coverage and network connectivity problems are caused by a limited detection range and the communication distance of the nodes. To solve the coverage and connectivity problems, many studies are suggested, but most research is restricted to apply into the real environment because they didn't consider various environmental factors on wireless sensor network deployment. So in this paper, we propose a node deployment strategy considering environmental factors and the number of nodes in surveillance and reconnaissance sensor networks(SRSN). The proposed node deployment method divides the installation of the surveillance and reconnaissance sensor networks system into four steps such as identification of influences factors for node placement through IPB process, sensor node deployment based on sensing range, selection of monitoring site, and relay node deployment based on RF communication range. And it deploys the sensor nodes and relay nodes considered the features of the surveillance and reconnaissance sensor network system and environmental factors. The result of simulation indicates that the proposed node deployment method improves sensor coverage and network connectivity.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.6
• /
• pp.169-174
• /
• 2014

Practical deployment methods for sensor nodes are demanding as applications using sensor nodes increase. In particular, node connectivity is crucial not only for the network longevity but also for direct impacts on sensing and data collection capability. Economic requirement at building sensor networks and often limited access for sensor fields due to hostile environment force to remain at random deployment from air. However, random deployment often result in lost connection problem and inefficient network topology issue due to node irregularity. In this paper, mixed deployment of key nodes that have better communication capability is proposed to support the original deployment into working in an efficient way. Node irregularity is improved by introducing mixed nodes and an efficient mixed node density is also analyzed. Simulation results show that the mixed deployment method has better performance than the existing deployment methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.990-1013
• /
• 2015

Deploying sensors into a target region is a key issue to be solved in building a wireless sensor network. Various deployment algorithms have been proposed by the researchers, and most of them are evaluated under the ideal conditions. Therefore, they cannot reflect the real environment encountered during the deployment. Moreover, it is almost impossible to evaluate an algorithm through practical deployment. Because the deployment of sensor networks require a lot of nodes, and some deployment areas are dangerous for human. This paper proposes a deployment approach to solve the problems mentioned above. Our approach relies on the satellite images and the Virtual Force Algorithm (VFA). It first extracts the topography and elevation information of the deployment area from the high resolution satellite images, and then deploys nodes on them with an improved VFA. The simulation results show that the coverage rate of our method is approximately 15% higher than that of the classical VFA in complex environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3823-3840
• /
• 2017

This paper analyzes the nodes deployment optimization problem in energy constrained wireless sensor networks, which multi-hop cooperative beamforming (CB) based cooperative-multi-input-single-output (CMISO) transmission is adopted to reduce the energy consumption. Firstly, we establish the energy consumption models for multi-hop SISO, multi-hop DSTBC based CMISO, multi-hop CB based CMISO transmissions under random nodes deployment. Then, we minimize the energy consumption by searching the optimal nodes deployment for the three transmissions. Furthermore, numerical results present the optimal nodes deployment parameters for the three transmissions. Energy consumption of the three transmissions are compared under optimal nodes deployment, which shows that CB based CMISO transmission consumes less energy than SISO and DSTBC based CMISO transmissions. Meanwhile, under optimal nodes deployment, the superiorities of CB based CMISO transmission over SISO and DSTBC based CMISO transmissions can be more obvious when path-loss-factor becomes low.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.406-412
• /
• 2010

In this paper, we formally define the problem of maximizing the coverage of sensor deployment, which is the optimization problem appeared in real-world sensor deployment, and analyze the properties of its solution space. To solve the problem, we proposed novel genetic algorithms, and we could show their superiority through experiments. When applying genetic algorithms to maximum coverage sensor deployment, the most important issue is how we evaluate the given sensor deployment efficiently. We could resolve the difficulty by using Monte Carlo method. By regulating the number of generated samples in the Monte Carlo evaluation of genetic algorithms, we could also reduce the computing time significantly without loss of solution quality.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.391-398
• /
• 2006

This paper verifies deployment algorithms in wireless sensor networks using SPIN, a widely used model checking tool. In this paper, two deployment algorithms, DSSA(Distributed Self Spreading Algorithm) and TBDA(Tree Based Deployment Algorithm), are verified to check their stability against oscillation as well as energy consumption that is an important factor in wireless sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.973-980
• /
• 2009

Many studies which have been done for efficient installation and management of wireless sensor networks (WSN) include energy savings, key managements and sensor deployments. Sensor deployment problem is one of the most important and fundamental issues among them in that the topic is directly related with the system cost and performance. In this paper, we suggest a sensor deployment scheme that reduces the system cost of WSN while satisfying the fundamental system requirements of connectivity between sensor nodes and sensing coverage. Using graphical information system(GIS) which contains region-dependent information related with connectivity condition, the initial positions of sensors in the procedure simulated annealing (SA) are determined. The GIS information helps in reducing system cost reduction not only at the initial deployment of SA but also at the final deployment of SA which is shown by computer simulations.