在多跳无线网络中实现公平性和吞吐量最优的一种基于积压的CSMA机制

2008 46th Annual Allerton Conference on Communication, Control, and Computing Pub Date : 2008-09-01 DOI:10.1109/ALLERTON.2008.4797635

P. Marbach, A. Eryilmaz

{"title":"在多跳无线网络中实现公平性和吞吐量最优的一种基于积压的CSMA机制","authors":"P. Marbach, A. Eryilmaz","doi":"10.1109/ALLERTON.2008.4797635","DOIUrl":null,"url":null,"abstract":"We propose and analyze a distributed backlog-based CSMA policy to achieve fairness and throughput-optimality in wireless multihop networks. The analysis is based on a CSMA fixed point approximation that is accurate for large networks with many small flows and a small sensing period.","PeriodicalId":120561,"journal":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","volume":"341 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"A backlog-based CSMA mechanism to achieve fairness and throughput-optimality in multihop wireless networks\",\"authors\":\"P. Marbach, A. Eryilmaz\",\"doi\":\"10.1109/ALLERTON.2008.4797635\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose and analyze a distributed backlog-based CSMA policy to achieve fairness and throughput-optimality in wireless multihop networks. The analysis is based on a CSMA fixed point approximation that is accurate for large networks with many small flows and a small sensing period.\",\"PeriodicalId\":120561,\"journal\":{\"name\":\"2008 46th Annual Allerton Conference on Communication, Control, and Computing\",\"volume\":\"341 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 46th Annual Allerton Conference on Communication, Control, and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2008.4797635\",\"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 46th Annual Allerton Conference on Communication, Control, and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2008.4797635","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 45

摘要

为了在无线多跳网络中实现公平性和吞吐量最优性，我们提出并分析了一种基于分布式积压的CSMA策略。分析基于CSMA不动点近似，该近似对于具有许多小流量和小感知周期的大网络是准确的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A backlog-based CSMA mechanism to achieve fairness and throughput-optimality in multihop wireless networks

We propose and analyze a distributed backlog-based CSMA policy to achieve fairness and throughput-optimality in wireless multihop networks. The analysis is based on a CSMA fixed point approximation that is accurate for large networks with many small flows and a small sensing period.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 46th Annual Allerton Conference on Communication, Control, and Computing

自引率

0.00%

发文量