#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1958

2017

- This year (1)
- Last 5 years (14)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Cell Type

#### Key Phrases

Learn More

- Magnús M. Halldórsson, Pradipta Mitra
- SODA
- 2011

The capacity of a wireless network is the maximum possible amount of simultaneous communication, taking interference into account. Formally, we treat the following problem. Given is a set of links, each a sender-receiver pair located in a metric space, and an assignment of power to the senders. We seek a maximum subset of links that are feasible in the SINR… (More)

- Eyjólfur Ingi Ásgeirsson, Pradipta Mitra
- INFOCOM
- 2011

We consider the capacity problem (or, the single slot scheduling problem) in wireless networks. Our goal is to maximize the number of successful connections in arbitrary wireless networks where a transmission is successful only if the signal-to-interference-plus-noise ratio at the receiver is greater than some threshold. We study a game theoretic approach… (More)

- Magnús M. Halldórsson, Pradipta Mitra
- Distributed Computing
- 2011

We study the wireless scheduling problem in the SINR model. More specifically, given a set of $$n$$ n links, each a sender–receiver pair, we wish to partition (or schedule) the links into the minimum number of slots, each satisfying interference constraints allowing simultaneous transmission. In the basic problem, all senders transmit with the same uniform… (More)

- Magnús M. Halldórsson, Pradipta Mitra
- SODA
- 2012

Given n wireless transceivers located in a plane, a fundamental problem in wireless communications is to construct a strongly connected digraph on them such that the constituent links can be scheduled in fewest possible time slots, assuming the SINR model of interference. In this paper, we provide an algorithm that connects an arbitrary point set in O(log… (More)

- Magnús M. Halldórsson, Pradipta Mitra
- FOMC
- 2012

We consider the <i>local broadcasting</i> problem in the SINR model, which is a basic primitive for gathering initial information among <i>n</i> wireless nodes. Assuming that nodes can measure received power, we achieve an essentially optimal constant approximate algorithm (with a log<sup>2</sup> <i>n</i> additive term). This improves upon the previous best… (More)

In this paper, we analyze the second eigenvector technique of spectral partitioning on the planted partition random graph model, by constructing a recursive algorithm using the second eigenvectors in order to learn the planted partitions. The correctness of our algorithm is not based on the ratio-cut interpretation of the second eigenvector, but exploits… (More)

- Magnús M. Halldórsson, Pradipta Mitra
- INFOCOM
- 2012

We give algorithms with constant-factor performance guarantees for several capacity and throughput problems in the SINR model. The algorithms are all based on a novel LP formulation for capacity problems. First, we give a new constant-factor approximation algorithm for selecting the maximum subset of links that can be scheduled simultaneously, under any… (More)

<lb>We study a fundamental measure for wireless interference in the SINR model when power<lb>control is available. This measure characterizes the effectiveness of using oblivious power —<lb>when the power used by a transmitter only depends on the distance to the receiver — as a<lb>mechanism for improving wireless capacity.<lb>We prove optimal bounds for… (More)

- Pradipta Mitra
- Electr. J. Comb.
- 2009

Let G be a graph randomly selected from Gn,p, the space of Erdős-Rényi Random graphs with parameters n and p, where p > log 6 n n . Also, let A be the adjacency matrix of G, and v1 be the first eigenvector of A. We provide two short proofs of the following statement: For all i ∈ [n], for some constant c > 0

This paper considers the well-studied problem of clustering a set of objects under a probabilistic model of data in which each object is represented as a vector over the set of features, and there are only <i>k</i> different types of objects. In general, earlier results (mixture models and "planted" problems on graphs) often assumed that all coordinates of… (More)