7 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 7 / 7
Yayın Optimal primary-secondary user pairing and power allocation in cognitive cooperative multiple access channels(IEEE, 2014) Bakşi, Saygın; Kaya, OnurWe develop jointly optimal power control and primary-secondary user partnering strategies for a cognitive cooperative multiple access channel with K primary and K secondary users. For each primary user, a cooperating secondary user is assigned. We consider both underlay and overlay modes for cognition/cooperation. In overlay mode, each secondary user decodes and relays part of its assigned primary user's message, and simultaneously transmits its own independent message, while ensuring the primary user achieves at least its single user capacity with power control. The encoding is based on channel adaptive block Markov superposition coding, where the powers assigned to primary and secondary user codewords are optimized so as to maximize either the system's sum rate, or the sum of secondary users' rates. In underlay mode, each secondary user employs independent signalling and allocates its power to maximize its own rate, without decreasing its assigned primary user's rate. The partnering problem for either mode is reduced to a maximum weighted matching (MWM) problem on a bipartite graph, and solved jointly optimally with the power allocation problem.Yayın 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.Yayın Power control in the cognitive cooperative multiple access channel(IEEE, 2012) Kaya, Onur; İşleyen, MuratWe extend several encoding and decoding techniques from cooperative communications framework, to a cognitive radio system consisting of a primary user (PU) and a secondary user (SU), sending their messages to a common receiver. Assuming that the transmitters and the receiver have full channel state information (CSI) collected and distributed by the common receiver, and that the SU knows the PU's codebook, the cooperation is obtained by block Markov superposition coding, and backwards decoding, which yield a causal overlay scenario. We formulate two rate optimization problems with the aim of, (i) maximizing the sum rate of the system, and (ii) maximizing the rate of the secondary user. We obtain the optimal power allocations for both cases, and the resulting rate regions. The power controlled cooperation turns out to be especially useful when maximizing the sum rate of the system, as it gives the PU significant rate rewards for allowing the cognitive transmitter to access its resources.Yayın 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.Yayın 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.Yayın A new block Markov coding strategy for pairwise and collective cooperation in the three user MAC(IEEE, 2013) Edemen, Çağatay; Kaya, OnurFor a three user cooperative multiple access channel (MAC), we propose a new block Markov superposition encoding strategy, which enables all three users to cooperate collectively as well as in pairs. We obtain the resulting achievable rate expressions and compare them with existing two and three user cooperative strategies. We demonstrate that significant rate gains may be possible, without resorting to adaptive encoding/decoding techniques. We investigate the contributions from pairwise and collective cooperation signals while achieving tuples on the rate region boundary, and compare by simulations the sum rates achievable by two user versus three user grouping in cooperative MACs with fixed total resources.Yayın Quarantine region scheme to mitigate spam attacks in wireless sensor networks(IEEE, 2006-08) Coşkun, Vedat; Çayırcı, Erdal; Levi, Albert; Sancak, SerdarThe Quarantine Region Scheme (QRS) is introduced to defend against spam attacks in wireless sensor networks where malicious antinodes frequently generate dummy spam messages to be relayed toward the sink. The aim of the attacker is the exhaustion of the sensor node batteries and the extra delay caused by processing the spam messages. Network-wide message authentication may solve this problem with a cost of cryptographic operations to be performed over all messages. QRS is designed to reduce this cost by applying authentication only whenever and wherever necessary. In QRS, the nodes that detect a nearby spam attack assume themselves to be in a quarantine region. This detection is performed by intermittent authentication checks. Once quarantined, a node continuously applies authentication measures until the spam attack ceases. In the QRS scheme, there is a trade-off between the resilience against spam attacks and the number of authentications. Our experiments show that, in the worst-case scenario that we considered, a not quarantined node catches 80 percent of the spam messages by authenticating only 50 percent of all messages that it processes.
