• Title/Summary/Keyword: Rendezvous

Search Result 102, Processing Time 0.039 seconds

Receiver-driven Channel Rendezvous for Multi-channel Wireless Sensor Networks

  • Rahman, Md. Obaidur;Hong, Choong-Seon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06a
    • /
    • pp.359-360
    • /
    • 2011
  • In this work. a new receiver-driven channel rendezvous mechanism is proposed for multi-channel communication in Wireless sensor networks (WSNs). The work is a light-weight scheduled scheme. seems to be incurring less overhead in compare to traditional common control channel based rendezvous mechanisms.

Spacecraft Guidance Algorithms for Asteroid Intercept and Rendezvous Missions

  • Hawkins, Matt;Guo, Yanning;Wie, Bong
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.13 no.2
    • /
    • pp.154-169
    • /
    • 2012
  • This paper presents a comprehensive review of spacecraft guidance algorithms for asteroid intercept and rendezvous missions. Classical proportional navigation (PN) guidance is reviewed first, followed by pulsed PN guidance, augmented PN guidance, predictive feedback guidance, Lambert guidance, and other guidance laws based on orbit perturbation theory. Optimal feedback guidance laws satisfying various terminal constraints are also discussed. Finally, the zero-effort-velocity (ZEV) error, analogous to the well-known zero-effort-miss (ZEM) distance, is introduced, leading to a generalized ZEM/ZEV guidance law. These various feedback guidance laws can be easily applied to real asteroid intercept and rendezvous missions. However, differing mission requirements and spacecraft capabilities will require continued research on terminal-phase guidance laws.

A Study on Rendezvous Point between the Mobile Robot and Predicted Moving Objects (경로예측이 가능한 이동물체와 이동로봇간의 Rendezvous Point에 관한 연구)

  • Youn, Jung-Hoon;Lee, Kee-Seong
    • Proceedings of the KIEE Conference
    • /
    • 2001.11c
    • /
    • pp.84-86
    • /
    • 2001
  • A new navigation method is developed and implemented for mobile robot. The mobile robot navigation problem has traditionally been decomposed into the path planning and path following. Unlike tracking-based system, which minimize intercept time and moved mobile robot distance for optimal rendezvous point selection. To research of random moving object uses algorithm of Adaptive Control using Auto-regressive Model. A fine motion tracking object's trajectory is predicted of Auto-regressive Algorithm. Thus, the mobile robot can travel faster than the target wi thin the robot's workspace. The can select optimal rendezvous point of various intercept time.

  • PDF

A Multi-Node Channel Rendezvous Algorithm in Cognitive Radio Ad-hoc Networks (인지 무선 애드혹 네트워크에서의 멀티노드 채널 랑데부 알고리즘)

  • Seong, Jin-uk;Lee, Bong-Hwan;Yang, Dongmin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.4
    • /
    • pp.453-461
    • /
    • 2019
  • In this paper, we focus on the study of multi-node rendezvous on one common channel among multiple channels before transmitting in CRAHNs (Cognitive Radio Ad-hoc Networks) for the efficient use of inefficient frequency resources. Most existing researches have dealt with the channel rendezvous between two nodes. But, it can be time-consuming to apply them to three or more nodes. In addition, it cab be impossible to communicate with each other. Therefore, in this paper, we propose a Multi-Node Sequence (MNSEQ), which allows three or more nodes to rendezvous on a single common channel in a short period of time. And, CSMA/CA was applied for data exchange after rendezvous. By performance evaluation through very extensive simulations, we have demonstrated that the proposed MNSEQ outperforms the existing scheme in terms of communication completion time and transmission efficiency.

Adaptive Tracking Control for Spacecraft Rendezvous and Docking (우주비행체의 랑데부 및 도킹을 위한 적응 제어기법)

  • Yoon, Hyung-Joo;Shin, Hyo-Sang;Tahk, Min-Jea
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.36 no.11
    • /
    • pp.1072-1078
    • /
    • 2008
  • An adaptive control algorithm for spacecraft rendezvous and docking in a Keplerian orbit is presented. The equations of relative motion of two spacecrafts expressed in a local-vertical-local-horizontal rectangular frame are converted to a general Hamiltonian form, then an adaptive control method developed for the uncertain Hamiltonian system is applied to the rendezvous and docking problem. A smooth projection algorithm is applied to keep the parameter estimates inside a singularity-free region, and a numerical example shows that the developed controller successfully deals with the unknown mass of the chaser spacecraft.

A Rendezvous Router Decision Algorithm Considering Routing Table Size (라우팅 테이블의 크기를 고려한 랑데부 라우터 선정 알고리즘)

  • Cho, Kee-Seong;Jang, Hee-Seon;Kim, Dong-Whee
    • 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.

Load-Balancing Rendezvous Approach for Mobility-Enabled Adaptive Energy-Efficient Data Collection in WSNs

  • Zhang, Jian;Tang, Jian;Wang, Zhonghui;Wang, Feng;Yu, Gang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.3
    • /
    • pp.1204-1227
    • /
    • 2020
  • The tradeoff between energy conservation and traffic balancing is a dilemma problem in Wireless Sensor Networks (WSNs). By analyzing the intrinsic relationship between cluster properties and long distance transmission energy consumption, we characterize three node sets of the cluster as a theoretical foundation to enhance high performance of WSNs, and propose optimal solutions by introducing rendezvous and Mobile Elements (MEs) to optimize energy consumption for prolonging the lifetime of WSNs. First, we exploit an approximate method based on the transmission distance from the different node to an ME to select suboptimal Rendezvous Point (RP) on the trajectory for ME to collect data. Then, we define data transmission routing sequence and model rendezvous planning for the cluster. In order to achieve optimization of energy consumption, we specifically apply the economic theory called Diminishing Marginal Utility Rule (DMUR) and create the utility function with regard to energy to develop an adaptive energy consumption optimization framework to achieve energy efficiency for data collection. At last, Rendezvous Transmission Algorithm (RTA) is proposed to better tradeoff between energy conservation and traffic balancing. Furthermore, via collaborations among multiple MEs, we design Two-Orbit Back-Propagation Algorithm (TOBPA) which concurrently handles load imbalance phenomenon to improve the efficiency of data collection. The simulation results show that our solutions can improve energy efficiency of the whole network and reduce the energy consumption of sensor nodes, which in turn prolong the lifetime of WSNs.

A Study on Tatyana Tolstaya's Rendezvous with Bird (따찌야나 똘스따야의 단편 「새와의 만남」에 나타난 절망과 죽음의 모티프 - 조이스, 욘손과의 비교를 중심으로 -)

  • Choi, Haeng-Gyu
    • Cross-Cultural Studies
    • /
    • v.41
    • /
    • pp.415-442
    • /
    • 2015
  • Through the comparison of "Rendezvous with a Bird" with "Araby", there were found to be well-explained psychological causes of the boy's (Petya) behavior that closely discloses the concrete object of desperation and definitely confirmed the internal causes of heroes (vanity of the boys in "Araby" and "Rendezvous with bird"). Through the comparison of "Rendezvous with a Bird" with "A man in a boat" we also knew that Petya's indefinite fear of death was to some extent a sense of guilt. This study contains a full-scale review of Russian contemporary writer Tatyana Tolstaya's short story "Rendezvous with a Bird", which is one of the her earliest works. As many critics indicate, the works of Tatyana Tolstaya resonate with metaphor. "Rendezvous with a bird" plays an important role in understanding this metaphoric tendency. In order to understand the metaphoric tendency of her works we need our own reading strategy, and so we inquired into the grasp of the main motifs. Analysis of the main motifs can start from the understanding of meanings of the very figurative title 'Rendezvous with a Bird'. To understand the meanings of the title, we first of all analyzed the incidents of actual or figurative meetings with birds in this work, and through this we deduced two main motifs. We confirmed one main motif of 'desperation', which centers on the love of a young boy and woman. We confirmed the other motif as 'death', which developed into the rendezvous of the grandfather with inevitable death. Thus, the 'desperation' and 'death' with which we meet in childhood becomes a subject matter for the writer. To understand the deeper meanings of these main motifs, we compared "Rendezvous with Bird" with the short story "Araby" by James Joyce and with the short story "A man in a boat" by Eyvind Johnson, which very successfully deal with the motifs: 'desperation' and 'death'.

Vicious Cycle of MAC Protocols of Cognitive Radio Ad Hoc Networks: Problem Statement

  • Htike, Zaw;Hong, Choong-Seon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06d
    • /
    • pp.294-296
    • /
    • 2012
  • In cognitive radio ad hoc networks, secondary users need to exchange control information before data transmission. This task is not trivial in cognitive radio networks due to the dynamic nature of environment. This problem is sometime called rendezvous problem of cognitive radio network. The rendezvous problem is normally tackled by using two famous approaches: the use of common control channel (CCC) and using channel hopping (a.k.a sequence-based protocols). However, these two famous solutions form a vicious cycle while solving the rendezvous problem. The main purpose of this paper is to point out how and why this vicious cycle is formed.