@inproceedings{c988a840b6f741f59ecbdf149b9329e4,
title = "Computing subgraph probability of random geometric graphs: Quantitative analyses of wireless ad hoc networks",
abstract = "This paper undergoes quantitative analyses on fundamental properties of ad hoc networks including estimating the number of hidden-terminal pairs and the number of exposed-terminal sets. To obtain these results, we propose a paradigm to systematically derive exact formulas for a great deal of subgraph probabilities of random geometric graphs. In contrast to previous work, which established asymptotic bounds or approximation, we obtain closed-form formulas that are fairly accurate and of practical value.",
keywords = "Ad hoc networks, Analytical method, Exposed terminal, Hidden terminal, Performance evaluation, Quantitative analysis, Random geometric graphs, Sensor networks",
author = "Yu, {Chang Wu} and Li-Hsing Yen",
year = "2005",
month = dec,
day = "1",
doi = "10.1007/11562436_33",
language = "English",
isbn = "354029189X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "458--472",
booktitle = "Formal Techniques for Networked and Distributed Systems - FORTE 2005 - 25th IFIP WG 6.1 International Conference, Proceedings",
note = "25th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems - FORTE 2005 ; Conference date: 02-10-2005 Through 05-10-2005",
}