Arama Sonuçları

Listeleniyor 1 - 10 / 12
  • Yayın
    Optimum power control for transmitter cooperation in OFDMA based wireless networks
    (IEEE, 2011) Bakım, İsmail Sezi; Kaya, Onur
    For 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
    Energy and data cooperation in energy harvesting multiple access channel
    (IEEE, 2016) Gürakan, Berk; Şişman, Berrak; Kaya, Onur; Ulukuş, Sennur
    We consider the energy harvesting two user Gaussian multiple access channel (MAC), where both users harvest energy from nature. The users cooperate at the physical layer (data cooperation) by establishing common messages through overheard signals and then cooperatively sending them. In addition, the users cooperate at the battery level (energy cooperation) by wirelessly transferring energy to each other. We find the jointly optimal offline transmit power and rate allocation policy together with the energy transfer policy that maximizes the departure region. We provide necessary conditions for energy transfer, and prove some properties of the optimal transmit policy, thereby shedding some light on the interplay between energy and data cooperation.
  • Yayın
    Cooperative multiple access under energy harvesting constraints
    (Institute of Electrical and Electronics Engineers Inc, 2015) Su, Nuğman; Kaya, Onur; Ulukuş, Şennur; Koca, Mutlu
    We consider a cooperative multiple access channel (MAC) with two energy harvesting transmitters. The transmitters perform delay constrained transmission, i.e., every information block is encoded, transmitted and decoded between two consecutive energy harvests. We aim to maximize the achievable departure region over a finite transmission duration. We formulate the departure region maximization as a convex optimization problem. We propose an iterative algorithm which uses a directional waterfilling strategy to calculate the optimal power components. The departure region obtained by cooperation is shown to be significantly larger than that of a MAC without cooperation under the same energy arrival patterns. As a special case, we also analyze an energy harvesting relay channel with full duplex cooperation.
  • Yayın
    Power control in the cognitive cooperative multiple access channel
    (IEEE, 2012) Kaya, Onur; İşleyen, Murat
    We extend several encoding and decoding techniques from cooperative communications framework, to a cognitive radio system consisting of a primary user (PU) and a secondary user (SU), sending their messages to a common receiver. Assuming that the transmitters and the receiver have full channel state information (CSI) collected and distributed by the common receiver, and that the SU knows the PU's codebook, the cooperation is obtained by block Markov superposition coding, and backwards decoding, which yield a causal overlay scenario. We formulate two rate optimization problems with the aim of, (i) maximizing the sum rate of the system, and (ii) maximizing the rate of the secondary user. We obtain the optimal power allocations for both cases, and the resulting rate regions. The power controlled cooperation turns out to be especially useful when maximizing the sum rate of the system, as it gives the PU significant rate rewards for allowing the cognitive transmitter to access its resources.
  • Yayın
    Energy and data cooperative multiple access channel with intermittent data arrivals
    (IEEE, 2018-03) Gürakan, Berk; Kaya, Onur; Ulukuş, Şennur
    We consider an energy harvesting two user cooperative Gaussian multiple access channel, where both of the users harvest energy from nature. The users cooperate at the physical layer (data cooperation) by establishing common messages through overheard signals and then cooperatively sending them. We study two scenarios within this model. In the first scenario, the data packets arrive intermittently over time. We find the optimal offline transmit power and rate allocation policy that maximize the departure region. We first show that there exists an optimal policy, in which the single user rate constraints in each time slot are tight, yielding a one-to-one relation between the powers and rates. Then, we formulate the departure region maximization problem as a weighted sum departure maximization in terms of rates only. Next, we propose a sequential convex approximation method to approximate the problem at each step and show that it converges to the optimal solution. We solve the approximate problems using an inner-outer decomposition method. In the second scenario, the data packets are available at the beginning of the transmission, but the users now have the ability to cooperate at the battery level (energy cooperation), in addition to data cooperation. The energy cooperation is facilitated by wireless energy transfer and is bidirectional. For this scenario, we find the jointly optimal offline transmit power and rate allocation policy together with the energy transfer policy that maximize the departure region. We provide necessary conditions for energy transfer and prove some properties of the optimal transmit policy, thereby shedding some light on the interplay between energy and data cooperation.
  • Yayın
    Channel adaptive encoding and decoding strategies and rate regions for the three user cooperative multiple access channel
    (IEEE, 2008) Edemen, Çağatay; Kaya, Onur
    For a cooperative Gaussian multiple access channel (MAC), we propose a new channel adaptive three user cooperation strategy, based on a non-trivial extension of block Markov super-position encoding. We obtain the expressions for the resulting achievable rate region. We demonstrate through simulations that the participation of an extra user in cooperation provides significant rate improvements. The proposed strategy also improves upon our earlier results on the three user cooperative MAC [1], under certain channel conditions.
  • Yayın
    Achievable rates for the three user cooperative multiple access channel
    (IEEE, 2008) Edemen, Çağatay; Kaya, Onur
    For a three user Gaussian multiple access channel (MAC), we propose a new superposition block Markov encoding based cooperation scheme. Our scheme allows the three users to simultaneously cooperate both in pairs, and collectively, by dividing the transmitted messages into sub messages intended for each cooperating partner. The proposed encoding and decoding at the transmitters take into account the relative qualities of the cooperation links between the transmitters. We obtain and evaluate the achievable rate region based on our encoding strategy, and compare it with the achievable rates for the two user cooperative MAC. We demonstrate that the added diversity by the presence of the third user improves the region of achievable rates, and this improvement is especially significant as far as the sum rate of the system is concerned.
  • Yayın
    Window and backwards decoding achieve the same sum rate for the fading cooperative Gaussian multiple access channel
    (IEEE, 2006) Kaya, Onur
    For a two user fading Gaussian multiple access channel with user cooperation, we show that window decoding achieves the same sum rate as backwards decoding, when the encoding is done using block Markov superposition coding. We prove this result by showing that when optimum power control is employed, the additional constraints on the sum rate imposed by the use of window decoding instead of backwards decoding are never active. While doing so, we also provide some properties of power allocation that is jointly optimal with block Markov coding and window decoding.
  • Yayın
    Energy efficient transmission scheduling for channel-adaptive wireless energy transfer
    (Institute of Electrical and Electronics Engineers Inc, 2018) Bacinoǧlu, Baran Tan; Kaya, Onur; Uysal Bıyıkoğlu, Elif
    We consider a fading communication link where the transmitter is powered by the receiver through wireless energy transfer (WET). A typical application scenario for this is the transmitter being a simple sensor while the demand for data is created by an application running at the receiver side and pulled from the transmitter as needed. We formulate two offline transmission scheduling problems: the transmitter-centric WET transmission optimization problem, where the schedule is computed by the transmitter, and the receiver-centric WET transmission optimization problem, where the receiver computes the schedule. We provide explicit solutions of both problems and propose online policies that rely on using the estimated water level values for each case. Our formulation allows direct optimization of energy efficiency in contrast to other EH transmission scheduling formulations in the literature. We prove some equivalence results under the special case of fixed channels.
  • Yayın
    A new block Markov coding strategy for pairwise and collective cooperation in the three user MAC
    (IEEE, 2013) Edemen, Çağatay; Kaya, Onur
    For 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.