Click here to view fulltext PDF

Permanent link:
https://www.ias.ac.in/article/fulltext/sadh/031/02/0117-0139

Wireless networks; geometric random graphs; topology properties

Wireless networks in which the node locations are random are best modelled as random geometric graphs (RGGs). In addition to their extensive application in the modelling of wireless networks, RGGs find many new applications and are being studied in their own right. In this paper we first provide a brief introduction to the issues of interest in random wireless networks. We then discuss some recent results for one-dimensional networks with the nodes distributed uniformly in (0,z). We then discuss some asymptotic results for networks in higher dimensions when the nodes are distributed in a finite volume. Finally we discuss some recent generalisations in considering non uniform transmission ranges and non uniform node distributions. An annotated bibliography of some of the recent literature is also provided.

Srikanth K Iyer¹ D Manjunath²

1. Department of Mathematics, Indian Institute of Science, Bangalore - 560 012, India
2. Department of Electrical Engineering, Indian Institute of Technology - Bombay, Powai, Mumbai - 400 076, India

Published

April 2006