Very sharp transitions in one-dimensional MANETs

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.contributor.departmentCSHCNen_US
dc.date.accessioned2007-05-23T10:18:15Z
dc.date.available2007-05-23T10:18:15Z
dc.date.issued2005en_US
dc.description.abstractWe investigate how quickly phase transitions can occur in one-dimensional geometric random graph models of MANETs. In the case of graph connectivity, we show that the transition width behaves like 1/n (when the number n of users is large), a significant improvement over general asymptotic bounds given recently by Goel et al. for monotone graph properties. We also discuss a similar result for the property that there exists no isolated user in the network. The asymptotic results are validated by numerical computations. Finally we outline how the approach sed here could be applied in higher dimensions and or other graph properties.en_US
dc.format.extent134572 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6573
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2005-104en_US
dc.relation.ispartofseriesCSHCN; TR 2005-10en_US
dc.subjectSensor-Actuator Networksen_US
dc.titleVery sharp transitions in one-dimensional MANETsen_US
dc.typeTechnical Reporten_US

Files

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

Collections

Institute for Systems Research Technical Reports