Hierarchical Routing over Dynamic Wireless Networks

Wireless network topologies change over time and maintaining routes requires frequent updates. Updates are costly in terms of consuming throughput available for data transmission, which is precious in wireless networks. In this paper, we ask whether there exist low-overhead schemes that produce low-stretch routes. This is studied by using the underlying geometric properties of the connectivity graph in wireless networks.Comment: 29 pages, 19 figures, a shorter version was published in the proceedings of the 2008 ACM Sigmetrics conferenc

Hitting probabilities for non-linear systems of stochastic waves

We consider a $d$-dimensional random field $u = \{u(t,x)\}$ that solves a non-linear system of stochastic wave equations in spatial dimensions $k \in \{1,2,3\}$, driven by a spatially homogeneous Gaussian noise that is white in time. We mainly consider the case where the spatial covariance is given by a Riesz kernel with exponent $\beta$. Using Malliavin calculus, we establish upper and lower bounds on the probabilities that the random field visits a deterministic subset of \IR^d, in terms, respectively, of Hausdorff measure and Newtonian capacity of this set. The dimension that appears in the Hausdorff measure is close to optimal, and shows that when $d(2-\beta) > 2(k+1)$, points are polar for $u$. Conversely, in low dimensions $d$, points are not polar. There is however an interval in which the question of polarity of points remains open.Comment: 85 page

The Question of Ownership in a Sharing Economy

Abstrac