5 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 5 / 5
Yayın 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.Yayın 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.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.Yayın 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.Yayın 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.
