On the connectivity of cooperative and non cooperative wireless communication networks

Author

Barbarossa, Sergio ; Bucciarelli, Fruncesco

Author_Institution

INFOCOM Dpt., Univ. of Rome "La Sapienza", Italy

fYear

2005

fDate

5-8 June 2005

Firstpage

905

Lastpage

909

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. 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.

Keywords

antenna arrays; approximation theory; diversity reception; fading channels; probability; radio networks; space-time codes; albeit approximation; asymptotic connectivity; cooperative manner; distributed space-time coding strategy; fading channel; multiantenna transceiver; network connectivity; noncooperative wireless communication network; probability; spatial diversity; Communication networks; Diversity methods; Electronic mail; H infinity control; Information geometry; Nearest neighbor searches; Network topology; Transceivers; Wireless communication; Wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing Advances in Wireless Communications, 2005 IEEE 6th Workshop on

Print_ISBN

0-7803-8867-4

Type

conf

DOI

10.1109/SPAWC.2005.1506271

Filename

1506271