Balancing Power and Rate to Achieve Bounded Average Delay in Wireless Networks

B. M. Dogahe, Xingzhe Fan, M. Murthi, K. Premaratne
{"title":"Balancing Power and Rate to Achieve Bounded Average Delay in Wireless Networks","authors":"B. M. Dogahe, Xingzhe Fan, M. Murthi, K. Premaratne","doi":"10.1109/MILCOM.2007.4454959","DOIUrl":null,"url":null,"abstract":"Allocating limited resources such as bandwidth and power in a multi-hop wireless network can be formulated as a Network Utility Maximization (NUM) problem. In this approach, both source transmitting and link relaying nodes exchange information allowing for the NUM problem to be solved in an iterative distributed manner. Previous NUM formulations of wireless networks have considered the parameters of data rate and reliability in the utility function which measures an application's performance. However, it is well known that delay is an important factor in the performance of many applications. In this paper, we consider an additional constraint based on the delay requirements of the sources. This augmented NUM formulation allows an application to tradeoff rate, power and queuing delay according to its needs, thereby providing greater flexibility. Power allocation among different transmitters is a subtle issue to deal with in this problem, since the capacity of the wireless links are interference limited. A distributed iterative algorithm solving the NUM is presented along with its convergence. The performance of the algorithm is examined via simulations which confirm the expectations from the theory.","PeriodicalId":135777,"journal":{"name":"MILCOM 2007 - IEEE Military Communications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 2007 - IEEE Military Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2007.4454959","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Allocating limited resources such as bandwidth and power in a multi-hop wireless network can be formulated as a Network Utility Maximization (NUM) problem. In this approach, both source transmitting and link relaying nodes exchange information allowing for the NUM problem to be solved in an iterative distributed manner. Previous NUM formulations of wireless networks have considered the parameters of data rate and reliability in the utility function which measures an application's performance. However, it is well known that delay is an important factor in the performance of many applications. In this paper, we consider an additional constraint based on the delay requirements of the sources. This augmented NUM formulation allows an application to tradeoff rate, power and queuing delay according to its needs, thereby providing greater flexibility. Power allocation among different transmitters is a subtle issue to deal with in this problem, since the capacity of the wireless links are interference limited. A distributed iterative algorithm solving the NUM is presented along with its convergence. The performance of the algorithm is examined via simulations which confirm the expectations from the theory.
平衡功率和速率以实现无线网络的有界平均延迟
在多跳无线网络中分配有限的资源(如带宽和功率)可以表述为网络效用最大化(NUM)问题。在这种方法中,源传输和链路中继节点交换信息,允许以迭代分布式方式解决NUM问题。以前的无线网络的NUM公式考虑了测量应用程序性能的效用函数中的数据速率和可靠性参数。然而,众所周知,延迟是影响许多应用程序性能的一个重要因素。在本文中,我们考虑了一个基于源的延迟要求的附加约束。这种增强的NUM公式允许应用程序根据其需要权衡速率,功率和排队延迟,从而提供更大的灵活性。由于无线链路的容量受到干扰的限制,不同发射器之间的功率分配是该问题中需要处理的一个微妙问题。给出了求解NUM的一种分布式迭代算法及其收敛性。通过仿真验证了算法的性能,验证了理论的期望。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信