5 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 5 / 5
Yayın Energy harvesting cooperative multiple access channel with data arrivals(IEEE, 2016) Gürakan, Berk; Kaya, Onur; Ulukuş, ŞennurWe consider an energy harvesting two user cooperative Gaussian multiple access channel (MAC), where both of the users harvest energy from nature. The data packets arrive intermittently over time. The users overhear each other's transmitted signals and can cooperate by forming common messages. 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 rate 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. Finally, we solve the approximate problems using an inner outer decomposition method. Numerically, we observe that higher data rates can be supported with the same amount of energy.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, MutluWe 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 Energy and data cooperative multiple access channel with intermittent data arrivals(IEEE, 2018-03) Gürakan, Berk; Kaya, Onur; Ulukuş, ŞennurWe 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 Energy harvesting cooperative multiple access channel with decoding costs(IEEE, 2016) Arafa, Ahmed M.; Kaya, Onur; Ulukuş, ŞennurWe consider an energy harvesting cooperative multiple access channel (AC) with decoding costs. In this setting, users cooperate at the physical layer (data cooperation) in order to increase the achievable rates. Data cooperation comes at the expense of decoding costs: each user spends some amount of its harvested energy to decode the message of the other user, before forwarding both messages to the receiver. The decoding power spent is an increasing convex function of the incoming message rate. We characterize the optimal power scheduling policies that achieve the boundary of the maximum departure region subject to energy causality constraints and decoding costs by using a generalized water-filling algorithm.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.
