{"title":"New adaptive protocols for fine-level end-to-end rate control in wireless networks","authors":"Ying Jian, Shigang Chen, L. Zhang, Yuguang Fang","doi":"10.1109/ICNP.2008.4697021","DOIUrl":null,"url":null,"abstract":"Fine-level rate control, particularly meeting rate requirements and differentiating various types of end-to-end traffic, remains an open problem for multihop wireless networks. Traditionally, rate assurance in wired networks is achieved through resource reservation and admission control, which can be efficiently implemented since the bandwidth capacity of each communication link is known and the sender of a link has the information of all flows that compete for the bandwidth of the link. In a wireless network, however, the capacity of each wireless link can change unpredictably over time due to contention from nearby links and dynamic channel conditions. An end-to-end flow consumes available bandwidth not only at links on its route but also at all nearby contending links, which makes resource reservation extremely complicated. We believe fundamental differences require a fundamentally different paradigm shift in solutions. Is there a simpler alternative to resource reservation and admission control that is better suited for wireless network dynamics? In this paper, we propose a new adaptive rate control function based on two novel protocols, called dynamic weight adaptation with floor and ceiling and proportional packet scheduling, which together implement prioritized rate assurance and sophisticated bandwidth differentiation among all end-to-end flows in a multihop wireless network without resource reservation and admission control. The adaptive function achieves global rate control objectives in a fully distributed way using only localized operations.","PeriodicalId":301984,"journal":{"name":"2008 IEEE International Conference on Network Protocols","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Conference on Network Protocols","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNP.2008.4697021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
Fine-level rate control, particularly meeting rate requirements and differentiating various types of end-to-end traffic, remains an open problem for multihop wireless networks. Traditionally, rate assurance in wired networks is achieved through resource reservation and admission control, which can be efficiently implemented since the bandwidth capacity of each communication link is known and the sender of a link has the information of all flows that compete for the bandwidth of the link. In a wireless network, however, the capacity of each wireless link can change unpredictably over time due to contention from nearby links and dynamic channel conditions. An end-to-end flow consumes available bandwidth not only at links on its route but also at all nearby contending links, which makes resource reservation extremely complicated. We believe fundamental differences require a fundamentally different paradigm shift in solutions. Is there a simpler alternative to resource reservation and admission control that is better suited for wireless network dynamics? In this paper, we propose a new adaptive rate control function based on two novel protocols, called dynamic weight adaptation with floor and ceiling and proportional packet scheduling, which together implement prioritized rate assurance and sophisticated bandwidth differentiation among all end-to-end flows in a multihop wireless network without resource reservation and admission control. The adaptive function achieves global rate control objectives in a fully distributed way using only localized operations.