Practical Node Deployment Scheme Based on Virtual Force for Wireless Sensor Networks in Complex Environment

( Lu Wei ),( Yang Yuwang ),( Zhao Wei ),( Wang Lei ) 한국인터넷정보학회 2015 KSII Transactions on Internet and Information Syst Vol.9 No.3

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.

Energy-Efficient Cooperative Beamforming based CMISO Transmission with Optimal Nodes Deployment in Wireless Sensor Networks

( Gan Xiong ),( Lu Hong ),( Yang Guangyou ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.8

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.

저온 저장고 환경에서 보로노이 다이어그램을 이용한 센서 노드 배치 기법

전승우,홍봉희,권준호 한국정보과학회 2012 데이타베이스 연구 Vol.28 No.3

농산물의 유통 과정에서 저온 저장고를 두고 그 내부에 온도, 습도, CO2등을 체크할 수 있는 센서를 설치하여 신선도를 유지하고 관리한다. 현재 운용 중에 있는 저온 저장고는 임의의 위치에 센서를 부착하여 측정함으로써 저장고 내부의 상태를 사용자의 요구 사항에 맞도록 조절한다. 하지만, 저온 저장고의 내부 별 온도는냉장 쿨러 맞은 벽면, 저장고 입구 등의 위치에 따른 영향과 각 농산물의 품온에 따른 영향에 의해 각각 다르다. 따라서 상이한 내부 별 온도를 측정하기 위해서는 센서에 대한 정확한 위치 선정이 필요하다. 간단한 위치선정으로는 센서 측정 범위를 이용하여 중첩되는 정도에 따라 일렬로 센서를 나열하여 부착하는 것이다. 이것은 고정된 중첩 영역을 이용하여 센서의 위치를 고려하기 때문에, 센서의 총 개수를 줄이기 힘들어 지며, 그에따른 센서 장비 구입비용이 커지게 된다. 이러한 단점을 극복하기 위하여, 본 논문에서는 보로노이 다이어그램을 이용한 저장고 내부 센서 배치 기법을 제안한다. 이 기법은 영역 분할, 영역 비교 및 다음 센서 위치 선정의3단계로 구성된다. 즉, 기준점을 이용하여 1차 분할하며, 분할된 보로노이 다각형 영역의 꼭지점과 기준점과의길이를 구한 다음, 가장 거리가 먼 꼭짓점을 다음 센서 위치를 선정한다. 다만, 인접한 두 센서 간 과도한 중첩영역이 발생한다면 선정된 센서를 삭제한다. 따라서, 이 기법을 이용하여 저장고 내부의 공간을 적절히 분할하여 그 곳에 센서를 설치하면 격자 설치에 비하여 총 센서의 개수를 줄일 뿐만 아니라, 내부의 온도 측정을보다 더 정확하게 얻을 수 있게 된다. Cold storehouse is used for storing perishable food items. It is commonly used in an agricultural products distribution. It is also easy to configure because there are installed sensor nodes inside. The sensor nodes are monitoring the temperature, humidity, and CO2 level. This attribute are important to maintain the freshness of the agricultural products. Put the sensor nodes randomly and adjust the internal state of cold storehouse based on user requirement. However, overall temperature in the storehouse maybe different depends on the location of sensor, such as opposite cooler, storehouse entrance and fermented material temperature. Therefore we need to put the sensor in the right place. One way to do this are using sensor nodes simple positioning; we put the sensor node in a line according to static overlapping area of sensor range. But if we are using this method, it is difficult to decrease the number of sensors. Eventually it leads to a bigger cost for preparing the sensor node. For solving the problem of decreasing the number of sensor, we propose a technique which designed for sensor node deployment by using Voronoi diagram. Voronoi diagram consists of 3 steps: area partitioning, territory comparison, and location selection of the next sensor. We divide a plane area based on the reference point and then comparing the length of each edge point and sensor point. The most distant point is selected as the location of the next sensor. However, if there is an excessive overlapped area between two neighboring sensors,that location selection is deleted. By using this technique we can decrease the number of sensor nodes and also decrease the received sensing value.

Cluster Head Election with Hexagonal Node Deployment Technique in Wireless Sensor Networks

Tripti Sharma,G.S.Tomar,Ishaan Berry,Aarti Kapoor,Suhani Jasuja 보안공학연구지원센터 2016 International Journal of Future Generation Communi Vol.9 No.1

Wireless Sensor Networks (WSNs) are a network of large number of wireless sensor nodes deployed over a wide geographical area. The sensor nodes have a limited amount of memory as well as power. Excess extent of energy is dissipated during data transmission to the base station (sink) from normal sensor nodes. The efficient way of prolonging the lifetime of sensor nodes is clustering which optimizes the energy dissipation of WSNs. In this paper, a homogenous clustering algorithm based on fuzzy logic has been proposed in which cluster head election is done with the help of two fuzzy descriptors namely residual energy and proximity distance. The sensor nodes have been hexagonally deployed in the homogenous environment. This covers the sensing area efficiently along with reducing the redundancy in data being transmitted by the sensor nodes. This algorithm has been compared with the low energy adaptive clustering hierarchy (LEACH) protocol. The simulation results show that the proposed approach outperforms the LEACH protocol in terms of number of data packets transmitted to base station, energy consumption and prolonged network lifetime.

Network Localization with Assisting Nodes

Carlos A. Gomez-Vega,Zhenyu Liu,Carlos A. Gutierrez,Andrea Conti,Moe Z. Win 한국통신학회 2021 한국통신학회 학술대회논문집 Vol.2021 No.2

Location awareness in wireless networks depends on propagation conditions, transmitting resources, and nodes deployment. A well designed node deployment strategy can enhance the localization performance significantly. In this paper, we present a near-optimal algorithm for deploying assisting nodes in localization networks with limited infrastructure. First, we formulate the node deployment task as an optimization problem to minimize the localization error of an agent. Then, we develop a node deployment algorithm based on this formulation. Finally, we present a case study to validate the proposed algorithm.

무선 센서 네트워크의 최적화 노드배치에 관한 연구

최원갑,박형무,Choi, Weon-Gap,Park, Hyung-Moo 한국전기전자학회 2007 전기전자학회논문지 Vol.11 No.3

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

센서 네트워크에서 표적의 위치 정확도 향상을 위한 클러스터링을 이용한 정보 융합과 센서 노드 배치에 관한 연구

전기남(Ki-Nam Jun),백승호(Seung-Ho Baek),임병욱(Byung-Wook Im),유연상(Youn-Sang Yoo) 한국정보기술학회 2017 한국정보기술학회논문지 Vol.15 No.3

In order to improve the location accuracy of a target, various methods for improving the performance of a single sensor node have been studied in sensor network. However, there is little research to improve the location accuracy using data fusion and sensor node deployment at system level. Therefore, this paper proposed a method to improve the location accuracy using data fusion and sensor node deployment. We implemented the proposed data fusion system and simulated various sensor node deployments. As a result, the proposed method improved the location accuracy of about 1.67m. In addition, we have found an optimal deployment that satisfies a required performance under limited sensor node resources.

A New Group Key Management Protocol for WSN

Tegshbayar,이상민,박종서 한국융합보안학회 2008 융합보안 논문지 Vol.8 No.1

Sensor networks have a wide spectrum of military and civil applications, particularly with respect to security and secure keys for encryption and This thesis presents a new centralized approach which focuses on the group key distribution with revocation capability for Wireless Sensor Networks. We propose a new personal key share distribution. When utilized, this approach proves to be secure against k-number of illegitimate colluding nodes. In contrast to related approaches, our scheme can overcome the shortcomings while keeping the small overhead requirements per node. It will be shown that our scheme is unconditionally secure and achieves both forward secrecy and backward secrecy. The analysis is demonstrated in terms of communication and storage heads.

Node Deployment Algorithm Based on Improved Steiner Tree

Xuemei Sun 보안공학연구지원센터 2015 International Journal of Multimedia and Ubiquitous Vol.10 No.7

Wireless sensor networks are being applied to a wider and wider range and better quality of network service is becoming increasingly important. Node deployment has been a key point of research on development of wireless sensor network. In essence, the problem node deployment of wireless sensor networks calculates the position where sensors are placed in regions to satisfy specific demands of network. This problem has been proved to be a NP-complete one. This thesis proposes node deployment algorithm about wireless sensor networks based on Steiner tree algorithm. On the basis of the triangle Steiner tree algorithm, it considers the two aspects algorithm complexity and practical topology to design improvement strategies. The algorithm can ensure high arithmetic speed and better results to solve node deployment based on network connectivity.

센서네트워크 연결성 강화를 위한 거점 노드 혼합 배치 기법 연구

허노정(Nojeong Heo) 대한전자공학회 2014 전자공학회논문지 Vol.51 No.6

센서노드를 활용한 응용이 증가함에 따라 센서네트워크의 장기적 운용과 성능을 보장할 수 있는 현실적 배치 문제 해결 기법이 요구되고 있다. 특히 네트워크 연결성은 네트워크 전체 수명에도 영향을 줄 뿐만 아니라 근거리 센싱 정보의 취합 능력에도 직접적인 연관성을 갖는다. 센서네트워크의 구축 시 요구되는 경제적인 이유와 함께 센서 노드가 배치될 필드의 접근성 문제로 임의 배치 기법이 주로 사용되고 있으나 센서노드의 불균일로 인한 연결성 문제, 비효율적 네트워크 구성 등이 발생할 수 있다. 본 논문에서는 초기 배치 노드의 성능을 최대한 활용할 수 있도록 거점 노드의 혼합 배치 기법을 제안한다. 혼합 배치를 통해 기존 센서 노드의 불균형을 완화시키면서 추가되는 혼합 노드의 수를 효과적으로 줄일 수 있는 밀도 분석을 시행하였다. 실험 결과를 통하여 제안하는 기법이 단일 센서노드로 구성된 기존의 배치 방식 보다 좋은 결과를 얻을 수 있음을 보였다. 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.