• Journal of Communications and Networks
• /
• 제17권3호
• /
• pp.231-240
• /
• 2015

To facilitate the base station planning in high speed railway communication systems, it is necessary to consider the functional relationships between the base station transmit power and space parameters such as train velocity and cell radius. Since these functions are able to present some inherent system properties determined by its spatial topology, they will be referred to as the power-space functions in this paper. In light of the fact that the line-of-sight path persists the most power of the received signal of each passing train, this paper considers the average transmission rate and bounds on power-space functions based on the additive white Gaussian noise channel (AWGN) model. As shown by Monte Carlo simulations, using AWGN channel instead of Rician channel introduces very small approximation errors, but a tractable mathematical framework and insightful results. Particularly, lower bounds and upper bounds on the average transmission rate, as well as transmit power as functions of train velocity and cell radius are presented in this paper. It is also proved that to maintain a fixed amount of service or a fixed average transmission rate, the transmit power of a base station needs to be increased exponentially, if the train velocity or cell radius is increased, respectively.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.499-510
• /
• 2007

Shortest path tree(SPT) construction is essential in high performance routing in an interior network using link state protocols. When some links have new state values, SPTs may be rebuilt, but the total rebuilding of the SPT in a static way for a large computer network is not only computationally expensive, unnecessary modifications can cause routing table instability. This paper presents a new update algorithm, dynamic shortest path tree(DSPT) that is computationally economical and that maintains the unmodified nodes mostly from an old SPT to a new SPT. The proposed algorithm reduces redundancy using a dynamic update approach where an edge becomes the significant edge when it is extracted from a built edge list Q. The average number of significant edges are identified through probability analysis based on an arbitrary tree structure. An update derived from significant edges is more efficient because the DSPT algorithm neglect most other redundant edges that do not participate in the construction of a new SPT. Our complexity analysis and experimental results show that DSPT is faster than other known methods. It can also be extended to solve the SPT updating problem in a graph with negative weight edges.

• 한국전자통신학회논문지
• /
• 제13권1호
• /
• pp.127-132
• /
• 2018

무인비행체와 관련된 기술의 주요 이슈 중 하나는 충돌 회피이다. 특히, 다중 무인비행체 간의 충돌 회피는 무인비행체의 응용분야를 다수의 무인비행체가 제한된 공간에서 운영되는 민간 분야로 확장하기 위하여 매우 중요한 기술이다. 본 논문에서는 FANET(: Flying Ad Hoc Network)에 기반을 둔 충돌 회피 방안을 소개한다. 제안된 방식은 무선 데이터통신에서 사용되는 충돌회피 방식과 유사한 방법을 채택한다. 이 방식을 통하여 무인비행체들은 통상적인 사용자 정보를 주고받을 뿐만 아니라 충돌 회피를 위한 비행 정보도 공유한다.

• Structural Engineering and Mechanics
• /
• 제37권6호
• /
• pp.575-592
• /
• 2011

For seismic resistant design of critical structures, a dynamic analysis, either response spectrum or time history is frequently required. Owing to the lack of recorded data and the randomness of earthquake ground motion that may be experienced by structure in the future, usually it is difficult to obtain recorded data which fit the requirements (site type, epicenteral distance, etc.) well. Therefore, the artificial seismic records are widely used in seismic designs, verification of seismic capacity and seismic assessment of structures. The purpose of this paper is to develop a numerical method using Artificial Neural Network (ANN) and wavelet packet transform in best basis method which is presented for the decomposition of artificial earthquake records consistent with any arbitrarily specified target response spectra requirements. The ground motion has been modeled as a non-stationary process using wavelet packet. This study shows that the procedure using ANN-based models and wavelet packets in best-basis method are applicable to generate artificial earthquakes compatible with any response spectra. Several numerical examples are given to verify the developed model.

• 대한의용생체공학회:의공학회지
• /
• 제35권3호
• /
• pp.68-74
• /
• 2014

Recent research on mild cognitive impairment (MCI) has shown that cognitive and memory decline in this disease is accompanied by disruptive changes in the brain functional network. However, there have been no graph-theoretical studies using $^{11}C$-PIB PET data of the Alzheimer's Disease or mild cognitive impairment. In this study, we acquired $^{18}F$-FDG PET and $^{11}C$-PIB PET images of twenty-four normal aging control participants and thirty individuals with MCI from ADNI (Alzheimer's Disease Neuroimaging Initiative) database. Brain networks were constructed by thresholding binary correlation matrices using graph theoretical approaches. Both normal control and MCI group showed small-world property in $^{11}C$-PIB PET images as well as $^{18}F$-FDG PET images. $^{11}C$-PIB PET images showed significant difference between NC (normal control) and MCI over large range of sparsity values. This result will enable us to further analyze the brain using established graph-theoretical approaches for $^{11}C$-PIB PET images.

• 시스템엔지니어링학술지
• /
• 제2권2호
• /
• pp.45-50
• /
• 2006

Tilting technology is to tilt the train on the curve in order to minimize centrifugal force to passengers and to improve the speed within the limits of passenger's comfort and safety. According to reports from other countries, there is 15~30% speed improvement compared to the conventional trains. Recently, the advent of World-Wide-Web(WWW) and the explosive popularity of the Internet gave birth to collaborative applications which were enabled by computers and networks as their primary media. The progress of 3D computer graphics enabled collaborative applications with 3D virtual environments or distributed virtual environments. In this paper, we explain our implementation of the Share collaboration engine which is for collaboration applications based on a distributed virtual environment. The Share collaboration engine proposes a new Share network architecture for management of participants, and it provides some synchronization methods for 3D objects in virtual collaboration. TTX_PDM is an experimental application that tries to prevent wastes of human, material and time resources in networked virtual collaboration.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제9권6호
• /
• pp.131-136
• /
• 2020

차량 환경의 통신에서 콘텐츠의 사전 캐싱은 사용자로부터 콘텐츠 서버까지의 지연시간을 감소시킬 수 있다. 하지만 어디에, 어느 량 만큼의 사전 캐싱을 해야하는 지에 대한 문제점은 아직도 해결되지 않고 있다. 본 논문에서는 차량의 이동 확률을 토대로 차량이 다음으로 이동하게 될 기지국 후보들에게 각각 최적화된 량만큼의 콘텐츠를 분산시켜 사전 캐싱하는 방안을 제시한다. 우선, 각 차량의 이동 확률은 Markov Chain을 이용하여 학습되었다. 그리고 분산하여 사전 캐싱할 콘텐츠의 량은 무선 환경을 기반으로 최적화되었다. NS-3를 기반으로 진행된 실험에서 제안방안은 기존 방안에 비하여 최소의 지연시간을 유지하며 트래픽을 가장 많이 절약한 결과가 도출되었다.

• 한국시뮬레이션학회논문지
• /
• 제12권4호
• /
• pp.25-40
• /
• 2003

With the growing usage of the networks, the world-wide Internet has become the main means to exchange data and carry out transactions. It has also become the main means to attack hosts. To solve the security problems which occur in the network such as Internet, we import software products of network security elements like an IDS (Intrusion Detection System) and a firewall. In this paper, we have designed and constructed the general simulation environment of network security model composed of multiple IDSes and a firewall which coordinate by CNP (Contract Net Protocol) for the effective detection of the intrusion. The CNP, the methodology for efficient integration of computer systems on heterogeneous environment such as distributed systems, is essentially a collection of agents, which cooperate to resolve a problem. Command console in the CNP is a manager who controls the execution of agents or a contractee, who performs intrusion detection. In the network security model, each model of simulation environment is hierarchically designed by DEVS(Discrete Event system Specification) formalism. The purpose of this simulation is that the application of rete pattern-matching algorithm speeds up the inference cycle phases of the intrusion detection expert system and we evaluate the characteristics and performance of CNP architecture with rete pattern-matching algorithm.

• 융합정보논문지
• /
• 제10권7호
• /
• pp.1-6
• /
• 2020

본 논문에서는 셀 간 정보의 공유를 통한 협력이 가능한 연결된 네트워크 구조를 갖는 5G Cloud RAN 네트워크에 적용이 가능한 새로운 자원 관리 알고리즘을 제안한다. 제안 알고리즘은 네트워크 협력의 이점을 활용하여 공정성과 처리량을 동시에 증가시킨다. 이러한 네트워크 성능 최적화는 허용이 가능한 양의 신호 처리 오버헤드 및 계산 복잡도 내에서 달성될 수 있으며 시뮬레이션 결과는 셀 외곽 사용자에 대한 네트워크 용량이 기존의 방법 대비 40% 가량 향상되었으며 사용자간 공정성 또한 Jain의 공평성 지수를 기준으로 약 23% 향상되었음을 확인하였다.

• ETRI Journal
• /
• 제38권6호
• /
• pp.1145-1152
• /
• 2016

Because the nodes in a wireless sensor network (WSN) are mobile and the network is highly dynamic, monitoring every node at all times is impractical. As a result, an intruder can attack the network easily, thus impairing the system. Hence, detecting anomalies in the network is very essential for handling efficient and safe communication. To overcome these issues, in this paper, we propose a rule-based anomaly detection technique using roaming honeypots. Initially, the honeypots are deployed in such a way that all nodes in the network are covered by at least one honeypot. Honeypots check every new connection by letting the centralized administrator collect the information regarding the new connection by slowing down the communication with the new node. Certain predefined rules are applied on the new node to make a decision regarding the anomality of the node. When the timer value of each honeypot expires, other sensor nodes are appointed as honeypots. Owing to this honeypot rotation, the intruder will not be able to track a honeypot to impair the network. Simulation results show that this technique can efficiently handle the anomaly detection in a WSN.