The search functionality is under construction.

Keyword Search Result

[Keyword] layer 3(4hit)

1-4hit
  • System Performance Investigation of Layer-1 and Layer-3 Relays in LTE-Advanced Downlink

    Satoshi NAGATA  Yuan YAN  Anxin LI  Xinying GAO  Tetsushi ABE  Takehiro NAKAMURA  

     
    PAPER

      Vol:
    E94-B No:12
      Page(s):
    3296-3303

    In Long-Term Evolution (LTE)-Advanced, an important goal in addition to achieving high-speed, high-capacity communications is throughput enhancement for cell-edge users. One solution is to relay radio transmissions between an eNode B and user equipment (UE). Relays are expected to extend the coverage to the cell boundary and coverage hole areas, and are expected to reduce network costs. It was agreed that in Release 10 LTE, a Layer-3 (L3) relay, which achieves self-backhauling of radio signals between an eNode B and a UE in Layer 3 should be standardized. Meanwhile, a Layer-1 (L1) relay, which amplifies and forwards received radio frequency signals, has already found widespread use in second-generation and third-generation mobile communication systems. This paper investigates the downlink system level performance for L3 and L1 relays with orthogonal frequency division multiple access (OFDMA) in LTE-Advanced. Various practical factors are taken into account in the evaluations such as the processing delay and upper bound of the amplifier gain of the L1 relay, capacity limitation of the backhaul channels, and empty buffer status at the L3 relay. We also propose and investigate a downlink backhaul link (radio link between the eNode B and L3 relay node) scheduling method for the in-band half-duplex L3 relay. In the proposed scheduling method, radio resources from an eNode B to an L3 relay node and macro UE are multiplexed in the same backhaul subframe considering the number of relay UEs and macro UEs, and the channel quality of the backhaul link to the L3 relay and the access link to the macro UE. Based on system-level simulations, we clarify the system impact of several conditions for the relay such as the number of relay nodes and the number of backhaul (radio link between eNode B and L3 relay) subframes, the distance between the eNode B and relay, and show the throughput performance gain of the L3 relay compared to the L1 relay. We also clarify that the cell-edge UE throughput performance is increased by approximately 10% by applying the proposed scheduling method due to more efficient and fair resource allocation to the L3 relay and macro UEs.

  • Performance Evaluation of Inter-Layer 3 Networking with ID/Locator Separation Architecture

    Hiroyuki URABAYASHI  Miki YAMAMOTO  Tomohiko YAGYU  

     
    PAPER

      Vol:
    E94-B No:10
      Page(s):
    2741-2750

    In research community of content distribution, a new communication paradigm of rendezvous-based abstraction which easily enables location-free content-oriented services, attracts great attention. ID/Locator separation architecture is originally proposed for resolving increase of routing table size in the current Internet but it has possibility of supporting this abstraction because host ID is clearly separated from its location. This feature of ID/Locator separation means an end host can be identified by ID independent of its network layer protocol. So, ID/Locator separation architecture enables communication with end host(s) operating different network-layer protocol, which might increase candidate paths between host pairs and improve content distribution path. In this paper, we evaluate this improvement of shortest path brought by inter-layer 3 networking. In inter-layer 3 networking, a shared node connecting different network layer plane plays an important role. We evaluate shortest path improvement with various shared node locations and show that strategic assignment of shared nodes brings large improvement. When multiple layer 3 networks are available for users, shortest path might be improved even only with multi-homing (without inter-layer 3 networking). We also evaluate shortest path improvement brought by multi-homing and inter-layer 3 networking for incremental deployment scenario of multi-homing. Our simulation results show that inter-layer 3 networking brings great improvement even with small number of users deploying multi-homing while only multi-homing itself brings small improvement.

  • Layer 3 Diversity Reception Technology for Ku-Band Mobile Satellite Communication Systems

    Fumiaki NAGASE  Jin MITSUGI  Masayoshi NAKAYAMA  Masazumi UEBA  

     
    PAPER-Satellite Communications

      Vol:
    E89-B No:6
      Page(s):
    1856-1861

    We describe a layer 3 diversity reception scheme that enhances the transmission characteristics of Ku-band mobile satellite communication systems. This scheme can realize high-speed communication for vehicles that experience shadowing caused by terrestrial obstacles such as tunnels, buildings and bridges, especially for trains that frequently experience shadowing from the trolley wire structures. Layer 3 diversity was chosen for long distance diversity to prevent signal shadowing caused by terrestrial obstacles while minimizing the alterations of existing receivers. The technology enables high-speed communication under shadowing conditions in a running train environment.

  • A Multicasting Scheme Using Multiple MCS for Reducing End-to-End Path Delay in ATM Networks

    Tae-Young BYUN  Ki-Jun HAN  

     
    PAPER-Network

      Vol:
    E84-B No:4
      Page(s):
    1020-1029

    In this paper, we proposed two models, the full multiple MCS (Multicast Server) model and the hybrid multiple MCS model to support multiple MCS over a single large cluster in ATM (Asynchronous Transfer Mode) networks. Also, we presented two methods for MCS assignment which are known as 2PSPMT (2 Phase Shortest Path based on Multicast tree) and hybrid-2PSPMT, and evaluated its performance by simulation. When an ATM host requests joining a specific multicast group, the MARS (Multicast Address Resolution Server) designates a proper MCS among the multiple MCSs for the group member to minimize the average path delay between the sender and the group members. Each method for MCS assignment construct a 2-phase partial multicast tree based on the shortest path algorithm. We reduced the average path delay in the multicast tree using these methods with various cluster topologies and MCS distribution scenarios in addition to distributing the load among multiple MCSs.