• Title/Summary/Keyword: Reliable Networks

Search Result 686, Processing Time 0.027 seconds

A Study on Estimating Route Travel Time Using Collected Data of Bus Information System (버스정보시스템(BIS) 수집자료를 이용한 경로통행시간 추정)

  • Lee, Young Woo
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.33 no.3
    • /
    • pp.1115-1122
    • /
    • 2013
  • Recently the demands for traffic information tend to increase, and travel time might one of the most important traffic information. To effectively estimate exact travel time, highly reliable traffic data collection is required. BIS(Bus Information System) data would be useful for the estimation of the route travel time because BIS is collecting data for the bus travel time on the main road of the city on real-time basis. Traditionally use of BIS data has been limited to the realm of bus operating but it has not been used for a variety of traffic categories. Therefore, this study estimates a route travel time on road networks in urban areas on the basis of real-time data of BIS and then eventually constructs regression models. These models use an explanatory variable that corresponds to bus travel time excluding service time at the bus stop. The results show that the coefficient of determination for the constructed regression model is more than 0.950. As a result of T-test performance with assistance from collected data and estimated model values, it is likely that the model is statistically significant with a confidence level of 95%. It is generally found that the estimation for the exact travel time on real-time basis is plausible if the BIS data is used.

Upper Bounds for the Performance of Turbo-Like Codes and Low Density Parity Check Codes

  • Chung, Kyu-Hyuk;Heo, Jun
    • Journal of Communications and Networks
    • /
    • v.10 no.1
    • /
    • pp.5-9
    • /
    • 2008
  • Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

A Nulling Anti-Jamming Scheme for the Polyphase Filter Bank-Based Satellite Repeat System (다상 필터 뱅크 기반의 위성 중계시스템을 위한 항재밍 기법의 연구)

  • Oh, Jin-O;Im, Sung-Bin;Ko, Hyun-Suk
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.7
    • /
    • pp.39-47
    • /
    • 2012
  • The combination of the broadband property and the wide area coverage of satellite communications enables high speed transmission. Every user in the region under the satellite beam coverage can tranceiver and one can simultaneously communicate with multiple users. For these reasons, it is one of commendable telecommunication networks for information transfer. Since the satellite communications use open channels, it is likely to cause jamming with unwanted interference signals. In the thesis, APSK (Amplitude Phase Shift Keying) is employed, which is recommended for DVB-S2 due to high-speed transmission and excellent bandwidth efficiency. For obtaining reliable communication under the jamming environments, the communication satellite transponder rests on the polyphase filter bank structure, which enables switching among the subchannels and gain control on each subchannel, resulting in effectively eliminating jamming. Furthermore, the nulling scheme, one of the various anti-jamming approaches, is investigated, in which unwanted jamming signals are eliminated in the frequency domain after passing through the analysis part of the polyphase filter bank. The performance of the nulling scheme is evaluated for tone jamming and partial band jamming in terms of BER and EVM. The simulation results indicate that the nulling scheme improve the BER and EVM performance over the case without any anti-jamming approach.

Development of Multi-Site Daily Rainfall Simulation Based on Homogeneous Hidden Markov Chain Model Coupled with Chow-Liu Tree Structures (Chow-Liu Tree 모형과 동질성 Hidden Markov Model을 연계한 다지점 일강수량 모의기법 개발)

  • Kwon, Hyun-Han;Kim, Tae Jeong;Kim, Oon Ki;Lee, Dong Ryul
    • Journal of Korea Water Resources Association
    • /
    • v.46 no.10
    • /
    • pp.1029-1040
    • /
    • 2013
  • This study aims to develop a multivariate daily rainfall simulation model considering spatial coherence across watershed. The existing Hidden Markov Model (HMM) has been mainly applied to single site case so that the spatial coherences are not properly addressed. In this regard, HMM coupled with Chow-Liu Tree (CLT) that is designed to consider inter-dependences across rainfall networks was proposed. The proposed approach is applied to Han-River watershed where long-term and reliable hydrologic data is available, and a rigorous validation is finally conducted to verify the model's capability. It was found that the proposed model showed better performance in terms of reproducing daily rainfall statistics as well as seasonal rainfall statistics. Also, correlation matrix across stations for observation and simulation was compared and examined. It was confirmed that the spatial coherence was well reproduced via CLT-HMM model.

Mutual Authentication Method between Wireless Mesh Enabled MSAPs in the Next-generation TICN (차세대 전술정보통신체계에서의 무선 메쉬 MSAP 노드 간 상호 인증 기법)

  • Son, Yu-Jin;Bae, Byoung-Gu;Shon, Tae-Shik;Ko, Young-Bae;Lim, Kwang-Jae;Yun, Mi-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.5B
    • /
    • pp.385-394
    • /
    • 2012
  • The tactical mobile communication network, which comprises a part of the next-generation Tactical Information and Communication Network (TICN), provides means of communication and control for Tactical Multi-Functional Terminals (TMFT) belonging to a Mobile Subscriber Access Point (MSAP). The next-generation of MSAP is capable of constructing a backbone network via LCTR and HCTR directional antennas. At the same time, WMN modules are used to create and manage a wireless mesh backbone. When directional antennas are used in mobile environments, seamless services cannot be efficiently supported as the movement of the node prevents the angle of the antenna to constantly match. Therefore, data communication through the wireless mesh networks is required to provide direct communication between mobile MSAPs. Accordingly, mutual authentication and data encryption mechanisms are required to provide reliable data transmission in this environment. To provide efficient mutual authentication between MSAP devices, the process of verifying a certificate of the other MSAP device through its own authentication server is required. This paper proposes mutual authentication mechanisms where the MSAP requiring authentication and the MSAP that permits it initiates low-cost and efficient authentication in a distributed way. More specifically, we propose a method of applying EAP-ELS (Extensible Authentication Protocol-Transport Layer Security) in the next-generation TICN.

Acceleration sensor, and embedded system using location-aware (가속센서를 이용한 위치인식과 임베디드시스템)

  • Roh, Chang-Bae;Na, Won-Shik
    • Journal of Convergence Society for SMB
    • /
    • v.3 no.2
    • /
    • pp.51-56
    • /
    • 2013
  • Real-time processing of sensor data network, is one of the important factors. Each node in the detected data are required to be transmitted within a certain time since the accurate processing is possible. Thus, the data nodes are successfully delivered within a specified time, it is very important to check whether the. Recently more and more accurate real-time embedded systems are reliable and haejyeoseo been able to provide sophisticated services. Because of the inherent complexity of embedded systems in the physical world and the difficulty of predicting the difficulty of a safe design constraints on the runtime violation of system as to cause unexpected causes. Each node data in time detected by the time required to be passed in the appropriate processing is possible because the data transfer time in this paper, the monitoring of the sensor network through a node are allowed to exist within the time range and transmits data to the server Analysis of the data transfer time for checking whether the system was implemented. Implementation of the data transmission time to the process for analyzing and presenting, according to the procedure suggested by the transit time required for analysis a time difference analysis method, a data collection method and a data transmission time and transmission time calculating method presented.

  • PDF

Water Quality Analysis of Hongcheon River Basin Under Climate Change (기후변화에 따른 홍천강 유역의 수질 변화 분석)

  • Kim, Duckhwan;Hong, Seung Jin;Kim, Jungwook;Han, Daegun;Hong, Ilpyo;Kim, Hung Soo
    • Journal of Wetlands Research
    • /
    • v.17 no.4
    • /
    • pp.348-358
    • /
    • 2015
  • Impacts of climate change are being observed in the globe as well as the Korean peninsula. In the past 100 years, the average temperature of the earth rose about 0.75 degree in celsius, while that of Korean peninsula rose about 1.5 degree in celsius. The fifth Assessment Report of IPCC(Intergovermental Panel on Climate Change) predicts that the water pollution will be aggravated by change of hydrologic extremes such as floods and droughts and increase of water temperature (KMA and MOLIT, 2009). In this study, future runoff was calculated by applying climate change scenario to analyze the future water quality for each targe period (Obs : 2001 ~ 2010, Target I : 2011 ~ 2040, Target II : 2041 ~ 2070, Target III : 2071 ~ 2100) in Hongcheon river basin, Korea. In addition, The future water quality was analyzed by using multiple linear regression analysis and artificial neural networks after flow-duration curve analysis. As the results of future water quality prediction in Hongcheon river basin, we have known that BOD, COD and SS will be increased at the end of 21 century. Therefore, we need consider long-term water and water quality management planning and monitoring for the improvement of water quality in the future. For the prediction of more reliable future water quality, we may need consider various social factors with climate components.

A Maximally Disjoint Multipath Routing Protocol Based on AODV in Mobile Ad Hoc Networks (모바일 애드혹 네트워크에서의 AODV 기반 치대 비중첩 다중경로 라우팅 프로토콜)

  • Kim Jungtae;Moh Sangman;Chung Ilyong
    • The KIPS Transactions:PartC
    • /
    • v.12C no.3 s.99
    • /
    • pp.429-436
    • /
    • 2005
  • A mobile ad hoc network (MANET) is a collection of mobile nodes without any fixed infrastructure or my form of centralized administration such as access points and base stations. The ad hoc on-demand distance vector routing (AODV) protocol is an on-demand routing protocol for MANETs, which is one of the Internet-Drafts submitted to the Internet engineering task force (IETF) MANET working group. This paper proposes a new multipath routing protocol called maximally disjoint multipath AODV (MDAODV), which exploits maximally node- and link-disjoint paths and outperforms the conventional multipath protocol based on AODV as well as the basic AODV protocol. The key idea is to extend only route request (RREQ) message by adding source routing information and to make the destination node select two paths from multiple RREQs received for a predetermined time period. Compared to the conventional multipath routing protocol, the proposed MDAODV provides more reliable and robust routing paths and higher performance. It also makes the destination node determine the maximally node- and link-disjoint paths, reducing the overhead incurred at intermediate nodes. Our extensive simulation study shows that the proposed MDAODV outperforms the conventional multipath routing protocol based on AODV in terms of packet delivery ratio and average end-to-end delay, and reduces routing overhead.

The hybrid of artificial neural networks and case-based reasoning for intelligent diagnosis system (인공 신경경망과 사례기반추론을 혼합한 지능형 진단 시스템)

  • Lee, Gil-Jae;Kim, Chang-Joo;Ahn, Byung-Ryul;Kim, Moon-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.15B no.1
    • /
    • pp.45-52
    • /
    • 2008
  • As the recent development of the IT services, there is a urgent need of effective diagnosis system to present appropriate solution for the complicated problems of breakdown control, a cause analysis of breakdown and others. So we propose an intelligent diagnosis system that integrates the case-based reasoning and the artificial neural network to improve the system performance and to achieve optimal diagnosis. The case-based reasoning is a reasoning method that resolves the problems presented in current time through the past cases (experience). And it enables to make efficient reasoning by means of less complicated knowledge acquisition process, especially in the domain where it is difficult to extract formal rules. However, reasoning by using the case-based reasoning alone in diagnosis problem domain causes a problem of suggesting multiple causes on a given symptom. Since the suggested multiple causes of given symptom has the same weight, the unnecessary causes are also examined as well. In order to resolve such problems, the back-propagation learning algorithm of the artificial neural network is used to train the pairs of the causes and associated symptoms and find out the cause with the highest weight for occurrence to make more clarified and reliable diagnosis.

A study on simplification of SWMM for prime time of urban flood forecasting -a case study of Daerim basin- (도시홍수예보 골든타임확보를 위한 SWMM유출모형 단순화 연구 -대림배수분구를 중심으로-)

  • Lee, Jung-Hwan;Kim, Min-Seok;Yuk, Gi-Moon;Moon, Young-Il
    • Journal of Korea Water Resources Association
    • /
    • v.51 no.1
    • /
    • pp.81-88
    • /
    • 2018
  • The rainfall-runoff model made of sewer networks in the urban area is vast and complex, making it unsuitable for real-time urban flood forecasting. Therefore, the rainfall-runoff model is constructed and simplified using the sewer network of Daerim baisn. The network simplification process was composed of 5 steps based on cumulative drainage area and all parameters of SWMM were calculated using weighted area. Also, in order to estimate the optimal simplification range of the sewage network, runoff and flood analysis was carried out by 5 simplification ranges. As a result, the number of nodes, conduits and the simulation time were constantly reduced to 50~90% according to the simplification ranges. The runoff results of simplified models show the same result before the simplification. In the 2D flood analysis, as the simplification range increases by cumulative drainage area, the number of overflow nodes significantly decreased and the positions were changed, but similar flooding pattern was appeared. However, in the case of more than 6 ha cumulative drainage area, some inundation areas could not be occurred because of deleted nodes from upstream. As a result of comparing flood area and flood depth, it was analyzed that the flood result based on simplification range of 1 ha cumulative drainage area is most similar to the analysis result before simplification. It is expected that this study can be used as reliable data suitable for real-time urban flood forecasting by simplifying sewer network considering SWMM parameters.