Yazar "Kaya, Onur" seçeneğine göre listele
Listeleniyor 1 - 20 / 35
Sayfa Başına Sonuç
Sıralama seçenekleri
Öğe Achievable rates for the three user cooperative multiple access channel(IEEE, 2008) Edemen, Çağatay; Kaya, OnurFor 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.Öğe Achievable rates for two user cooperative OFDMA(IEEE, 2010) Bakım, İsmail Sezi; Kaya, OnurWe propose two encoding strategies for a two user cooperative Orthogonal Frequency Division Multiple Access (OFDMA) system, based on block Markov superposition encoding. We obtain the expressions for the resulting achievable rate regions for both encoding strategies, and evaluate them through simulations. We show that, by allowing for re-partitioning and re-encoding of the cooperative messages across subchannels, it is possible to better exploit the diversity created by OFDMA, and higher rates can be achieved.Öğe Achieving the capacity region boundary of fading CDMA channels via generalized iterative waterfilling(IEEE, 2006-11) Kaya, Onur; Ulukuş, ŞennurWe characterize the optimum power control policies that achieve arbitrary rate tuples on the boundary of the, capacity region of a power controlled, code division multiple access (CDMA) system in a fading channel with perfect channel state information (CSI). We propose a "generalized" waterfilling approach, and provide an iterative algorithm that solves for the optimum power allocation policy, for A given arbitrary rate tuple on the boundary of the capacity region. We then investigate the effects of limited feedback on the capacity region, and demonstrate that a good power control policy may require only a very low rate feedback.Öğe Age of Information in Practice(Cambridge University Press, 2023) Uysal, Elif; Kaya, Onur; Baghaee, Sajjad; Beytur, Hasan BurhanWhile age of Information (AoI) has gained importance as a metric characterizing the freshness of information in information-update systems and time-critical applications, most previous studies on AoI have been theoretical. In this chapter, we compile a set of recent works reporting AoI measurements in real-life networks and experimental testbeds, and investigating practical issues such as synchronization, the role of various transport layer protocols, congestion control mechanisms, application of machine learning for adaptation to network conditions, and device related bottlenecks such as limited processing power.Öğe Birleşik çöz/sıkıştır ve ilet tabanlı işbirlikçi çoklu erişim(IEEE, 2012-04-18) Güneş, Mehmet; Kaya, OnurBu bildiride, iki kullanıcılı bir işbirlikçi çoklu erişim kanalı için çöz-ilet ve sıkıştır-ilet tekniklerinin eş zamanlı kullanılmasına dayalı kodlama ve kodçözme teknikleri geliştiriyor, ve karşılık gelen erişilebilir veri hızı ifadelelerini türetiyoruz. Sonuçlarımızı bilinen bazı çift yönlü işbirliği stratejilerinin veri hızları ile kıyaslayarak, iki tekniğin bir arada kullanılmasının erişilebilir veri hızı bölgesini genişletebildiğini benzetimler yolu ile gösteriyoruz.Öğe Channel adaptive encoding and decoding strategies and rate regions for the three user cooperative multiple access channel(IEEE, 2008) Edemen, Çağatay; Kaya, OnurFor 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.Öğe Cognitive cooperative MAC with one primary and two secondary users: achievable rates and optimal power control(IEEE-INST Electrical Electronics Engineers Inc, 2014-11) Edemen, Çağatay; Kaya, OnurWe consider a three-user fading cognitive cooperative multiple access channel (MAC) with one primary and two secondary transmitters. We propose two encoding/decoding strategies with varying levels of cooperation, based on block Markov superposition encoding and backward decoding. The first is an overlay model, where the secondary users (SUs) aid the transmission of the primary user (PU) by causally decoding the PU message and forwarding it while also cooperating among each other. The second is an underlay model, where the SUs cooperate by decoding and forwarding each other's messages while treating the signal received from the PU as noise. In either case, the PU is guaranteed to operate at its maximum achievable single user rate. We characterize the achievable SU rate region for both models and maximize this region as a function of the transmit powers. The simulation results show that the SU rate region can be significantly enlarged, particularly using the overlay model.Öğe 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.Öğe Cooperative strategies and achievable rates for two user OFDMA channels(IEEE-INST Electrical Electronics Engineers Inc, 2011-12) Bakım, İsmail Sezi; Kaya, OnurWe propose three encoding strategies for a two user cooperative Orthogonal Frequency Division Multiple Access (OFDMA) system, based on block Markov superposition encoding (BMSE). We obtain the expressions for the resulting achievable rate regions for all three encoding strategies. We show that, by allowing for re-partitioning and re-encoding of the cooperative messages across subchannels, it is possible to better exploit the diversity created by OFDMA, and higher rates can be achieved. We demonstrate potential rate gains attained by cooperative OFDMA, through simulations.Öğe 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.Öğe Enabling cooperation, resource allocation and receiver selection across cells: complementary fractional frequency reuse(IEEE, 2013) Bakşi, Saygın; Kaya, Onur; Bıyıkoğlu, TürkerFor a multi-cell multiple access channel, we develop a comprehensive cooperative communication framework: we propose a novel complementary fractional frequency reuse (FFR) strategy tailored specifically for pairwise user cooperation, also taking into account cell sectoring. This strategy allows the cell edge users not only to pool their resources and cooperate across cells, but also to choose the best receiver. We divide the users into cooperating inner and outer user pairs, and assign each pair orthogonal resources using OFDMA. We employ pairwise bidirectional cooperation based on block Markov superposition encoding among user pairs. We derive the achievable rates, while taking into account the geometry dependent interference at the users and the receiver. We find the jointly optimal power allocation, partner selection and receiver selection strategies that maximize the sum rate of the system. We then propose a heuristic matching algorithm, which operates based only on user and receiver locations. We compare the performance of our proposed strategies with several non-cooperative models, and demonstrate that the sum rate can nearly be doubled, while using the same resources.Öğe Energy and data cooperation in energy harvesting multiple access channel(IEEE, 2016) Gürakan, Berk; Şişman, Berrak; Kaya, Onur; Ulukuş, SennurWe 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.Öğe Energy and data cooperation in energy harvesting multiple access channel(Institute of Electrical and Electronics Engineers Inc., 2016-08-26) Gürakan, Berk; Şişman, Berrak; Kaya, Onur; Ulukuş, SennurWe 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.Öğe 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.Öğe 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, ElifWe 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.Öğe 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.Öğe 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.Öğe 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.Öğe Improving age of information in random access channels(Institute of Electrical and Electronics Engineers Inc., 2020-07) Atabay, Doğa Can; Uysal, Elif; Kaya, OnurWe study Age of Information (AoI) in a random access channel where a number of devices try to send status updates over a common medium. Assuming a time-slotted scenario where multiple transmissions result in collision, we propose a threshold-based lazy version of Slotted ALOHA and derive the time average AoI achieved by this policy. We demonstrate that the average AoI performance of the lazy policy is significantly better than Slotted ALOHA, and close to the ideal round robin benchmark.
