Trading space for time in undirected s-t connectivity
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The electrical resistance of a graph captures its commute and cover times
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A technique for lower bounding the cover time
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
RaWMS -: random walk based lightweight membership service for wireless ad hoc network
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On the cover time and mixing time of random geometric graphs
Theoretical Computer Science
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Generating random spanning trees
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
The cover times of random walks on hypergraphs
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
The cover times of random walks on random uniform hypergraphs
Theoretical Computer Science
Radio cover time in hyper-graphs
Ad Hoc Networks
| Hi-index | 0.00 |
In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks, and the Web. For wireless networks, graphs are actually not the correct model of the communication; instead, hyper-graphs better capture the communication over a wireless shared channel. Motivated by this example, we study in this paper random walks on hyper-graphs. First, we formalize the random walk process on hyper-graphs and generalize key notions from random walks on graphs. We then give the novel definition of radio cover time, namely, the expected time of a random walk to be heard (as opposed to visited) by all nodes. We then provide some basic bounds on the radio cover, in particular, we show that while on graphs the radio cover time is O(mn), in hyper-graphs it is O(mnr), where n, m, and r are the number of nodes, the number of edges, and the rank of the hyper-graph, respectively. We conclude the paper with results on specific hyper-graphs that model wireless mesh networks in one and two dimensions and show that in both cases the radio cover time can be significantly faster than the standard cover time. In the two-dimension case, the radio cover time becomes sub-linear for an average degree larger than log2 n.