Performance Analysis of Channel-Aware Media Access Control Schemes

This thesis proposes a new Channel-Aware MAC (CA-MAC) protocol that allows more than two simultaneous transmissions to take place within a single wireless collision domain. In this proposed work, Multiple-Input Multiple-Output (MIMO) system is used to achieve higher spectral efficiency. The MIMO-based PHY layer has been adopted to help in controlling the transmission and to avoid any collisions by using weights gains technique on the antenna transmission, and by recovering any possible collisions using ZigZag decoding. In order to develop CA-MAC algorithm, to exploit the full potential of MIMO system, the library of 802.11x standard has been modified. NS-2 based simulations were conducted to study the performance of the proposed system. Detailed analysis and comparisons with current protocols schemes are presented

Construction and Applications of CRT Sequences

Protocol sequences are used for channel access in the collision channel without feedback. Each user accesses the channel according to a deterministic zero-one pattern, called the protocol sequence. In order to minimize fluctuation of throughput due to delay offsets, we want to construct protocol sequences whose pairwise Hamming cross-correlation is as close to a constant as possible. In this paper, we present a construction of protocol sequences which is based on the bijective mapping between one-dimensional sequence and two-dimensional array by the Chinese Remainder Theorem (CRT). In the application to the collision channel without feedback, a worst-case lower bound on system throughput is derived.Comment: 16 pages, 5 figures. Some typos in Section V are correcte

Beyond the Baseline 1991: Proceedings of the Space Station Evolution Symposium. Volume 1: Space Station Freedom, part 2

This report contains the individual presentations delivered at the Space Station Evolution Symposium. The results of Space Station Freedom Advanced Studies provide a road map for the evolution of Freedom in terms of user requirements, utilization and operations concepts, and growth options for distributed systems. Regarding these specific systems, special attention is given to: highlighting changes made during restructuring; description of growth paths through the follow-on and evolution phases; identification of minimum impact provisions to allow flexibility in the baseline; and identification of enhancing and enabling technologies

Dark signalling and code division multiple access in an optical fibre LAN with a bus topology

This thesis describes an optical fibre network that uses a bus topology and Code Division Multiple Access (CDMA). Various potential configurations are analysed and compared and it is shown that a serious limitation of optical CDMA schemes using incoherent correlators is the effect of optical beating due to the presence of multiple incoherent optical signals at the receiver photodiode. The network proposed and analysed in this thesis avoids beating between multiple optical fields because it only uses a single, shared, optical source. It does this through the SLIM (Single Light-source with In-line Modulation) configuration in which there is a continuously-operating light source at the head-end of a folded bus, and modulators at the nodes to impose signals on the optical field in the form of pulses of darkness which propagate along the otherwise continuously bright bus. Optical CDMA can use optical-fibre delay-line correlators as matched filters, and these may be operated either coherently or incoherently.Coherent operation is significantly more complex than incoherent operation, but incoherent correlators introduce further beating even in a SLIM network. A new design of optical delay-line correlator, the hybrid correlator, is therefore proposed, analysed and demonstrated. It is shown to eliminate beating. A model of a complete network predicts that a SLIMbus using optical CDMA with hybrid correlators can be operated at TeraBaud rates with the number of simultaneous users limited by multiple access interference (MAI), determined only by the combinatorics of the code set