{"title":"多跳无线网络分布式广播调度协议的评估","authors":"Xiaopeng Ma, E. Lloyd","doi":"10.1109/MILCOM.2001.985989","DOIUrl":null,"url":null,"abstract":"In Ma and Lloyd (1998) we introduced a fully distributed algorithm (FDAS) for broadcast scheduling in multihop packet radio networks. In this paper we analyze the performance of that algorithm relative to non distributed broadcast scheduling algorithms and to a random access method. Both analytical and simulation results are presented. These analyses establish that FDAS has superior throughput and medium access delay performance at both the node and system levels.","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Evaluation of a distributed broadcast scheduling protocol for multihop radio networks\",\"authors\":\"Xiaopeng Ma, E. Lloyd\",\"doi\":\"10.1109/MILCOM.2001.985989\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Ma and Lloyd (1998) we introduced a fully distributed algorithm (FDAS) for broadcast scheduling in multihop packet radio networks. In this paper we analyze the performance of that algorithm relative to non distributed broadcast scheduling algorithms and to a random access method. Both analytical and simulation results are presented. These analyses establish that FDAS has superior throughput and medium access delay performance at both the node and system levels.\",\"PeriodicalId\":136537,\"journal\":{\"name\":\"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.2001.985989\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2001.985989","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Evaluation of a distributed broadcast scheduling protocol for multihop radio networks
In Ma and Lloyd (1998) we introduced a fully distributed algorithm (FDAS) for broadcast scheduling in multihop packet radio networks. In this paper we analyze the performance of that algorithm relative to non distributed broadcast scheduling algorithms and to a random access method. Both analytical and simulation results are presented. These analyses establish that FDAS has superior throughput and medium access delay performance at both the node and system levels.