In a cognitive radio network, the full-spectrum is usually divided into multiple channels. However, due to the hardware and energy constraints, a cognitive user (also called second...
In a traditional wakeup scheduling, sensor nodes start up numerous times to communicate in a period, thus consuming extra energy due to state transitions (e.g. from the sleep state...
The existing research on security issues in cognitive radio networks mainly focuses on attack and defense in individual network layers. However, the attackers do not necessarily re...
We consider distributed storage over two untrusted networks, whereby coding is used as a means to achieve a prescribed level of confidentiality. The key idea is to exploit the alge...
While in computer networks the number of possible protocol encapsulations is growing day after day, network administrators face ever increasing difficulties in selecting accurately...
Luigi Ciminiera, Marco Leogrande, Ju Liu, Fulvio R...
We present an information theoretic perspective on optimal broadband matching. Most of the broadband matching and communication theory literature assumes a frequencyflat reflection...
In this work, we investigate the security of anonymous wireless sensor networks. To lay down the foundations of a formal framework, we propose a new model for analyzing and evalua...
Abstract--We devise an optimization framework for generalized proportional fairness (GPF) under different time scales for amplify-and-forward (AF) relay networks. In GPF scheduling...
Alireza Sharifian, Petar Djukic, Halim Yanikomerog...
Abstract-- We consider the problem of identifying insiderbased attacks in the form of jammers in multi-channel wireless networks, where jammers have the inside knowledge of frequen...