一种适用于本地无线网络的确认争用算法

Michael A Malcolm, Lawrence D Rogers, John E Spracklen
{"title":"一种适用于本地无线网络的确认争用算法","authors":"Michael A Malcolm,&nbsp;Lawrence D Rogers,&nbsp;John E Spracklen","doi":"10.1016/0376-5075(83)90002-8","DOIUrl":null,"url":null,"abstract":"<div><p>We present a contention transmission algorithm for local networks which is related to the p-persistent family of algorithms previously analyzed by Kleinrock and Tobagi. Our algorithm incorporates an automatic acknowledgement signal which is sent by the receiving station immediately after each packet is correctly received. The algorithm is suitable for radio environments in which transmitting stations can “capture” nearby receivers. Assuming that stations are not placed too close each other, we prove that an acknowledgement signal is received by a transmitting station only if the packet has been received correctly by the intended receiver. In a cable network where transmitters do not capture receivers, the acknowledgement signal is guaranteed (in the same sense) regardless of the distances between stations. This result depends on very weak assumptions about the type of data encoding used on the channel. We discuss the more interesting aspects of implementing this scheme, and we outline how higher-level protocols can make use of the acknowledgement signal and its properties.</p></div>","PeriodicalId":100316,"journal":{"name":"Computer Networks (1976)","volume":"7 1","pages":"Pages 1-8"},"PeriodicalIF":0.0000,"publicationDate":"1983-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0376-5075(83)90002-8","citationCount":"0","resultStr":"{\"title\":\"An acknowledging contention algorithm suitable for local radio networks\",\"authors\":\"Michael A Malcolm,&nbsp;Lawrence D Rogers,&nbsp;John E Spracklen\",\"doi\":\"10.1016/0376-5075(83)90002-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We present a contention transmission algorithm for local networks which is related to the p-persistent family of algorithms previously analyzed by Kleinrock and Tobagi. Our algorithm incorporates an automatic acknowledgement signal which is sent by the receiving station immediately after each packet is correctly received. The algorithm is suitable for radio environments in which transmitting stations can “capture” nearby receivers. Assuming that stations are not placed too close each other, we prove that an acknowledgement signal is received by a transmitting station only if the packet has been received correctly by the intended receiver. In a cable network where transmitters do not capture receivers, the acknowledgement signal is guaranteed (in the same sense) regardless of the distances between stations. This result depends on very weak assumptions about the type of data encoding used on the channel. We discuss the more interesting aspects of implementing this scheme, and we outline how higher-level protocols can make use of the acknowledgement signal and its properties.</p></div>\",\"PeriodicalId\":100316,\"journal\":{\"name\":\"Computer Networks (1976)\",\"volume\":\"7 1\",\"pages\":\"Pages 1-8\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1983-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0376-5075(83)90002-8\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks (1976)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0376507583900028\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks (1976)","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0376507583900028","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种局部网络的争用传输算法,该算法与Kleinrock和Tobagi先前分析的p-persistent算法族有关。我们的算法包含一个自动确认信号,该信号在每个数据包被正确接收后立即由接收站发送。该算法适用于发射站可以“捕获”附近接收器的无线电环境。假设站之间的距离不太近,我们证明只有当数据包被预期的接收者正确接收时,发送站才会接收到确认信号。在发射机不捕获接收机的有线网络中,无论站与站之间的距离如何,确认信号都得到保证(在同样的意义上)。这个结果依赖于关于信道上使用的数据编码类型的非常弱的假设。我们讨论了实现该方案的更有趣的方面,并概述了高级协议如何利用确认信号及其属性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An acknowledging contention algorithm suitable for local radio networks

We present a contention transmission algorithm for local networks which is related to the p-persistent family of algorithms previously analyzed by Kleinrock and Tobagi. Our algorithm incorporates an automatic acknowledgement signal which is sent by the receiving station immediately after each packet is correctly received. The algorithm is suitable for radio environments in which transmitting stations can “capture” nearby receivers. Assuming that stations are not placed too close each other, we prove that an acknowledgement signal is received by a transmitting station only if the packet has been received correctly by the intended receiver. In a cable network where transmitters do not capture receivers, the acknowledgement signal is guaranteed (in the same sense) regardless of the distances between stations. This result depends on very weak assumptions about the type of data encoding used on the channel. We discuss the more interesting aspects of implementing this scheme, and we outline how higher-level protocols can make use of the acknowledgement signal and its properties.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Editorial Calendar Concise report on the “first african conference on computer communications” — Africom 84 Sorting a distributed file in a network Protection and resource control in distributed operating systems
×
引用
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