On the critical communication range under node placement with vanishing densities

Simple item page
dc.contributor.advisorMakowski, Armand M.en_US
dc.contributor.authorHan, Guangen_US
dc.contributor.authorMakowski, Armand M.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T10:19:04Z
dc.date.available2007-05-23T10:19:04Z
dc.date.issued2007en_US
dc.description.abstractWe consider the random network where n points are placed independently on the unit interval [0, 1] according to some probability distribution function F. Two nodes communicate with each other if their distance is less than some transmission range. When F admits a continuous density f with f = inf (f(x), x  [0, 1]) > 0, it is known that the property of graph connectivity for the underlying random graph admits a strong critical threshold. Through a counterexample, we show that only a weak critical threshold exists when f = 0 and we identify it. Implications for the critical transmission range are discussed.en_US
dc.format.extent92713 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6616
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2007-1en_US
dc.titleOn the critical communication range under node placement with vanishing densitiesen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_2007-1.pdf
Size:
90.54 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports