An integrated and distributed scheduling and power control algorithm for maximizing network utility for wireless multihop networks

J.C. Fang, R. Rao
{"title":"An integrated and distributed scheduling and power control algorithm for maximizing network utility for wireless multihop networks","authors":"J.C. Fang, R. Rao","doi":"10.1109/MILCOM.2003.1290304","DOIUrl":null,"url":null,"abstract":"In this paper, we solve the resource allocation problem of maximizing the sum of transmitter utilities subject to QoS and peak power constraints per link in a wireless multihop network. Each node in the network has an associated utility function that models its valuation of its data rate (or signal power) in terms of its transmission power and multiaccess interference. By explicitly accounting for multiaccess interference in the utility function, our framework can model and solve a wide variety of resource allocation problems. Each link in the network is subject to a minimum and a maximum data rate constraint and each transmitter is subject to a peak power constraint. We present an iterative power control algorithm that solves the above problem using a penalty function approach and prove its convergence to the optimal solution. Our power control policy is applicable over any subset of links scheduled. To achieve high data rates over the links in addition to maximizing system utility, we schedule links using a degree-based greedy algorithm that limits multiaccess interference by scheduling a small number of transmissions around any scheduled receiver. The link scheduling algorithm and the power control algorithm are both amenable to distributed implementation in the framework of 802.11 LANs. Finally, we compare the performance of our joint scheduling and power control algorithms against CDMA using example utility functions and illustrate the superior performance of our algorithms.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"165 9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Military Communications Conference, 2003. MILCOM 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2003.1290304","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

In this paper, we solve the resource allocation problem of maximizing the sum of transmitter utilities subject to QoS and peak power constraints per link in a wireless multihop network. Each node in the network has an associated utility function that models its valuation of its data rate (or signal power) in terms of its transmission power and multiaccess interference. By explicitly accounting for multiaccess interference in the utility function, our framework can model and solve a wide variety of resource allocation problems. Each link in the network is subject to a minimum and a maximum data rate constraint and each transmitter is subject to a peak power constraint. We present an iterative power control algorithm that solves the above problem using a penalty function approach and prove its convergence to the optimal solution. Our power control policy is applicable over any subset of links scheduled. To achieve high data rates over the links in addition to maximizing system utility, we schedule links using a degree-based greedy algorithm that limits multiaccess interference by scheduling a small number of transmissions around any scheduled receiver. The link scheduling algorithm and the power control algorithm are both amenable to distributed implementation in the framework of 802.11 LANs. Finally, we compare the performance of our joint scheduling and power control algorithms against CDMA using example utility functions and illustrate the superior performance of our algorithms.
一种用于最大化无线多跳网络的网络效用的集成和分布式调度和功率控制算法
在本文中,我们解决了无线多跳网络中受QoS和峰值功率约束的每链路发射机效用总和最大化的资源分配问题。网络中的每个节点都有一个相关的效用函数,该函数根据其传输功率和多址干扰对其数据速率(或信号功率)的估值进行建模。通过明确地考虑效用函数中的多址干扰,我们的框架可以建模并解决各种各样的资源分配问题。网络中的每个链路都受到最小和最大数据速率约束,每个发射机都受到峰值功率约束。我们提出了一种迭代功率控制算法,利用罚函数方法解决了上述问题,并证明了该算法收敛于最优解。我们的功率控制策略适用于计划的任何链路子集。除了最大化系统效用外,为了在链路上实现高数据速率,我们使用基于度的贪婪算法来调度链路,该算法通过在任何调度的接收器周围调度少量传输来限制多址干扰。链路调度算法和功率控制算法都可以在802.11局域网框架下分布式实现。最后,我们使用示例效用函数比较了我们的联合调度和功率控制算法与CDMA的性能,并说明了我们的算法的优越性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信