• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.1 s.6
• /
• pp.107-115
• /
• 2005

For effective IP based service implementation on the wireless network environments, wireless network including the ITS network have to support QoS guaranteed protocol such as a RSVP. RSVP is a resource reservation protocol for Internet environment, and its scalability makes easy to implement RSVP over the various IP transport technologies. But for the If based ITS wireless network environment, RSVP is not suitable, since by its path setup procedure characteristic. In the wireless access network for ITS service, when a mobile node moves to other domain it must perform registration procedure. But the registration procedure is time consuming steps, so if a RSVP session was already established in the previous domain, the RSYP session may be disconnected and the time to re establish a new RSVP session is long enough to cause serious packet loss. In this paper, we propose a pre-path reservation mechanism for applying the RSVP in wireless access networks for ITS. In the pre-path reservation mechanism, the resource reservation procedure occurred during a mobile node's handoff time. An access point in wireless access network performs this procedure when the mobile node attempts handoff The access point executes pre-path reservation procedure as a proxy, since the mobile node does not have IP address until the address allocation procedure is finished in a new domain.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.538-548
• /
• 2008

In the Internet Engineering Task Force(IETF), Next Step in Signaling(NSIS) working group, proposed a mechanism to discover the Crossover Node(CRN), when the route is changed by Mobile Node(MN) handover. The CRN is divergence or convergence node on old and new path for reserving resources. Trough the CRN discovery mechanism, it possible to reduce a signaling delay and avoid the redundant reservation on the common path between old and new path. However, the QoS(Quality of Service) can be guaranteed continuously while the MN is performing handover, it is needed to pre-reserve the resource on the new path before completion of the handover. When the nodes on the new path try to make a pre-resource reservation before the handover, it is difficult to pre-reserve the resource with the existing CRN discovery mechanism. Therefore, we proposed a Passive CRN(PCRN) discovery scheme and pre-resource reservation mechanism. The PCRN which means an initial common point between the current reserved and the new paths, where the handover can take place.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05a
• /
• pp.20-23
• /
• 2004

In non-selective frequency environment, it is difficult to take the advantage of path diversity. In the literature, some methods have been proposed to solve the issue. This paper presents a new method to obtain the resolvable path in Indoor Multi-carrier Code Division Multiple Access (MC-CDMA) system by using downlink beam forming. With the aid of downlink beamforming, the most reliable path is found and chosen for the communication link. The new approach is evaluated in term of bit error rate (BER) and power consumption. The simulation results show that the new approach can get better BER performance. However, the cost of BER improvement is a small degradation in power reservation.

• Journal of information and communication convergence engineering
• /
• v.2 no.2
• /
• pp.71-75
• /
• 2004

In non-selective frequency environment, it is difficult to take the advantage of path diversity. In the literature, some methods have been proposed to solve the issue. This paper presents a new method to obtain the resolvable path in Indoor Multi-carrier Code Division Multiple Access (MC-CDMA) system by using downlink beam forming. With the aid of downlink beamforming, the most reliable path is found and chosen for the communication link. The new approach is evaluated in term of bit error rate (BER) and power consumption. The simulation results show that the new approach can get better BER performance. However, the cost of BER improvement is a small degradation in power reservation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.255-266
• /
• 2007

RSVP (Resource reSerVation Protocol) is the Internet standard protocol for supporting QoS (Quality of Service) requirements by reserving network resources between the sender and the receiver. Several problems, such as common path identification and resource pre-reservation, should be solved to apply RSVP in wireless mobile environments. To resolve these problems, this paper proposes DBRA (Dynamic Branch Router Approach) based on two designated entities, candidate access routers and a branch router. While several RSVP sessions between a branch router and candidate routers are managed, DBRA makes use of only one RSVP session between the sender and a branch router. Based on a network simulation, the proposed scheme has been compared with MRSVP (Mobile RSVP) and HMRSVP (Hierarchical MRSVP) in terms of the average packet transmission rate, bandwidth utilization and RSVP session failure rate.