• Title/Summary/Keyword: Critical Node

Search Result 284, Processing Time 0.024 seconds

A Study on Rate-Based Congestion Control Using EWMA for Multicast Services in IP Based Networks (IP 기반 통신망의 멀티캐스팅 서비스를 위한 지수이동 가중평판을 이용한 전송률기반 폭주제어에 관한 연구)

  • Choi, Jae-Ha;Lee, Seng-Hyup;Chu, Hyung-Suk;An, Chong-Koo;Shin, Soung-Wook
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.8 no.1
    • /
    • pp.39-43
    • /
    • 2007
  • In high speed communication networks, the determination of a transmission rate is critical for the stability of a closed-loop network system with the congestion control scheme. In ATM networks, the available bit rate (ABR) service is based on a feedback mechanism, i.e., the network status is transferred to the ABR source by a resource management (RM) cell. RM cells contain the traffic information of the downstream nodes for the traffic rate control. However, the traffic status of the downstream nodes can not be directly transferred to the source node in the IP based networks. In this paper, a new rate-based congestion control scheme using an exponential weighted moving average algorithm is proposed to build an efficient feedback control law for congestion avoidance in high speed communication networks. The proposed congestion control scheme assures the stability of switch buffers and higher link utilization of the network. Moreover, we note that the proposed congestion scheme can flexibly work along with the increasing number of input sources in the network, which results in an improved scalability.

  • PDF

Design and Implementation of Fault-tolerant Communication Middleware for a High-reliable Launch Control System (고신뢰성 발사통제시스템을 위한 고장허용 통신 미들웨어 설계 및 구현)

  • Song, Dae-Ki;Jang, Bu-Cheol;Lee, Cheol-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.8
    • /
    • pp.37-46
    • /
    • 2008
  • Launch control system controls the sequence for launching missile in weapon systems. This system have to generate the engagement plan, input information and launch the missile in timeliness requirement. Such a system may fail to operate correctly either due to errors in hardware and software or due to violation of timing constraints. We presented fault-tolerant ethernet for embedded real-time system like launch control system. This approach is designed to handle network faults using dual commercial-off-the-shelf(COTS) network devices. To support fault-tolerant ethernet each node is composed dual channel ethernet and designed the communication middleware for network fault detect and recovery. Especially for time-critical system, the middleware is being developed to achieve that no point of network failure shall take down or cause loss of communication to network nodes.

A Scheduling Scheme Considering Multiple-Target Coverage and Connectivity in Wireless Sensor Networks (무선 센서 네트워크에서 다중 타겟 커버리지와 연결성을 고려한 스케줄링 기법)

  • Kim, Yong-Hwan;Han, Youn-Hee;Park, Chan-Yeol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3B
    • /
    • pp.453-461
    • /
    • 2010
  • A critical issue in wireless sensor networks is an energy-efficiency since the sensor batteries have limited energy power and, in most cases, are not rechargeable. The most practical manner relate to this issue is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy. Especially, CTC (Connected Target Coverage) problem has been considered as a representative energy-efficiency problem considering connectivity as well as target coverage. In this paper, we propose a new energy consumption model considering multiple-targets and create a new problem, CMTC (Connected Multiple-Target Coverage) problem, of which objective is to maximize the network lifetime based on the energy consumption model. Also, we present SPT (Shortest Path based on Targets)-Greedy algorithm to solve the problem. Our simulation results show that SPT-Greedy algorithm performs much better than previous algorithm in terms of the network lifetime.

Fast Handoff Technique using Improved Cashing Agent and CoA Pool in Mobile IP (모바일 아이피에서 개선된 캐싱 에이전트와 CoA 풀을 사용한 빠른 핸드오프 기법)

  • Lee, Jang-Su;Kim, Sung-Chun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.2
    • /
    • pp.75-82
    • /
    • 2008
  • Mobile IP was proposed to overcome identity problem of original IP address system caused by mobility of wireless mobile host. To complete its network handoff procedure, it must receive a mobile advertisement broadcasted by mobile agent. Generally, in a mobile IP system, mean time delay, 500ms, in a network handoff procedure is a critical problem of wireless service such as Voip, multimedia streaming. A caching agent caches a latest mobile advertisement, and replays it by receiving solicitation message from a mobile node finishing link layer detection. But, during the procedure of mobile registration, many packets from service provider to the mobile host would be lost and handoff time delay would be increased. In this thesis, we propose an unproved caching agent technique which can forward data packets while handoff procedure, and CoA pool for fast mobile IP registration.

End-to-End Performance of Packet Aggregation Transmission on MANET under DDoS Attacks (DDoS 공격이 있는 MANET에서 패킷취합전송의 종단간 성능)

  • Kim, Young-Dong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.6
    • /
    • pp.689-694
    • /
    • 2014
  • DDoS attacks on MANET makes disable any node which support network function, cause critical results as a stopping of entire network service or separation to some parts. Packet aggregation, which gather some pieces of short length into a certain length of data, improves transmission performances on MANETs. In this paper, some effects on transmission performance of packet aggregation transmission be caused by DDoS Attacks are measured and analyzed in point of end-to-end level. MANET simulator, based on NS-2, is used for measurement end-to-end performances. MOS, connection rate, delay and packet loss rate is used as performance parameters. VoIP traffic is used for object service measurement. Finally, it is suggested that number of packet aggregation is more then 4 for keeping the transmission quality over MANETs under DDoS attacks.

A FPGA Design of High Speed LDPC Decoder Based on HSS (HSS 기반의 고속 LDPC 복호기 FPGA 설계)

  • Kim, Min-Hyuk;Park, Tae-Doo;Jung, Ji-Won
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.11
    • /
    • pp.1248-1255
    • /
    • 2012
  • LDPC decoder architectures are generally classified into serial, parallel and partially parallel architectures. Conventional method of LDPC decoding in general give rise to a large number of computation operations, mass power consumption, and decoding delay. It is necessary to reduce the iteration numbers and computation operations without performance degradation. This paper studies horizontal shuffle scheduling(HSS) algorithm and self-correction normalized min-sum(SC-NMS) algorithm. In the result, number of iteration is half than conventional algorithm and performance is almost same between sum-product(SP) and SC-NMS. Finally, This paper implements high-speed LDPC decoder based on FPGA. Decoding throughput is 816 Mbps.

A study on association analysis among nodes in information diffusion and mobility pattern for mobile social networks (모바일 소셜 네트워크 환경에서 이동 패턴과 정보 유포 연관성 분석 연구)

  • Ryu, Jegwang;Yong, Sung-Bong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.05a
    • /
    • pp.90-92
    • /
    • 2017
  • Due to the popularity of social networks and the development of technology in mobile networking, the mobile social networks (MSNs) provide opportunities for the spread of information between mobile devices. As a result, understanding the information diffusion in the emerging MSNs is a critical issue. Many research studies have addressed diffusion minimization, which is a problem of how to find the proper initial k users who can effectively propagate as widely as possible in the minimum amount of time, similar to influence maximization. We address a study on association analysis among nodes in information diffusion and mobility pattern for mobile social networks. Experiments in our study were conducted in the Opportunistic Network Environment (ONE) simulator using GPS trace of mobile node, to show that the study results in MSNs. We also demonstrate that our experiments outperform other existing algorithms with various communication range and ratio of k influential nodes.

  • PDF

A Finite Element Analysis of Circular Plate Resting on Elasto-Plastic Soil Medium (탄소성(彈塑性) 지반(地盤)위에 놓인 원형평판(圓形平板)의 유한요소(有限要素) 해석(解析))

  • Kim, Sung Deuk;Chang, Sung Pil
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.7 no.4
    • /
    • pp.91-102
    • /
    • 1987
  • In this study, the finite element method using 8-node isoparametric element is developed theoretically and simulated to see the deformation of soil and plate, when the circular plate resting on Boussinesq's soil type is loaded axisymmetrically. The results of numerical analysis using the Mohr-Coulomb yield criterion, and experimental analysis are approximative, assuming that soil is elasto-plastic medium. The paper shows that the plastic zone of soil medium is displayed at the near the edge of plate at the first place; when the plastic zone of soil medium is linked around central axis, the external load is termed by critical load, and then the contact pressure changes abruptly, in this case it is approved to be the risk of shear failure.

  • PDF

A Study on Complex Field Network Coding Scheme for Wireless Relay System (무선 릴레이 시스템에서의 Complex Field Network Coding 기법 적용에 관한 연구)

  • Hwang, Won-Jun;Jang, Jun-Hee;Choi, Hyung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4C
    • /
    • pp.241-253
    • /
    • 2011
  • In this paper, a CFNC (Complex Field Network Coding) scheme is presented, which focuses on improving transmission efficiency by reducing time slots that are needed to exchange data frames. Conventional CFNC scheme has the advantage of minimizing the number of time slots required for information exchanges. However, there exists serious performance deterioration because the transmit signals are interfered with each other. Moreover, when CFNC scheme is applied, the estimation and compensation performance of fine frequency offset severely deteriorates due to the multiple frequency offsets in received signal of relay node. In order to overcome these critical problems, we propose an improved CFNC scheme with modified maximum likelihood decision method which uses uplink transmit diversity. Also, we propose an enhanced fine frequency offset estimation method and a corresponding compensation method to deal with the multiple frequency offsets. Corresponding simulation results verify that the proposed methods are able to effectively solve the problems of CFNC scheme.

Adaptive Timeout Scheduling for Energy-Efficient, Reliable Data Aggregation in Wireless Sensor Network (무선 센서 네트워크에서 에너지 효율적이고 신뢰성이 높은 데이터 병합을 위한 적응적 타임아웃 스케줄링 기법)

  • Baek, Jang-Woon;Nam, Young-Jin;Seo, Dae-Wha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5B
    • /
    • pp.326-333
    • /
    • 2008
  • In wireless sensor networks, a sensor node with in-network aggregation adjusts the timeout which is a waiting time to receive messages from child nodes. This paper proposes a novel timeout scheduling scheme for data aggregation in wireless sensor networks, which adaptively configures its timeout according to changing data patterns in order to improve energy efficiency and data accuracy during data aggregation. The proposed scheme decreases the timeout when the temporal difference of collected data(data variation) from children is lower than a pre-defined threshold because there is no occurrence of critical events. Conversely, it increases the timeout when the data variation is higher than the pre-defined threshold in order to fulfill more accurate data aggregation. Extensive simulation reveals that the proposed scheme outperforms the cascading-based scheme in terms of energy consumption and data accuracy.