Conference proceeding
On the incompatibility of connectivity and local pooling in Erdos-Rényi Graphs
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Conference Proceedings, 676
01 Oct 2013
Abstract
Conference Title: 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton) Conference Start Date: 2013, Oct. 2 Conference End Date: 2013, Oct. 4 Conference Location: Monticello, IL, USA For a wireless communications network, Local Pooling (LoP) is a desirable property due to its sufficiency for the optimality of low-complexity greedy scheduling techniques. However, LoP in network graphs with a primary interference model enforces an edge sparsity that may be prohibitive to other desirable properties in wireless networks, such as connectivity. In this paper, we investigate the impact of the edge density on both LoP and the size of the largest component under the primary interference model, as the number of nodes in the network grows large. For Erdos-Rényi graphs, we employ threshold functions to establish critical values for the edge probability necessary for these properties to hold. These thresholds demonstrate that LoP and connectivity (or even the presence of a giant component) cannot both hold asymptotically for a large class of edge probability functions. A similar incompatibility for random geometric graphs is suggested by our simulation results. [PUBLICATION ABSTRACT]
Metrics
6 Record Views
Details
- Title
- On the incompatibility of connectivity and local pooling in Erdos-Rényi Graphs
- Creators
- Jeffrey WildmanSteven Weber
- Publication Details
- The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Conference Proceedings, 676
- Publisher
- The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Electrical and Computer Engineering
- Identifiers
- 991019203436704721