| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427833 | Information Processing Letters | 2009 | 4 Pages |
Abstract
We derive closed analytical formulae of connectivity for random interval graphs in the presence of fixed access points. We examine the influence of positions of access points on the graph accessible connectivity. The results developed in this paper are useful in the design and engineering of random wireless access network in the future.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
