This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks
December 2008 (vol. 7 no. 12)
pp. 1397-1414
Calin Curescu, Linköping University, Linköping
Simin Nadjm-Tehrani, Linköping University, Linköping
This article proposes a scheme for bandwidth allocation in wireless ad hoc networks. The quality of service (QoS) levels for each end-to-end flow are expressed using resource-utility functions, and our algorithms aim to maximize aggregated utility. The shared channel is modeled as bandwidth resources defined by maximal cliques of mutual interfering links. We propose an entirely novel resource allocation algorithm that employs auction mechanisms where flows are bidding for resources. The bids depend both on the flow's utility function and the intrinsically derived shadow prices. Then we combine it with a utility-aware on-demand shortest path routing algorithm where shadow prices are used as a natural distance metric. We also show that the problem can be formulated as a linear programming problem. Thus we can compare the performance of our scheme to the centralized optimal LP solution, registering results very close to the optimum. We isolate the performance of the price-based routing and show its advantages in hotspot scenarios, and also propose an asynchronous version that is more feasible for ad hoc environments. Experimental results of a comparison with the state-of-the-art approach based on Kelly's utility maximization framework show that our approach exhibits superior performance for networks with both increased mobility or increased allocation period.

[1] C. Lee, J. Lehoczky, R. Rajkumar, and D. Siewiorek, “On Quality of Service Optimization with Discrete QoS Options,” Proc. Fifth IEEE Real-Time Technology and Applications Symp., June 1999.
[2] C. Curescu and S. Nadjm-Tehrani, “Time-Aware Utility-Based Resource Allocation in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 7, pp. 624-636, July 2005.
[3] Y. Xue, B. Li, and K. Nahrstedt, “Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach,” IEEE Trans. Mobile Computing, vol. 5, no. 4, pp. 347-364, Apr. 2006.
[4] H. Luo, S. Lu, V. Bharghavan, J. Cheng, and G. Zhong, “A Packet Scheduling Approach to QoS Support in Multihop Wireless Networks,” Mobile Networks and Applications, vol. 9, no. 3, pp.193-206, 2004.
[5] Y. Xue, B. Li, and K. Nahrstedt, “Price-Based Resource Allocation in Wireless Ad Hoc Networks,” Proc. 11th Int'l Workshop Quality of Service (IWQoS '03), vol. 2707, pp. 79-96, June 2003.
[6] Q. Xue and A. Ganz, “Ad Hoc QoS On-Demand Routing (AQOR) in Mobile Ad Hoc Networks,” J. Parallel and Distributed Computing, vol. 63, no. 2, pp. 154-165, 2003.
[7] S. Chen and K. Nahrstedt, “Distributed Quality-of-Service Routing in Ad-Hoc Networks,” IEEE J. Special Areas in Comm., vol. 17, no. 8, pp. 1-18, Aug. 1999.
[8] C.R. Lin and J.-S. Liu, “QoS Routing in Ad Hoc Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp.1426-1438, 1999.
[9] J.N. Al-Karaki and A. Kamal, Quality of Service Routing in Mobile Ad hoc Networks: Current and Future Trends, chapter Mobile Computing Handbook, CRC, 2004.
[10] C. Curescu and S. Nadjm-Tehrani, “Time-Aware Utility-Based QoS Optimisation,” Proc. 15th Euromicro Conf. Real-time Systems (ECRTS '03), pp. 83-93, July 2003.
[11] R.R.-F. Liao and A.T. Campbell, “A Utility-Based Approach for Quantitative Adaptation in Wireless Packet Networks,” Wireless Networks, vol. 7, pp. 541-557, Sept. 2001.
[12] V. Bharghavan, K.-W. Lee, S. Lu, S. Ha, J.-R. Li, and D. Dwyer, “The TIMELY Adaptive Resource Management Architecture,” Personal Comm., IEEE, vol. 5, no. 4, pp. 20-31, Aug. 1998.
[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] J.W. Lee, M. Chiang, and R.A. Calderbank, “Jointly Optimal Congestion and Contention Control in Wireless Ad Hoc Networks,” Proc. 64th IEEE Vehicular Technology Conf., May 2006.
[15] X. Lin and N.B. Shroff, “An Optimization-Based Approach for QoS Routing in High-Bandwidth Networks,” IEEE/ACM Trans. Networking, vol. 14, no. 6, pp. 1348-1361, 2006.
[16] H. Han, S. Shakkottai, C.V. Hollot, R. Srikant, and D. Towsley, “Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity on the Internet,” IEEE/ACM Trans. Networking, vol. 14, no. 6, pp. 1260-1271, Dec. 2006.
[17] F. Kelly, A. Maulloo, and D. Tan, “Rate Control in Communication Networks: Shadow Prices, Proportional Fairness and Stability,” J.Operational Research Soc., vol. 49, 1998.
[18] X. Lin, N. 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, 2006.
[19] C. Curescu and S. Nadjm-Tehrani, “Price/Utility-Based Optimized Resource Allocation in Wireless Ad Hoc Networks,” Proc. Second Conf. Sensor and Ad Hoc Comm. and Networks, Sept. 2005.
[20] M. Luethi, S. Nadjm-Tehrani, and C. Curescu, “Comparative Study of Price-Based Resource Allocation Algorithms for Ad Hoc Networks,” Proc. 20th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '06), Apr. 2006.
[21] C. Lee, “On Quality of Service Management,” Technical Report CMU-CS-99-165, Carnegie Mellon Univ., Aug. 1999.
[22] ITU-R Recommendation BT.500-10: Methodology for the Subjective Assessment of the Quality of Television Pictures, Geneva, Switzerland, ITU, 2000.
[23] SAMVIQ—Subjective Assessment Methodology for Video Quality, EBU Project Group B/VIM Video in Multimedia, BPN 056 Report, http://www.ebu.ch/trev_301-samviq.pdf, May 2003.
[24] R.J. Vanderbei, Linear Programming: Foundations and Extensions. Kluwer Academic Publishers, 1996.
[25] K. Römer, P. Blum, and L. Meier, “Time Synchronization and Calibration in Wireless Sensor Networks,” Handbook of Sensor Networks: Algorithms and Architectures, I. Stojmenovic, ed., John Wiley & Sons, Sept. 2005.
[26] J.G. Augustson and J. Minker, “An Analysis of Some Graph Theoretical Cluster Techniques,” J. ACM, vol. 17, no. 4, pp.571-588, 1970.
[27] C. Oliveira, J.B. Kim, and T. Suda, “An Adaptive Bandwidth Reservation Scheme for High-Speed Multimedia Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 16, pp. 858-878, 1998.
[28] F. Ruben and F. Edlund, “Design of a Mobile Payment Intermediary,” Master's thesis, LiTH-IDA-Ex-02/108, Linköping Univ., Dec. 2002.
[29] J-sim Homepage, http:/www.j-sim.org/, 2008.
[30] J. Yoon, M. Liu, and B. Noble, “Random Waypoint Considered Harmful,” Proc. IEEE INFOCOM '03, pp. 1312-1321, Apr. 2003.
[31] E. Kuiper and S. Nadjm-Tehrani, “Mobility Models for UAV Group Reconnaissance Applications,” Proc. Second Int'l Conf. Wireless and Mobile Comm. (ICWMC '06), July 2006.
[32] Or-Objects Homepage, http://opsresearch.com/OR Objectsindex. html , 2008.
[33] F.P. Kelly, “Charging and Rate Control for Elastic Traffic,” European Trans. Telecomm., vol. 8, pp. 33-37, Jan. 1997.

Index Terms:
Distributed networks, Wireless communication, Pricing and resource allocation, Optimization,Performance evaluation of algorithms and systems
Citation:
Calin Curescu, Simin Nadjm-Tehrani, "A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 7, no. 12, pp. 1397-1414, Dec. 2008, doi:10.1109/TMC.2008.54
Usage of this product signifies your acceptance of the Terms of Use.