• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권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.

• 전기전자학회논문지
• /
• 제11권3호
• /
• pp.100-107
• /
• 2007

무선 센서 네트워크에서 중요한 문제 중 하나는 센서 노드들의 최적 배치, 즉 측정하고자 하는 지역을 모두 커버할 수 있는 최소 센서 노드 수를 산출하고 배치 위치를 결정하는 일이다. 본 논문에서는 이러한 문제를 해결하기 위한 방법으로 제안한 Fuzzy C-Means 클러스터링을 이용하여 측정하고자 하는 지역에서의 최적의 노드 배치와 최소 노드의 수를 시뮬레이션을 통해 도출하였고, 실험을 통하여 검증하였다. 시뮬레이션은 3가지 타입의 2차원 지역을 모델로 하여 수행하였다. 모델링한 지역은 6M${\times}$10M의 직사각형, 50M${\times}$20M의 직사각형, 100M${\times}$80M의 ‘L’ 자 형태의 지역으로 하였으며, 각각 9개, 9개, 15개 노드의 위치를 결정하였다. 실제 실험결과 각 지역에 대해서 94.6%, 92.2%, 95.7%의 정확도를 가진 통신 연결을 확인할 수 있었다.

• 한국통신학회논문지
• /
• 제35권1B호
• /
• pp.106-116
• /
• 2010

센서들은 최대 관찰영역 확보, 신뢰성 있는 데이터 획득, 센서의 효율적 자원관리 등을 위하여 최적의 위치에 배치되어야 한다. 전통적인 고정형 무선 센서 네트워크에서는 미개발 지역, 군사 지역, 재난 지역 등의 경우에는 사람이 직접 센서를 배치하는 것이 불가능하다. 따라서 이러한 경우 각 센서가 이동 능력을 겸비하고 있다면 스스로 주변 센서들의 위치를 인식하고 그 정보를 활용하여 전체 영역을 관찰할 수 있다. 우리는 이전 연구를 통해 각 센서가 이웃의 위치 좌표를 통해 계산된 보로노이 다각형의 도심으로 이동하는 것이 높은 커버리지 확보에 효율적임을 보인 바 있다. 본 논문에서는 보로노이 다각형의 도심을 활용하는 방안과 전통적인 포텐셜 필드 방식에 의한 센서 움직임 방법을 접목하여 보다 향상된 자율 배치 방법을 제안한다. 또한, 시뮬레이션을 통하여 제안한 센서 자율 배치 방법이 단순하게 포텐셜 필드만을 활용하였을 때 보다 적은 이동으로 빠른 시간 안에 높은 커버리지를 확보함을 보인다.

• 한국통신학회논문지
• /
• 제33권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.

• 한국군사과학기술학회지
• /
• 제18권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.

• 정보처리학회논문지C
• /
• 제13C권2호
• /
• pp.195-202
• /
• 2006

센서 네트워크를 실생활에 적용하기 위해서는 보안 서비스가 반드시 같이 제공되어야하며 보안에 있어서 핵심은 노드 간에 안전한 통신을 가능하게 하는 pairwise 키 설정이다. 본 연구에서는 센서 네트워크를 사전에 클러스터링하고 각 클러스터에 헤드를 두어 기본적인 정보는 사전에 예측된 배치정보에 의해 배분하고 노드 배치 후 실제적으로 이웃 노드를 파악하여 정보가 필요한 노드들만이 클러스터헤드에게 해당 정보를 요청하는 메커니즘을 제안한다. 제안 메커니즘은 클러스터헤드가 좀 더 많은 정보를 사전 분배받는 대신 일반 노드의 메모리 부담을 훨씬 줄였으며 불필요한 정보를 분배하지 않음으로써 노드 포획 시에도 이에 대한 저항성을 높여 보안성을 한층 강화할 수 있을 뿐 아니라 모든 이웃 노드 간 직접키 설정을 보장함으로써 효율적인 키 설정과 통신이 가능하다.

• Journal of Electrical Engineering and Technology
• /
• 제12권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• 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)
• /
• 제15권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• 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.