{"title":"Flow-fair Intra-Piconet (FℓIP) scheduling for communications in personal area networks","authors":"S. Basagni, Maurizio A. Nanni, C. Petrioli","doi":"10.1109/RWS.2008.4463623","DOIUrl":null,"url":null,"abstract":"As a building step of designing integrated solution for forming multi-hop personal area networks (PANs) of Bluetooth devices, in this paper we introduce a new intra-piconet scheduling protocol that defines the interaction among masters and slaves with an eye to the flows passing through their piconets. Differently from previous intra- piconet solutions, such as pure round robin, its E-limited variation, and the more recent credit scheme, fairness and traffic adaptivity is now achieved on a per-flow basis. Our flow-fair intra-piconet (F^IP) scheduling identifies the flows passing through each piconet slave. Based on this information the master can efficiently manage intra-piconet resources. FlIP is compared with the three leading solutions for intra-piconet scheduling mentioned. Through ns2-based simulations we show that FlIP is effective in decreasing both packet drop rate as well as end-to-end packet latency.","PeriodicalId":431471,"journal":{"name":"2008 IEEE Radio and Wireless Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE Radio and Wireless Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RWS.2008.4463623","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
As a building step of designing integrated solution for forming multi-hop personal area networks (PANs) of Bluetooth devices, in this paper we introduce a new intra-piconet scheduling protocol that defines the interaction among masters and slaves with an eye to the flows passing through their piconets. Differently from previous intra- piconet solutions, such as pure round robin, its E-limited variation, and the more recent credit scheme, fairness and traffic adaptivity is now achieved on a per-flow basis. Our flow-fair intra-piconet (F^IP) scheduling identifies the flows passing through each piconet slave. Based on this information the master can efficiently manage intra-piconet resources. FlIP is compared with the three leading solutions for intra-piconet scheduling mentioned. Through ns2-based simulations we show that FlIP is effective in decreasing both packet drop rate as well as end-to-end packet latency.