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
Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
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
Efficient and robust query processing in dynamic environments using random walk techniques
Proceedings of the 3rd international symposium on Information processing in sensor networks
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
Models and solutions for radio irregularity in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
An analysis of unreliability and asymmetry in low-power wireless links
ACM Transactions on Sensor Networks (TOSN)
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
PWave: a multi-source multi-sink anycast routing framework for wireless sensor networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Toward practical opportunistic routing with intra-session network coding for mesh networks
IEEE/ACM Transactions on Networking (TON)
INFOCOM'10 Proceedings of the 29th conference on Information communications
Analysis of latency of stateless opportunistic forwarding in intermittently connected networks
IEEE/ACM Transactions on Networking (TON)
Efficient network-coding-based opportunistic routing through cumulative coded acknowledgments
IEEE/ACM Transactions on Networking (TON)
Robust connectivity-aware energy-efficient routing for wireless sensor networks
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
Various applications in wireless networks, such as routing and query processing, can be formulated as random walks on graphs. Many results have been obtained for such applications by utilizing the theory of random walks (or spectral graph theory), which is mostly developed for undirected graphs. However, this formalism neglects the fact that the underlying (wireless) networks in practice contain asymmetric links, which are best characterized by directed graphs (digraphs). Therefore, random walk on digraphs is a more appropriate model to consider for such networks. In this paper, by generalizing the random walk theory (or spectral graph theory) that has been primarily developed for undirected graphs to digraphs, we show how various transmission costs in wireless networks can be formulated in terms of hitting times and cover times of random walks on digraphs. Using these results, we develop a unified theoretical framework for estimating various transmission costs in wireless networks. Our framework can be applied to random walk query processing strategy and the three routing paradigms--best path routing, opportunistic routing, and stateless routing--to which nearly all existing routing protocols belong. Extensive simulations demonstrate that the proposed digraph-based analytical model can achieve more accurate transmission cost estimation over existing methods.