References

Cormen TH, Stein C, Rivest RL and Leiserson CE 2001 Introduction to Algorithms 2nd edn. McGraw-Hill Higher Education, New York, NY, USA.

Couto DD, Aguayo D, Bicket J and Morris R 2003 A high-throughput path metic for multi-hop wireless routing ACM MobiCom'03, San Diego, California.

Dubois-Ferriere H, Grossglauser M and Vetterli M 2007 Least-cost opportunistic routing. Technical Report LCAV-REPORT-2007-001, School of Computer and Communication Sciences, EPFL.

Dubois-Ferriere H, Grossglauser M and Vetterli M In press Valuable detours: Least-cost anypath routing. IEEE/ACM Transactions on Networking.

Laufer RP, Dubois-Ferriere H and Kleinrock L 2010 Polynomial-time algorithms for multirate anypath routing in wireless multihop networks. Technical Report UCLA-CSD-TR100034, UCLA Computer Science Department.

Laufer R and Kleinrock L 2008a Multirate Anypath Routing in Wireless Mesh Networks. Technical report, UCLA Computer Science Department.

Laufer RP and Kleinrock L 2008b Multirate anypath routing in wireless mesh networks. Technical Report UCLA-CSD-TR080025, UCLA Computer Science Department.

Lee S, Bhattacharjee B and Banerjee S 2005 Efficient geographic routing in multihop wireless networks MobiHoc.

Reis C, Mahajan R, Rodrig M, Wetherall D and Zahorjan J 2006 Measurement-based models of delivery and interference in static wireless networks Proceedings of the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 51–62 ...

Get Multihop Wireless Networks: Opportunistic Routing now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.