5 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 5 / 5
Yayın Optimal primary-secondary user pairing and power allocation in cognitive cooperative multiple access channels(IEEE, 2014) Bakşi, Saygın; Kaya, OnurWe develop jointly optimal power control and primary-secondary user partnering strategies for a cognitive cooperative multiple access channel with K primary and K secondary users. For each primary user, a cooperating secondary user is assigned. We consider both underlay and overlay modes for cognition/cooperation. In overlay mode, each secondary user decodes and relays part of its assigned primary user's message, and simultaneously transmits its own independent message, while ensuring the primary user achieves at least its single user capacity with power control. The encoding is based on channel adaptive block Markov superposition coding, where the powers assigned to primary and secondary user codewords are optimized so as to maximize either the system's sum rate, or the sum of secondary users' rates. In underlay mode, each secondary user employs independent signalling and allocates its power to maximize its own rate, without decreasing its assigned primary user's rate. The partnering problem for either mode is reduced to a maximum weighted matching (MWM) problem on a bipartite graph, and solved jointly optimally with the power allocation problem.Yayın Optimum power control for transmitter cooperation in OFDMA based wireless networks(IEEE, 2011) Bakım, İsmail Sezi; Kaya, OnurFor a cooperative orthogonal frequency division multiple access (OFDMA) system with two transmitters (TXs), and full channel state information (CSI), we obtain the optimal power allocation (PA) policies which maximize the rate region achievable by a recently introduced version of block Markov superposition encoding (BMSE): inter-subchannel cooperative encoding (ISCE) [1]. We provide the optimality conditions that need to be satisfied by the powers associated with the transmitted codewords. We propose two algorithms that yield the optimal power distribution: a subgradient algorithm which achieves an arbitrary rate point on the achievable rate region boundary, and an iterative waterfilling-like algorithm which maximizes the sum rate, and converges much faster. We observe that, utilization of power control to take advantage of the diversity offered by the cooperative OFDMA system, not only leads to a remarkable improvement in achievable rates, but also may help determine how the subchannels have to be instantaneously allocated to various tasks in cooperation.Yayın A new block Markov coding strategy for pairwise and collective cooperation in the three user MAC(IEEE, 2013) Edemen, Çağatay; Kaya, OnurFor a three user cooperative multiple access channel (MAC), we propose a new block Markov superposition encoding strategy, which enables all three users to cooperate collectively as well as in pairs. We obtain the resulting achievable rate expressions and compare them with existing two and three user cooperative strategies. We demonstrate that significant rate gains may be possible, without resorting to adaptive encoding/decoding techniques. We investigate the contributions from pairwise and collective cooperation signals while achieving tuples on the rate region boundary, and compare by simulations the sum rates achievable by two user versus three user grouping in cooperative MACs with fixed total resources.Yayın Enerji depolama kayıpları altında enerji hasat eden işbirlikli çoklu erişim(IEEE, 2017-06-27) Su, Nuğman; Kaya, Onur; Koca, MutluBu bildiride, enerji hasat eden iki vericiyle bir alıcının haberleştiği işbirlikli bir çoklu erişim kanalı için, sonlu batarya sığası ve enerji depolama kayıpları altında ulaşılabilir gönderim bölgesi eniyileme problemini çözüyoruz. İşbirliğinin gecikme kısıtlı ve gecikme toleranslı olduğu durumları ayrı ayrı ele alarak, her iki durumda eniyi iletim gücü ve hızı dağılımının batarya limitleri ve verimsizliğine göre değişimini inceliyoruz. Gecikme kısıtlı ve toleranslı durumların gönderim alanlarını bulup karşılaştırıyoruz.Yayın Delay tolerant cooperation in the energy harvesting multiple access channel(IEEE, 2016) Kaya, Onur; Su, Nuğman; Ulukuş, Şennur; Koca, MutluWe consider the optimum transmit scheduling problem for a two user energy harvesting cooperative multiple access channel. We assume a slotted model where energy harvests in each slot are known a priori. We propose a delay tolerant cooperation model: the transmitters create common information in a given slot, but need not cooperatively send the created common information immediately; they may relegate all or part of the cooperative message transmission to upcoming slots. We propose a modified block Markov superposition coding scheme based on message re-partitioning, that spans multiple slots. We characterize the corresponding achievable departure region by a deadline, and maximize it subject to energy harvesting constraints. We show that, delay tolerant cooperation need not necessarily improve the departure region over delay constrained cooperation, and derive a sufficient condition for the equivalence of the two policies. We compare optimal delay constrained and delay tolerant cooperation policies, and their achievable departure regions via simulations.
