Analytical lower bounds on the critical density in continuum percolation

Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007

Volumn , Issue , 2007, Pages

  Kong, Zhenning ^a   Yeh, Edmund M ^a  

^a Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL THEORY; OPTIMIZATION; PERCOLATION (FLUIDS); SOLVENTS; WIRELESS NETWORKS;

CONTINUUM PERCOLATION; CRITICAL DENSITIES; FUNDAMENTAL PROBLEMS; INTERNATIONAL SYMPOSIUM; LOWER BOUNDS; PERCOLATION THEORY;

AD HOC NETWORKS;

EID: 49749129310     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIOPT.2007.4480080     Document Type: Conference Paper

References (16)

1. L. Booth, J. Bruck, M. Franceschetti, and R. Meester, "Covering algorithms, continuum percolation and the geometry of wireless networks," Annals of Applied Probability, vol. 13, pp. 722-741, May 2003.
2. 4Of course, if techniques are developed to compute the higher-order cluster coefficients in closed form, we would automatically obtain even tighter analytical lower bounds.
3. O. Dousse, M. Franceschetti, and P. Thiran, "Information theoretic bounds on the throughput scaling of wireless relay networks," in Proc. IEEE INFOCOM'05, Mar. 2005.
4. O. Dousse, F. Baccelli, and P. Thiran, "Impact of interferences on connectivity in ad hoc networks," IEEE Trans. Network, vol. 13, pp. 425-436, April 2005.
5. E. N. Gilbert, "Random plane networks," J. Soc. Indust. Appl. Math., vol. 9, pp. 533-543, 1961.
6. P. Hall, "On continuum percolation," Annals of Prob., vol. 13, pp. 1250-1266, 1985.
7. R. Meester and R. Roy, Continuum Percolation. New York: Cambridge University Press, 1996.
8. M. Penrose, Random Geometric Graphs. New York: Oxford University Press, 2003.
9. G. Grimmett, Percolation. New York: Springer, second ed., 1999.
10. B. Bollobás and O. Riordan, Percolation. New York: Cambridge University Press, 2006.
11. J. Quintanilla, S. Torquato, and R. M. Ziff. "Efficient measurement of the percoaltion threshold for fully penetrable discs," Physics A, vol. 86, pp. 399-407, 2000.
12. P. Balister, B. Bollobás, and M. Walters, "Continuum percolation with steps in the square or the disc," Random Structures Algorithms, vol. 26, pp. 392-403, 2005.
13. S. Janson, T. Luczak, and A. Rucirtski, Random Graphs. New York: John Wiley & Sons, 2000.
14. W. Feller, An Introduction to Probability Theory and its Applications, vol. 1. New York: John Wiley & Sons. 1957.
15. J. Dall and M. Christensen, "Random geometric graphs," Phy. Rev. E, vol. 66, no. 016121, 2002.
16. U. Alon, A. Drory, and I. Balberg, "Systematic derivationof percolation thresholds in continuum systems," Physical Review A, vol. 42, pp. 4634-4638, 1990.