• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.415-422
• /
• 2007

In this paper, we proposed a new dynamic channel allocation algorithm for TD-SCDMA with cross time slots. In order to reduce the interference in cross time slot, the mobile stations (MSs) are divided into two groups: the Near Group consisting of MSs near by the base station(BS) and the Far Group including the MSs far from the BS. The reverse link for MSs in the Near Group and forward link for MSs in the Far Group are allocated to the cross time slot. In cellular systems, a BS has multiple neighbor BSs. Some of neighbor BSs can operate in the same direction link while the others have cross time slot. Thus, it is required to determine which BS has the most significant impact in terms of interference. We divide each cell into 6 areas based on the direction of arrival of smart antenna and the most significant neighbor sector is determined with this division. The proposed allocation method and area division method can avoid the severe interference in cross time slots and increase the system capacity about 2%~9% compared to FCA, and 0.5%~1.3% compared to RCA.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.223-228
• /
• 2009

Efficient service discovery mechanism is a crucial feature for a hybrid ad-hoc network supporting extension of a wireless ad-hoc network to the Internet. We propose an efficient cross-layer service discovery mechanism using non-disjoint multi-path source routing protocol for hybrid ad-hoc networks. Our scheme has advantages of multi-path routing protocol and cross-layer service discovery. Intuitively, it is not difficult to imagine that the cross-layer service discovery mechanism could result in a decreased number of messages compared to the traditional approach for handling routing independently from service discovery. By simulation, we show that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths and by maintaining link/node non-disjoint multi-path.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.3
• /
• pp.202-209
• /
• 2003

We succeeded to build a cost effective assistance robotic arm with a compact and lightweight body. The robotic arm has three joints, and the tip of robotic arm to install tools consists of a closed link mechanism, which consisted of two actuators and several links. The robotic arm has been made possible by the use of actuators typically used in radio control devices. The controller of the robotic arm consists of a single chip PIC only. The robotic arm has a friendly user interface, as the operators are aged and disabled in most cases. The operator can manipulate the robotic arm by voice commands or by pressing a push button. The robotic arm has been successfully prototyped and tested on an elderly patient to assist with eating. The results of field test were satisfactory.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11B
• /
• pp.981-988
• /
• 2008

In this paper, the efficient AODV routing algorithm in MANET is proposed. Because transmission channel has a high error rate and loss in MANET, the number of hops can't be regarded as an absolute network metric. After measuring FER periodically at the data link layer using cross-layer design, the scheme that every node forwards the weight of link status in the reserved field of AODV protocol is used. In order to find the efficient route, we design AODV to be able to select an optimal route that has a good channel status by evaluating the sum of weight. The proposed AODV improves throughput, routing overhead and average end-to-end delay in comparison with the generic AODV.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.9
• /
• pp.514-519
• /
• 2002

We are considering the following problem that can be used in the prediction of the structure of proteins. Given two length n arrays A, B with positive numbers and a positive number M, find all pairs of subarrays A[i]＋…A[j],$1{\leq}i{\leq}j{\leq}n$ such that A[i]＋…A[j]＋B[k]＋…B[l]=M. This paper presents an algorithm with $Ο(n^2log n+K)$ time using Ο(n) memory, where K is the number of pairs output. The previously best known one is with $Ο(n^2log +Klog n)$ time and Ο(n) memory.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.767-774
• /
• 2008

With the development of ubiquitous sensor networks, the need for communication among mobile nodes has been increased. When the existing TCP is applied to MANET, link failure, route change and network partition make TCP recognize congestion. As a result, TCP shows a poor performance. In this paper, using cross-layer design a new TCP congestion control algorithm that is suitable for MANET is designed and analyzed with ns2.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.319-321
• /
• 2015

인지무선네트워크 (Cognitive Radio Networks) 환경에서 스펙트럼의 원소유주인 1차사용자가 전송을 개시하는 경우, 같은 채널을 사용하는 2차사용자의 TCP (Transmission Control Protocol) 는 전송 불능 상태가 되어 심각한 성능저하가 발생한다. 이러한 성능저하는 1차사용자의 등장으로 인해 채널이 사용 불가능 해지는 상태를 패킷 손실로 판단하여 재전송 타임아웃이 발생하기 때문에 발생된다. 우리는 이 문제를 링크 또는 물리 계층 (하위계층) 과 TCP간의 크로스레이어링을 통하여 해결하고자 한다. 하위 계층은 1차사용자의 전송이 감지되면, 이를 TCP에게 시그널링하고, TCP는 이를 통해 재전송 타이머와 혼잡 윈도우를 고정시키고, 패킷 전송을 중단하도록 한다. 또, 하위계층이 가용 채널을 감지하게 되면, 재차 TCP에게 시그널링을 함으로써, 전송이 신속하게 재개되도록 한다. 제안하는 방법은 실제 USRP(Universal Software Radio Peripheral)에 구현하여 성능의 향상을 검증한다.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.905-916
• /
• 2004

Self-organizing hierarchical ad hoc network (SOHAN) is a new ad-hoc network architecture designed to improve the scalability properties of conventional 'flat' ad hoc networks. This network architecture consists of three tiers of ad-hoc nodes, i.e.. access points, forwarding nodes and mobile nodes. This paper presents a topology discovery and routing protocol for the self-organization of SOHAN. We propose a cross-layer path metric based on link quality and MAC delay which plays a key role in producing an optimal cluster-based hierarchical topology with high throughput capacity. The topology discovery protocol provides the basis for routing which takes place in layer 2.5 using MAC addresses. The routing protocol is based on AODV with appropriate modifications to take advantage of the hierarchical topology and interact with the discovery protocol. Simulation results are presented which show the improved performance as well as scalability properties of SOHAN in terms of through-put capacity, end-to-end delay, packet delivery ratio and control overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4A
• /
• pp.377-386
• /
• 2008

In this paper, a new handover management scheme has been proposed to reduce handover latency and to support fast handover without packet losses, so that it may be applicable to the wireless mobile Internet system such as IPv6-based WiBro system. To minimize the handover latency in processing of movement detection, we propose the handover management scheme which simplifies the handover message exchanging procedure between mobile subscriber station (MSS) and network by integrating layer 2 and layer 3 handovers efficiently based on the layer2 information. To reduce the processing delay from new care-of-address (NCoA) configuration during handover, we propose that NCoA is created, distributed and managed by new access control router (NACR). In addition, in order to minimize the packet transmission delay and eliminate the packet losses, the proposed scheme employs a crossover router (CR) which is upper network located over PACR and NACR and employs the packet buffering for MSS. The simulation study shows that the proposed scheme achieves loss-free packet delivery and low latency in the environment of narrow overlapped cell area or high velocity of the MSS, comparing the performance with the conventional schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.85-93
• /
• 2001

In this paper, a path restoration method independent of failure location in all-optical networks is proposed and its wavelength requirements are calculated. In the proposed method, since a single backup wavelength is used for any link failure, a node can consist of only fixed wavelength transmitters, resulting in the levels node cost. Hence, restoration process can be triggered just after the failure detection, if combined with edge-disjoint path restoration method. This feature and the parallel cross-connection message transfer technique proposed in this paper make the restoration process faster. Also, it is shown the wavelength requirements in the proposed method are similar to the ones in the method using tunable backup wavelength, resulting in little increment for transmission cost.