Bounds on the mixing time and partial cover of ad-hoc and sensor networks

Chen Avin, Gunes Ercal

Research output: Contribution to conferencePaperpeer-review

12 Scopus citations

Abstract

In [1], the authors proposed the partial cover of a random walk on a broadcast network to be used to gather information and supported their proposal with experimental results. In this paper, we demonstrate analytically that for sufficiently large broadcast radius r, the partial cover of a random walk on a random broadcast network is in fact efficient and generates a good distribution of the visited nodes. Our result is based on bounding the conductance, which intuitively measures the amount of bottlenecks in a graph. We show that the conductance of a random broadcast network in a unit square is Θ(r) with high probability, and this bound allows us to analyze properties of the random walk such as mixing time and load balancing. We find that for the random walk to be both efficient and have a high quality cover and partial cover (i.e. rapid mixing), radius at least rrapid = Θ(1/poly(log n)) is sufficient and necessary. Experimental results on the random geometric graphs, namely graphs that represent broadcast networks, that resemble the conductance of the 3-dimensional grid indicate that the analytical bounds on efficiency, namely cover time and partial cover time, are not tight. In particular, r = Θ(1/n1/3) is sufficient radius to obtain optimal cover time and partial cover time.

Original languageEnglish
Pages1-12
Number of pages12
DOIs
StatePublished - 1 Dec 2005
Externally publishedYes
Event2nd European Workshop onWireless Sensor Networks, EWSN 2005 - Istanbul, Turkey
Duration: 31 Jan 20052 Feb 2005

Conference

Conference2nd European Workshop onWireless Sensor Networks, EWSN 2005
Country/TerritoryTurkey
CityIstanbul
Period31/01/052/02/05

ASJC Scopus subject areas

  • Engineering (all)

Fingerprint

Dive into the research topics of 'Bounds on the mixing time and partial cover of ad-hoc and sensor networks'. Together they form a unique fingerprint.

Cite this