Filtreler

20162
Filtreleri Sıfırla

Ayarlar

Yazar: Ulukuş, Şennur × Konu: Decoding ×

Arama Sonuçları

Listeleniyor 1 - 2 / 2
  • Küçük Resim
    Yayın
    Energy harvesting cooperative multiple access channel with decoding costs
    (IEEE, 2016) Arafa, Ahmed M.; Kaya, Onur; Ulukuş, Şennur
    We 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.
  • Küçük Resim
    Yayın
    Delay tolerant cooperation in the energy harvesting multiple access channel
    (IEEE, 2016) Kaya, Onur; Su, Nuğman; Ulukuş, Şennur; Koca, Mutlu
    We 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.