Multi-constrained anypath routing in wireless mesh networks

SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

Volumn , Issue , 2010, Pages

  Fang, Xi ^a   Yang, Dejun ^a   Gundecha, Pritam ^a   Xue, Guoliang ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIJKSTRA'S SHORTEST PATH ALGORITHM; K CONSTRAINTS; K-APPROXIMATION ALGORITHM; NP-HARD; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; SPATIAL DIVERSITY; WIRELESS MEDIUM; WIRELESS ROUTING PROTOCOLS;

AD HOC NETWORKS; COMMUNICATION; GRAPH THEORY; LOCAL AREA NETWORKS; MESH NETWORKING; POLYNOMIAL APPROXIMATION; SENSORS;

APPROXIMATION ALGORITHMS;

EID: 77955119955     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SECON.2010.5508266     Document Type: Conference Paper

References (25)

1. S. Biswas and R. Morris, "ExOR: Opportunistic Multi-Hop Routing for Wireless Networks," ACM SIGCOMM'05, Philadelphia, PA, USA, Aug.2005, pp. 133-143.
2. S. Chachulski, "Trading Structure for Randomness in Wireless Opportunistic Routing," Masters thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, May 2007.
3. S. Chen and K. Nahrstedt, "On finding multi-constrained paths," IEEE ICC'98, Atlanta, GA, USA, pp.874-879.
4. Cisco, "Cisco Aironet 802.11a/b/g Wireless LAN Client Adapters (CB21AG and PI21AG) Installation and Configuration Guide", 2007.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, "Introduction to Algorithms," The MIT Press.
6. D. D. Couto, D. Aguayo, J. Bicket, and R. Morris, "A High-Throughput Path Metric for Multi-Hop Wireless Routing," ACM MobiCom'03 Conference, San Diego, CA, USA, Sep. 2003, pp. 134-146.
7. R. Draves, J. Padhye, and B. Zill, "Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks," ACM MobiCom'04 Conference, Philadelphia, PA, USA, Sep.2004, pp. 114-128.
8. H. Dubois-Ferrière, "Anypath Routing," Ph.D dissertation, Ecole Poly-technique Fédérale de Lausanne, Lausanne, Switzerland, Nov. 2006.
9. H. Dubois-Ferrière, M. Grossglauser and Martin Vetterli, "Least-cost Opportunistic Routing," Allerton Conference'07, Monticello, IL, USA, Sep.2007.
10. F. Ergun, R. Sinha and L. Zhang, "An improved FPTAS for restricted shortest path," Information Proc. Letters, vol.83(2002), pp. 287-291.
11. A. Goldsmith, "Wireless Communications," Cambridge University Press, Aug.2005.
12. J.M. Jaffe, "Algorithms for finding paths with multiple constraints," Networks, vol.14, no.1, Oct. 2006, pp. 95-116.
13. S. Jain and S. R. Das, "Exploiting Path Diversity in the Link Layer in Wireless Ad Hoc Networks," Ad Hoc Networks, vol.6, no.5, Jul.2008, pp.805-825.
14. F.A. Kuipers, A. Orda, D. Raz, and P. Van Mieghem, "A comparison of exact and A-approximation algorithms for constrained routing," IFIP Networking'06, Coimbra, Portugal, May 15-19, 2006.
15. P. Larsson, "Selection Diversity Forwarding in a Multihop Packet Radio Network with Fading Channel and Capture," SIGMOBILE Mob. Comput. Commun. Rev., vol.5, no.4, Oct.2001, pp. 47-54.
16. R. Laufer, H. Dubois-Ferrière and L. Kleinrock, "Multirate Anypath Routing in Wireless Mesh Networks," IEEE INFOCOM'09, Rio de Janeiro, Brazil, Apr.2009, pp.37-45.
17. R. Laufer and L. Kleinrock, "Multirate Anypath Routing in Wireless Mesh Networks," UCLA Computer Science Department, Tech. Rep. UCLA-CSD-TR080025, Aug. 2008.
18. D.H. Lorenz and D. Raz; "A simple efficient approximation scheme for the restricted shortest path problem," Operations Research Letters, vol.28, no.5, Jun. 2001, pp. 213-219.
19. C. Reis, R. Mahajan, M. Rodrig, D. Wetherall, and J. Zahorjan, "Measurement-based models of delivery and interference in static wireless networks," ACM SIGCOMM'06 Conference, Vancouver, British Columbia, Canada, Sep. 2006, pp.51-62.
20. G. Schaefer, F. Ingelrest, and M. Vetterli, "Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks," 6th European Conference on WSNs, Cork, Ireland, Feb. 2009, pp. 118-133.
21. Z. Wang and J. Crowcroft, "Quality-of-service routing for supporting multimedia applications," IEEE Journal on Selected Areas in Communications, vol.14, no.7, Sep. 1996 pp.1228-1234.
22. G. Xue, A. Sen, W. Zhang, J. Tang and K. Thulasiraman, "Finding a path subject to many additive QoS constraints," IEEE/ACM Transactions on Networking, vol.15, no.1, Feb.2007, pp. 201-211.
23. G. Xue, W. Zhang, J. Tang and K. Thulasiraman, "Polynomial time approximation algorithms for multi-constrained QoS routing," IEEE/ACM Transactions on Networking, vol. 16, no.3, Jun.2008, pp. 656-669.
24. K. Zeng, W. Lou, and H. Zhai, "On End-to-end Throughput of Opportunistic Routing in Multirate and Multihop Wireless Networks," IEEE Infocom'08 Conference, Phoenix, AZ, USA, Apr. 2008.
25. Z. Zhong, J. Wang, S. Nelakuditi, and G.-H. Lu, "On Selection of Candidates for Opportunistic Any Path Forwarding," ACM SIGMOBILE Mob Comp. and Com. Rev., vol.10, no.4, Oct. 2006, pp.1-2.