{"title":"Universal routing in multi hop radio network","authors":"Bogdan S. Chlebus, V. Cholvi, D. Kowalski","doi":"10.1145/2634274.2634278","DOIUrl":null,"url":null,"abstract":"We study dynamic routing in multi-hop radio networks in a specialized framework of adversarial queuing. We consider cross-layer interactions of the following three components of routing protocols: transmission policies for medium-access control, scheduling policies on the network layer, and hearing-control mechanisms through which transmissions interact with a scheduler.\n We propose a model of adversarial queuing in radio networks in which transmission policies are delegated to oracles and adversaries control packet injection. For such a setting, we propose a definition of universal stability that takes into account not only how packets are injected, as in the wireline adversarial model, but also how transmission policies behave.\n We investigate which scheduling policies are universally stable, depending on hearing control, and settle this question for many popular scheduling policies.","PeriodicalId":270463,"journal":{"name":"International Workshop on Foundations of Mobile Computing","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Foundations of Mobile Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2634274.2634278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
We study dynamic routing in multi-hop radio networks in a specialized framework of adversarial queuing. We consider cross-layer interactions of the following three components of routing protocols: transmission policies for medium-access control, scheduling policies on the network layer, and hearing-control mechanisms through which transmissions interact with a scheduler.
We propose a model of adversarial queuing in radio networks in which transmission policies are delegated to oracles and adversaries control packet injection. For such a setting, we propose a definition of universal stability that takes into account not only how packets are injected, as in the wireline adversarial model, but also how transmission policies behave.
We investigate which scheduling policies are universally stable, depending on hearing control, and settle this question for many popular scheduling policies.