具有分组排队、信道争用和混合ARQ的自组网递归分析

M. Levorato, S. Tomasin, M. Zorzi
{"title":"具有分组排队、信道争用和混合ARQ的自组网递归分析","authors":"M. Levorato, S. Tomasin, M. Zorzi","doi":"10.1109/ITA.2008.4601098","DOIUrl":null,"url":null,"abstract":"In this paper we present a recursive algorithm to compute some important performance metrics for wireless networks, such as throughput, channel occupancy, average number of packets in the queue and service time. Our model comprises packet queuing, channel access contention, backoff and hybrid automatic retransmission request (HARQ) error control. The analysis is carried out recursively to reduce the computational complexity and makes use of semi-Markov processes and renewal theory. We present results showing that the proposed model is able to accurately predict the aforementioned metrics even for networks with many nodes, where traditional analysis requires infeasible complexity to account for the overall network status.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Recursive analysis of ad hoc networks with packet queueing, channel contention and hybrid ARQ\",\"authors\":\"M. Levorato, S. Tomasin, M. Zorzi\",\"doi\":\"10.1109/ITA.2008.4601098\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a recursive algorithm to compute some important performance metrics for wireless networks, such as throughput, channel occupancy, average number of packets in the queue and service time. Our model comprises packet queuing, channel access contention, backoff and hybrid automatic retransmission request (HARQ) error control. The analysis is carried out recursively to reduce the computational complexity and makes use of semi-Markov processes and renewal theory. We present results showing that the proposed model is able to accurately predict the aforementioned metrics even for networks with many nodes, where traditional analysis requires infeasible complexity to account for the overall network status.\",\"PeriodicalId\":345196,\"journal\":{\"name\":\"2008 Information Theory and Applications Workshop\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Information Theory and Applications Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITA.2008.4601098\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Information Theory and Applications Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2008.4601098","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种递归算法来计算无线网络的一些重要性能指标,如吞吐量、信道占用、队列中的平均分组数和服务时间。该模型包括分组排队、信道访问争用、回退和混合自动重传请求(HARQ)错误控制。利用半马尔可夫过程和更新理论,递归地进行分析以降低计算复杂度。我们提出的结果表明,即使对于具有许多节点的网络,所提出的模型也能够准确地预测上述指标,而传统的分析需要不可思议的复杂性来考虑整体网络状态。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Recursive analysis of ad hoc networks with packet queueing, channel contention and hybrid ARQ
In this paper we present a recursive algorithm to compute some important performance metrics for wireless networks, such as throughput, channel occupancy, average number of packets in the queue and service time. Our model comprises packet queuing, channel access contention, backoff and hybrid automatic retransmission request (HARQ) error control. The analysis is carried out recursively to reduce the computational complexity and makes use of semi-Markov processes and renewal theory. We present results showing that the proposed model is able to accurately predict the aforementioned metrics even for networks with many nodes, where traditional analysis requires infeasible complexity to account for the overall network status.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信