Zugl.: Karlsruhe, Univ., Diss. 2006.

Thesis (M.S. in Information Technology Management) Naval Postgraduate School, September 1996. / Thesis advisor(s): Gus K. Lott, Cynthia E. Irvine, Rex Buddenberg. "September 1996." Includes bibliographical references (p. 135-140). Also available online.

Thesis (Ph. D.)--University of Hong Kong, 2010. / Includes bibliographical references (leaves 88-96). Also available in print.

Thesis (M.S.)--Brigham Young University. Dept. of Computer Science, 2006. / Includes bibliographical references (p. 109-113).

International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / While the transition to IP internetworking in space-based applications has a tremendous upside, there are significant challenges of communications efficiency and compatibility to overcome. This paper describes a very high efficiency, low-risk, incremental architecture for migrating to IP internetworking based on the use of proxies. In addition to impressive gains in communications bandwidth, the architecture provides encapsulation of potentially volatile decisions such as particular vendors and network technologies. The specific benchmarking architecture is a NetAcquire Corporation COTS telemetry system that includes built-in TCP-Tranquility (also known as SCPS-TP) and Reed-Solomon Forward Error Correction capabilities as well as a specialized proxy-capable network stack. Depending on network conditions, we will show that the effective bandwidth for satellite transmissions can be increased as much as a factor of one hundred with no external changes to existing internetworking equipment.

Different from multiple-input multiple-output (MIMO) systems, a major challenge for cooperative communications is the problem of synchronization because multiple transmissions undertaken by cooperative systems may not be synchronized in time and/or frequency. With synchronization errors, conventional space-time (ST) codes may not be directly applicable any longer. To tackle the problem of timing synchronization, space-frequency (SF) coded orthogonal frequency division multiplexing (OFDM) cooperative systems have recently been proposed to achieve asynchronous diversity due to their insensitivity to timing errors. However, these systems still need to face the problem of multiple carrier frequency offsets (CFOs). Since each node in a cooperative system is equipped with its own oscillator, the received signals from different relay nodes may have multiple CFOs which cannot be compensated simultaneously at the destination node. For SF coded OFDM cooperative systems, this problem becomes more complicated because CFOs can lead to inter-carrier interference (ICI). To address this challenge, in this thesis we consider the signal detection problem in cooperative systems having multiple CFOs. / First, we investigate the effect of multiple CFOs on two classic ST codes. They are delay diversity and the Alamouti code. For delay diversity, we find that both its achieved diversity order and diversity product are not decreased by multiple CFOs arising from maximum-likelihood (ML) detection. For the Alamouti code, the diversity product may be decreased by multiple CFOs. In the worst case situation, full diversity order 2 cannot be achieved. / For deeper insights into the SF coded communication system with multiple CFOs, we then carry out diversity analysis. By treating the CFOs as part of the SF codeword matrix, we show that if all the absolute values of normalized CFOs are less than 0.5, then the full diversity order for the SF codes are not affected by the multiple CFOs in the SF coded OFDM cooperative system. We further prove that this full diversity property can still be preserved if the zero forcing (ZF) method is used to equalize the multiple CFOs. This method, by some reasonable approximations, is actually equivalent to the MMSE-F detection method. To improve the robustness of the SF codes to multiple CFOs, we propose a novel permutation method. With this method, the achieved diversity order of SF codes remains the same even when the absolute values of normalized CFOs are equal to or greater than 0.5. To reduce computational complexity, we further propose two full diversity achievable detection methods, namely the ZF-ML-Zn and ZF-ML-PIC detection methods, which are suitable for the case when the ICI matrix is singular. / In summary, in this study, we demonstrate that with proper design, the SF coded OFDM approach can be made robust to both timing errors and CFOs in a cooperative communication system. / Since OFDM systems are robust to timing errors, we turn to an SF coded cooperative communication system with multiple CFOs, where the SF codes are rotational based and can achieve both full cooperative and full multipath diversity orders. We begin with the traditional way of ICI mitigation. To preserve the performance of the SF code, we suggest increasing the SINR of each subcarrier but not equalizing the SF precoding matrix. By exploiting the structure of the SF codes, we propose three signal detection methods to deal with the multiple CFOs problem in SF coded OFDM systems. They are the minimum mean-squared filtering (MMSE-F) method, the two-stage simple frequency shift Q taps (FS-Q-T) method, and the multiple fast Fourier transform (M-FFT) method, all of which offer different tradeoffs between performance and computational complexity. Our simulation results indicate that the proposed detection methods perform well as long as the CFOs between nodes are small. / Tian, Feng. / Adviser: Ching Pak-Chung. / Source: Dissertation Abstracts International, Volume: 71-01, Section: B, page: 0559. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 146-160). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. Ann Arbor, MI : ProQuest Information and Learning Company, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese.

Title from PDF of title page (University of Missouri--Columbia, viewed on March 10, 2010). The entire thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file; a non-technical public abstract appears in the public.pdf file. Thesis advisor: Dr. Wenjun Zeng. Includes bibliographical references.

No description available.

El presente trabajo surge como una necesidad en el Campus de la Universidad Nacional de Salta, de contar con herramientas que faciliten al Ingeniero de redes realizar tareas de administración desde cualquier punto de la red, independizándolo de esta manera de la plataforma necesaria para ejecutar aplicaciones de gestión. La Administración o Gestión basada en Web es la aplicación de la tecnología World Wide Web a redes y administración de dispositivos. Pretende aprovechar la amplia difusión de los navegadores como interfaz de usuario universal, para utilizarlos como interfaz para las aplicaciones de gestión. Debido a que esta tecnología es relativamente nueva, pocos investigadores se adentraron en el tema hasta ahora. El principal beneficio de los mecanismos de Gestión basados en Web es que los desarrolladores de aplicaciones no tienen por qué conocer los detalles de los protocolos de gestión para manejar dispositivos remotos. Adicionalmente esto permite abstraer los diferentes protocolos y unificarlos con una única visión. Este trabajo plantea por una parte inspeccionar el área de la Gestión basada en Web, y compararla con las Herramientas de Gestión tradicionales basadas en SNMP. Se hace énfasis en muchas características como seguridad, eficiencia, costo, interfaz amigable, etc. Por otro lado intenta desarrollar un conjunto de herramientas que sean rápidamente implementables y permitan al Ingeniero de red realizar algunas operaciones de administración en agentes del tipo pc/routers, ver estadísticas, estado y evolución de estos dispositivos.

Zugl.: Aachen, Techn. Hochsch., Diss., 2006.