Michael A Malcolm, Lawrence D Rogers, John E Spracklen
{"title":"一种适用于本地无线网络的确认争用算法","authors":"Michael A Malcolm, Lawrence D Rogers, 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, Lawrence D Rogers, 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}
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.