• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.12
• /
• pp.1124-1131
• /
• 2015

This paper describes a 5-dof ground testbed which emulates micro-gravity environment for developing Rendezvous/docking algorithm of a nano-satellite. The testbed consists of two parts, the low part which eliminates friction force with ground and the upper part which has 3-dof rotational motion with respect to the low part. For Vison-based autonomous navigation algorithm, we use camera, LIDAR and AHRS as sensors and eight cold gas thrusters and three axis directional reaction wheels as actuators. All system software are implemented with C++ based on on-board computer and Linux OS.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.268-281
• /
• 2008

It is difficult to construct streaming services based on the overlay networks without any loss of scalability. DONet is one of the most representative streaming overlay network protocols without managing any specific structure. Since DONet does not support the nodes on private networks, it can be considered that the performance of the overlay is not the best. Hole Punching is one of the famous techniques participating the nodes on private networks to streaming overlay networks by using a rendezvous server. However, using only a single rendezvous server cannot be suggested in P2P environment, because it can cause problems in terms of scalability and so on. In this paper, we propose DONet-p, an extension of DONet with Distributed Hole Punching techniques. It supports the nodes on private networks without toss of scalability. The experimental results show the better performance and scalability than DONet with a minimum overhead for additional control messages.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.1
• /
• pp.167-172
• /
• 2017

Mobile nodes are used for prolonging the life-time of the entire wireless sensor networks and many studies that use drones to collected data have been actively conducted with the development of drone related technology. In case of associating a drone and tactical wireless sensor networks, real-time feature and efficiency are improved. The previous studies so focus on reducing drone's flight distance that the energy consumption of sensor nodes is unbalanced. This unbalanced energy consumption accelerates the network partition and increases drone's flight distance. In this paper, we proposed a new selection scheme considered drone's flight distance and nodes' life-time to solve this problem when rendezvous nodes that collect data from their cluster and directly communicate with a drone are selected.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.5
• /
• pp.695-707
• /
• 1993

Marked Petri Net(MPN) is used to analyze communication complexity with respect to the maximum number of concurrently active rendezvous. But, because it cannot represent timed & probability characteristics explicitly, it is not used to analyze the new execution time of complexity with respect to the communication. Thus to effectively analyze that execution time complexity, we propose Ada Tasking Structure Nets (ATSN) introduced restrictive conditions : net reduction rules, execution time, and probability. Finally, we show the powers of analyze of communication complexity with ATSN.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.10
• /
• pp.770-778
• /
• 2013

Solar sail propulsion uses solar radiation pressure to propel spacecraft without propellant, and it is useful for deep-space missions and continuos orbit maneuver missions. After a brief introduction of solar sail dynamics, locally optimal trajectories in Sun-centered and Earth-centered orbits are analyzed. Numerical simulations for the optimal trajectories are performed. Trajectory for the rendezvous with Halley comet is generated, and different planet escape methods are compared.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1167-1170
• /
• 2002

멀티캐스트 기술은 다자간 비디오회의, 대화형 원격 강의, 소프트웨어 배포, 인터넷 게임 등 특정 사용자 그룹에게만 전송하는 효율적인 통신기술이다. 그러나, 멀티캐스트의 개방적 특성상, 언제 어디서나 임의의 그룹멤버가 메시지를 보낼 수 있다. 따라서 부적절한 데이터의 수신으로부터 그룹 멤버들을 보호하고 다양한 DOS 공격으로부터 멀티캐스트 트리를 보호하기 위해 송신자 접근통제를 수행하는 것이 중요하나 소스기반과 단일지점 또는 랑데부 지점에서 인가되거나 인증되는 연구가 진행되어 왔다. 본 논문에서는 접근권한에 따라 전송 메시지가 라우터의 임의의 지점에서 사진에 통제될 수 있는 양방향 멀티캐스트 트리에 대한 다단계 송신자 접근통제 메커니즘을 제시한다 다음으로 제시한 방식과 기존 전송 방식간의 메시지 전송 효율성 측면을 실험을 통하여 분석한다. 제안 방식이 라우터상에서 접근권한의 비교를 통하여 메시지를 사전에 걸러냄으로써 상대적으로 작은 메시지 전달 오버헤드를 갖는 것을 확인하였다.

• Journal of Astronomy and Space Sciences
• /
• v.15 no.1
• /
• pp.221-228
• /
• 1998

The effect of air drag was researched when a low-earth orbit spacecraft using power-limited thruster rendezvoused another low-earth orbit spacecraft. The air density was assumed to decrease exponentially. The radius of parking orbit was 6655.935km and that of target orbit was 7321.529km. From the trajectories of active vehicles, the fuelconsumption and the magnitude of thrust acceleration, we could conclude that the effect of air drag had to be considered in fuel optimal rendezvous problem between low-earth orbit spacecrafts. In multiple-revolution rendezvous case, the air drag was more effective.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.4
• /
• pp.189-196
• /
• 2020

In cognitive radio networks, secondary transmitters should cease its transmission immediately on detecting of primary transmission in the spectrum they are accessing. Then they should exploit another idle spectrums and handoff to the newly found idle spectrums, which is called spectrum rendezvous. With regards to spectrum rendezvous, most of related work presume the existence of dedicated common control channel used by secondary users for exchanging the information of idle spectrums. However, this presumption is not feasible in real world cognitive radio scenario. Therefore we address a blind spectrum rendezvous scheme with no need of separate control channel. Furthermore we consider maintaining one or more extra spectrums (channels) to expedite the spectrum rendezvous. Our scheme lets secondary users maintain extra spectrums by exchanging the spectrum information periodically during normal communications. The one of the extra spectrums are regarded as a candidate spectrum that the users can handoff to on detecting the primary transmission. We evaluate that our blind scheme can help to reduce the rendezvous delay in a real world cognitive radio environments with USRPs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10B
• /
• pp.621-629
• /
• 2007

In cognitive radio (CR) network, the channels are generally classified into either the unavailable channels that are occupied by incumbent users or the available channels that are not occupied. The conventional channel classification scheme may result in poor utilization of spectrum holes since it does not take the spatial relationship between CR node and incumbent users into consideration. In this paper, we propose an efficient channel management scheme for the centralized CR network to maximize the spectrum holes by overcoming the shortcomings of conventional scheme. In addition, we mathematically analyze the effectiveness of proposed scheme. Based on the proposed channel management scheme, we also propose the rendezvous algorithm, which can establish the control channels between base station and CR node under the dynamically changing spectrum environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6A
• /
• pp.617-625
• /
• 2011

In wireless sensor networks, data dissemination protocols have been proposed for mobile sink groups that are characterized by geographically staying closely and collective movement. They usually exploit flooding technology for mobility supporting and data delivery guarantee. However, it causes the excessive energy consumption of all sensor nodes in the group region due to data delivery participation. Moreover, the costs of the flooding would become higher in proportional to the group region. In this paper, we propose an energy efficient data dissemination scheme that resolves these problems. The virtual infrastructure called a 'pipe' is used as a rendezvous area. A source delivers data to the pipe, from which member sinks in the group retrieve it directly. Simulation results showed that this solution has better performance than existing protocols in terms of energy consumption as it reduces the number of regional flooding and eliminates unnecessary data flooding.