: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
: Following Etherington, Hoge and Parkes, we consider a network consisting of (approximately) N transceivers in the plane R2 distributed randomly with density given by a Gaussian d...
: Traditional ad hoc routing protocols do not work in intermittently connected networks since end-to-end paths may not exist in such networks. Hence, routing mechanisms that can wi...