Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10337991 | Ad Hoc Networks | 2005 | 15 Pages |
Abstract
We also show that the diameter of the random grid (i.e., the maximum number of hops required to travel from any active node to another) is of the order n/log(n). Finally, we derive a sufficient condition for connectivity of the active nodes (without necessarily having coverage). If the node success probability p(n) is small enough, we show that connectivity does not imply coverage.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Sanjay Shakkottai, R. Srikant, Ness B. Shroff,