CAREER: Traffic Differentiation in Multihop Wireless Networks
                                                                               


     

 

 

 

Project Summary

After WLAN's phenomenal commercial success, multihop wireless networks, including wireless sensor networks, wireless mesh networks, and mobile ad-hoc networks, are expected to lead in the next wave of deployment. From a user's perspective, not only do these networks enable ubiquitous communication, but also they should provide means to support diverse application requirements, particularly, the ability to differentiate various types of data flows and ensure quality of service. The objective of this project is to design distributed algorithms and network protocols to solve several fundamental problems in multihop wireless networks, including end-to-end weighted bandwidth allocation, bandwidth assurance, and performance/overhead tradeoff in traffic differentiation. The study covers a variety of network conditions, including single-commodity or multi-commodity flows, single-path or multi-path routing, and static or highly-dynamic wireless networks. The research focuses on two hop-by-hop, routing-independent, light-weight approaches based on aggregate state and packet labels, respectively. Without maintaining any per-flow state, these approaches are able to implement traffic differentiation under aggregate or weighted maxmin models and have great flexibility in adaptation based on network/traffic conditions. The research results are expected to have significant intellectual and practical impact. Wireless sensor networks, mesh networks, and mobile ad-hoc networks will provide a pervasive communication infrastructure for modern societies and dramatically change the way people interact with cyberspace and physical environment. Traffic-differentiation capability allows these networks to meet diverse application requirements, which will promote their entrance into the marketplace. As an educational effort, this project actively involves senior undergrads and minority students.

Funding Agency: National Science Foundation

http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0644033

PI: Dr. Shigang Chen

Project Duration: 05/01/2007 - 04/30/2012

Publication

1.     Shigang Chen, Yuguang Fang, Ye Xia, Achieving Lexicographic Maxmin Fairness for Data Collection in Wireless Sensor Networks, IEEE Transactions on Mobile Computing, vol. 6, no. 7, pp. 762-776, July 2007.

2.     Ying Jian, Shigang Chen, Liang Zhang, Yuguang Fang, New Adaptive Protocols for Fine-Level End-to-End Rate Control in Wireless Networks, in Proc. of 16th IEEE International Conference on Network Protocols (ICNP'08), Orlando, Florida, USA, October 2008.

3.     Liang Zhang, Shigang Chen, Ying Jian, Ming Zhang, A Novel Solution for End-to-End Fairness Problem in Wireless Mesh Networks, in Proc. of IEEE Globecom, Ad Hoc, Sensor and Mesh Networking Symposium (GC'08 AHSN), New Orleans, LA, USA, November/December 2008.

4.     Ying Jian, Shigang Chen, Can CSMA/CA Networks be Made Fair?, in Proc. of ACM MobiCom, San Francisco, California, USA, September 2008.

5.     Liang Zhang, Shigang Chen, Ying Jian, Achieving Global End-to-End Maxmin in Multihop Wireless Networks, in Proc. of 28th IEEE International Conference on Distributed Computing Systems (ICDCS'08), Beijing, China, June 2008.

6.     Liang Zhang, Shigang Chen, Ying Jian, Yuguang Fang, Distributed Progressive Algorithm for Maximizing Lifetime Vector in Wireless Sensor Networks, in Proc. of IEEE INFOCOM’09, Rio de Janeiro, Brazil, April 2009.