RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
        • 등재정보
        • 학술지명
        • 주제분류
        • 발행연도
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • An Efficient Multicast-based Binding Update Scheme for Network Mobility

        ( Moonseong Kim ),( Hayder Radha ),( Jin Young Lee ),( Hyunseung Choo ) 한국인터넷정보학회 2008 KSII Transactions on Internet and Information Syst Vol.2 No.1

        Mobile IP (MIP) is the solution supporting the mobility of Mobile Nodes (MNs), however, it is known to lack the support for NEtwork MObility (NEMO). NEMO manages situations when an entire network, composed of one or more subnets, dynamically changes its point of attachment to the Internet. NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in a mobile network, however, there exists a serious pinball routing problem. To overcome this weakness, there are many Route Optimization (RO) solutions such as Bi-directional Tunneling (BT) mechanism, Aggregation and Surrogate (A&S) mechanism, Recursive Approach, etc. The A&S RO mechanism is known to outperform the other RO mechanisms, except for the Binding Update (BU) cost. Although Improved Prefix Delegation (IPD) reduces the cost problem of Prefix Delegation (PD), a well-known A&S protocol, the BU cost problem still presents, especially when a large number of Mobile Routers (MRs) and MNs exist in the environment such as train, bus, ship, or aircraft. In this paper, a solution to reduce the cost of delivering the BU messages is proposed using a multicast mechanism instead of unicasting such as the traditional BU of the RO. The performance of the proposed multicast-based BU scheme is examined with an analytical model which shows that the BU cost enhancement is up to 32.9% over IPDbased, hence, it is feasible to predict that the proposed scheme could benefit in other NEMO RO protocols.

      • SCIESCOPUSKCI등재

        An Efficient Multicast-based Binding Update Scheme for Network Mobility

        Kim, Moon-Seong,Radha, Hayder,Lee, Jin-Young,Choo, Hyun-Seung Korean Society for Internet Information 2008 KSII Transactions on Internet and Information Syst Vol.2 No.1

        Mobile IP (MIP) is the solution supporting the mobility of Mobile Nodes (MNs), however, it is known to lack the support for NEtwork MObility (NEMO). NEMO manages situations when an entire network, composed of one or more subnets, dynamically changes its point of attachment to the Internet. NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in a mobile network, however, there exists a serious pinball routing problem. To overcome this weakness, there are many Route Optimization (RO) solutions such as Bi-directional Tunneling (BT) mechanism, Aggregation and Surrogate (A&S) mechanism, Recursive Approach, etc. The A&S RO mechanism is known to outperform the other RO mechanisms, except for the Binding Update (BU) cost. Although Improved Prefix Delegation (IPD) reduces the cost problem of Prefix Delegation (PD), a well-known A&S protocol, the BU cost problem still presents, especially when a large number of Mobile Routers (MRs) and MNs exist in the environment such as train, bus, ship, or aircraft. In this paper, a solution to reduce the cost of delivering the BU messages is proposed using a multicast mechanism instead of unicasting such as the traditional BU of the RO. The performance of the proposed multicast-based BU scheme is examined with an analytical model which shows that the BU cost enhancement is up to 32.9% over IPDbased, hence, it is feasible to predict that the proposed scheme could benefit in other NEMO RO protocols.

      • KCI등재후보

        On Rate-adaptive LDPC-based Cross-layer SVC over Bursty Wireless Channels

        ( Yongju Cho ),( Jihun Cha ),( Hayder Radha ),( Kwang-deok Seo ) 한국인터넷정보학회 2012 KSII Transactions on Internet and Information Syst Vol.6 No.9

        Recent studies have indicated that a significant improvement in wireless video throughput can be achieved by Cross Layer Design with Side-information (CLDS) protocols. In this paper, we derive the operational rate of a CLDS protocol operating over a realistic wireless channel. Then, a Rate-Distortion (R-D) empirical model for above-capacity Scalable Video Coding (SVC) is deduced to estimate the loss of video quality incurred under inaccurate rate estimation scenarios. Finally, we develop a novel Unequal Error Protection (UEP) scheme which leverages the characteristics of LDPC codes to reduce the distortion of video quality in case of typically-observed burst wireless errors. The efficacy of the proposed rate adaptation architecture over conventional protocols is demonstrated by realistic video simulations using actual IEEE 802.11b wireless traces.

      • KCI등재

        Multihop Rate Adaptive Wireless Scalable Video Using Syndrome-Based Partial Decoding

        Yongju Cho,Jungil Seo,Jungwon Kang,Hayder Radha,Jinwoo Hong 한국전자통신연구원 2010 ETRI Journal Vol.32 No.2

        The overall channel capacity of a multihop wireless path drops progressively over each hop due to the cascading effect of noise and interference. Hence, without optimal rate adaptation, the video quality is expected to degrade significantly at any client located at a far-edge of an ad-hoc network. To overcome this limitation, decoding and forwarding (DF), which fully decodes codewords at each intermediate node, can be employed to provide the best video quality. However, complexity and memory usage for DF are significantly high. Consequently, we propose syndrome-based partial decoding (SPD). In the SPD framework an intermediate node partially decodes a codeword and relays the packet along with its syndromes if the packet is corrupted. We demonstrate the efficacy of the proposed scheme by simulations using actual 802.11b wireless traces. The trace-driven simulations show that the proposed SPD framework, which reduces the overall processing requirements of intermediate nodes, provides reasonably high goodput when compared to simple forwarding and less complexity and memory requirements when compared to DF.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼