• Title/Summary/Keyword: 멀티 링크

Search Result 481, Processing Time 0.031 seconds

Design and Performance Evaluation of a New SR-ARQ with an Adaptive Timer and Delayed NAK for Improving Handover Performance in Next-Generation Mobile Communication Networks (차세대 이동 통신망에서 핸드오버 성능 향상을 위한 적응형 타이머와 지연 NAK을 이용한 SR-ARQ 설계 및 성능 평가)

  • Park, Man-Kyu;Choi, Yun-Chul;Lee, Jae-Yong;Kim, Byung-Chul;Kim, Dae-Young;Kim, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.1
    • /
    • pp.48-59
    • /
    • 2009
  • Next generation mobile communication system will have various access networks and provide seamless multimedia data service to mobile nodes. The WiNGS system, one of these access network, has superior RAT(Radio Access Technology) and network connectivity other than previous ones. In this paper, we propose link-layer SR-ARQ between mobile node and WAGW to solve packet re-ordering problem during handover. In the proposed scheme, we apply the adaptive timer at the SR-ARQ sender to reduce unnecessary packet retransmission during handoff and delayed NAK algorithm at the SR-ARQ receiver for delaying NAK response due to temporary out-of-sequenced frames. We evaluate the performance of the proposed scheme by implementing the new SR-ARQ protocol at the link-layer using ns-2 simulator, and show the handover performance is improved greatly by preventing unnecessary retransmission.

Adaptive Multi-Tap Equalization for Removing ICI Caused by Transmitter Power Transient in LTE Uplink System (LTE 상향 링크 시스템에서 송신기의 전력 과도 현상에 의해 발생하는 ICI를 제거하기 위한 적응적 멀티 탭 등화 기법)

  • Chae, Hyuk-Jin;Cho, Il-Nam;Kim, Dong-Ku
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.20 no.8
    • /
    • pp.701-713
    • /
    • 2009
  • This paper studies a method for reducing performance degradation due to losing sub-carrier orthogonality caused by power transient between physical channels in LTE uplink transmission. The pattern of inter-carrier interference(ICI) caused by power transient is different from what has been studied for doppler shift, in that its pattern occurs at front and rear sides of channels in each period of power transient. The reason of ICI's occurrence results from power difference between channels, power transient duration, multi-path channel delay spread, and numbers of sub-carrier. New criterion is proposed to find out number of taps of multi-tap equalizer enough to improve the ICI. The scheme is to determine the number of taps of multi-tap equalizer when a normalized interference or a normalized ICI is greater than a normalized noise. Simulation results show that the number of taps is flexibly adjusted according to SNR(Signal to Noise Ratio) of a received signal to improve Bit Error Rate(BER), while the complexity of the proposed scheme is reduced down to 88 percentage of the classical method.

Dynamic QoS Support Protocol (동적인 네트워크 QoS 설비 방안)

  • 노희경;문새롬;이미정
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04a
    • /
    • pp.265-267
    • /
    • 2002
  • 인터넷에서 멀티미디어 응용들이 증가함에 따라 서비스 품질(QoS: Quality of Service)을 보장해 줄 수 있는 여러 가지 방안이 제안되어 왔는데, 일반적으로 이들 방안은 확장성과 종단간 QoS 보장 간에 상호 모순이 발생하는 경향을 가지고 있다. 본 논문에서는 이와 같은 상호 모순을 피할 수 있는 QoS 지원 방안으로서 DQSP(Dynamic QoS Support Protocol)를 제안한다. DQSP는 도메인 내에서의 자원 예약과 연결 수락 제어 메커니즘을 정의한다. DQSP는 링크 자원을 각 에지 라우터로부터의 트래픽 클래스별로 동적으로 할당하고 에지 라이투가 자신에게 할당된 링크 자원에 관한 정보를 유지하도록 한다. DQSP는 목적지로의 연결 수락 제어를 위한 QoS 신호 프로토콜이 필요 없이 에지 라우터에서 매 사용자 플로우별로 직접적으로 연결 수락 결정을 내리므로 확장성 문제 및 코어 라우터의 복잡한 기능 요구 사항 문제를 해결한다. 또한 UQSP는 에지 라우터가 트래픽 부하에 따라 자신에게 할당되어 있는 자원을 반납하거나 추가적인 자원을 제공받을 수 있도록 해 자원 오버 프로비져닝으로 인해 발생할 수 있는 비효율적인 자원 활용 문제를 해결한다. 또한 DQSP는 경로 재계산을 수행하여 라우팅을 조정해 나감으로써 효율적일 네트워크 자원 활용이 가능하다. 시뮬레이션을 통하여 DQSP와 기존의 자원 할당 및 공유 방식들을 비교한 결과 DQSP가 시그널링과 상태 정보 유지를 위한 오버헤드 면에서 기존의 종단간 QoS 보장을 제공하는 구조인 IntServ에서와 같은 확장성 문제를 발생시키지 않으면서도 효율적으로 네트워크 자원을 활용할 수 있음을 확인할 수 있었다.재 상용화 되어있는 Bellcore 의 S/KEY 시스템과의 비교를 수행하였다. 분석에서는 제품의 효율성뿐만 아니라 보안성을 중요하게 생각하였으며, 앞으로 보안 관련 소프트웨어 개발에 사용될 수 있는 도구들이 가이드 라인에 대한 정보를 제공한다.용할 수 있는지 세부 설계를 제시한다.다.으로서 hemicellulose구조가 polyuronic acid의 형태인 것으로 사료된다. 추출획분의 구성단당은 여러 곡물연구의 보고와 유사하게 glucose, arabinose, xylose 함량이 대체로 높게 나타났다. 점미가 수가용성분에서 goucose대비 용출함량이 고르게 나타나는 경향을 보였고 흑미는 알칼리가용분에서 glucose가 상당량(0.68%) 포함되고 있음을 보여주었고 arabinose(0.68%), xylose(0.05%)도 다른 종류에 비해서 다량 함유한 것으로 나타났다. 흑미는 총식이섬유 함량이 높고 pectic substances, hemicellulose, uronic acid 함량이 높아서 콜레스테롤 저하 등의 효과가 기대되며 고섬유식품으로서 조리 특성 연구가 필요한 것으로 사료된다.리하였다. 얻어진 소견(所見)은 다음과 같았다. 1. 모년령(母年齡), 임신회수(姙娠回數), 임신기간(姙娠其間), 출산시체중등(出産時體重等)의 제요인(諸要因)은 주산기사망(周産基死亡)에 대(對)하여 통계적(統計的)으로 유의(有意)한 영향을 미치고 있어 $25{\sim}29$세(歲)의 연령군에서, 2번째 임신과 2번째의 출산에서 그리고 만삭의 임신 기간에, 출산시체중(出産時體重) $3.50{\sim}3.99kg$사이의 아이에서 그 주산기사망률(周産基死亡率)이 각각

  • PDF

Low Cost and Acceptable Delay Unicast Routing Algorithm Based on Interval Estimation (구간 추정 기반의 지연시간을 고려한 저비용 유니캐스트 라우팅 방식)

  • Kim, Moon-Seong;Bang, Young-Cheol;Choo, Hyun-Seung
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.263-268
    • /
    • 2004
  • The end-to-end characteristic Is an important factor for QoS support. Since network users and required bandwidths for applications increase, the efficient usage of networks has been intensively investigated for the better utilization of network resources. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The DCLC(Delay Constrained 1.east Cost) path problem has been shown to be NP-hard problem. The path cost of LD path is relatively more expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper, we investigate the performance of heuristic algorithm for the DCLC problem with new factor which is probabilistic combination of cost and delay. Recently Dr. Salama proposed a polynomial time algorithm called DCUR. The algorithm always computes a path, where the cost of the path is always within 10% from the optimal CBF. Our evaluation showed that heuristic we propose is more than 38% better than DCUR with cost when number of nodes is more than 200. The new factor takes in account both cost and delay at the same time.

Implementation of Clinical Microbiology Images CAI System Using Web (Web을 이용한 임상미생물 화상 CAI 시스템의 구현)

  • Koo Bong-Oh;Shin Yong-Won
    • The Journal of the Korea Contents Association
    • /
    • v.4 no.4
    • /
    • pp.45-51
    • /
    • 2004
  • The number of development in educational software is currently decreasing despite rapid improvement in computer technology. This is partly due to the fact that the current software relies on the conventional hypermedia method or on the hierarchical method, both of which have inherent limitations. To compensate their limitations while keeping their merits, a hybrid method called the structured hypermedia link method has recently been proposed in the literature. It has been found that the structured hypermedia link method is far superior than the conventional methods in terms of educational effectiveness because it can help a learner to search various data by navigating between the study topics on his own while maintaining his level of cognitively overloaded stress to the minimum. The clinical microbiology laboratories were chosen as the candidate site for this study because its educational system has not been standardized and has been relying heavily on the personal experience. In this study, the hypermedia link method was applied to the development of an education system for the image analysis in clinical microbiology laboratories. For this purpose, a web-based computer aided instruction(CAI) program was designed to systematically organize the Gram stain method based on the standardized image data. In the future, CAI program must be intended to educate for beginner and developed to accept for variable knowledge. And it will be useful program for technicians in case of applying various examinations based Gram stain method of this study.

  • PDF

The study on the capacity of synchronous CDMA return link for a Ka band satellite communication system (Ka 대역을 사용하는 동기화 CDMA 위성 시스템 리턴링크의 수용용량에 관한 연구)

  • 황승훈;이용한;박용서;황금찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.7
    • /
    • pp.1797-1806
    • /
    • 1998
  • Future satellite communication systems will be developed at Ka-band (20/30 GHz) owing to the relatively wide frequency allocation and current freedom from terrestrial interference for multimedia services. A serious disadvantage of the Ka-band, however, is the very high atmospheric attenuation in rainy weather. Synchronous CDMA drastically redces the effect of self-noise with several interesting features of CDMA for mobile communications such as fixible freuqncy rese, the capability of performin soft-handover and a lower sensitivity to interference. This paper evaluates the performance of a synchronous CDMA reture link for a Ka-band geostationary satellite communication system. For a fixed satellite channel whose characteristics depend on weather conditions, the signal envelope and phase for this channel is modelled as Gaussian. The bit error and outage probability, and the detection loss due to imperfect chip timing synchronization is analytically evaluated and the system capacity degaradation due to the weather condition is estimated. The two cases consist of the general case in which all users are affected by rain condition, and the worst case in which the reference user is only affected by rain attenuation. the results for two cases of rain condition clearly show that synchronous CDMA eases the power control requirements and has less sensitivity to imperfect power control.

  • PDF

An Energy-Efficient and Destination-Sequenced Routing Algorithm by a Sink Node in Wireless Sensor Networks (무선 센서 네트워크에서의 싱크 노드에 의한 에너지 효율적인 목적지-순서적 라우팅 알고리즘)

  • Jung, Sang-Joon;Chung, Youn-Ky
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.10
    • /
    • pp.1347-1355
    • /
    • 2007
  • A sensor network is composed of a large number of tiny devices, scattered and deployed in a specified regions. Each sensing device has processing and wireless communication capabilities, which enable it to gather information from the sensing area and to transfer report messages to a base station. The energy-efficient routing paths are established when the base station requests a query, since each node has several characteristics such as low-power, constrained energy, and limited capacity. The established paths are recovered while minimizing the total transmit energy and maximizing the network lifetime when the paths are broken. In this paper, we propose a routing algorithm that each sensor node reports its adjacent link information to the sink node when a sink node broadcasts a query. The sink node manages the total topology and establishes routing paths. This algorithm has a benefit to find an alternative path by reducing the negotiating messages for establishing paths when the established paths are broken. To reduce the overhead of collection information, each node has a link information before reporting to the sink. Because the node recognizes which nodes are adjacent. The proposed algorithm reduces the number of required messages, because sensor nodes receive and report routing messages for establishment at the beginning of configuring routing paths, since each node keeps topology information to establish a routing path, which is useful to report sensing tasks in monitoring environments.

  • PDF

Cache Sensitive T-tree Main Memory Index for Range Query Search (범위질의 검색을 위한 캐시적응 T-트리 주기억장치 색인구조)

  • Choi, Sang-Jun;Lee, Jong-Hak
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.10
    • /
    • pp.1374-1385
    • /
    • 2009
  • Recently, advances in speed of the CPU have for out-paced advances in memory speed. Main-memory access is increasingly a performance bottleneck for main-memory database systems. To reduce memory access speed, cache memory have incorporated in the memory subsystem. However cache memories can reduce the memory speed only when the requested data is found in the cache. We propose a new cache sensitive T-tree index structure called as $CST^*$-tree for range query search. The $CST^*$-tree reduces the number of cache miss occurrences by loading the reduced internal nodes that do not have index entries. And it supports the sequential access of index entries for range query by connecting adjacent terminal nodes and internal index nodes. For performance evaluation, we have developed a cost model, and compared our $CST^*$-tree with existing CST-tree, that is the conventional cache sensitive T-tree, and $T^*$-tree, that is conventional the range query search T -tree, by using the cost model. The results indicate that cache miss occurrence of $CST^*$-tree is decreased by 20~30% over that of CST-tree in a single value search, and it is decreased by 10~20% over that of $T^*$-tree in a range query search.

  • PDF

A WATM MAC Protocol for the Efficient Transmission of Voice Traffic in the Multimedia Environment (멀티미디어 환경에서 효율적인 음성 전송을 위한 WATM MAC 프로토콜)

  • 민구봉;최덕규;김종권
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.1A
    • /
    • pp.96-103
    • /
    • 2000
  • The voice traffic is one of the most important real-time objects in WATM(Wireless Asynchronous Transfer Mode) networks. In this paper, we propose a new MAC(Medium Access'Control) protocol for the efficienttransmission of voice traffic over WATM networks in the multimedia environment and compare the performanceto existing similar protocols. The new protocol separates the reservation slot period for voice and that for data toguarantee some level of QoS(Quality of Service) in voice traffic. This is denoted by a slot assignment functiondepending on the frame size. According to the characteristics of voice traffic which is repeatedly in silent states,the protocol allocates voice reservation request slots dynamically with respect to the number of silent(off state)voice sources and also sends the first block of talkspurt restarted after silent period with a reservation requestslot to reduce the access delay.The simulation results show that the proposed protocol has better performance than Slotted Aloha in bandwidthefficiency, and can serve a certain level of QoS by the given slot assignment function even when the number ofvoice terminals varies dynamically. This means we can observe that the new MAC protocol is much better thanthe NC-PRMA(None Collision-Packet Reservation Multiple Access) protocol.

  • PDF

An Adaptive Coverage Control Algorithm for Throughput Improvement in OFDMA-based Relay Systems (OFDMA 기반 Relay 시스템에서 Throughput 성능 향상을 위한 적응적 커버리지 조절 기법)

  • Hyun, Myung-Reun;Hong, Dae-Hyoung;Lim, Jae-Chan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9B
    • /
    • pp.876-882
    • /
    • 2009
  • In this paper, we propose a sub-cell coverage control algorithm for enhancement of the cell throughput in OFDMA based relay systems. Relay station (RS) is exploited for improved quality of the received signal in cellular communication systems, especially in shadow areas. However, since a RS requires additional radio resource consumption for the link between the base station (BS) and the RS, we have to carefully control the coverage areas if a mobile station (MS) is serviced via the BS or the RS considering the cell throughput. We consider radio resource reuse as well for the sub-cell coverage configuration by applying various reuse patterns between RSs. We also consider a time varying system by adaptively changing the threshold for coverage depending on the MSs' traffic in the cell. We initially determine the sub-cell coverage of the system depending on the ratio of received signal-interference-noise-ratio (SINR) of the MS from the BS and RSs, respectively. Then, the "sub-cell coverage threshold" varies based on the "effective transmitted bits per sub-channel" with time. Simulation result shows that the proposed "time varying coverage control algorithm" leads to throughput improvement compared to the fixed sub-cell coverage configuration.