• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.512-522
• /
• 2005

In this paper, an optimal determination method of the subband-frame size and mode-switching level is proposed for adaptive OFDM-TDD systems in frequency-selective time-varying channels. The optimization problem considering frequency selectivity. user's mobility, and the signaling overhead caused by the mode change information is formulated in the maximum spectral efficiency sense satisfying the target BER. Assuming that subband-frame size is given, the mode-switching level is first optimized so that the spectral efficiency can be maximized satisfying the target BER. The subband-frame size among candidates is then determined, which maximizes the spectral efficiency. Simulation results show that the proposed scheme outperforms conventional schemes, in terms of the spectral efficiency and the BER.

• ETRI Journal
• /
• v.40 no.1
• /
• pp.39-50
• /
• 2018

More people prefer using rail traffic for travel or for commuting owing to its convenience and flexibility. The railway scenario has become an important communication scenario in the fifth generation era. The communication system should be designed to support high-data-rate demands with seamless connectivity at a high mobility. In this paper, the channel characteristics are studied and modeled for the railway tunnel scenario with straight and curved route shapes. On the basis of measurements using the "Mobile Hotspot Network" system, a three-dimensional ray tracer (RT) is calibrated and validated for the target scenarios. More channel characteristics are explored via RT simulations at 25.25 GHz with a 500-MHz bandwidth. The key channel parameters are extracted, provided, and incorporated into a 3rd-Generation-Partnership-Project-like stochastic channel generator. The necessary channel information can be practically realized, which can support the link-level and system-level design of the communication system in similar scenarios.

• Journal of Positioning, Navigation, and Timing
• /
• v.7 no.2
• /
• pp.53-59
• /
• 2018

This paper proposes a pseudo-random beamforming technique for time-synchronized mobile base stations (BSs) for multi-cell downlink networks which have mobility. The base stations equipped with multi-antennas and mobile stations (MSs) are time-synchronized based on global positioning system (GPS) signals and generate a number of transmit beamforming matrix candidates according to the predetermined pseudo-random pattern. In addition, MSs generate receive beamforming vectors that correspond to the beam index number based on the minimum mean square error (MMSE) using transmit beamforming vectors that make up a number of transmit beamforming matrices and wireless channel matrices from BSs estimated via the reference signals (RS). Afterward, values of received signal-to-interference-plus-noise ratio (SINR) with regard to all transmit beamforming vectors are calculated, and the resulting values are then feedbacked to the BS of the same cells along with the beam index number. Each of the BSs calculates each of the sum-rates of the transmit beamforming matrix candidates based on the feedback information and then transmits the calculated results to the BS coordinator. After this, optimum transmit beamforming matrices, which can maximize a sum-rate of the entire cells, are selected at the BS coordinator and informed to the BSs. Finally, data signals are transmitted using them. The simulation results verified that a sum-rate of the entire cells was improved as the number of transmit beamforming matrix candidates increased. It was also found that if the received SINR values and beam index numbers are feedbacked opportunistically from each of the MSs to the BSs, not only nearly the same performance in sum-rate with that of applying existing feedback techniques could be achieved but also an amount of feedback was significantly reduced.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.12 s.354
• /
• pp.89-94
• /
• 2006

In the Mobile IP, the movement of Mobile Host(MH) causes packets to be transmitted through a long route. A Correspond Node(CN) first communicate with a Home Agent(HA) when a Mobile Host moved from one subnet to another subnet. The HH-MIP algorithm reduces an inefficient transmission of packets by regarding a Foreign Agent(FA) near a mobile host as a Temporary Home Agent(THA). However, The algorithm costs the unnecessary signaling by measuring the distance of route between a FA and a THA for handover in the case that a Mobile host comes from a THA which a current FA never communicated. To solve this problem, we propose a scheme called Hierarchical Home Agent Handover in Mobile IP(HHH-MIP) algorithm. Our HHH-MIP algorithm only searches tables in a router by using the hierarchical structure between a FA and a THA. The simulation results show that the HHH-MIP algorithm reduces the additional signaling cost.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.12 s.354
• /
• pp.68-74
• /
• 2006

The MANET(Mobile Ad Hoc Network) is an independent network that is oranized by only Mobile Hosts. MANET guarantees the mobility of the node and does not need a backbone network or a base station. Recently, there is a strong demand to connect MANET to the Internet. For the interconnection between MANET and Internet, Mobile hosts of MANET must have global IP address. The well known scheme of the address configuration for MANET is SAA(Stateless Address Autoconfiguration). SAA configurated IP address by node itself. The advantage of SAA is not requiring any server for address configuration. However the SAA has problems of unstable and inefficient interconnection on the AD Hoc Network. To solve this problem we propose a method that assigns an IPv6 Global address to the node through the Internet Gateway. The format of assigned IPv6 address is also defined. The simulation result demonstrates that the proposed method can support the host for fast getting of global IPv6 Address and Mobile IPv6 efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1101-1112
• /
• 2006

With the recent growth in demand for high-data rate multimedia services in the wireless environments, the Mobile Broadband Wireless Access (MBWA) technologies, such as WiBro (Wireless Broadband internet) system, are gradually coming into the spotlight. Unlike the conventional mobile communication networks based on cellular system, the WiBro system basically consists of IP based backbone networks that will be ultimately deployed by Ipv6 (IP version six) based backbone networks according to the All-IP trend for the network evolution. In such wireless mobile environments, it is needed to support the mobility management protocol on network layer as well as physical layer and Medium Access Control (MAC) layer in WiBro system. Accordingly, in this paper, we propose a fast handover scheme for improving the handover performance in IPv6 based WiBro system and show that the proposed scheme achieves loss-free and low handover latency during inter-subnet movement of the mobile stations through the simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8B
• /
• pp.1115-1121
• /
• 2010

The DNAv6 was designed to support fast attachment for a host, which is corresponding to the movement detection part in the mobility management. Since, however, the DNAv6 has supported only DNAv6-capable ARs and DNAv6-capable hosts, an non-DNAv6 host could not support fast handoff function in a DNAv6 network. In this paper, we consider a new method of the fast attachment of non-DNAv6 hosts. To support the non-DNAv6 host in DNAv6 networks, we suggest a novel algorithm, RCA algorithm, where an AR can decide whether a host has the DNAv6 function and whether it has moved to a new link or not, and then the AR can inform the host of new link information. For the RCA algorithm, we proposed to modify the RS message and the Reconf_Link message with addition of some fields. To validate our RCA algorithm and its performance, we have accomplished simulation tests for the ND process, the DNAv6 process and the modified DNAv6 process with our RCA algorithm. In the viewpoints of the attachment delay and complexity, the proposed algorithm gives the better delay performance than the ND process while it presents the less complexity than the DNAv6 process.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.27-33
• /
• 2009

This paper proposes transmit power control techniques with fading channel prediction scheme based on recurrent neural network for high-speed mobile communication systems. The operation result of recurrent neural network which is derived interpretively solves complexity problems of neural network circuit, and channel gain of multiple transmit antenna is derived with maximum ratio combining(MRC) by using the operation result, and this channel gain control transmit power of each antenna. simulation results show that proposed method has a outstanding performance compared to method that is not to be controlled power based on channel prediction. Most of legacy studies are for robust receive technique of fading signals or channel prediction of fading signals limited low-speed mobility, but in open loop Power control, proposed channel prediction method decrease system complexity with removal of fading effect in transmitter.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1075-1082
• /
• 2008

A greedy forwarding algorithm is one of the most suitable solutions for routing in vehicular ad-hoc networks. Compared to conventional routing protocols for mobile ad-hoc networks, greedy forwarding based routing protocols maintain only local information of neighbors instead of per-destination routing entries, and thus they show better performance in highly-mobile vehicular ad-hoc networks. With greedy forwarding, each node learns its geographical position and periodically broadcasts a beacon message including its position information. Based on the position information, each node selects a neighbor node located closest to the destination node as the next forwarder. One of the most serious problems in greedy forwarding is the lost link problem due to the mobility of nodes. In this paper, we propose a new algorithm to reduce the lost link problem. The proposed algorithm aims to find an efficient and stable routing path by taking account of the position of neighbors and the last beacon reception time. Our simulation results show that the proposed algorithm outperforms the legacy greedy algorithm and its variants.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1159-1166
• /
• 2014

In this paper, a resource management scheme for enhancing the network connectivity and reliability in wireless USB system is proposed. Wireless USB protocol is suitable for the application that supports the real-time multimedia service in Ship Area Network since it supports high speed data transfer. However, the device's mobility is caused the dramatic change of link state and network topology, and is occurred the degradation of network performance. Therefore, a resource management scheme for wireless USB system is proposed in this paper. The proposed technique can intelligently treat the change of link state, and solve the degradation of network performance. The simulation results show that proposed protocol can enhance the throughput and delay performance by selecting relay device with better link state.