This Article 
 Bibliographic References 
 Add to: 
Shaping Throughput Profiles in Multihop Wireless Networks: A Resource-Biasing Approach
March 2012 (vol. 11 no. 3)
pp. 367-376
Sumit Singh, Moseley Assoc. Inc., Santa Barbara, CA, USA
U. Madhow, Dept. of Electr. & Comput. Eng., Univ. of California, Santa Barbara, CA, USA
E. M. Belding, Dept. of Comput. Sci., Univ. of California, Santa Barbara, CA, USA
A fundamental question in multihop wireless network protocol design is how to partition the network's transport capacity among contending flows. A classically "fair” allocation leads to poor throughput performance for all flows because connections that traverse a large number of hops (i.e., long connections) consume a disproportionate share of resources. However, naïvely biasing against longer connections can lead to poor network utilization, because a significantly high fraction of total connections are long in large networks with spatially uniform traffic. While proportional fair allocation provides a significant improvement, we show here that there is a much richer space of resource allocation strategies for introducing a controlled bias against resource-intensive long connections in order to significantly improve the performance of shorter connections. Specifically, mixing strongly biased allocations with fairer allocations leads to efficient network utilization as well as a superior trade-off between flow throughput and fairness. We present an analytical model that offers insight into the impact of a particular resource allocation strategy on network performance, taking into account finite network size and spatial traffic patterns. We point to protocol design options to implement our resource allocation strategies by invoking the connection with the well-studied network utility maximization framework. Our simulation evaluation serves to verify the analytical design prescriptions.

[1] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
[2] F. Kelly, A. Maulloo, and D. Tan, “Rate Control in Communication Networks: Shadow Prices, Proportional Fairness and Stability,” J. Operational Research Soc., vol. 49, pp. 237-252, 1998.
[3] J. Mo and J. Walrand, “Fair End-to-End Window-Based Congestion Control,” IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 556-567, Oct. 2000.
[4] S. Singh, U. Madhow, and E.M. Belding, “Beyond Proportional Fairness: A Resource Biasing Framework for Shaping Throughput Profiles in Multihop Wireless Networks,” Proc. IEEE INFOCOM, Apr. 2008.
[5] L. Massouli and J. Roberts, “Bandwidth Sharing: Objectives and Algorithms,” IEEE/ACM Trans. Networking, vol. 10, no. 3, pp. 320-328, June 2002.
[6] L. Tassiulas and S. Sarkar, “Max-Min Fair Scheduling in Wireless Networks,” Proc. IEEE INFOCOM '02, pp. 763-772, June 2002.
[7] R. Srikant, The Mathematics of Internet Congestion Control. Birkhauser, 2004.
[8] X. Lin, N.B. Shroff, and R. Srikant, “A Tutorial on Cross-Layer Optimization in Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 24, no. 8, pp. 1452-1463, Aug. 2006.
[9] M. Chiang, S. Low, A. Calderbank, and J. Doyle, “Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures,” Proc. IEEE, vol. 95, no. 1, pp. 255-312, Jan. 2007.
[10] Y. Yi and S. Shakkottai, “Hop-By-Hop Congestion Control over a Wireless Multi-Hop Network,” IEEE/ACM Trans. Networking, vol. 15, no. 1, pp. 133-144, Feb. 2007.
[11] M. Chiang, “Balancing Transport and Physical Layers in Wireless Multihop Networks: Jointly Optimal Congestion Control and Power Control,” IEEE J. Selected Areas Comm., vol. 23, no. 1, pp. 104-116, Jan. 2005.
[12] U. Akyol, M. Andrews, P. Gupta, J.D. Hobby, I. Saniee, and A.L. Stolyar, “Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks,” Proc. IEEE INFOCOM, pp. 619-627, Apr. 2008.
[13] A. Eryilmaz and R. Srikant, “Joint Congestion Control, Routing, and MAC for Stability and Fairness in Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 24, no. 8, pp. 1514-1524, Aug. 2006.
[14] L. Bui, R. Srikant, and A. Stolyar, “Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing,” Proc. IEEE INFOCOM, pp. 2936-2940, 2009.
[15] M. Neely, E. Modiano, and C.-P. Li, “Fairness and Optimal Stochastic Control for Heterogeneous Networks,” IEEE/ACM Trans. Networking, vol. 16, no. 2, pp. 396-409, Apr. 2008.
[16] J. Lee, M. Chiang, and R.A. Calderbank, “Jointly Optimal Congestion and Contention Control Based on Network Utility Maximization,” IEEE Comm. Letters, vol. 10, no. 3, pp. 216-218, Mar. 2006.
[17] X. Lin and N. Shroff, “The Impact of Imperfect Scheduling on Cross-Layer Congestion Control in Wireless Networks,” IEEE/ACM Trans. Networking, vol. 14, no. 2, pp. 302-315, Apr. 2006.
[18] L. Tassiulas and A. Ephremides, “Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks,” IEEE Trans. Automatic Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
[19] L. Chen, S.H. Low, and J.C. Doyle, “Joint Congestion Control and Media Access Control Design for Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM, pp. 2212-2222, Mar. 2005.
[20] B. Radunovic and J.-Y. L. Boudec, “Rate Performance Objectives of Multihop Wireless Networks,” IEEE Trans. Mobile Computing, vol. 3, no. 4, pp. 334-349, Oct.-Dec. 2004.
[21] A. Velayutham, K. Sundaresan, and R. Sivakumar, “Non-Pipelined Relay Improves Throughput Performance of Wireless Ad-Hoc Network,” Proc. IEEE INFOCOM, pp. 477-490, Mar. 2005.
[22] J. Li, C. Blake, D.S.J. De Couto, H.I. Lee, and R. Morris, “Capacity of Ad Hoc Wireless Networks,” Proc. ACM MobiCom, pp. 61-69, July 2001.
[23] N. Zhou, H. Wu, and A.A. Abouzeid, “The Impact of Traffic Patterns on the Overhead of Reactive Routing Protocols,” IEEE J. Selected Areas in Comm., vol. 23, no. 3, pp. 547-560, Mar. 2005.
[24] G. Bianchi, “Performance Analysis of the IEEE 802.11 Distributed Coordination Function,” IEEE J. Selected Areas Comm., vol. 18, no. 3, pp. 535-547, Mar. 2000.
[25] M. Heusse, F. Rousseau, G. Berger-Sabbatel, and A. Duda, “Performance Anomaly of 802.11b,” Proc. IEEE INFOCOM, vol. 2, pp. 836-843, Mar.-Apr. 2003.
[26] QualNet Network Simulator, Version 3.9, http:/, 2005.
[27] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ., 2004.
[28] A. Stolyar, “Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm,” Queueing Systems: Theory and Applications, vol. 50, no. 4, pp. 401-457, Aug. 2005.

Index Terms:
telecommunication traffic,protocols,radio networks,resource allocation,network utility maximization framework,throughput profile shaping,resource-biasing approach,multihop wireless network protocol design,network transport capacity partitioning,proportional fair allocation,resource allocation strategy,finite network size,spatial traffic patterns,Resource management,Throughput,Analytical models,Wireless networks,Spread spectrum communication,Communication protocols,Network topology,network utility maximization.,Resource allocation,multihop wireless networks,proportional fairness,resource biasing
Sumit Singh, U. Madhow, E. M. Belding, "Shaping Throughput Profiles in Multihop Wireless Networks: A Resource-Biasing Approach," IEEE Transactions on Mobile Computing, vol. 11, no. 3, pp. 367-376, March 2012, doi:10.1109/TMC.2011.63
Usage of this product signifies your acceptance of the Terms of Use.