In a seminal work, Gupta and Kumar derived the conditions for the asymptotic connectivity of a network composed of nodes uniformly distributed over a disc of unit area, as the number of nodes goes to infinity [1]. In this work, we incorporate the channel fading and we provide the conditions for the network connectivity, in case of single or multi-antenna transceivers. In particular, we derive closed form, albeit approximate, expressions for the spatial density with which the nodes must be deployed in order to insure the network connectivity with a desired probability. Finally, we show how to improve the connectivity by allowing nearby nodes to transmit in a cooperative manner, using a distributed space-time coding strategy, in order to get spatial diversity gain. © 2005 IEEE.
On the connectivity of cooperative and non cooperative wireless communication networks / Barbarossa, Sergio; Francesco, Bucciarelli. - 2005:(2005), pp. 905-909. (Intervento presentato al convegno 2005 IEEE 6th Workshop on Signal Processing Advances in Wireless Communications tenutosi a New York; United States) [10.1109/SPAWC.2005.1506271].
On the connectivity of cooperative and non cooperative wireless communication networks
BARBAROSSA, Sergio;
2005
Abstract
In a seminal work, Gupta and Kumar derived the conditions for the asymptotic connectivity of a network composed of nodes uniformly distributed over a disc of unit area, as the number of nodes goes to infinity [1]. In this work, we incorporate the channel fading and we provide the conditions for the network connectivity, in case of single or multi-antenna transceivers. In particular, we derive closed form, albeit approximate, expressions for the spatial density with which the nodes must be deployed in order to insure the network connectivity with a desired probability. Finally, we show how to improve the connectivity by allowing nearby nodes to transmit in a cooperative manner, using a distributed space-time coding strategy, in order to get spatial diversity gain. © 2005 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
