International Telemetering Conference Proceedings / October 26-29, 1998 / Town & Country Resort Hotel and Convention Center, San Diego, California / The Near Earth Asteroid Prospector (NEAP) has a scheduled launch date between mid- 1999 and mid-2000, and will encounter a yet to be determined near Earth asteroid (1.1 - 2.2 AU distance from Earth) some ten months later [2]. The purpose of this mission is not only to collect valuable scientific and geological data, but to also determine the value of the asteroid’s materials for possible mining and exploitation [2], [3]. The purpose of this paper is to detail frequency allocation issues and to determine possible return (space to Earth) data rates associated with deep space communications with the NEAP spacecraft.

This concept of calculating, optimizing, and utilizing a trajectory known as a ``Free Return Trajectory" to facilitate spacecraft rendezvous with Near-Earth Asteroids is presented in this dissertation. A Free Return Trajectory may be defined as a trajectory that begins and ends near the same point, relative to some central body, without performing any deterministic velocity maneuvers (i.e., no maneuvers are planned in a theoretical sense for the nominal mission to proceed). Free Return Trajectories have been utilized previously for other purposes in astrodynamics, but they have not been previously applied to the problem of Near-Earth Asteroid rendezvous. Presented here is a series of descriptions, algorithms, and results related to trajectory initial guess calculation and optimal trajectory convergence. First, Earth-centered Free Return Trajectories are described in a general manner, and these trajectories are classified into several families based on common characteristics. Next, these trajectories are used to automatically generate initial conditions in the three-body problem for the purpose of Near-Earth Asteroid rendezvous. For several bodies of interest, example initial conditions are automatically generated, and are subsequently converged, resulting in feasible, locally-optimal, round-trip trajectories to Near-Earth Asteroids utilizing Free Return Trajectories. Subsequently, a study is performed on using an unpowered flyby of the Moon to lower the overall DV cost for a nominal round-trip voyage to a Near-Earth Asteroid. Using the Moon is shown to appreciably decrease the overall mission cost. In creating the formulation and algorithms for the Lunar flyby problem, an initial guess routine for generic planetary and lunar flyby tours was developed. This continuation algorithm is presented next, and details a novel process by which ballistic trajectories in a simplistic two-body force model may be iteratively converged in progressively more realistic dynamical models until a final converged ballistic trajectory is found in a full-ephemeris, full-dynamics model. This procedure is useful for constructing interplanetary transfers and moon tours in a realistic dynamical framework; an interplanetary and an inter-moon example are both shown. To summarize, the material in this dissertation consists of: novel algorithms to compute Free Return Trajectories, and application of the concept to Near-Earth Asteroid rendezvous; demonstration of cost-savings by using a Lunar flyby; and a novel routine to transfer trajectories from a simplistic model to a more realistic dynamical representation. / text

The most significant challenge for next wireless generation is to work opportunistically on the spectrum without a fixed spectrum allocation. Cognitive Radio (CR) is the candidate technology to utilize spectrum white space, which requires the CR to change its operating channel as the white space moves. In a CR ad-hoc network, each node could tune to a different channel; as a result, it cannot communicate with other nodes. This different tuning is due to the difficulty of maintaining Common Control Channel (CCC) in opportunistic spectrum network, and keeping the nodes synchronized in ad-hoc network. The CR ad-hoc network requires a protocol to match tuning channels between ad-hoc nodes, namely, rendezvous channels. In this thesis, two distributed Medium Access Control (MAC) protocols are designed that provide proper rendezvous channel without CCC or synchronization. The Balanced Incomplete Block Design (BIBD) is used in both protocols to provide our protocols a method of rendezvous between CR ad-hoc nodes. In fact, the BIBD guarantees there is at least one common element between any two blocks. If the channels are assigned to the BIBD elements and the searching sequence to the BIBD block, there is a guarantee of a rendezvous at least in one channel for each searching sequence. The first protocol uses a single-BIBD sequence and a multi-channel sensing. Alternatively, the second protocol uses a multi-BIBD sequence and a single-channel sensing. The single-sequence protocol analysis is based on the discrete Markov Chain. At the same time, the sequence structure of the BIBD in a multi-sequence protocol is used to define the Maximum Time to Rendezvous (MTTR). The simulation results confirm that the protocols outperform other existing protocols with respect to Time to Rendezvous (TTR), channel utilization, and network throughput. In addition, both protocols fairly distribute the network load on channels, and share the channels fairly among network nodes. This thesis provides straight forward and efficiently distributed MAC protocols for the CR ad-hoc networks.

The most significant challenge for next wireless generation is to work opportunistically on the spectrum without a fixed spectrum allocation. Cognitive Radio (CR) is the candidate technology to utilize spectrum white space, which requires the CR to change its operating channel as the white space moves. In a CR ad-hoc network, each node could tune to a different channel; as a result, it cannot communicate with other nodes. This different tuning is due to the difficulty of maintaining Common Control Channel (CCC) in opportunistic spectrum network, and keeping the nodes synchronized in ad-hoc network. The CR ad-hoc network requires a protocol to match tuning channels between ad-hoc nodes, namely, rendezvous channels. In this thesis, two distributed Medium Access Control (MAC) protocols are designed that provide proper rendezvous channel without CCC or synchronization. The Balanced Incomplete Block Design (BIBD) is used in both protocols to provide our protocols a method of rendezvous between CR ad-hoc nodes. In fact, the BIBD guarantees there is at least one common element between any two blocks. If the channels are assigned to the BIBD elements and the searching sequence to the BIBD block, there is a guarantee of a rendezvous at least in one channel for each searching sequence. The first protocol uses a single-BIBD sequence and a multi-channel sensing. Alternatively, the second protocol uses a multi-BIBD sequence and a single-channel sensing. The single-sequence protocol analysis is based on the discrete Markov Chain. At the same time, the sequence structure of the BIBD in a multi-sequence protocol is used to define the Maximum Time to Rendezvous (MTTR). The simulation results confirm that the protocols outperform other existing protocols with respect to Time to Rendezvous (TTR), channel utilization, and network throughput. In addition, both protocols fairly distribute the network load on channels, and share the channels fairly among network nodes. This thesis provides straight forward and efficiently distributed MAC protocols for the CR ad-hoc networks.

In the past decade, the development of wireless communication technologies has made the use of the Internet ubiquitous. With the increasing number of new inventions and applications using wireless communication, more interference is introduced among wireless devices that results in limiting the capacity of wireless networks. Many approaches have been proposed to improve the capacity. One approach is to exploit multiple channels by allowing concurrent transmissions, and therefore it can provide high capacity. Many available, license-exempt, and non-overlapping channels are the main advantages of using this approach. Another approach that increases the network capacity is to adjust the transmission power; hence, it reduces interference among devices and increases the spatial reuse. Integrating both approaches provides further capacity. However, without careful transmission power control (TPC) design, the network performance is limited. The first part of this thesis tackles the integration to efficiently use multiple channels with an effective TPC design in a distributed manner. We examine the deficiency of uncontrolled asymmetrical transmission power in multi-channel ad hoc wireless networks. To overcome this deficiency, we propose a novel distributed transmission power control protocol called the distributed power level (DPL) protocol for multi-channel ad hoc wireless networks. DPL allocates different maximum allowable power values to different channels so that the nodes that require higher transmission power are separated from interfering with the nodes that require lower transmission power. As a result, nodes select their channels based on their minimum required transmission power to reduce interference over the channels. We also introduce two TPC modes for the DPL protocol: symmetrical and asymmetrical. For the symmetrical mode, nodes transmit at the power that has been assigned to the selected channel, thereby creating symmetrical links over any channel. The asymmetrical mode, on the other hand, allows nodes to transmit at a power that can be lower than or equal to the power assigned to the selected channel. In the second part of this thesis, we propose the multi-channel MAC protocol with hopping reservation (MMAC-HR) for multi-hop ad hoc networks to overcome the multi-channel exposed terminal problem, which leads to poor channel utilization over multiple channels. The proposed protocol is distributed, does not require clock synchronization, and fully supports broadcasting information. In addition, MMAC-HR does not require nodes to monitor the control channel in order to determine whether or not data channels are idle; instead, MMAC-HR employs carrier sensing and independent slow channel hopping without exchanging information to reduce the overhead. In the last part of this thesis, a novel multi-channel MAC protocol is developed without requiring any change to the IEEE 802.11 standard known as the dynamic switching protocol (DSP) based on the parallel rendezvous approach. DSP utilizes the available channels by allowing multiple transmissions at the same time and avoids congestion because it does not need a dedicated control channel and enables nodes dynamically switch among channels. Specifically, DSP employs two half-duplex interfaces: One interface follows fast hopping and the other one follows slow hopping. The fast hopping interface is used primarily for transmission and the slow hopping interface is used generally for reception. Moreover, the slow hopping interface never deviates from its default hopping sequence to avoid the busy receiver problem. Under single-hop ad hoc environments, an analytical model is developed and validated. The maximum saturation throughput and theoretical throughput upper limit of the proposed protocol are also obtained.

In the past decade, the development of wireless communication technologies has made the use of the Internet ubiquitous. With the increasing number of new inventions and applications using wireless communication, more interference is introduced among wireless devices that results in limiting the capacity of wireless networks. Many approaches have been proposed to improve the capacity. One approach is to exploit multiple channels by allowing concurrent transmissions, and therefore it can provide high capacity. Many available, license-exempt, and non-overlapping channels are the main advantages of using this approach. Another approach that increases the network capacity is to adjust the transmission power; hence, it reduces interference among devices and increases the spatial reuse. Integrating both approaches provides further capacity. However, without careful transmission power control (TPC) design, the network performance is limited. The first part of this thesis tackles the integration to efficiently use multiple channels with an effective TPC design in a distributed manner. We examine the deficiency of uncontrolled asymmetrical transmission power in multi-channel ad hoc wireless networks. To overcome this deficiency, we propose a novel distributed transmission power control protocol called the distributed power level (DPL) protocol for multi-channel ad hoc wireless networks. DPL allocates different maximum allowable power values to different channels so that the nodes that require higher transmission power are separated from interfering with the nodes that require lower transmission power. As a result, nodes select their channels based on their minimum required transmission power to reduce interference over the channels. We also introduce two TPC modes for the DPL protocol: symmetrical and asymmetrical. For the symmetrical mode, nodes transmit at the power that has been assigned to the selected channel, thereby creating symmetrical links over any channel. The asymmetrical mode, on the other hand, allows nodes to transmit at a power that can be lower than or equal to the power assigned to the selected channel. In the second part of this thesis, we propose the multi-channel MAC protocol with hopping reservation (MMAC-HR) for multi-hop ad hoc networks to overcome the multi-channel exposed terminal problem, which leads to poor channel utilization over multiple channels. The proposed protocol is distributed, does not require clock synchronization, and fully supports broadcasting information. In addition, MMAC-HR does not require nodes to monitor the control channel in order to determine whether or not data channels are idle; instead, MMAC-HR employs carrier sensing and independent slow channel hopping without exchanging information to reduce the overhead. In the last part of this thesis, a novel multi-channel MAC protocol is developed without requiring any change to the IEEE 802.11 standard known as the dynamic switching protocol (DSP) based on the parallel rendezvous approach. DSP utilizes the available channels by allowing multiple transmissions at the same time and avoids congestion because it does not need a dedicated control channel and enables nodes dynamically switch among channels. Specifically, DSP employs two half-duplex interfaces: One interface follows fast hopping and the other one follows slow hopping. The fast hopping interface is used primarily for transmission and the slow hopping interface is used generally for reception. Moreover, the slow hopping interface never deviates from its default hopping sequence to avoid the busy receiver problem. Under single-hop ad hoc environments, an analytical model is developed and validated. The maximum saturation throughput and theoretical throughput upper limit of the proposed protocol are also obtained.

Multicasting in a network improves the efficiency to deliver an IP packet to multiple clients at the same time. Small to medium sized organizations implement this technology to enhance their network capability, which is otherwise not possible just with normal routing. However, to use this technology, it requires proper network design with tidy resource implementation.Network administrators prefer automatic deployment of multicast technology because it reduces the potential risk of prolonged down time during network troubleshooting. On the other hand, choosing an auto deployment technology could cause malfunctioning in the network. To avoid such malfunctioning, we used two technologies: Auto-RP (Auto- Rendezvous Point) [1] and Bootstrap [2] in our network. A problem that occurs here is that if different domains with similar or different technologies want to share their resources with each other, then regular multicasting cannot connect them for successful communication. Also, if an administrator wishes to provide short and redundant paths within a domain, then these two technologies do not possess the ability to do so.The thesis presents issues in intra-domain and inter-domain multicast networks; it also focuses on Auto-RP (Auto Rendezvous Point) and BSR (Bootstrap Router) which are technologies related to multicasting. This project highlights the importance of multicasting security and will brief the problems associated with these two technologies. It will offer a better solution with a properly implemented design guide. The study uses MSDP (Multicast Source Discovery Protocol) [3] which connects two domains with multicasting capabilities for exchanging the source and providing redundancy in intra- domain. The work implements MBGP (Multicast Border Gateway Protocol) [4] to avoid a situation in which there is no multicast support on one of the service provider(s) end. Keywords:Auto-RP (Auto-Rendezvous Point), BSR (Bootstrap Router), MSDP (Multicast Source Discovery Protocol), MBGP (Multicast Border Gateway Protocol)

No description available.

Formation flying of satellites describes a mission in which a set of satellites arrange their position with respect to one another. In this paper, satellite formation flying guidance and control algorithms are investigated in terms of required velocity increment Delta-v, and tracking error for a Chief/Deputy satellite system. Different control methods covering continuous and impulsive laws are implemented and tested for Low Earth Orbit (LEO). Sliding Mode, Feedback Linearization and Model Predictive Controllers are compared to an Impulsive Feedback Law which tracks the mean orbital element differences. Sliding Mode and Feedback Linearization controllers use the same dynamic model which includes Earth Oblateness perturbations. On the other hand, Model Predictive Control with Multi-Objective Cost Function is based on the Clohessy–Wiltshire equations, which do not account for any perturbation and do not cover the eccentricity of the orbit. The comparison was done for two different missions both including Earth Oblateness effects only. A relative orbit mission, which was based on the Prisma Satellite Mission and a rendezvous mission, was implemented. The reference trajectory for the controllers was generated with Yamanaka and Ankersen’s state transition matrix, while a separate method was used for the Impulsive Law. In both of the missions, it was observed that the implemented Impulsive Law outperformed in terms of Delta-v, 1.2 to 3.5 times smaller than the continuous control approaches, while the continuous controllers had a smaller tracking error, 2 to 8.3 times less, both in terms of root mean square error and maximum error in the steady state. Finally, this study shows that the tracking error and Delta-v has inversely proportional relationship. / Formationsflygning av satelliter innebär att en grupp satelliter flyger tillsammans och anpassar sina relativa lägen i förhållande till varandra. I detta examensarbete studerades regleralgoritmer för formationsflygande satelliter med fokus på bränsleförbrukning och positionsavvikelse genom ”Chief & Deputy”-metoden. Olika reglermetoder har studerats, t.ex. Sliding Mode- och Feedback Linearization-reglering för formationsflygningsfall i låg jordbana med J2-störning samt en Model Predictive-reglering för fall med relativ rörelse baserad på Clohessy-Wiltshire-ekvationerna. Vidare studerades en reglermetod baserad på impulsframdrivning. De fyra reglermetoderna implementerades på två olika rymduppdrag. Först ett uppdrag baserat på Prisma-satelliterna för två satelliter i relativ omloppsbana och sedan ett Rendezvous-uppdrag. Referensbanan för alla reglermetoder, utom för implusmetoden, har tagits fram med hjälp av Yamanakas och Ankersens tillståndsmatris. Resultaten visar att den implementerade impulsmetoden presterar bättre med avseende på bränsleförbrukning, medan de kontinuerliga reglermetoderna producerade mindre relativ positionsavvikelse, både med avseende på kvadratiskt medelvärde och maximalt värde.

The tremendous success of various wireless applications operating in unlicensed bands has resulted in the overcrowding of those bands. Cognitive radio (CR) is a new technology that enables an unlicensed user to coexist with incumbent users in licensed spectrum bands without inducing interference to incumbent communications. This technology can significantly alleviate the spectrum shortage problem and improve the efficiency of spectrum utilization. Networks consisting of CR nodes (i.e., CR networks)---often called dynamic spectrum access networks or NeXt Generation (XG) communication networks---are envisioned to provide high bandwidth to mobile users via heterogeneous wireless architectures and dynamic spectrum access techniques. In recent years, the operational aspects of CR networks have attracted great research interest. However, research on the security aspects of CR networks has been very limited. In this thesis, we discuss security issues that pose a serious threat to CR networks. Specifically, we focus on three potential attacks that can be launched at the physical or MAC layer of a CR network: primary user emulation (PUE) attack, spectrum sensing data falsification (SSDF) attack, and control channel jamming (CCJ) attack. These attacks can wreak havoc to the normal operation of CR networks. After identifying and analyzing the attacks, we discuss countermeasures. For PUE attacks, we propose a transmitter verification scheme for attack detection. The scheme utilizes the location information of transmitters together with their signal characteristics to verify licensed users and detect PUE attackers. For both SSDF attacks and CCJ attacks, we seek countermeasures for attack mitigation. In particular, we propose Weighted Sequential Probability Ratio Test (WSPRT) as a data fusion technique that is robust against SSDF attacks, and introduce a multiple-rendezvous cognitive MAC (MRCMAC) protocol that is robust against CCJ attacks. Using security analysis and extensive numerical results, we show that the proposed schemes can effectively counter the aforementioned attacks in CR networks. / Ph. D.