城域网中重传感知拥塞控制与分布式功率分配

A. Giovanidis, S. Stańczak
{"title":"城域网中重传感知拥塞控制与分布式功率分配","authors":"A. Giovanidis, S. Stańczak","doi":"10.1109/WIOPT.2009.5291588","DOIUrl":null,"url":null,"abstract":"In the current work the effects of hop-by-hop packet loss and retransmissions via ARQ protocols are investigated within a Mobile Ad-hoc NET-work (MANET). Errors occur due to outages and a success probability function is related to each link, which can be controlled by power and rate allocation. We first derive the expression for the network's capacity region. A Network Utility Maximization problem (NUM) with stability constraints is further formulated which decomposes into (a) the input rate control problem and (b) the scheduling problem. The NUM problem can be solved in a fully decentralized manner if (b) is solved distributedly. Use of supermodular game theory suggests a price based algorithm that requires minimum information exchange between interfering nodes and converges to a power allocation which satisfies the necessary optimality conditions of (b). Simulations illustrate that the suggested algorithm brings near optimal results.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Retransmission aware congestion control and distributed power allocation in MANETs\",\"authors\":\"A. Giovanidis, S. Stańczak\",\"doi\":\"10.1109/WIOPT.2009.5291588\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the current work the effects of hop-by-hop packet loss and retransmissions via ARQ protocols are investigated within a Mobile Ad-hoc NET-work (MANET). Errors occur due to outages and a success probability function is related to each link, which can be controlled by power and rate allocation. We first derive the expression for the network's capacity region. A Network Utility Maximization problem (NUM) with stability constraints is further formulated which decomposes into (a) the input rate control problem and (b) the scheduling problem. The NUM problem can be solved in a fully decentralized manner if (b) is solved distributedly. Use of supermodular game theory suggests a price based algorithm that requires minimum information exchange between interfering nodes and converges to a power allocation which satisfies the necessary optimality conditions of (b). Simulations illustrate that the suggested algorithm brings near optimal results.\",\"PeriodicalId\":143632,\"journal\":{\"name\":\"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks\",\"volume\":\"96 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WIOPT.2009.5291588\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIOPT.2009.5291588","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在当前的工作中,研究了移动自组网(MANET)中逐跳数据包丢失和通过ARQ协议重传的影响。由于停电而产生错误,每个链路都有一个成功概率函数,可以通过功率和速率分配来控制。首先推导出网络容量区域的表达式。进一步提出了具有稳定性约束的网络效用最大化问题(NUM),该问题分解为(A)输入速率控制问题和(b)调度问题。如果(b)以分布式方式解决,NUM问题可以以完全去中心化的方式解决。利用超模博弈论提出了一种基于价格的算法,该算法需要最小的干扰节点之间的信息交换,并收敛到满足(b)中必要的最优性条件的功率分配。仿真表明,该算法带来了接近最优的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Retransmission aware congestion control and distributed power allocation in MANETs
In the current work the effects of hop-by-hop packet loss and retransmissions via ARQ protocols are investigated within a Mobile Ad-hoc NET-work (MANET). Errors occur due to outages and a success probability function is related to each link, which can be controlled by power and rate allocation. We first derive the expression for the network's capacity region. A Network Utility Maximization problem (NUM) with stability constraints is further formulated which decomposes into (a) the input rate control problem and (b) the scheduling problem. The NUM problem can be solved in a fully decentralized manner if (b) is solved distributedly. Use of supermodular game theory suggests a price based algorithm that requires minimum information exchange between interfering nodes and converges to a power allocation which satisfies the necessary optimality conditions of (b). Simulations illustrate that the suggested algorithm brings near optimal results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Joint load balancing, scheduling, and interference mitigation in multi-cell and multi-carrier wireless data systems Transmission schedule optimization for half-duplex multiple-relay networks Quantization, channel compensation, and energy allocation for estimation in wireless sensor networks Characterization of power consumption in thin clients due to protocol data transmission over IEEE 802.11 Battery recovery aware sensor networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1