Computing subgraph probability of random geometric graphs: quantitative analyses of wireless ad hoc networks

  • Authors:
  • Chang Wu Yu;Li-Hsing Yen

  • Affiliations:
  • Department of Computer Science and Information Engineering, Chung Hua University, Taiwan, R.O.C;Department of Computer Science and Information Engineering, Chung Hua University, Taiwan, R.O.C

  • Venue:
  • FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper undergoes quantitative analyses on fundamental properties of ad hoc networks including estimating the number of hiddenterminal 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.