• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2011년도 정기총회 및 추계학술대회 논문집
• /
• pp.3104-3110
• /
• 2011

This paper describes how to ensure safety of train by guaranteeing stable and continuous communication in RF-CBTC. CBTC System uses the wireless communication between onboard and wayside so that safety of wireless communication is the most important. Losing the position of train causes vital problem of train service. By losing the position of train, the other trains are blocked in the block and the train move by emergency mode so headway and safety cannot guaranteed. Therefore, safety is ensured by redundancy of wireless equipment. One of the ways to make redundancy is redundancy of equipment. However, the redundancy of equipment spends a lot of money to avoid interference in limited place like underground. Continuous communication is guaranteed by means of redundancy of wireless communication coverage to solve the problems even though one of the equipment is broken.

• 한국멀티미디어학회논문지
• /
• 제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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3621-3640
• /
• 2016

In the process of k-coverage of the target node, there will be a lot of data redundancy forcing the phenomenon of congestion which reduces network communication capability and coverage, and accelerates network energy consumption. Therefore, this paper proposes a novel energy balanced k-coverage control algorithm based on probability model (EBKCCA). The algorithm constructs the coverage network model by using the positional relationship between the nodes. By analyzing the network model, the coverage expected value of nodes and the minimum number of nodes in the monitoring area are given. In terms of energy consumption, this paper gives the proportion of energy conversion functions between working nodes and neighboring nodes. By using the function proportional to schedule low energy nodes, we achieve the energy balance of the whole network and optimizing network resources. The last simulation experiments indicate that this algorithm can not only improve the quality of network coverage, but also completely inhibit the rapid energy consumption of node, and extend the network lifetime.

• 한국통신학회논문지
• /
• 제39B권10호
• /
• pp.708-714
• /
• 2014

무선 센서 네트워크는 일반적으로 에너지를 위해 배터리에 의존하는 밀집되게 배치된 센서 노드들로 구성된다. 이와 같이 여러 개로 밀집되게 배치된 센서 노드들은 에너지 낭비 및 센서 데이터의 높은 중복 전송을 야기한다. 상기 전원 관련 제약 및 높은 중복성과 같은 양자 문제는 센서 노드들 간의 적절한 노드 활동 스케줄링에 의해 해결될 수 있다. 본 논문에서는 우수한 커버리지 성능 보장 및 노드들 간 에너지 절약과 네트워크 수명의 연장을 위한 셀룰러 오토마타 (CA) 기반의 노드 스케줄링 알고리즘이 제안된다. 또한 CA 프레임워크에 기반하여 노드 스케줄링 알고리즘의 새로운 수학적 모델을 제안한다. 제안한 알고리즘은 스케줄링 결정을 위해 노드 내 지역 환경 조건의 변경 및 인접 노드들의 상태 정보를 이용한다. 본 논문은 제안한 방식을 적용한 시스템의 동작을 분석하고 시뮬레이션 결과를 통해 제안한 알고리즘이 센싱 커버리지 품질을 유지하면서 유의한 에너지 절약을 갖춘 에너지 균형을 보장함을 확인하였다.

• 한국통신학회논문지
• /
• 제35권7A호
• /
• pp.697-705
• /
• 2010

WSN에서의 커버리지 문제는 센싱 커버리지에 대한 요구조건을 만족시키기 위해 필요한 최소한의 활동 센서(active sensor)의 개수로 공식화될 수 있다. 일반적으로 확률적 기하학을 이용하여 WSN의 커버리지 분석을 수행하기 때문에 센싱 모델이 커버리지 분석의 핵심 요소로 간주된다. 따라서, 커버리지 분석의 정확도는 어떠한 센싱 모델을 가정하였느냐에 따라 달라질 수 있으며 분석에 사용된 센싱 모델이 얼마나 실 센싱 환경에 가깝게 특성화 되었느냐에 따라 달라진다. 본 논문에서는 Boolean 모델, Exponential 모델, Hybrid 모델 등 다양한 형태의 결정적 혹은 확률적 센싱 모델들을 조사하고 각각의 센싱 모델에 따라 일정 영역을 센싱할 수 있는 최소한의 센서 개수를 도출할 수 있는 수리적 분석을 수행하였으며 이를 통해 성능을 비교 평가하였다.

• Journal of Information Processing Systems
• /
• 제11권4호
• /
• pp.509-527
• /
• 2015

Wireless Video Sensor Networks (WVSNs) have become a leading solution in many important applications, such as disaster recovery. By using WVSNs in disaster scenarios, the main goal is achieving a successful immediate response including search, location, and rescue operations. The achievement of such an objective in the presence of obstacles and the risk of sensor damage being caused by disasters is a challenging task. In this paper, we propose a fault tolerance model of WVSN for efficient post-disaster management in order to assist rescue and preparedness operations. To get an overview of the monitored area, we used video sensors with a rotation capability that enables them to switch to the best direction for getting better multimedia coverage of the disaster area, while minimizing the effect of occlusions. By constructing different cover sets based on the field of view redundancy, we can provide a robust fault tolerance to the network. We demonstrate by simulating the benefits of our proposal in terms of reliability and high coverage.

• Journal of information and communication convergence engineering
• /
• 제10권4호
• /
• pp.329-336
• /
• 2012

For designing broadcast protocols in mobile ad hoc networks (MANETs), one of the important goals is to reduce the rebroadcast packets redundancy while reaching all the nodes in network. In this paper, we propose a probabilistic broadcasting mechanism based on selfishness and additional coverage in MANETs. Our approach dynamically adjusts the rebroadcast probability according to the extra covered area and number of neighbor nodes. By these two factors, mobile hosts can be classified into three groups: normal, low selfishness, and high selfishness groups. The nodes in the normal group forward packets for other nodes with high probability, whereas the nodes in the low selfishness group rebroadcast packets with low probability and the nodes in the high selfishness group do not rebroadcast packets. We compared our approach with simple flooding and the fixed probabilistic approach. The simulation results show that the proposed schemes can significantly reduce the number of retransmissions by up to 40% compared simple flooding and fixed probabilistic scheme without significant reduction in the network reachability and end-to-end packet delay.

• The Korean Journal of Ecology
• /
• 제2권1호
• /
• pp.1-8
• /
• 1978

Epiphytic lichens were sampled quantitatively on the cherry trees (Prunus serrulata) at Jeonju and Hadong along both north and south exposures of tat trees. Coverage of lichens was determinated for each species by 10*20cm quadrat. Lichen species diversities such as total diversity (D), mean diversity (D), Shannon diversity (D') and redundancy (R) were estimated according to Brillouin and Shannon equation. The importance value of lichen species was meassured by niche preemption model, The importance value transformed into some fraction k of the niche space. The value of k was compared with aggregation of lichens communities in to areas. The ten most important awariensis, Parmelia incurva, Parmelia crinita, Dirinaria applanta, Parmelia wallichiana, Parmelia austrosinensis and Cetraria platyphylla. The mean coverage epiphytic lichens on north side of tree was higher than of south side in two areas. The species diversities of epiphytic lichen of two areas shows that a change in the value of D' along vertical was not paralled with the D and R. In Kumsan-sa, D, D and D' increased upward along the tree of north exposure, but did not follow this trend in south, However in Sangge-sa, D, D and D' of both sides increased.

• 한국통신학회논문지
• /
• 제30권4B호
• /
• pp.170-177
• /
• 2005

Ad-Hoc 망에서 브로드캐스트는 중복적인 패킷 재전송에 기인한 오버헤드가 매우 큰 작업이다. 따라서 재전송으로 인한 오버헤드를 줄이기 위한 기존 연구로 암묵적 혹은 명시적으로 주변 노드 정보를 주고 받음으로써 패킷의 중복된 재전송을 최소화하고자 하는 연구가 진행되어져 왔다. 하지만 이 방법들은 주기적으로 주변 정보를 주고 받아야 하는 부가적인 오버헤드를 가진다. 따라서 본 논문에서는 현재 진행되는 브로드캐스트에 의해 획득 가능한 정보만으로 패킷의 전파 영역 (Coverage Area)을 지역적으로 추정함으로써 패킷 재전송을 줄이는 실용적인 브로드캐스트 기법을 제안한다. 제안하는 기법은 현재 전송되고 있는 브로드캐스트 패킷에서 추출할 수 있는 정보만을 사용하기 때문에, 주변 노드 정보를 알기 위해서 전송되는 주기적인 패킷 전송 오버헤드를 제거할 수 있다.

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