A fair scheduling for wireless mesh networks

WiMesh 2005 - 1st IEEE Workshop on Wireless Mesh Networks, Held in Conjunction with SECON 2005

Volumn , Issue , 2005, Pages

  Salem, Naouel Ben ^a   Hubaux, Jean Pierre ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BAND-WIDTH UTILIZATION; BROADBAND CONNECTION; INTERNET SERVICE PROVIDERS (ISP); ITS EFFICIENCIES; MEDIUM ACCESS PROTOCOL; MULTI HOP COMMUNICATION; TRANSMISSION RIGHTS; WIRELESS MESH NETWORKS (WMNS);

INTERNET SERVICE PROVIDERS; MEDIUM ACCESS CONTROL; SCHEDULING; WI-FI; WIRELESS MESH NETWORKS (WMN);

MESH NETWORKING;

EID: 84893511445     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. I. F. Akyildiz, X. Wang, and W. Wang. Wireless Mesh Networks: A Survey. Computer Networks Journal (Elsevier), 47(4), 2005.
2. P. Bahl, A. Balachandran, A. Miu, W. Russell, G. Voelker, and Y.M. Wang. PAWNs: Satisfying the Need for Ubiquitous Connectivity and Location Services. IEEE Personal Communications Magazine (PCS), 9(1), 2002.
3. P. Bahl, A. Balachandran, and S. Venkatachary. Secure Wireless Internet Access in Public Places. In Proceedings of the IEEE Conference on Communications, 2001.
4. Y. Bejerano, S.-J. Han, and L. Li. Fairness and Load Balancing in Wireless LANs Using Association Control. In Proceedings of MobiCom, 2004.
5. P. Bjorklund, P. Varbrand, and D. Yuan. Resource Optimization of Spatial TDMA in Ad Hoc Radio Networks: A Column Generation Approach. In Proceedings of INFOCOM, 2003.
6. R. Bruno, M. Conti, and E. Gregori. Mesh Networks: Commodity Multihop Ad Hoc Networks. IEEE Communications Magazine, March 2005.
7. N. Chiba and T. Nashizeki. Arboricity and Subgraph Listing Algorithms. SIAM J. Comput, 14, 1985.
8. V. Gambiroza, B. Sadeghi, and E. Knightly. End-to-End Performance and Fairness in Multihop Wireless Backhaul Networks. In Proceedings of MobiCom, 2004.
9. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman, 1983.
10. J. Gronkvist. Assignment Methods for Spatial Reuse TDMA. In Proceedings of MobiHOC, 2000.
11. Matlab Simulator. http://www.mathworks.com/.
12. MeshNetworks Granted Experimental License by the FCC to Test and Deploy Mobile Mesh 4.9Ghz Solutions. http://www.tmcnet.com/usubmit/2004/Sep/1075816. htm.
13. Y. C. Hu, A. Perrig, and D. B. Johnson. Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks. In Proceedings of Mobicom, 2002.
14. D. Jackson. Motorola Announces First Mesh Deployment. http://mrtmag.com/news/motorolameshdeployment022805/.
15. D. B. Johnson and D. A. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks. In Imielinski and Korth, editors, Mobile Computing. Kluwer Academic Publishers, 1996.
16. R. Karp. Reducibility Among Combinatorial Problems. Complexity of Computer Computations, 85-103, 1972.
17. Victoria W. Kipp. The battle of NIMBY. PRIMEDIA Business Magazines & Media Inc, 2002.
18. S. Nelson and L. Kleinrock. Spatial TDMA: A Collision-Free Multihop Channel Access Protocol. IEEE Transactions on Commnuications, 33(9), 1985.
19. P. Papadimitratos and Z. J. Haas. Secure Routing for Mobile Ad Hoc Networks. In Proceedings of CNDS, 2002.
20. S. Rupley. A Moveable Mesh. http://www.pcmag.com/article2/0,1895,1641379, 00.asp.
21. K. Sanzgiri, D. LaFlamme, B. Dahill, B. Levine, C. Shields, and E. Belding-Royer. An Authenticated Routing Protocol for Secure Ad hoc Networks. In Journal on Selected Areas in Communications special issue on Wireless Ad hoc Networks, March 2005.
22. C. E. Perkins, E. M. Belding-Royer, and S. R. Das. Ad Hoc On-Demand Distance Vector (AODV) Routing. IETF Internet draft, draft-ietf-manet-aodv-10. txt (Work in Progress). March 2002.
23. E. Tomita, A. Tanaka, and H. Takahashi. The Worst-case Time Complexity for Finding all the Cliques. Technical report, UEC-TR-CI, 1988.
24. P. Varbrand and D. Yuan. Maximal Throughput of Spatial TDMA in Ad Hoc Networks. In White paper, Sept., 2003.