#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1999

2018

- This year (3)
- Last 5 years (7)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Paul N. Balister, BÃ©la BollobÃ¡s, Amites Sarkar, Santosh Kumar
- MobiCom
- 2007

Deriving the critical density (which is equivalent to deriving the critical radius or power) to achieve coverage and/or connectivity for random deployments is a fundamental problem in the area ofâ€¦ (More)

- Paul N. Balister, BÃ©la BollobÃ¡s, Amites Sarkar, Mark Walters
- Discrete Applied Mathematics
- 2009

Let P be a Poisson process of intensity one in a square Sn of area n. We construct a random geometric graph Gn,k by joining each point of P to its k nearest neighbours. For many applications it isâ€¦ (More)

- Amites Sarkar, Martin Haenggi
- 2011 Information Theory and Applications Workshop
- 2011

Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the presence ofâ€¦ (More)

- BÃ©la BollobÃ¡s, Paul ErdÃ¶s, Amites Sarkar
- Discrete Mathematics
- 1999

In this review paper, we shall discuss some recent results concerning several models of random geometric graphs, including the Gilbert disc model Gr , the k-nearest neighbour model G nn k and theâ€¦ (More)

Let P be a Poisson process of intensity one in the infinite plane R2. We surround each point x ofP by the open disc of radius r centred at x. Now let Sn be a fixed disc of area n, and let Cr(Sn) beâ€¦ (More)

- Amites Sarkar, Martin Haenggi
- 2011 IEEE Information Theory Workshop
- 2011

Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the presence ofâ€¦ (More)

- Amites Sarkar, Martin Haenggi
- 2010 Conference Record of the Forty Fourthâ€¦
- 2010

Motivated by information-theoretic secrecy, geometric models for secrecy in wireless networks have begun to receive increased attention. The general question is how the presence of eavesdroppersâ€¦ (More)

Let P be a Poisson process of intensity one in a square Sn of area n. For a fixed integer k, join every point of P to its k nearest neighbours, creating an undirected random geometric graph Gn,k. Weâ€¦ (More)

- Martin Haenggi, Amites Sarkar
- ArXiv
- 2016

Consider a wireless cellular network consisting of small, densely scattered base stations. A user u is uniquely covered by a base station b if u is the only user within distance r of b. This makes itâ€¦ (More)