This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach
April 2006 (vol. 5 no. 4)
pp. 347-364
ASCII Text
x 
 
Yuan Xue, Baochun Li, Klara Nahrstedt, "Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach," IEEE Transactions on Mobile Computing, vol. 5, no. 4, pp. 347-364, April, 2006.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2006.52,
author = {Yuan Xue and Baochun Li and Klara Nahrstedt},
title = {Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach},
journal ={IEEE Transactions on Mobile Computing},
volume = {5},
number = {4},
issn = {1536-1233},
year = {2006},
pages = {347-364},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2006.52},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach
IS - 4
SN - 1536-1233
SP347
EP364
EPD - 347-364
A1 - Yuan Xue,
A1 - Baochun Li,
A1 - Klara Nahrstedt,
PY - 2006
KW - Wireless communication
KW - algorithm/protocol design and analysis
KW - nonlinear programming.
VL - 5
JA - IEEE Transactions on Mobile Computing
ER -
 
Yuan Xue, IEEE
Baochun Li, IEEE
The shared-medium multihop nature of wireless ad hoc networks poses fundamental challenges to the design of effective resource allocation algorithms that are optimal with respect to resource utilization and fair across different network flows. None of the existing resource allocation algorithms in wireless ad hoc networks have realistically considered end-to-end flows spanning multiple hops. Moreover, strategies proposed in wireline networks are not applicable in the context of wireless ad hoc networks, due to their unique characteristics of location-dependent contention. In this paper, we propose a new price-based resource allocation framework in wireless ad hoc networks to achieve optimal resource utilization and fairness among competing end-to-end flows. We build our pricing framework on the notion of maximal cliques in wireless ad hoc networks, as compared to individual links in traditional wide-area wireline networks. Based on such a price-based theoretical framework, we present a two-tier iterative algorithm. Distributed across wireless nodes, the algorithm converges to a global network optimum with respect to resource allocations. We further improve the algorithm toward asynchronous network settings and prove its convergence. Extensive simulations under a variety of network environments have been conducted to validate our theoretical claims.

[1] T. Nandagopal, T.-E. Kim, X. Gao, and V. Bharghavan, “Achieving MAC Layer Fairness in Wireless Packet Networks,” Proc. ACM Mobicom Conf., pp. 87-98, 2000.
[2] L. Tassiulas and S. Sarkar, “Maxmin Fair Scheduling in Wireless Networks,” Proc. INFOCOM Conf., pp. 763-772, 2002.
[3] H. Luo, S. Lu, and V. Bharghavan, “A New Model for Packet Scheduling in Multihop Wireless Networks,” Proc. ACM Mobicom Conf., pp. 76-86, 2000.
[4] F.P. Kelly, A.K. Maulloo, and D.K.H. Tan, “Rate Control in Communication Networks: Shadow Prices, Proportional Fairness and Stability,” J. Operational Research Soc., vol. 49, pp. 237-252, 1998.
[5] S.H. Low and D.E. Lapsley, “Optimization Flow Control: Basic Algorithm and Convergence,” IEEE/ACM Trans. Networking, vol. 7, no. 6, pp. 861-874, 1999.
[6] F.P. Kelly, “Charging and Rate Control for Elastic Traffic,” European Trans. Telecomm., vol. 8, pp. 33-37, 1997.
[7] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
[8] D. Bertsekas, Nonlinear Programming. Athena Scientific, 1999.
[9] Y. Xue, B. Li, and K. Nahrstedt, “Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach,” technical report UIUCDCS-R-2004-2505, Univ. of Illinois at Urbana-Champaign, Dec. 2004.
[10] J.G. Augustson and J. Minker, “An Analysis of Some Graph Theo-retical Cluster Techniques,” J. ACM, vol. 17, no. 4, pp. 571-586, 1970.
[11] D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation. Prentice-Hall, 1989.
[12] C. Perkins and E. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications (WMCSA '99), 1999.
[13] S.H. Shah, K. Chen, and K. Nahrstedt, “Dynamic Bandwidth Management for Single-Hop Ad Hoc Wireless Networks,” ACM/Kluwer Mobile Networks and Applications, vol. 10, no. 1, 2005.
[14] R.J. La and V. Anantharam, “Utility-Based Rate Control in the Internet for Elastic Traffic,” IEEE/ACM Trans. Networking, vol. 10, no. 2, pp. 272-286, 2002.
[15] T.M. Heikkinen, “On Congestion Pricing in a Wireless Network,” Wireless Networks, vol. 8, no. 4, pp. 347-354, 2002.
[16] D. Julian, M. Chiang, D. O'Neill, and S. Boyd, “QoS and Fairness Constrained Convex Optimization of Resource Allocation for Wireless Cellular and Ad Hoc Networks,” Proc. IEEE INFOCOM Conf., pp. 477-486, June 2002.
[17] R. Liao, R. Wouhaybi, and A. Campbell, “Incentive Engineering in Wireless LAN Based Access Networks,” Proc. 10th IEEE Int'l Conf. Network Protocols (ICNP), Nov. 2002.
[18] Y. Qiu and P. Marbach, “Bandwidth Allocation in Ad-Hoc Networks: A Price-Based Approach,” Proc. INFOCOM Conf., 2003.
[19] L. Buttyan and J.P. Hubaux, “Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks,” ACM/Kluwer Mobile Networks and Applications (MONET), vol. 8, no. 5, Oct. 2003.

Index Terms:
Wireless communication, algorithm/protocol design and analysis, nonlinear programming.
Citation:
Yuan Xue, Baochun Li, Klara Nahrstedt, "Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach," IEEE Transactions on Mobile Computing, vol. 5, no. 4, pp. 347-364, April 2006, doi:10.1109/TMC.2006.52
Usage of this product signifies your acceptance of the Terms of Use.