Optimal cross layer design for CDMA-SFBC wireless systems

The demand for high speed reliable wireless services has been rapidly growing. Wireless networks have limited resources while wireless channels suffer from fading, interference and time variations. Furthermore, wireless applications have diverse end to end quality of service (QoS) requirements. The aforementioned challenges require the design of spectrally efficient transmission systems coupled with the collaboration of the different OSI layers i.e. cross layer design. To this end, we propose a code division multiple access (CDMA)-space frequency block coded (SFBC) systems for both uplink and downlink transmissions. The proposed systems exploit code, frequency and spatial diversities to improve reception. Furthermore, we derive closed form expressions for the average bit error rate of the proposed systems. In this thesis, we also propose a cross layer resource allocation algorithm for star CDMA-SFBC wireless networks. The proposed resource allocation algorithm assigns base transceiver stations (BTS), antenna arrays and frequency bands to users based on their locations such that their pair wise channel cross correlation is minimized while each user is assigned channels with maximum coherence time. The cooperation between the medium access control (MAC) and physical layers as applied by the optimized resource allocation algorithm improves the bit error rate of the users and the spectral efficiency of the network. A joint cross layer routing and resource allocation algorithm for multi radio CDMA-SFBC wireless mesh networks is also proposed in this thesis. The proposed cross layer algorithm assigns frequency bands to links to minimize the interference and channel estimation errors experienced by those links. Channel estimation errors are minimized by selecting channels with maximum coherence time. On top, the optimization algorithm routes network traffic such that the average end to end packet delay is minimized while avoiding links with high interference and short coherence time. The cooperation between physical, MAC and network layers as applied by the optimization algorithm provides noticeable improvements in average end to end packet delay and success rat

Local heuristic for the refinement of multi-path routing in wireless mesh networks

We consider wireless mesh networks and the problem of routing end-to-end traffic over multiple paths for the same origin-destination pair with minimal interference. We introduce a heuristic for path determination with two distinguishing characteristics. First, it works by refining an extant set of paths, determined previously by a single- or multi-path routing algorithm. Second, it is totally local, in the sense that it can be run by each of the origins on information that is available no farther than the node's immediate neighborhood. We have conducted extensive computational experiments with the new heuristic, using AODV and OLSR, as well as their multi-path variants, as underlying routing methods. For two different CSMA settings (as implemented by 802.11) and one TDMA setting running a path-oriented link scheduling algorithm, we have demonstrated that the new heuristic is capable of improving the average throughput network-wide. When working from the paths generated by the multi-path routing algorithms, the heuristic is also capable to provide a more evenly distributed traffic pattern