Collaborative Distributed Beamforming for Spectrum-Sharing Systems

The scarcity of bandwidth has always been the main obstacle for providing reliable high date-rate wireless links, which are in great demand to accommodate nowadays and immediate future wireless applications. In addition, recent reports have showed inefficient usage and under-utilization of the available bandwidth. Cognitive radio (CR) has recently emerged as a promising solution to enhance the spectrum utilization, where it offers the ability for unlicensed users to access the licensed spectrum opportunistically. On one hand, by allowing opportunistic spectrum access, the overall spectrum utilization can be improved. On the other hand, transmission from cognitive nodes can cause severe interference to the licensed users of the spectrum. This requires cognitive radio networks (CRNs) to consider two essential design targets, namely, maximizing the spectrum utilization and minimizing the interference caused to the primary users (PUs). Such interference can be reduced through proper resource allocation, power control or other degrees of freedom techniques such as beamforming. In this thesis, we aim to use joint distributed beamforming and cooperative relaying in spectrum-sharing systems in an effort to enhance the spectrum efficiency and improve the performance of the secondary system. We investigate a one-way cooperative spectrum-sharing system in the presence of one PU and multiple PUs. We study two relaying schemes, namely, decode-and-forward (DF) and amplify-and-forward (AF) relaying in conjunction with distributed optimal beamforming. We employ zero forcing beamforming (ZFB) as a sub-optimal scheme, and compare both approaches through simulations. For both schemes, we derive closed-form expressions and asymptotic expressions for the outage probability and bit error rate (BER) over independent and identically distributed Rayleigh fading channels for binary phase shift keying (BPSK) and M-ary quadrature amplitude modulation (M-QAM) schemes. Numerical results show the effectiveness of the combination of the cooperative diversity and distributed beamforming in compensating for the loss in the secondary system's performance due to the primary user's co-channel interference (CCI). To further improve the spectrum efficiency, we employ distributed beamforming in two-way AF cooperative spectrum-sharing systems in the presence of multiple PUs. For this system, we investigate the transmission protocols over two, three and four time-slots. Our results show that the three time-slot protocol outperforms the two time-slot and four time-slot protocols in certain scenarios where it offers a good compromise between bandwidth efficiency and system performance. We extend the two-way relaying system to the DF scheme, where two practical two-way relaying strategies are investigated, namely, DF-XORing (bit-wise level) and DF-superposition (symbol-wise level). For each relaying strategy, we derive general optimal beamforming vectors and sup-optimal ZFB vectors at the relays. Employing ZFB, we present an analytical framework of the secondary system considering the effect of the primary-secondary mutual CCIs. Our results show that, when the received signals at the relays are weighted equally, the DF-XOR always outperforms both DF-superposition and AF relaying. In the last part of the thesis, we consider a limited feedback system model by assuming partial channel state information (CSI) of the interference channel between the secondary relays and primary receiver. In particular, the CSI feedback is limited only to the quantized channel direction information (CDI). To investigate the effect of the quantized CDI on the secondary system's performance, we derive closed-form expressions for the outage probability and the BER considering the mutual secondary-primary CCI. In the simulation results, we compare the system performance of the limited feedback with the perfect CSI. Our results show that the performance improves as the number of feedback bits increases

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words