• 한국공간정보시스템학회:학술대회논문집
• /
• 2004.12a
• /
• pp.169-181
• /
• 2004

SK Telecom has already constructed GIMS system as the base common framework of LBS/GIS service system based on OGC(OpenGIS Consortium)'s international standard for the first mobile vector map service in 2002, But as service content appears more complex, renovation has been needed to satisfy multi-purpose, multi-function and maximum efficiency as requirements have been increased. This research is for preparation ion of GML3-based platform to upgrade service from GML2 based GIMS system. And with this, it will be possible for variety of application services to provide location and geographic data easily and freely. In GML 3.0, it has been selected animation, event handling, resource for style mapping, topology specification for 3D and telematics services for mobile LBS multimedia service. And the schema and transfer protocol has been developed and organized to optimize data transfer to MS(Mobile Stat ion) Upgrade to GML 3.0-based GIMS system has provided innovative framework in the view of not only construction but also service which has been implemented and applied to previous research and system. Also GIMS channel interface has been implemented to simplify access to GIMS system, and service component of GIMS internals, WFS and WMS, has gotten enhanded and expanded function.

• Journal of Navigation and Port Research
• /
• v.43 no.6
• /
• pp.403-412
• /
• 2019

The characteristics of the manoeuvring motion of a ship are dependent on the ship type, as well as draft or speed in the same ship. In recent years, the number of extra-large vessels has increased significantly, which can cause enormous material and environmental damage in the event of a marine accident. Thus, the importance of ship maneuvering is increasing. The IMO has forced the officers to be trained in simulators through the STCW 95 amendment. However, FMSS is costly and difficult to access and the PC-based simulator has the disadvantage that only one person can engage in simulation. The purpose of this study was to solve the shortcomings of the FMSS and PC-based simulators by enabling multiple people to use their PCs to simulate based on a network. The simulator is implemented through the analysis and numerical calculation of the Nomoto model, Radar function mounting, data transfer protocol design, and GUI building. To verify the simulator, the simulation results were compared and analyzed with the test results of T.S. HANBADA according to the criteria of the Korean Register of Shipping(KR) and IMO standards for ship maneuverability. As a result, It showed a relative error of 0%~ 32.1% with an average of 13.7%, and it satisfied the IMO criteria for ship maneuverability.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.79-89
• /
• 2006

TCP is the most widely used transport protocol in Internet applications that guarantees a reliable data transfer. But, in the wireless multi-hop networks, TCP performance is degraded because it is designed for wired networks. The main reasons of TCP performance degradation are contention for wireless medium at the MAC layer, hidden terminal problem, exposed terminal problem, packet losses in the link layer, unfairness problem, reordering problem caused by path disconnection, bandwidth waste caused by exponential backoff of retransmission timer due to node's mobility and so on. Specially, in the mobile ad-hoc networks, discrepancy between a station's transmission range and interference range produces hidden terminal problem that decreases TCP performance greatly by limiting simultaneous transmission at a time. In this paper, we propose a new MAC algorithm for mobile ad-hoc networks to solve the problem that a node can not transmit and just increase CW by hidden terminal. In the IEEE 802.11 MAC DCF, a node increases CW exponentially when it fails to transmit, but the proposed algorithm, changes CW adaptively according to the reason of failure so we get a TCP performance enhancement. We show by ns-2 simulation that the proposed algorithm enhances the TCP performance by fairly distributing the transmission opportunity to the failed nodes by hidden terminal problems.

• Journal of the Korean Society of Radiology
• /
• v.1 no.2
• /
• pp.13-22
• /
• 2007

The purpose of this study was to survey a development of the wireless transmission system of medical images for ubiquitous medicine. There have been many changes in medical equipments and medical record medical treatment and medical record within hospital and PACS(Picture Archiving Communication System) which is picture management system for patients can be typical cases. It is difficult to use these automated medical systems unless they are within hospital and in case of rapid image reading in the emergency cases or in absence of doctor, it is difficult to perform it immediately. The present study implemented an image transmission system using CDMA connection so that images in the server can be viewed at any time and in any place. Remote wireless diagnosis based on medical images using PDA is applicable to medical areas that require mobility, and the use of PDA can be an ideal alternative for point of care. The use of PDA enables prompt and accurate access to digital medical images, which in turn reduces medical accidents and improves the quality of medical services through high productivity and efficiency of medical practitioners' works. It also enables quick response to patients' demands and high-quality medical services and, consequently, patients' high satisfaction.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.413-420
• /
• 2006

The speed of present-day network technology exceeds a gigabit and is developing rapidly. When using TCP/IP in these high-speed networks, a high load is incurred in processing TCP/IP protocol in a host CPU. To solve this problem, research has been carried out into TCP/IP Offload Engine (TOE). The TOE processes TCP/IP on a network adapter instead of using a host CPU; this reduces the processing burden on the host CPU. In this paper, we developed two software-based TOEs. One is the TOE implementation using an embedded Linux. The other is the TOE implementation using Lightweight TCP/IP (lwIP). The TOE using an embedded Linux did not have the bandwidth more than 62Mbps. To overcome the poor performance of the TOE using an embedded Linux, we ported the lwIP to the embedded system and enhanced the lwIP for the high performance. We eliminated the memory copy overhead of the lwIP. We added a delayed ACK and a TCP Segmentation Offload (TSO) features to the lwIP and modified the default parameters of the lwIP for large data transfer. With the aid of these modifications, the TOE using the modified lwIP shows a bandwidth of 194 Mbps.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.