Oshri Naparstek

Learn More
In this paper, we address the problem of fully distributed assignment of users to sub-bands such that the sum-rate of the system is maximized. We introduce a modified auction algorithm that can be applied in a fully distributed way using an opportunistic CSMA assignment scheme and is ε optimal. We analyze the expected time complexity of the algorithm(More)
In this paper we introduce a modified auction algorithm that can be applied in a fully distributed manner. The algorithm requires an auctioneer but does not require shared memory or message passing between bidders. We show that an opportunistic carrier sensing scheme can be used to replace the auctioneer in a manner that does not require any message(More)
In this paper we analyze the expected time complexity of the auction algorithm for the matching problem on random bipartite graphs. We prove that the expected time complexity of the auction algorithm for bipartite matching is O ( N log(N) log(Np) ) on sequential machines. This is equivalent to other augmenting path algorithms such as the HK algorithm.(More)
The channel assignment problem is a special case of a very well studied combinatorial optimization problem known as the assignment problem. In this paper we introduce an asymptotically optimal fully distributed algorithm for the maximum cardinality matching problem. We show that with high probability, the running time of the algorithm on random bipartite(More)
In the last few years the issue of energy-efficient network design has gained increasingly more importance [1], [2], both in academia and in industry. Information and communication technologies (ICT) represent about 2% of the entire world’s energy consumption, and the situation is likely to reach a point where ICT equipments in large cities will require(More)
The channel assignment problem is highly important to OFDMA cognitive radio systems. Tight bounds on the optimal channel assignment are crucial for the performance evaluation of various channel assignment schemes. In this paper we derive the mean of the maximal sum rate channel assignment for i.i.d Rayleigh fading channels. We provide upper and lower bounds(More)
In this paper we describe the optimization of an information theoretic criterion for radar waveform design. The method is used to design radar waveforms suitable for simultaneously estimating and tracking parameters of multiple targets. Our approach generalizes the information theoretic water-filling approach of Bell. The paper has two main contributions.(More)
We consider the problem of dynamic spectrum access for network utility maximization in multichannel wireless networks. The shared bandwidth is divided into K orthogonal channels, and the users access the spectrum using a random access protocol. In the beginning of each time slot, each user selects a channel and transmits a packet with a certain attempt(More)
Passive radar systems that use an illuminator of choice have been extensively studied over the past decade because they are difficult to detect and cheaper to deploy. Among the signals investigated for passive radar are FM radio, DVB-T and cellular networks. Recently, UMTS and Long Term Evolution (LTE) signals have been considered for passive radar. In this(More)