具有“空间aloha”协议的一维蜂窝网络

S. P. Fedortsov, J. Linnartz
{"title":"具有“空间aloha”协议的一维蜂窝网络","authors":"S. P. Fedortsov, J. Linnartz","doi":"10.1109/PIMRC.1995.480994","DOIUrl":null,"url":null,"abstract":"We address the transmission of data packets from base stations to mobile terminals in a one-dimensional cellular network. The probability that a data packet successfully arrives at the destined mobile terminal highly depends on the activity of nearby co-channel base stations. Motivated by favorable results from earlier studies we consider a network in which all base stations use the same radio channel. Packets lost because of mutual interference are retransmitted with a random backoff mechanism. Recursive arguments are applied for the calculation of the mean time necessary for a base station to deliver the packet, provided that in an initial state all stations have packets to transmit. The average delivery time, maximized over all base station locations, is also analyzed. The relations obtained give some further insight into the behavior of a (highway) cellular data network.","PeriodicalId":433500,"journal":{"name":"Proceedings of 6th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"One dimensional cellular network with \\\"spatial-ALOHA\\\" protocol\",\"authors\":\"S. P. Fedortsov, J. Linnartz\",\"doi\":\"10.1109/PIMRC.1995.480994\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address the transmission of data packets from base stations to mobile terminals in a one-dimensional cellular network. The probability that a data packet successfully arrives at the destined mobile terminal highly depends on the activity of nearby co-channel base stations. Motivated by favorable results from earlier studies we consider a network in which all base stations use the same radio channel. Packets lost because of mutual interference are retransmitted with a random backoff mechanism. Recursive arguments are applied for the calculation of the mean time necessary for a base station to deliver the packet, provided that in an initial state all stations have packets to transmit. The average delivery time, maximized over all base station locations, is also analyzed. The relations obtained give some further insight into the behavior of a (highway) cellular data network.\",\"PeriodicalId\":433500,\"journal\":{\"name\":\"Proceedings of 6th International Symposium on Personal, Indoor and Mobile Radio Communications\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 6th International Symposium on Personal, Indoor and Mobile Radio Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.1995.480994\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 6th International Symposium on Personal, Indoor and Mobile Radio Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.1995.480994","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们在一维蜂窝网络中处理从基站到移动终端的数据包传输。数据包成功到达目标移动终端的概率在很大程度上取决于附近同信道基站的活动情况。基于早期研究的有利结果,我们考虑了一个所有基站使用同一无线电频道的网络。由于相互干扰而丢失的数据包通过随机回退机制重传。如果在初始状态下所有基站都有要传输的数据包,则应用递归参数来计算基站传送数据包所需的平均时间。还分析了在所有基站位置上最大的平均交付时间。所得到的关系使我们对高速公路蜂窝数据网络的行为有了更深入的了解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
One dimensional cellular network with "spatial-ALOHA" protocol
We address the transmission of data packets from base stations to mobile terminals in a one-dimensional cellular network. The probability that a data packet successfully arrives at the destined mobile terminal highly depends on the activity of nearby co-channel base stations. Motivated by favorable results from earlier studies we consider a network in which all base stations use the same radio channel. Packets lost because of mutual interference are retransmitted with a random backoff mechanism. Recursive arguments are applied for the calculation of the mean time necessary for a base station to deliver the packet, provided that in an initial state all stations have packets to transmit. The average delivery time, maximized over all base station locations, is also analyzed. The relations obtained give some further insight into the behavior of a (highway) cellular data network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信