• Journal of Computing Science and Engineering
• /
• v.4 no.3
• /
• pp.225-239
• /
• 2010

This paper introduces a new approach to modeling relative distance among nodes under a variety of communication rates, due to node's mobility in Mobile Ad-hoc Networks (MANETs). When mobile nodes move to another location, the relative distance of communicating nodes will directly affect the data rate of transmission. The larger the distance between two communicating nodes is, the lower the rate that they can use for transferring data will be. The connection certainty of a link also changes because a node may move closer to or farther away out of the communication range of other nodes. Therefore, the stability of a route is related to connection entropy. Taking into account these issues, this paper proposes a new routing metric for MANETs. The new metric considers both link weight and route stability based on connection entropy. The problem of determining the best route is subsequently formulated as the minimization of an object function formed as a linear combination of the link weight and the connection uncertainty of that link. The simulation results show that the proposed routing metric improves end-to-end throughput and reduces the percentage of link breakages and route reparations.

• Journal of the Ergonomics Society of Korea
• /
• v.12 no.1
• /
• pp.75-86
• /
• 1993

Hypermedia systems allow the retrieval and representation of multimedia in- formation such as text, graphics, image and voice/sound using navigation and browsing mechanisms. In this study we developed a hypermedia system which provides hierarchical group, local map and cluster view for effective navigation in hyperspace. The system also supports hot link, reference link, move-to link and multiple link to browse the multimedia information space effectively. This system has been designed to integrate the navigation, browsing and searching function of the hypermedia system in hyman factor perspective and provides the user-friendly user interface mechanism.

• Journal of the Korea Society for Simulation
• /
• v.13 no.2
• /
• pp.53-63
• /
• 2004

In ad hoc networks, the link survivability is firstly considered if a routing between two mobile nodes takes place through wireless environments, because all of mobile nodes participating in a connection dynamically move to anywhere. Also, mobile nodes have multi-role to implement a communication without a static system supported by wired networks. Hence, it is difficult that all mobile nodes continuously provide a reliable connection when the nodes operate each role for the connection. Therefore, it is desired to maximize the lifetime of a route as long as possible for the reliable communication. In this paper, we propose a proactive link management scheme that can provide the continuous route supported by the link handover. It consider the wireless link quality and the power lifetime of a node so that the link handover is implemented for the link survivability without disconnecting the route on the communication.

• Kyungpook Mathematical Journal
• /
• v.52 no.3
• /
• pp.245-264
• /
• 2012

We determine lens surgeries (i.e. Dehn surgery yielding a lens space) along the n-twisted Whitehead link. To do so, we first give necessary conditions to yield a lens space from the Alexander polynomial of the link as: (1) n = 1 (i.e. the Whitehead link), and (2) one of surgery coefficients is 1, 2 or 3. Our interests are not only lens surgery itself but also how to apply the Alexander polynomial for this kind of problems.

• Journal of Biosystems Engineering
• /
• v.26 no.5
• /
• pp.415-422
• /
• 2001

A seedling pick-up device for vegetable transplanters was developed and its work performance was evaluated at the laboratory. The pick-up device extracts seedlings from a 200-cell tray of seedlings and transfers them to the place where they are to be transplanted into the soil. The device consists of a path generator, pick-up pins and a pin driver. The path generator is a five-bar mechanism comprised of a fixed link, a driving link, a driven link, a connecting link and a slider. The slider is constrained to move along the driven link and a fixed slot of combined straight-line and circular paths. The connecting link joins the driving link and the slider. When the slider moves along the straight-line path of the slot it takes seedlings out from the cell and transfers them to the transplanting hopper when moving along the circular path. A proto-type of the pick-up device was built and tested under the various operational conditions such as age of seedling, approach direction and penetration depth of pins to the cell, holding method of seedling and extracting velocity. The device extracted 30 seedlings per minute with the maximum success ratio of 97% using the seedlings of 23 days old. Some design details were also discussed and suggested to enhance the performance of the device.

• Wind and Structures
• /
• v.3 no.4
• /
• pp.291-302
• /
• 2000

A new finite element technique to solve the problem of wind and structure interactions is presented. Conventionally, wind analysis is performed on the Eulerian description in which the finite element mesh would not move in accordance with the wind flow. However, it is not the case in wind-structure interaction problems because nodes attached to the surface of structure should move with the displacement of structure. The arbitrary Lagrangian-Eulerian (ALE) method treats the mesh and flow independently, and allow the mesh to move. In this study, the analysis domain is divided into regions of the structure, air around the structure and the interface of two regions. To satisfy the compatibility and equilibrium conditions between separated regions and to carry out the efficient analysis, the rigid link is used. Also the equation of wind and that of structure are arranged in a single matrix equation.

• ETRI Journal
• /
• v.37 no.2
• /
• pp.262-272
• /
• 2015

In particular, for a practical mobile robot team to perform such a task as that of carrying out a search and rescue mission in a disaster area, the network connectivity and localization have to be guaranteed even in an environment where the network infrastructure is destroyed or a Global Positioning System is unavailable. This paper proposes the new collective intelligence network management architecture of multiple mobile robots supporting seamless network connectivity and cooperative localization. The proposed architecture includes a resource manager that makes the robots move around and not disconnect from the network link by considering the strength of the network signal and link quality. The location manager in the architecture supports localizing robots seamlessly by finding the relative locations of the robots as they move from a global outdoor environment to a local indoor position. The proposed schemes assuring network connectivity and localization were validated through numerical simulations and applied to a search and rescue robot team.

• Journal of Satellite, Information and Communications
• /
• v.3 no.1
• /
• pp.41-47
• /
• 2008

Line-of-sight communications cannot easily support korean armed forces because of mountainous terrain. ADD(Agency for Defense Development) introduced ANASIS(Army Navy Air-force Satellite Information System) to meet the Korean warfighter's operational needs. Currently, army's military satcom terminal is designed for either fixed site or on-the-pause operation. The US army is under development of multi-band integrated on-the-move satellite terminals to let the army's communication capability to keep pace with globally deployable Joint Task Force for network-centric application. In this paper we analyzed X-band and Ka-band link and subsystem requirement. Our focus here is to describe key technical issues. Especially, On the basis of 3dB beam width of 0.9m antenna, Tracking accuracy and disturbances compensation signal processing on-the-move of Antenna Tracking system is analyzed. Also, protocol is analyzed that minimize blockage on the move due to an obstacle. when the received signal blocked, it stop to transmit burst signal and retransmit when blockage removed through received synchronization signal monitoring. Analyzed specification will be used to make prototype terminal to analyze risk for mass production

• Journal of Internet of Things and Convergence
• /
• v.8 no.1
• /
• pp.31-36
• /
• 2022

As the society progresses to a knowledge economy, global demand is rapidly increasing in many fields of society. In line with this, interest in globalization is also increasing in universities. Accordingly, students who have graduated from universities are making efforts to find employment in Korea, but the barriers to entry for employment are high due to the high specifications and qualifications of domestic companies, so the government, local governments, and universities are putting a lot of effort into global overseas employment. This study is a training course design for the K-MOVE project aimed at employment in Japanese IT companies. To design this curriculum, we conduct a demand survey of recruiting companies and students, and draw a curriculum based on the results. Then, the effective link between regular subjects and K-MOVE education will be described. This study can be a useful resource for education experts planning overseas employment in the Japanese IT field.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.7
• /
• pp.952-965
• /
• 1995

In the hypercube multiprocessor system. repeated allocations and deallocations of subcubes generate a fragmented hypercube from which. even if sufficient free processors are available, a subcube that is large enough to accomodate a new task cannot be formed. To eliminate the fragmentation, we need a processor relocation to move a task-occupied subcube to a free subcube, and gather dispersed small subcubes. In this paper, we propose a routing algorithm for task migration in circuit- switched hypercube to relocate processors. In the circuit-switched hypercube, we have to find a set of dedicated link-disjoint routing paths for each node to move a task from a busy subcube to a free subcube in fragmentation. The proposed algorithm is based on the PGC(packed Gray code) which detects all kinds of subcubes.