• 한국멀티미디어학회논문지
• /
• 제24권3호
• /
• pp.431-439
• /
• 2021

Since the sensor nodes are randomly arranged in the region of interest, it may happen that the sensor network area is separated or there is no sensor node in some area. In addition, after the sensor nodes are deployed in the sensor network, a coverage hole may occur due to the exhaustion of energy or physical destruction of the sensor nodes. The coverage hole can greatly affect the overall performance of the sensor network, such as reducing the data reliability of the sensor network, changing the network topology, disconnecting the data link, and worsening the transmission load. Therefore, sensor network coverage hole recovery has been studied. Existing coverage hole recovery studies present very complex geometric methods and procedures in the two-step process of finding a coverage hole and recovering a coverage hole. This study proposes a method for discovering and recovering a coverage hole in a sensor network, discovering that the sensor node is a boundary node by itself, and determining the location of a mobile node to be added. The proposed method is expected to have better efficiency in terms of complexity and message transmission compared to previous methods.

• 한국컴퓨터정보학회논문지
• /
• 제24권4호
• /
• pp.169-176
• /
• 2019

Wireless sensor networks are used to monitor and control areas in a variety of military and civilian areas such as battlefield surveillance, intrusion detection, disaster recovery, biological detection, and environmental monitoring. Since the sensor nodes are randomly placed in the area of interest, separation of the sensor network area may occur due to environmental obstacles or a sensor may not exist in some areas. Also, in the situation where the sensor node is placed in a non-relocatable place, some node may exhaust energy or physical hole of the sensor node may cause coverage hole. Coverage holes can affect the performance of the entire sensor network, such as reducing data reliability, changing network topologies, disconnecting data links, and degrading transmission load. It is possible to solve the problem that occurs in the coverage hole by finding a coverage hole in the sensor network and further arranging a new sensor node in the detected coverage hole. The existing coverage hole detection technique is based on the location of the sensor node, but it is inefficient to mount the GPS on the sensor node having limited resources, and performing other location information processing causes a lot of message transmission overhead. In this paper, we propose an Adjacent Matrix-based Hole Coverage Discovery(AMHCD) scheme based on connectivity of neighboring nodes. The method searches for whether the connectivity of the neighboring nodes constitutes a closed shape based on the adjacent matrix, and determines whether the node is an internal node or a boundary node. Therefore, the message overhead for the location information strokes does not occur and can be applied irrespective of the position information error.

• Journal of Communications and Networks
• /
• 제11권1호
• /
• pp.57-71
• /
• 2009

Networking together hundreds or thousands of cheap sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. As sensor nodes are typically battery operated, it is important to efficiently use the limited energy of the nodes to extend the lifetime of the wireless sensor network (WSN). One of the fundamental issues in WSNs is the coverage problem. In this paper, the border coverage problem in WSNs is rigorously analyzed. Most existing results related to the coverage problem in wireless sensor networks focused on planar networks; however, three dimensional (3D) modeling of the sensor network would reflect more accurately real-life situations. Unlike previous works in this area, we provide distributed algorithms that allow the selection and activation of an optimal border cover for both 2D and 3D regions of interest. We also provide self-healing algorithms as an optimization to our border coverage algorithms which allow the sensor network to adaptively reconfigure and repair itself in order to improve its own performance. Border coverage is crucial for optimizing sensor placement for intrusion detection and a number of other practical applications.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 가을 학술발표논문집 Vol.33 No.2 (D)
• /
• pp.791-795
• /
• 2006

하이브리드 센서 네트워크에서 static sensor node들이 초기 배치된 후, coverage-hole을 결정하여, hole을 커버할 mobile sensor node들의 필요한 수 및 위치를 결정하고 배치하는 연구는 상당한 수준에 이르렀다. 그러나 mobile sensor node들을 호출하고 배치하는데 너무 많은 에너지를 소모하고 있다. 본 논문에서는 coverage-hole에서 mobile sensor node들을 호출하기 전에 mobile sensor node들을 최대한 coverage-hole에 가깝게 배치하여, 호출하는데 소요되는 에너지를 획기적으로 절감하였다.

• Journal of Communications and Networks
• /
• 제16권5호
• /
• pp.493-501
• /
• 2014

Coverage completeness is an important indicator for quality of service in wireless sensor networks (WSN). Due to limited energy and diverse working conditions, the sensor nodes have different lifetimes which often cause network holes. Most of the existing methods expose large limitation and one-sidedness because they generally consider only one aspect, either coverage rate or energy issue. This paper presents a novel method for coverage hole detection with residual energy in randomly deployed wireless sensor networks. By calculating the life expectancy of working nodes through residual energy, we make a trade-off between network repair cost and energy waste. The working nodes with short lifetime are screened out according to a proper ratio. After that, the locations of coverage holes can be determined by calculating the joint coverage probability and the evaluation criteria. Simulation result shows that compared to those traditional algorithms without consideration of energy problem, our method can effectively maintain the coverage quality of repaired WSN while enhancing the life span of WSN at the same time.

• 대한지리학회지
• /
• 제43권2호
• /
• pp.220-234
• /
• 2008

안전과 보안이 현대사회의 중요한 관심사로 등장하고 있고 그 대상 영역이 실내 공간으로 넘어서 도시로 확대되고 있다. 도심지역에 수 많은 감시 센서들이 설치 운영되고 있다. 많은 보안 모니터링 맥락에서 감시 센서/네트워크의 수행능력 혹은 효율성은 조명의 변화와 같은 환경 조건에 제약을 받는다. 서로 보완적인 상이한 유형의 센서를 설치함으로써 개별 유형의 센서의 고장 혹은 한계를 극복할 수 있다는 것은 익히 잘 알려진 사실이다. 입지 분석과 모델링의 관점에서 관심사는 어떻게 보완적인 상이한 유형의 센서들의 적절한 입지를 결정하여 보안기능을 강화할 수 있느냐 이다. 이 연구는 k 개의 상이한 유형의 감시 센서의 위치를 결정하는 커버리지 기반의 최적화 모델을 제시한다. 이 모델은 상이한 유형의 센서 사이의 공통 커버리지와 동일 유형의 센서 사이의 중복 커버지리를 동시에 고려한다. 개발된 모델은 도심 지역에 센서를 위치시키는데 적용된다. 연구 결과는 공통 및 중복 커버리지가 동시에 모델링 될 수 있으며, 두 유형의 커버지리 사이의 tradeoff를 보여주는 많은 해들이 있음을 보여준다.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제4권9호
• /
• pp.425-430
• /
• 2015

센서 레지스트리 시스템(Sensor Registry System, SRS)은 이기종 센서 네트워크 환경에서 센서 데이터의 즉각적 활용 및 끊김 없는 해석을 위해 사용자에게 센서 메타데이터를 제공한다. 하지만 기존 SRS는 네트워크 연결이 지원되지 않거나 신호가 불안정한 경우에 센서 메타데이터를 안정적으로 제공할 수 없다. 이 논문에서는 이러한 문제를 해결하기 위해, 네트워크 커버리지 정보를 이용한 센서 레지스트리 시스템 확장 방법을 제안한다. 제안 방법은 예측한 경로와 네트워크 커버리지에 대한 오픈 데이터(통신사, 신호 강도, 통신 타입)를 이용하여 사용자가 불안정한 네트워크 지역에 도착하기 전에 해당 지역의 센서 메타데이터를 추가로 송신한다. 이 논문에서 제안한 확장된 SRS는 사용자에게 보다 안정적으로 센서 메타데이터를 제공함으로써 응용서비스의 품질을 향상시킨다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권6호
• /
• pp.2658-2679
• /
• 2018

This paper proposes a novel Random Scheduling Algorithm based on Subregion Coverage (RSASC), to solve the SET K-cover problem (an NP-complete problem). SET K-cover problem distributes the set of sensors into the maximum number of mutually exclusive subsets (MESSs) in such a way that each of them can be scheduled for lifetime extension of WSN. Sensor coverage divides the target region into different subregions. RSASC first sorts the subregions in the ascending order concerning their sensor coverage. Then, it forms the subregion groups according to their similar sensor coverage. Lastly, RSASC ensures the K-coverage of each subregion from every group by randomly scheduling the sensors. We consider the target-coverage and area-coverage applications of WSN to analyze the usefulness of our proposed RSASC algorithm. The distinct quality of RSASC is that it utilizes less number of deployed sensors (33% less) to form the optimum number of MESSs with the higher computational speed (saves more than 93% of the time) as compared to the existing three algorithms.

• 한국정보과학회논문지:시스템및이론
• /
• 제35권8호
• /
• pp.385-393
• /
• 2008

사용자가 가능한 센서 가까이에서 이동하는 문제를 최단거리유지 문제(Best Coverage Problem)라 하며, 무선 연결의 안정성을 높이기 위해서 두 개의 센서로부터 최대한 가까이 위치하며 움직이는 이동경로를 차선거리유지 경로(Second Best Coverage Path)라고 한다. 이 논문에서는 센서들의 집합 U와 시작점 s, 끝점 t가 주어질 때, s에서 t까지 이르는 모든 경로 중에서, 가장 가까운 두 개의 센서까지 거리 중 큰 값이 최소가 되는 차선거리유지 경로를 찾는 O(n logn)-시간 알고리즘을 제시하며, 차선거리유지 경로를 따라 움직일 때가 최단거리유지 경로를 따라 움직일 때 보다, 네트워크에의 연결이 보다 안정적임을 보여주는 실험결과도 또한 제시한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권10호
• /
• pp.4804-4822
• /
• 2017

Coverage problem is a research hot spot in directional sensor networks (DSNs). However, the major problem affecting the performance of the current coverage-enhancing strategies is that they just optimize the coverage of networks, but ignore the maximum number of sleep sensors to save more energy. Aiming to find an approximate optimal method that can cover maximum area with minimum number of active sensors, in this paper, a new scheduling algorithm based on learning automata is proposed to enhance area coverage, and shut off redundant sensors as many as possible. To evaluate the performance of the proposed algorithm, several experiments are conducted. Simulation results indicate that the proposed algorithm have effective performance in terms of coverage enhancement and sleeping sensors compared to the existing algorithms.