• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1611-1629
• /
• 2016

Recently, deploying WiFi access points (APs) for facilitating indoor localization has attracted increasing attention. However, most existing mechanisms in this aspect are typically simulation based and further they did not consider how to jointly utilize pre-existing APs in target environment and newly deployed APs for achieving high localization performance. In this paper, we propose a measurement-based AP deployment mechanism (MAPD) for placing APs in target indoor environment for assisting fingerprint based indoor localization. In the mechanism design, MAPD takes full consideration of pre-existing APs to assist the selection of good candidate positions for deploying new APs. For this purpose, we first choose a number of candidate positions with low location accuracy on a radio map calibrated using the pre-existing APs and then use over-deployment and on-site measurement to determine the actual positions for AP deployment. MAPD uses minimal mean location error and progressive greedy search for actual AP position selection. Experimental results demonstrate that MAPD can largely reduce the localization error as compared with existing work.

• Journal of IKEEE
• /
• v.11 no.3
• /
• pp.100-107
• /
• 2007

One of the fundamental problems in wireless sensor networks is the efficient deployment of sensor nodes. The Fuzzy C-Means(FCM) clustering algorithm is proposed to determine the optimum location and minimum number of sensor nodes for the specific application space. We performed a simulation and a experiment using two rectangular and one L shape area. We found the minimum number of sensor nodes for the complete coverage of modeled area, and discovered the optimum location of each nodes. The real deploy experiment using sensor nodes shows the 94.6%, 92.2% and 95.7% error free communication rate respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.106-116
• /
• 2010

Sensor deployment makes an effect on not only covering of the interesting area but also reliable data acquisition and efficient resource management of sensor, so that sensors must be deployed at their better place. In traditional static wireless sensor networks, however, it is impossible to deploy the sensors manually when they are distributed in unexploited, hostile, or disaster areas. Therefore, if each sensor has locomotion capability, it can re-deploy itself using the location information of neighbor sensors. In our previous study, we showed that moving sensors to the centroids of their Voronoi polygon is efficient for extending the coverage area. In this paper, we present an improved potential-field-based sensor self-deployment scheme by combining the centroid of Voronoi polygon with the traditional potential-field scheme. Simulation results show that our scheme can achieve higher coverage in shorter time and less movement than the traditional potential-field scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.657-666
• /
• 2008

The intersection collision avoidance service among various telematics application services is regarded as one of the most critical services with regard to safety. In such safety applications, real-time, correct transmission of service is required. In this paper, we study on efficient infrastructure architecture for intersection collision avoidance using a cooperative mechanism between vehicles and wireless infrastructure. In particular, we propose an infrastructure, called CISN (Cooperative Infrastructure associated with Sensor Networks), in which proper numbers of sensor nodes are deployed on each road, surrounding the intersection. In the proposed architecture, overall service performance is influenced by various parameters consisting of the infrastructure, such as the number of deployed sensor nodes, radio range and broadcast interval of base station, and so on. In order to test the feasibility of the CISN model in advance, and to evaluate the correctness and real-time transmission ability, an intersection sensor deployment simulator is developed. Through various simulations on several environments, we identify optimal points of some critical parameters to build the most desirable CISN.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.18 no.5
• /
• pp.538-547
• /
• 2015

The goal of this study is to develop an algorithm to propose optimal deployment of detection sensor nodes in the target area, based on a performance surface, which represents detection performance of active and passive acoustic sonar systems. The performance surface of the active detection system is calculated from the azimuthal average of maximum detection ranges, which is estimated with a transmission loss and a reverberation level predicted using ray-based theories. The performance surface of the passive system is calculated using the transmission loss model based on a parabolic equation. The optimization of deployment configurations is then performed by a hybrid method of a virtual force algorithm and a particle swarm optimization. Finally, the effectiveness of deployment configurations is analyzed and discussed with the simulation results obtained using the algorithm proposed in this paper.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.195-202
• /
• 2006

For applying sensor networking technology for our daily life, security service is essential, and pairwise key establishment is the key point for security. In this paper, we propose fairwise key establishment mechanism for secure coumunication in sensor networks. In the mechanism, we cluster the network field before deployment and predistribute key materials to normal sensor nodes and clusterheads. For clusterheads, more key materials are predistributed, and after deployment, sensor nodes which need to establish pairwise keys with other sensor nodes in different clusters make request for related key materials to their own clusterheads. Our proposal reduces the memory requirements for normal sensor nodes by distributing more information to clusterheads, and it raises the security level and resilience against node captures. In addition, it guarantees perfect pairwise key establishments for every pair of neighboring nodes and provides efficient and secure sensor communications.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.3
• /
• pp.1307-1313
• /
• 2017

Sensor networks are composed of provide low powered, inexpensive distributed devices which can be deployed over enormous physical spaces. Coordination between sensor devices is required to achieve a common communication. In low cost, low power and short-range wireless environment, sensor networks cope with significant resource constraints. Security is one of main issues in wireless sensor networks because of potential adversaries. Several security protocols and models have been implemented for communication on computing devices but deployment these models and protocols into the sensor networks is not easy because of the resource constraints mentioned. Memory intensive encryption algorithms as well as high volume of packet transmission cannot be applied to sensor devices due to its low computational speed and memory. Deployment of sensor networks without security mechanism makes sensor nodes vulnerable to potential attacks. Therefore, attackers compromise the network to accept malicious sensor nodes as legitimate nodes. This paper provides the different security models as a metric, which can then be used to make pertinent security decisions for securing wireless sensor network communication.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.99-100
• /
• 2006

One of the fundamental problems in sensor networks is the deployment of sensor nodes. The Fuzzy C-Means(FCM) clustering algorithm is proposed to determine the optimum location and minimum number of sensor nodes for the specific application space. We performed a simulation using two dimensional L shape model. The actual length of the L shape model is about 100m each. We found the minimum number of 15 nodes are sufficient for the complete coverage of modeled area. We also found the optimum location of each nodes. The real deploy experiment using 15 sensor nodes shows the 95.7%. error free communication rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2959-2973
• /
• 2021

In wireless sensor and actuator networks (WSANs), the network lifetime is an important criterion to measure the performance of the WSAN system. Generally, the network lifetime is mainly affected by the energy of sensors. However, the energy of sensors is limited, and the batteries of sensors cannot be replaced and charged. So, it is crucial to make energy consumption efficient. WSAN introduces multiple actuators that can be regarded as multiple collectors to gather data from their respective surrounding sensors. But how to deploy actuators to reduce the energy consumption of sensors and increase the manageability of the network is an important challenge. This research optimizes actuators deployment by a proposed probabilistic mutation multi-layer particle swarm optimization algorithm to maximize the coverage of actuators to sensors and reduce the energy consumption of sensors. Simulation results show that this method is effective for improving the coverage rate and reducing the energy consumption.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.63-64
• /
• 2007

The Underwater Wireless Sensor Networks (UWSN) consists of sensor nodes equipped with limited sensing coverages, energy resources and communication capacity. Hence, the deployment and movement algorithm is a key issue that needs to be organized in order to improve the sensing efficiency of the networks. In this paper, we use a Queen problem and Knapsack problem to prevent the reiteration phenomenon of sensors, to guarantee improvement sensing coverage and efficiency in the 3D UWSN.