Asymptotic connectivity properties of cooperative wireless ad hoc networks

Authors:
Dennis Goeckel;Benyuan Liu;Don Towsley;Liaoruo Wang;Cedric Westphal
Affiliations:
Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA;Department of Computer Science, University of Massachusetts, Lowell, MA;Department of Computer Science, University of Massachusetts, Amherst, MA;Department of Electrical and Computer Engineering, Cornell University, Ithaca, NY;DoCoMo Labs USA, Palo Alto, CA
Venue:
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Year:
2009

Citing 5
Cited 2

Connectivity in cooperative wireless ad hoc networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Asynchronous cooperative diversity

IEEE Transactions on Wireless Communications
On the Feasibility of Distributed Beamforming in Wireless Networks

IEEE Transactions on Wireless Communications
The capacity of wireless networks

IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks

IEEE Transactions on Information Theory

Connectivity in selfish, cooperative networks

IEEE Communications Letters
Towards a better understanding of large-scale network models

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Extensive research has demonstrated the potential improvement in physical layer performance when multiple radios transmit concurrently in the same radio channel. We consider how such cooperation affects the requirements for full connectivity and percolation in large wireless ad hoc networks. Both noncoherent and coherent cooperative transmission are considered. For one-dimensional (1-D) extended networks, in contrast to noncooperative networks, for any path loss exponent less than or equal to one, full connectivity occurs under the noncoherent cooperation model with probability one for any node density. Conversely, there is no full connectivity with probability one when the path loss exponent exceeds one, and the network does not percolate for any node density if the path loss exponent exceeds two. In two-dimensional (2-D) extended networks with noncoherent cooperation, for any path loss exponent less than or equal to two, full connectivity is achieved for any node density. Conversely, there is no full connectivity when the path loss exponent exceeds two, but the cooperative network percolates for node densities above a threshold which is strictly less than that of the noncooperative network. A less conclusive set of results is presented for the coherent case. Hence, even relatively simple noncoherent cooperation improves the connectivity of large ad hoc networks.