bbabanner.jpg

Filter by

Distributed admission and power control for cognitive radios in spectrum underlay networks

In this paper we investigate admission control and power allocation for cognitive radios in an underlay network. We consider the problem of maximizing the number of supported secondary links under their minimum QoS requirements without violating the maximum tolerable interference on primary receivers in a cellular network. An optimal solution to our problem is shown in previous works to be NP-hard

Circuit Theory and Applications
Software and Communications

A subspace method for the blind identification of multiple time-varying FIR channels

A new method is proposed for the blind subspace-based identification of the coefficients of time-varying (TV) single-input multiple-output (SIMO) FIR channels. The TV channel coefficients are represented via a finite basis expansion model, i.e. linear combination of known basis functions. In contrast to earlier related works, the basis functions need not be limited to complex exponentials, and

Software and Communications

Analysis of a device-free passive tracking system in typical wireless environments

Device-free Passive (DfP) localization is a new concept in location determination where the tracked entity does not carry any device nor participate actively in the localization process. A DfP system operates by processing the received physical signal of a wireless transmitter at one or more monitoring points. The previously introduced DfP system was shown to enable the tracking of a single

Software and Communications

Distributed flooding-based storage algorithms for large-scale wireless sensor networks

In this paper we propose distributed storage algorithms for large-scale wireless sensor networks. Assume a wireless sensor network with n nodes that have limited power, memory, and bandwidth. Each node is capable of both sensing and storing data. Such sensor nodes might disappear from the network due to failures or battery depletion. Hence it is desired to design efficient schemes to collect data

Software and Communications

Towards evolving sensor actor networks

Sensor Actor NETworks (SANET) represent a major component of ubiquitous service environments promising interesting solutions to a wide range of problems. Despite the obvious increase in the research activities proposing architectures and protocols for SANETs, we are still no where near the production of industrial-grade SANET software that can be relied upon for mission critical applications. The

Energy and Water
Circuit Theory and Applications
Software and Communications
Agriculture and Crops

Formal specification and analysis of the PCF protocol in the 802.11 standard using systems of communicating machines

With the widespread usage of the 802.11 protocol, it becomes important to study the protocol operation. In this paper we propose a formal model for the point coordination function (PCF) of the 802.11 MAC layer using systems of communicating machines. Our goal is to analyse the protocol for safety and liveness properties. These properties cannot be verified directly from the protocol description

Software and Communications

On the secrecy rate region for the interference channel

This paper studies interference channels with security constraints. The existence of an external eavesdropper in a two-user interference channel is assumed, where the network users would like to secure their messages from the external eavesdropper. The cooperative binning and channel prefixing scheme is proposed for this system model which allows users to cooperatively add randomness to the

Software and Communications

The wiretap channel with feedback: Encryption over the channel

In this work, the critical role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is established. Unlike previous works, where a noiseless public discussion channel is used for feedback, the feed-forward and feedback signals share the same noisy channel in the present model. Quite interestingly, this noisy feedback model is shown to be more advantageous in the current

Software and Communications

On the secrecy capacity of fading channels

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We first consider the full channel state information (CSI) case, where the

Software and Communications

The relay-eavesdropper channel: Cooperation for secrecy

This paper establishes the utility of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay-eavesdropper channel is introduced and an outer-bound on the optimal rate-equivocation region is derived. Several cooperation strategies are then devised and the corresponding achievable rate-equivocation region are characterized. Of particular interest is

Software and Communications