Abstract
The shared-medium multi-hop nature of wireless ad hoc networks poses fundamental challenges to the design of an effective resource allocation algorithm to maximize the aggregated utility of flows, while maintaining basic fairness among multiple flows. When previously proposed scheduling algorithms have been shown to perform well in providing fair shares of bandwidth among single-hop wireless flows, they did not consider multi-hop flows with an end-to-end perspective. Moreover, the resource allocation strategies employed in the wireline network can not be applied directly in the context of ad hoc networks due to the unique characteristic of location dependent contention and spatial reuse of the shared wireless channel. In this paper, we propose a price-based resource allocation model to achieve maximized aggregated utility (i.e., social welfare) of flows. Our original contributions are: First, we propose to use maximal clique-associated shadow prices for wireless channel access coordination, rather than link-associated price for wireline link access arbitration. Second, we present a new pricing policy for end-to-end multi-hop flow. Using this model, different fairness goals can be realized in ad hoc networks for end-to-end flows. With a two-tier distributed and iterative algorithm, scarce channel capacity is allocated fairly among multi-hop flows from an end-to-end perspective, using shadow prices as the mechanism to arbitrate channel access. Through extensive analysis and simulation results, we show that our proposed algorithm is able to fairly distribute resources among multi-hop flows, while simultaneously maximizing the aggregated utility of flows globally.
This work was supported by the DoD Multi-disciplinary University Research Initiative (MURI) program administered by the Office of Naval Research under Grant NAVY CU 37515-6281, and the NSF EIA 99-72884 grant. Any opinions, findings, and conclusions are those of the authors and do not necessarily reflect the views of the above agencies.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, “Rate Control in Communication Networks: Shadow prices, Proportional Fairness and Stability,” Journal of the Operational Research Society, vol. 49, pp. 237–252, 1998.
S. H. Lowand D. E. Lapsley, “Optimization Flow Control: Basic Algorithm and Convergence,” IEEE/ACM Trans. on Networking, vol. 7, no. 6, pp. 861–874, 1999.
F. P. Kelly, “Charging and Rate Control for Elastic Traffic,” European Trans. on Telecommunications, vol. 8, pp. 33–37, 1997.
Richard J. La and V. Anantharam, “Utility-based rate control in the Internet for elastic traffic,” IEEE/ACM Trans. on Networking, vol. 10, no. 2, pp. 272–286, 2002.
L. Tassiulas K. Kar, S. Sarkar, “A simple rate control algorithm for maximizing total user utility,” in Proc. of INFOCOM, 2001.
C. U. Saraydar, N. B. Mandayam, and D. J. Goodman, “Efficient power control via pricing in wireless data networks,” IEEE Trans. Commun., vol. 50, no. 2, pp. 291–303, Feb 2002.
R. Wouhaybi R. Liao and A. Campbell, “Incentive engineering in wireless lan based access networks,” in Proc. of 10th IEEE International Conference on Network Protocols (ICNP), Nov 2002.
Y. Qiu and P. Marbach, “Bandwith Allocation in Ad-Hoc Networks: A Price-Based Approach,” in Proc. of INFOCOM, 2003.
T. Nandagopal, T.-E. Kim, X. Gao, and V. Bharghavan, “Achieving MAC Layer Fairness in Wireless Packet Networks,” in Proc. of ACM Mobicom, 2000, pp. 87–98.
L. Tassiulas and S. Sarkar, “Maxmin fair scheduling in wireless networks,” in Proc. of INFOCOM, 2002, pp. 763–772.
H. Luo, S. Lu, and V. Bharghavan, “A New Model For Packet Scheduling in Multihop Wireless Networks,” in Proc. of ACM Mobicom, 2000, pp. 76–86.
X. L. Huang and B. Bensaou, “On Max-min Fairness and Scheduling in Wireless Ad-hoc Networks: Analytical Framework and Implementation,” in Proc. of ACM MobiHoc, 2001, pp. 221–231.
B. Li Y. Xue and K. Nahrstedt, “Price-based resource allocation in wireless ad hoc networks,” Tech. Rep. UIUCDCS-R-2003-2331, Univ. of Illinios at Urbana-Champaign, 2003.
J. G. Augustson and J. Minker, “An Analysis of Some Graph Theoretical Cluster Techniques,” Journal of the Association for Computing Machinery, vol. 17, no. 4, pp. 571–586, 1970.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xue, Y., Li, B., Nahrstedt, K. (2003). Price-Based Resource Allocation in Wireless Ad Hoc Networks. In: Jeffay, K., Stoica, I., Wehrle, K. (eds) Quality of Service — IWQoS 2003. IWQoS 2003. Lecture Notes in Computer Science, vol 2707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44884-5_5
Download citation
DOI: https://doi.org/10.1007/3-540-44884-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40281-7
Online ISBN: 978-3-540-44884-6
eBook Packages: Springer Book Archive