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.
|主出版物標題||Formal Techniques for Networked and Distributed Systems - FORTE 2005 - 25th IFIP WG 6.1 International Conference, Proceedings|
|出版狀態||Published - 1 12月 2005|
|事件||25th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems - FORTE 2005 - Taipei, Taiwan|
持續時間: 2 10月 2005 → 5 10月 2005
|名字||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||25th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems - FORTE 2005|
|期間||2/10/05 → 5/10/05|