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 intruder with high accuracy in a highly controlled WLAN environment. In this paper, we propose and analyze different algorithms for DfP tracking in a typical indoor WLAN environment, rich in multipath. We

We present an interference alignment (IA) technique that allows multiple opportunistic transmitters (secondary users) to use the same frequency band of a pre-existing primary link without generating any interference. The primary and secondary transmit-receive pairs are equipped with multiple antennas. We exploit the fact that under power constraints on the primary transmitter, the rate of the primary user is maximized by water-filling on the singular values of its channel matrix leaving some eigen modes unused. The secondary users can align their transmitted signals to produce a number of

Efficient resource allocation is a critical component in multi-user QoS communications and high speed networks. In this paper, we devise a new mathematical model for the resource allocation problem that takes into account the users' demands in a PHY-MAC cross-layer approach. Incorporating the time axis in our model, the target is to maximize the number of bits transmitted in a given frame rather than maximizing the channel capacity or the average throughput. Our design is governed by constraints on users' demands (expressed in bits), energy expenditure, and frame duration. We model the

WLAN RSS-based localization has been a hot research topic for the last years. To obtain high accuracy in the noisy wireless channel, WLAN location determination systems usually use a calibration phase, where a radio map, capturing the signal strength signatures at different locations in the area of interest, is built. The radio map construction process takes a lot of time and effort, reducing the value of WLAN localization systems. In this paper, we propose 3D ray tracing as a way for automatically generating a highly accurate radiomap. We compare this method to previously used propagation

This paper introduces the novel concept of proactive resource allocation in which the predictability of user behavior is exploited to balance the wireless traffic over time, and hence, significantly reduce the bandwidth required to achieve a given blocking/outage probability. We start with a simple model in which the smart wireless devices are assumed to predict the arrival of new requests and submit them to the network T time slots in advance. Using tools from large deviation theory, we quantify the resulting prediction diversity gain to establish that the decay rate of the outage event

In this paper, we completely characterize the deterministic multicast capacity region of the symmetric two-pair bidirectional half duplex relay network with private messages. Towards this end, we first develop a new upper bound on the deterministic capacity region, based on the notion of a one-sided genie. We then proceed to construct novel detour schemes that achieve the upper bound by routing the bits intended for a certain receiver through the network rather than sending it directly. To the best of the authors' knowledge, this scenario corresponds to one of the rare cases where coding

Successful spectrum sharing in a cognitive radio network depends on the correct and quick detection of primary activity. Cooperative spectrum sensing is therefore suggested to enhance the reliability of such detection. However, it renders another significant problem of increased detection delay and traffic burden. Moreover, efficient schemes for multi-sensor data fusion should be designed. In this paper, we employ sequential detection scheme together with ordered transmissions from cognitive detectors. We derive two sequential schemes, one that is capable of achieving the minimum probability

We investigate the performance of dynamic proactive caching in relay networks where an intermediate relay station caches content for potential future use by end users. A central base station proactively controls the cache allocation such that cached content remains fresh for consumption for a limited number of time slots called proactive service window. With uncertain user demand over multiple data items and dynamically changing wireless links, we consider the optimal allocation of relay stations cache to minimize the time average expected service cost. We characterize a fundamental lower

Wireless testbeds present a convenient and cost effective option for researchers in communications to validate their work. The main drawback of these testbeds is their reliance on nodes with fixed placement; this limits experimenters ability to test protocols that depend on a complex connectivity between the nodes such as relaying. In this work, we present a way to overcome this limitation; this method attempts to realize a given topology between a set of nodes by adjusting each node's transmit power and receive gain in a manner to connect and disconnect the links between the nodes as desired

The validation of wireless communications research, whether it is focused on PHY, MAC or higher layers, can be done in several ways, each with its limitations. Simulations tend to be simplified. Equipping wireless labs requires funding and time. Remotely accessible testbeds present a good option to validate research. The existing testbeds have gone a long way in building the infrastructure for managing and operating themselves. Yet, there is still space to improve the administration of resources whether it is nodes, frequency spectrum or storage space. In this work, we present the