• 한국군사과학기술학회지
• /
• 제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)
• /
• 제16권11호
• /
• pp.3544-3564
• /
• 2022

With the development of the NB-IoT (Narrow band Internet of Things) and smart cities, coupled with the emergence of smart smoke sensors, new requirements and issues have been introduced to study on the deployment of sensors in large spaces. Previous research mainly focuses on the optimization of wireless sensors in some monitoring environments, including three-dimensional terrain or underwater space. There are relatively few studies on the optimization deployment problem of smart smoke sensors, and leaving large spaces with obstacles such as libraries out of consideration. This paper mainly studies the deployment issue of smart smoke sensors in large spaces by considering the fire probability of fire areas and the obstacles in a monitoring area. To cope with the problems of coverage blind areas and coverage redundancy when sensors are deployed randomly in large spaces, we proposed an optimized deployment strategy of smart smoke sensors based on the PSO (Particle Swarm Optimization) algorithm. The deployment problem is transformed into a multi-objective optimization problem with many constraints of fire probability and barriers, while minimizing the deployment cost and maximizing the coverage accuracy. In this regard, we describe the structure model in large space and a coverage model firstly, then a mathematical model containing two objective functions is established. Finally, a deployment strategy based on PSO algorithm is designed, and the performance of the deployment strategy is verified by a number of simulation experiments. The obtained experimental and numerical results demonstrates that our proposed strategy can obtain better performance than uniform deployment strategies in terms of all the objectives concerned, further demonstrates the effectiveness of our strategy. Additionally, the strategy we proposed also provides theoretical guidance and a practical basis for fire emergency management and other departments to better deploy smart smoke sensors in a large space.

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

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

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.1951-1972
• /
• 2018

Wi-Fi Access Point (AP) optimization approaches are used in indoor positioning systems for signal coverage enhancement, as well as positioning precision improvement. Although the huge power consumption of the AP optimization forms a serious problem due to the signal coverage requirement for large-scale indoor environment, the conventional approaches treat the problem of power consumption independent from the design of indoor positioning systems. This paper proposes a new Fast Water-filling algorithm Group Power Constraint (FWA-GPC) based Wi-Fi AP optimization approach for indoor positioning in which the power consumed by the AP optimization is significantly considered. This paper has three contributions. First, it is not restricted to conventional concept of one AP for one candidate AP location, but considered spare APs once the active APs break off. Second, it utilizes the concept of water-filling model from adaptive channel power allocation to calculate the number of APs for each candidate AP location by maximizing the location fingerprint discrimination. Third, it uses a fast version, namely Fast Water-filling algorithm, to search for the optimal solution efficiently. The experimental results conducted in two typical indoor Wi-Fi environments prove that the proposed FWA-GPC performs better than the conventional AP optimization approaches.

• 한국통신학회논문지
• /
• 제38B권1호
• /
• pp.18-25
• /
• 2013

본 논문에서는 차세대 이종망 환경에서 펨토셀이 자율적으로 커버리지를 조절하는 방안을 제안한다. 펨토셀의 커버리지가 펨토셀이 설치된 실내 영역보다 큰 경우 펨토셀 커버리지를 통과하는 실외 단말에 의해 핸드오버 요청이 발생하여 불필요한 signaling을 증가시키고 이에 따라 overhead가 커지게 된다. 펨토셀의 커버리지가 펨토셀이 설치된 실내 영역보다 작은 경우 실내에 위치한 단말이 펨토셀에 연결되지 못하는 문제가 발생한다. 따라서 본 논문에서는 펨토셀 커버리지가 실내영역과 일치하도록 자율적으로 전송 전력을 조절하는 방법을 제안한다. 제안 기법은 펨토셀이 스스로 얻을 수 있는 정보인 핸드오버 요청 및 단말의 펨토셀에 대한 결합등록(membership) 여부를 이용함으로써 자율적인 커버리지 조절을 가능 하게 한다. 제안 기법의 성능 분석을 위해 먼저 커버리지를 실내영역과 일치시키는 펨토셀 전송 전력의 이론값을 도출한다. 이후 제안 기법을 모의실험에 적용하여 분석한 결과에서 펨토셀의 전송 전력이 자율적으로 조절되어 이론값으로 수렴함을 보인다.

• 지능정보연구
• /
• 제16권4호
• /
• pp.99-112
• /
• 2010

앙상블 학습은 분류 및 예측 알고리즘의 성과개선을 위하여 제안된 기계학습 기법이다. 그러나 앙상블 학습은 기저 분류자의 다양성이 부족한 경우 다중공선성 문제로 인하여 성과개선 효과가 미약하고 심지어는 성과가 악화될 수 있다는 문제점이 제기되었다. 본 연구에서는 기저 분류자의 다양성을 확보하고 앙상블 학습의 성과개선 효과를 제고하기 위하여 유전자 알고리즘 기반의 범위 최적화 기법을 제안하고자 한다. 본 연구에서 제안된 최적화 기법을 기업 부실예측 인공신경망 앙상블에 적용한 결과 기저 분류자의 다양성이 확보되고 인공신경망 앙상블의 성과가 유의적으로 개선되었음을 보여주었다.

• Journal of Biosystems Engineering
• /
• 제38권1호
• /
• pp.18-24
• /
• 2013

Purpose: This study was conducted to develop an optimal combine scheduling program using Max-Coverage algorithm which derives the maximum efficiency for a specific location in harvest seasons. Methods: The combine scheduling program was operated with information about combine specification and farmland. Four operating types (Max-Coverage algorithm type, Boustrophedon path type, max quality value type, and max area type) were selected to compare quality and working capacity. Result: The working time of Max-Coverage algorithm type was shorter than others, and the total quality value of Max-Coverage algorithm and max quality value type were higher than others. Conclusion: The developed combine scheduling program using Max-Coverage algorithm will provide optimal operation and maximum quality in a limited area and time.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2000년도 춘계학술대회 논문집
• /
• pp.330-335
• /
• 2000

Faults detection and containment requirements are typically allocated from a top-level specification as a percentage of total faults detection and containment, weighted by failure rate. This faults detection and containments are called as a fault coverage. The fault coverage requirements are typically allocated identically to all units in the system, without regard to complexity, cost of implementation or failure rate for each units. In this paper a simple methodology and mathematical model to support the allocation of system fault coverage rates to lower-level units by considering the inherent differences in reliability is presented. The models are formed as a form of constrained optimization. The objectives and constraints are modeled as a linear form and this problems are solved by linear programming. It is identified by simulation that the proposed solving methods for these problems are effective to such requirement allocating.

• 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.