Arama Sonuçları

Listeleniyor 1 - 2 / 2
  • 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
    When to pull data for minimum age penalty
    (IEEE, 2021-10-18) Yavaşcan, Orhan Tahir; Ceran, Elif Tuğçe; Cakir, Zeynep; Uysal, Elif; Kaya, Onur
    A communication receiver that wants to pull data from a remote sensor by exploiting wireless energy transfer is considered. The receiver has a long-term average energy budget for this operation, and its goal is to keep the time average of a general age penalty function as small as possible. The channel from the source to the receiver is a two-state (ON/OFF) communication link whose state is IID or Markovian, and known instantaneously by the receiver. Modeling the problem as a constrained Markov decision problem, we obtain a randomized threshold-based decision policy that achieves the minimum possible average age penalty. We determine the optimal time average Age of Information and age violation probabilities by exploiting the optimality of the derived policy.