{"title":"Cross-layer scheduling and routing for unstructured and quasi-structured wireless networks","authors":"J. Thomas","doi":"10.1109/MILCOM.2005.1605904","DOIUrl":null,"url":null,"abstract":"Novel and conceptually simple scheduling and routing algorithms are proposed for unstructured (ad hoc) networks. These algorithms are based on an intelligent interference and power management paradigm that borrows notions from successive decoding and cancellation and transmission power control in order to exploit and thereby (or otherwise) suppress interference (thus departing from the \"collision-avoidance\" objective and its attendant burdens of eliminating hidden nodes) while supporting differential services based on preassigned traffic priorities. The application of the proposed algorithms to quasi-structured networks - where certain nodes may possess additional capabilities and thus alleviate any processing overheads - is also considered","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 2005 - 2005 IEEE Military Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2005.1605904","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
Novel and conceptually simple scheduling and routing algorithms are proposed for unstructured (ad hoc) networks. These algorithms are based on an intelligent interference and power management paradigm that borrows notions from successive decoding and cancellation and transmission power control in order to exploit and thereby (or otherwise) suppress interference (thus departing from the "collision-avoidance" objective and its attendant burdens of eliminating hidden nodes) while supporting differential services based on preassigned traffic priorities. The application of the proposed algorithms to quasi-structured networks - where certain nodes may possess additional capabilities and thus alleviate any processing overheads - is also considered