{"title":"基于令牌的链拓扑网状网络分布式调度","authors":"T. Hou, Chien-Yi Wang, M. Chan","doi":"10.1109/AINA.2006.61","DOIUrl":null,"url":null,"abstract":"The IEEE 802.11 DCF protocol used in multihop networks with chain topologies does not provide fair throughput to each node due to the hidden/exposed terminal problem and edge node effect. Eliminating the contention from hidden nodes is the key to providing high performance in the mesh network. We propose a token-based distributed scheduling scheme that not only guarantees throughput fairness among nodes but also allows allocation of proportional throughput among nodes.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A token-based distributed scheduling for mesh networks with chain topologies\",\"authors\":\"T. Hou, Chien-Yi Wang, M. Chan\",\"doi\":\"10.1109/AINA.2006.61\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The IEEE 802.11 DCF protocol used in multihop networks with chain topologies does not provide fair throughput to each node due to the hidden/exposed terminal problem and edge node effect. Eliminating the contention from hidden nodes is the key to providing high performance in the mesh network. We propose a token-based distributed scheduling scheme that not only guarantees throughput fairness among nodes but also allows allocation of proportional throughput among nodes.\",\"PeriodicalId\":185969,\"journal\":{\"name\":\"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2006.61\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2006.61","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A token-based distributed scheduling for mesh networks with chain topologies
The IEEE 802.11 DCF protocol used in multihop networks with chain topologies does not provide fair throughput to each node due to the hidden/exposed terminal problem and edge node effect. Eliminating the contention from hidden nodes is the key to providing high performance in the mesh network. We propose a token-based distributed scheduling scheme that not only guarantees throughput fairness among nodes but also allows allocation of proportional throughput among nodes.