• 한국통신학회논문지
• /
• 제36권8A호
• /
• pp.691-701
• /
• 2011

방향센서네트워크에서 주어진 모든 타켓을 관측하고 관측한 데이터를 싱크노드까지 전달한다는 요구사항을 유지하면서 에너지를 효율적으로 절약하여 전체 네트워크 수명을 최대화하는 것은 중요한 문제이다. 본 논문에서는 이와 관련하여 Maximum Directional Cover Tree(MDCT) 문제를 제시하고 방향센서들을 그룹화하여 네트워크 수명을 최대화하는 문제를 다룬다. 모든 타켓을 관측하고 관측한 데이터를 싱크노드까지 전달하는데 참여하는 센서들을 활성상태로 설정하고 그렇지 않은 센서들은 수면상태로 설정함으로써 에너지를 효율적으로 활용할 수 있는 휴리스틱 알고리즘인 Directional Coverage and Connectivity (DCC)-greedy 알고리즘을 제시하여 MDCT문제를 해결한다. 제안 알고리즘에서는 타켓을 관측하고 관측한 데이터 전달에 드는 에너지 외에 방향 회전에너지까지 고려함으로써 방향센서가 소비하는 에너지를 좀 더 정확하게 고려한다 마지막으로 시뮬레이션을 통해 제안 알고리즘이 네트워크 수명을 증가시킬 수 있음을 보인다.

• Journal of Communications and Networks
• /
• 제16권3호
• /
• pp.335-343
• /
• 2014

This paper considers the crucial problem of deploying wireless relays for achieving a connected wireless sensor network in indoor environments, an important aspect related to the management of the sensor network. Several algorithms have been proposed for ensuring full sensing coverage and network connectivity. These algorithms are not applicable to indoor environments because of the complexity of indoor environments, in which a radio signal can be dramatically degraded by obstacles such as walls. We first prove theoretically that the indoor relay placement problem is NP-hard. We then predict the radio coverage of a given relay deployment in indoor environments. We consider two practical scenarios; wire-connected relays and radio-connected relays. For the network with wire-connected relays, we propose an efficient greedy algorithm to compute the deployment locations of relays for achieving the required coverage percentage. This algorithm is proved to provide a $H_n$ factor approximation to the theoretical optimum, where $H_n=1+{\frac{1}{2}}+{\cdots}+{\frac{1}{n}}={\ln}(n)+1$, and n is the number of all grid points. In the network with radio-connected relays, relays have to be connected in an ad hoc mode. We then propose an algorithm based on the previous algorithm for ensuring the connectivity of relays. Experimental results demonstrate that the proposed algorithms achieve better performance than baseline algorithms.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2015년도 춘계학술대회
• /
• pp.116-119
• /
• 2015

다수의 이동센서노드를 이용한 환경감시 알고리즘을 제안한다. 제안하는 알고리즘은 사전 정보가 없는 개활 지역에서 이동센서노드들을 배치하여 센싱 커버리지를 최대화 하는 것을 목적으로 한다. 이동센서노드는 보다 높은 센싱 커버리지를 획득하기 위하여 최대의 센싱 커버리지를 획득할 때 까지 반복적으로 재배치된다. 커버리지 최대화를 위하여 ILP(Integer Linear Programming) 기반의 최적화 문제를 구성한다. 시뮬레이션 결과에 의하면 제안된 알고리즘은 이동센서노드들을 보다 높은 관심지역으로 이동시킬 수 있으며 최대의 센싱 커버리지 획득이 가능함을 시뮬레이션을 통하여 검증한다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 추계학술발표대회
• /
• pp.131-132
• /
• 2009

지형의 상태를 알 수 없는 타겟 지역에 구축되는 USN 환경은 각기 서로 다른 connectivity degree와 이동 가능한 센서들의 수를 가지면서 coverage의 최대화를 요구한다. 본 논문에서 설계한 모바일 센서 네트워크 시뮬레이터(MSNS)는 USN 환경을 GML로 구성하고, 각 센서들의 센싱/통신 범위가 설정된 센서 노드들의 수와 유지해야할 connectivity를 입력받아 주어진 조건에서 타겟 영역이 얼마나 효율적으로 coverage되는지를 가시화한다.

• 한국컴퓨터정보학회논문지
• /
• 제19권8호
• /
• pp.63-71
• /
• 2014

본 논문은 싱크 기반 무선 센서 액터 네트워크에서 액터의 연결성과 커버리지를 향상시키기 위하여 홉 거리를 기반으로 클러스터를 구성하는 알고리즘을 제안한다. 제안한 알고리즘은 싱크로부터 일정한 홉 간격으로 CH(Cluster Head)를 선출함으로써 목표영역에 고르게 분포된 센서 클러스터를 생성한다. CH 선출은 CH 위치에 배치되는 액터들과 싱크의 연결성을 보장하기 위해서 싱크로부터 순차적으로 진행된다. 또한 액터의 커버리지를 향상시키기 위해서 센서 밀도가 높은 영역부터 우선적으로 이루어진다. 제안한 알고리즘을 통하여 일정한 분포로 클러스터를 구성하여 중첩을 최소화함으로써 목표영역에서 생성되는 클러스터 수와 CH 위치에 배치되는 액터 수를 감축한다. 시뮬레이션을 수행하여 제안한 알고리즘이 싱크에 연결이 보장된 액터 네트워크를 형성함을 검증하였다. 그리고 기존의 IDSC 알고리즘에 비해 액터 커버리지를 향상시킴으로써 배치되는 액터 수를 9~20% 감축함을 확인하였다.

• ETRI Journal
• /
• 제43권4호
• /
• pp.702-716
• /
• 2021

This work proposes suitable network configurations for single frequency networks (SFNs) with ATSC 1.0 based on network coverage calculations and the laboratory multipath handling performance of commercial receivers. SFNs are widely used for delivering terrestrial digital television services because of their efficient use of the spectrum. In Mexico the analogue television transmissions switch-off occurred on 31 December 2016. Thus it is expected the adopted ATSC 1.0 system will be in force for the next several years despite the recent standardization of the ATSC 3.0 system. As ATSC 1.0 uses 8-VSB modulation the multipath handling capability of receivers is critical for the design of SFNs. The presented network planning results help develop technical normativity for implementing SFNs in Mexico and other countries that use ATSC 1.0. SFNs with transmitter separation up to 130 km are fully covered for outdoor reception mainly due to the directivity of the receiving antenna. Moreover for indoor reception at least 70% of an SFN coverage area can be achieved with a transmitter separation of up to 60 km depending on the radiated power and the transmitter antenna height.

• 한국군사과학기술학회지
• /
• 제23권4호
• /
• pp.407-416
• /
• 2020

Recent complex battle field demands Network Centric Warfare(NCW) ability to control various parts into a cohesive unit. In path planning filed, the NCW ability increases complexity of path planning algorithm, and it has to consider a communication coverage map as well as traditional parameters such as minimum radar exposure and survivability. In this paper, pros and cons of various propagation models are summarized, and we suggest a coverage map generation method using a Longley-Rice propagation model. Previous coverage map based on line of sight has significant discontinuities that limits selection of path planning algorithms such as Dijkstra and fast marching only. If there is method to remove discontinuities in the coverage map, optimization based path planning algorithms such as trajectory optimization and Particle Swarm Optimization(PSO) can also be used. In this paper, the Longley-Rice propagation model is used to calculate continuous RF strengths, and convert the strength data using smoothed leaky BER for the coverage map. In addition, we also suggest other types of rough coverage map generation using a lookup table method with simple inputs such as terrain type and antenna heights only. The implemented communication coverage map can be used various path planning algorithms, especially in the optimization based algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1260-1283
• /
• 2019

Low earth orbit (LEO) satellite broadband network is a crucial part of the space information network. LEO satellite constellation design is a top-level design, which plays a decisive role in the overall performance of the LEO satellite network. However, the existing works on constellation design mainly focus on the coverage criterion and rarely take network performance into the design process. In this article, we develop a unified framework for constellation optimization design in LEO satellite broadband networks. Several design criteria including network performance and coverage capability are combined into the design process. Firstly, the quality of service (QoS) metrics is presented to evaluate the performance of the LEO satellite broadband network. Also, we propose a network stability model for the rapid change of the satellite network topology. Besides, a mathematical model of constellation optimization design is formulated by considering the network cost-efficiency and stability. Then, an optimization algorithm based on non-dominated sorting genetic algorithm-II (NSGA-II) is provided for the problem of constellation design. Finally, the proposed method is further evaluated through numerical simulations. Simulation results validate the proposed method and show that it is an efficient and effective approach for solving the problem of constellation design in LEO satellite broadband networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권2호
• /
• pp.326-354
• /
• 2014

In this paper, a new green clustering algorithm is proposed to be as a first approach in the framework of an energy efficient strategy for centralized enterprise high-density WLANs. Traditionally, in order to maintain the network coverage, all the APs within the WLAN have to be powered-on. Nevertheless, the new algorithm can power-off a large proportion of APs while the coverage is maintained as its always-on counterpart. The two main components of the new approach are the faster procedure based on K-means and the more accurate procedure based on Evolutionary Algorithm (EA), respectively. The two procedures are processes in parallel for different designed requirements and there is information interaction in between. In order to implement the new algorithm, EA is applied to handle the optimization of multiple objectives. Moreover, we adapt the method for selection and recombination, and then introduce a new operator for mutation. This paper also presents simulations in scenarios modeled with ray-tracing method and FDTD technique, and the results show that about 67% to 90% of energy consumption can be saved while it is able to maintain the original network coverage during periods when few users are online or the traffic load is low.

• 대한간호학회지
• /
• 제41권3호
• /
• pp.423-431
• /
• 2011

Purpose: The study was designed to determine the discriminating ability of a Bayesian network (BN) for predicting risk for pressure ulcers. Methods: Analysis was done using a retrospective cohort, nursing records representing 21,114 hospital days, 3,348 patients at risk for ulcers, admitted to the intensive care unit of a tertiary teaching hospital between January 2004 and January 2007. A BN model and two logistic regression (LR) versions, model-I and .II, were compared, varying the nature, number and quality of input variables. Classification competence and case coverage of the models were tested and compared using a threefold cross validation method. Results: Average incidence of ulcers was 6.12%. Of the two LR models, model-I demonstrated better indexes of statistical model fits. The BN model had a sensitivity of 81.95%, specificity of 75.63%, positive and negative predictive values of 35.62% and 96.22% respectively. The area under the receiver operating characteristic (AUROC) was 85.01% implying moderate to good overall performance, which was similar to LR model-I. However, regarding case coverage, the BN model was 100% compared to 15.88% of LR. Conclusion: Discriminating ability of the BN model was found to be acceptable and case coverage proved to be excellent for clinical use.