• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.905-912
• /
• 2006

Depending on the location of the rendezvous point (RP), the network efficiency is determined in the core based tree (CBT) or protocol independent multicast-sparse mode (PIM-5M) multicasting protocol to provide the multicast services based on the shared tree. In this paper, a new algorithm to allocate the RP using the estimated values of the total cost and the size(number of entries) of the routing tables is proposed for efficiently controlling the cost and the number of routing table entries. The numerical results show that the proposed algorithm reduces the total cost in 5.37%, and the size of routing tables in 13.35% as compared to the previous algorithm.

• The Bulletin of The Korean Astronomical Society
• /
• v.24 no.2
• /
• pp.82-82
• /
• 1999

• Bulletin of the Korean Space Science Society
• /
• 1999.09a
• /
• pp.74-74
• /
• 1999

• Bulletin of the Korean Space Science Society
• /
• 2000.04a
• /
• pp.35-35
• /
• 2000

• Bulletin of the Korean Space Science Society
• /
• 2000.04a
• /
• pp.36-36
• /
• 2000

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1520-1523
• /
• 2007

최근 이동사무환경에 대한 관심이 증대되고 있다. 이를 위한 '유비쿼터스 이동사무환경 시스템'의 메신저 시스템은 기존 XMPP 메신저 프로토콜을 적용할 수 있으나, 몇 가지의 제약조건이 존재한다. 본 논문은 기존의 XMPP 를 확장해 이동사무환경에 적합한 새로운 프로토콜을 설계하고, 이를 실제 구현한 랑데부 서버에 적용하였다. 새롭게 개발한 MPE-MP 프로토콜은 사무환경의 전송을 위해 XMPP의 기본 네트웍 모델인 CS (Client-Server) 모델을 사용하지 않고, P2P (Point to Point) 방식을 사용하여 사무환경 전송을 수행한다. 본 논문에서는 MOE-MP 이동사무환경 메신저 프로토콜과 이의 구현인 랑데부 서버에 대한 특징, 기능을 서술한다.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.45 no.9
• /
• pp.775-783
• /
• 2017

In this paper, an impulsive rendezvous problem by using minimum energy of spacecraft in different orbits is addressed. In particular, the orbits considered in this paper are the general orbits including the elliptic orbit, while most of the orbits considered in the literature have been restricted within co-planar or circular orbits. The constraints for solving this optimization problem are the Kepler's equation formulated with the universal variable, and the final position and velocity of two spacecraft. Also, the Lagrange coefficients, sometimes called as f and g solution, are used to describe the orbit transfer. The proposed method technique is demonstrated through numerical simulation by considering the minimum energy, and both the minimum energy and the wait time, respectively. Finally, it is also verified by comparing with the Hohmann transfer known as the minimum energy trajectory. Although a closed-form solution cannot be obtained, it shows that the suggested technique can provide a new insight to solve various orbital transfer problems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.613-619
• /
• 2003

Bluetooth is a communication technology enabling short-range devices to be wirelessly connected. A master and one or more slave devices are connected to form a piconet, and piconets are joined to form a scatternet. The units participating in two or more piconets in a scatternet, is called bridge or gateway nodes. In order to operate the scatternet efficiently, both piconet scheduling for the master and slaves of a piconet, and scatternet scheduling for the bridge nodes are playing important roles. In this paper, we propose a traffic-adaptive dynamic scatternet scheduling algorithm based on rendezvous points and rendezvous windows. The performance of the proposed algorithm is compared and analyzed with that of a static scheduling algorithm via simulations. Simulation results show that our algorithm can distribute wireless resources efficiently to bridge nodes depending on the traffic characteristics.

• 전기의세계
• /
• v.30 no.9
• /
• pp.579-581
• /
• 1981

A rendezvous method via delayed state feedback is presented for a class of linear systems with time-delays. The property of pointwise degeneracy of delay differential system is utilized and it is shown that the controller is a minimun-time suboptimal controller.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1486-1492
• /
• 2007

Searching distributed resources efficiently is very important in distributed computing environments like P2P. But distributed resource searching may have system overheads and take a lot of time in proportion to the searching number, because distributed resource searching has to circuit many peers for searching information. In this paper, we design a proxy peer algorithm based on DHT(Distributed Hash Table) for efficient distributed resource searching in JXTA network environments. By containing the rendezvous information in proxy peer and searching a rendezvous peer firstly which has higher hit ratio, we can reduce the searching number and minimize system overheads.