8 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 8 / 8
Yayın 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.Yayın 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.Yayın Power control for fading cooperative multiple access channels(IEEE, 2007-08) Kaya, Onur; Ulukuş, ŞennurFor a fading Gaussian multiple access channel with user cooperation, we obtain the power allocation policies that maximize the average rates achievable by block Markov superposition coding, subject to average power constraints. The optimal policies result in a coding scheme that is simpler than the one for a general multiple access channel with generalized feedback. This simpler coding scheme also leads to the possibility of formulating an otherwise non-concave optimization problem as a concave one. Using the perfect channel state information available at the transmitters to adapt the powers, we demonstrate gains over the achievable rates for existing cooperative systems.Yayın 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.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 Power control for two user cooperative OFDMA channels(IEEE-INST Electrical Electronics Engineers Inc, 2013-01) Bakım, İsmail Sezi; Kaya, OnurFor a two user cooperative orthogonal frequency division multiple access (OFDMA) system with full channel state information (CSI), we obtain the optimal power allocation (PA) policies which maximize the rate region achievable by a channel adaptive implementation of inter-subchannel block Markov superposition encoding (BMSE), used in conjunction with backwards decoding. We provide the optimality conditions that need to be satisfied by the powers associated with the users' codewords and derive the closed form expressions for the optimal powers. We propose two algorithms that can be used to optimize the powers to achieve any desired rate pair on the rate region boundary: a projected subgradient algorithm, and an iterative waterfilling-like algorithm based on Karush-Kuhn-Tucker (KKT) conditions for optimality, which operates one user at a time 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. Simulations show that the gain from power allocation is still significant even when the CSI feedback is limited.Yayın Semantic communications in networked systems: a data significance perspective(IEEE, 2022-07-01) Uysal, Elif; Kaya, Onur; Ephremides, Anthony; Gross, James; Codreanu, Marian; Popovski, Petar; Assaad, Mohamad; Liva, Gianluigi; Munari, Andrea; Soret, Beatriz; Soleymani, Touraj; Johansson, Karl HenrikWe present our vision for a departure from the established way of architecting and assessing communication networks, by incorporating the semantics of information for communications and control in networked systems. We define semantics of information, not as the meaning of the messages, but as their significance, possibly within a real time constraint, relative to the purpose of the data exchange. We argue that research efforts must focus on laying the theoretical foundations of a redesign of the entire process of information generation, transmission and usage in unison by developing: advanced semantic metrics for communications and control systems; an optimal sampling theory combining signal sparsity and semantics, for real-time prediction, reconstruction and control under communication constraints and delays; semantic compressed sensing techniques for decision making and inference directly in the compressed domain; semantic-aware data generation, channel coding, feedback, multiple and random access schemes that reduce the volume of data and the energy consumption, increasing the number of supportable devices. This paradigm shift targets jointly optimal information gathering, information dissemination, and decision making policies in networked systems.Yayın Goal-Oriented Random Access (GORA)(Institute of Electrical and Electronics Engineers Inc., 2025-08) Topbaş, Ahsen; Ari, Çağrı; Kaya, Onur; Uysal, ElifWe propose Goal-Oriented Random Access (GORA), where transmitters jointly optimize what to send and when to access the shared channel to a common access point, considering the ultimate goal of the information transfer at its final destination. This goal is captured by an objective function, which is expressed as a general (not necessarily monotonic) function of the Age of Information. Our findings reveal that, under certain conditions, it may be desirable for transmitters to delay channel access intentionally and, when accessing the channel, transmit aged samples to reach a specific goal at the receiver.
