多通道网格网络的容量限制

2014 Wireless Telecommunications Symposium Pub Date : 2014-04-09 DOI:10.1109/WTS.2014.6835032

Amalya Mihnea, M. Cardei

{"title":"多通道网格网络的容量限制","authors":"Amalya Mihnea, M. Cardei","doi":"10.1109/WTS.2014.6835032","DOIUrl":null,"url":null,"abstract":"We give lower and upper bounds for capacity in grid networks when using one channel and one radio per node. We also analyze the capacity for multiple channels and make connections to channel assignment algorithms that we introduced previously, which are robust to the presence of primary users. These algorithms could be used in wireless networks or networks with limited resources.","PeriodicalId":199195,"journal":{"name":"2014 Wireless Telecommunications Symposium","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Bounds on capacity in multi-channel grid networks\",\"authors\":\"Amalya Mihnea, M. Cardei\",\"doi\":\"10.1109/WTS.2014.6835032\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give lower and upper bounds for capacity in grid networks when using one channel and one radio per node. We also analyze the capacity for multiple channels and make connections to channel assignment algorithms that we introduced previously, which are robust to the presence of primary users. These algorithms could be used in wireless networks or networks with limited resources.\",\"PeriodicalId\":199195,\"journal\":{\"name\":\"2014 Wireless Telecommunications Symposium\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Wireless Telecommunications Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WTS.2014.6835032\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Wireless Telecommunications Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WTS.2014.6835032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

给出了每个节点使用一个信道和一个无线电时网格网络容量的下界和上界。我们还分析了多个信道的容量，并与我们之前介绍的信道分配算法建立了联系，这些算法对主用户的存在具有鲁棒性。这些算法可用于无线网络或资源有限的网络。

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

查看原文本刊更多论文

Bounds on capacity in multi-channel grid networks

We give lower and upper bounds for capacity in grid networks when using one channel and one radio per node. We also analyze the capacity for multiple channels and make connections to channel assignment algorithms that we introduced previously, which are robust to the presence of primary users. These algorithms could be used in wireless networks or networks with limited resources.

求助全文

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

来源期刊

2014 Wireless Telecommunications Symposium

自引率

0.00%

发文量