Price-based resource allocation for wireless ad hoc networks with multi-rate capability and energy constraints

被引:5
|
作者
Kao, Yu-Fen [1 ,2 ]
Huang, Jen-Hung [2 ]
机构
[1] Chung Hua Univ, Dept Informat Management, Hsinchu 300, Taiwan
[2] Natl Chiao Tung Univ, Dept Management Sci, Hsinchu 300, Taiwan
关键词
Ad hoc network; Nonlinear programming; Pricing; Resource allocation; Wireless communication;
D O I
10.1016/j.comcom.2008.06.010
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless ad hoc networks have attracted a lot of attentions recently. Resource allocation in such networks needs to address both fairness and overall network performance. Pricing is a prospective direction to regulate behaviors of individual nodes while providing incentives for cooperation. In this work, we develop some pricing strategies for resource allocation by taking account of factors like multiple transmission rates and energy consumption of nodes, which have not been well studied in former works. Multi-rate transmission capability is commonly seen in most wireless products nowadays, while energy is one of the most important resources in portable devices. We propose a clique-based model which allows us to achieve optimal resource utilization and fairness among network flows when multi-rate transmission is considered. We also show how to extend the model to dynamically adjust prices based on energy consumptions of flows. In particular, our model takes into account energy consumptions in the transmitters' side, the receivers' side, and those that are non-transmitters and non-receivers but are interfered by these activities. So our model can more accurately reflect the real energy constraint in a wireless network. Simulation results are presented to show the convergence and other properties of these strategies. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:3613 / 3624
页数:12
相关论文
共 50 条
  • [41] Minimum Energy Multicast Based on the Shuffled Frog-Leaping Algorithm in Multi-rate Wireless Ad Hoc Networks with Directional Antennas
    Zhu, Xiaojian
    Shen, Jun
    2013 NINTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2013, : 812 - 816
  • [42] Joint routing and flow rate optimization in multi-rate ad hoc networks
    Tian, Hongtao
    Bose, Sanjay K.
    Law, Choi Look
    Xiao, Wendong
    COMPUTER NETWORKS, 2008, 52 (03) : 739 - 764
  • [43] Resource Allocation for Type-I HARQ Based Wireless Ad Hoc Networks
    Marcille, Sebastien
    Ciblat, Philippe
    Le Martret, Christophe J.
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2012, 1 (06) : 597 - 600
  • [44] Biological Swarm Intelligence Based Opportunistic Resource Allocation for Wireless Ad Hoc Networks
    Liu, Defang
    Wang, Bochu
    WIRELESS PERSONAL COMMUNICATIONS, 2012, 66 (04) : 629 - 649
  • [45] Biological Swarm Intelligence Based Opportunistic Resource Allocation for Wireless Ad Hoc Networks
    Defang Liu
    Bochu Wang
    Wireless Personal Communications, 2012, 66 : 629 - 649
  • [46] A feedback control scheme for resource allocation in wireless multi-hop ad hoc networks
    He, WB
    Liu, X
    Nahrstedt, K
    Proceedings of MobiQuitous 2005, 2005, : 432 - 439
  • [47] Opportunistic Routing in Multi-rate Multi-hop Ad Hoc Networks
    Al-Zubi, Raed Taleb
    Krunz, Marwan
    2012 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2012,
  • [48] Resource allocation algorithm for supporting QoS in wireless ad hoc networks
    Sanguankotchakorn, T
    Viravan, P
    International Conference on Computing, Communications and Control Technologies, Vol 3, Proceedings, 2004, : 240 - 245
  • [49] A unified framework for topology management in multi-rate ad hoc networks
    Tan, Haixia
    Zeng, Weilin
    Bao, Lichun
    Suda, Tatsuya
    IEEE Int. Conf. Wireless Mobile Comput. Netw. Com., 2005, (162-169):
  • [50] Performance evaluation of topology management in multi-rate ad hoc networks
    Tan, HX
    Zeng, WL
    Bao, LC
    2005 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4: WCNC 2005: BROADBAND WIRELESS FOR THE MASSES READY FOR TAKE-OFF., 2005, : 2213 - 2218