Computing Subgraph Probability of Random Geometric Graphs with Applications in Quantitative Analysis of Ad Hoc Networks

CHUR > College Computer Science and Informatics > Department of Computer Science and Information Engineering > Journal Articles > Item 987654321/31229

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/31229

Title:	Computing Subgraph Probability of Random Geometric Graphs with Applications in Quantitative Analysis of Ad Hoc Networks
Authors:	俞征武 Yu, Chang Wu
Contributors:	資訊工程學系 Computer Science & Information Engineering
Keywords:	random geometric graphs;quantitative analysis;ad hoc networks;subgraph probability
Date:	2009
Issue Date:	2014-06-27 01:23:56 (UTC+8)
Abstract:	Random geometric graphs (RGG) contain vertices whose points are uniformly distributed in a given plane and an edge between two distinct nodes exists when their distance is less than a given positive value. RGGs are appropriate for modeling ad hoc networks
Appears in Collections:	[Department of Computer Science and Information Engineering] Journal Articles

Files in This Item:

File	Description	Size	Format
p_e331_0075.pdf		25Kb	Adobe PDF	159	View/Open