Random walks on digraphs: a theoretical framework for estimating transmission costs in wireless routing

Authors:
Yanhua Li;Zhi-Li Zhang
Affiliations:
Department of Computer Science & Engineering, University of Minnesota, Twin Cities;Department of Computer Science & Engineering, University of Minnesota, Twin Cities
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 10
Cited 4

Matrix analysis

Matrix analysis
Discrete Green's functions

Journal of Combinatorial Theory Series A
Minimum energy paths for reliable communication in multi-hop wireless networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A high-throughput path metric for multi-hop wireless routing

Proceedings of the 9th annual international conference on Mobile computing and networking
Maximum lifetime routing in wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
ExOR: opportunistic multi-hop routing for wireless networks

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Trading structure for randomness in wireless opportunistic routing

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Random walk based routing protocol for wireless sensor networks

Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Robust connectivity-aware energy-efficient routing for wireless sensor networks

IEEE Transactions on Wireless Communications

Modeling and comparison of candidate selection algorithms in opportunistic routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
Analysis of latency of stateless opportunistic forwarding in intermittently connected networks

IEEE/ACM Transactions on Networking (TON)
Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships

Proceedings of the sixth ACM international conference on Web search and data mining
Random walks and Green's function on digraphs: a framework for estimating wireless transmission costs

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to the three routing paradigms-best path routing, opportunistic routing, and stateless routing-to which nearly all existing routing protocols belong.We illustrate how packet forwarding under each paradigm can be modeled as random walks on directed graphs (digraphs). By generalizing the theory of random walks that has primarily been developed for undirected graphs to digraphs, we show how various transmission costs can be formulated in terms of hitting times and hitting costs of random walks on digraphs. As representative examples, we apply the theory to three specific routing protocols, one under each paradigm. Extensive simulations demonstrate that the proposed digraph based analytical model can achieve more accurate transmission cost estimation over existing methods.