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

Chang Wu Yu*, Li-Hsing Yen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

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.

Original languageEnglish
Title of host publicationFormal Techniques for Networked and Distributed Systems - FORTE 2005 - 25th IFIP WG 6.1 International Conference, Proceedings
Pages458-472
Number of pages15
DOIs
StatePublished - 1 Dec 2005
Event25th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems - FORTE 2005 - Taipei, Taiwan
Duration: 2 Oct 20055 Oct 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3731 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference25th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems - FORTE 2005
CountryTaiwan
CityTaipei
Period2/10/055/10/05

Keywords

  • Ad hoc networks
  • Analytical method
  • Exposed terminal
  • Hidden terminal
  • Performance evaluation
  • Quantitative analysis
  • Random geometric graphs
  • Sensor networks

Fingerprint Dive into the research topics of 'Computing subgraph probability of random geometric graphs: Quantitative analyses of wireless ad hoc networks'. Together they form a unique fingerprint.

Cite this