Show simple item record

Very sharp transitions in one-dimensional MANETs

dc.contributor.advisorMakowski, Armand M.en_US
dc.contributor.authorHan, Guangen_US
dc.contributor.authorMakowski, Armand M.en_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.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 in this item


This item appears in the following Collection(s)

Show simple item record