{"title":"An Energy-Optimum and Communication-Time Efficient Protocol for Allocation, Scheduling and Routing in Wireless Networks","authors":"Thiago F. Neves, Marcos F. Caetano, J. Bordim","doi":"10.1109/IPDPSW.2012.104","DOIUrl":null,"url":null,"abstract":"The growing demand for mobile wireless access has stimulated the emergence of new communication technologies. Opportunistic Spectrum Access (OSA) is viewed as a promising alternative to overcome the problems caused by static spectrum assignment. Opportunistic access allows dynamic mapping of the transmission needs and communication opportunities. However, performing this task efficiently is not trivial. Indeed, it has been shown to be NP-complete. In this context, this paper presents an efficient heuristic for solving the problem of channel allocation and routing, according to the opportunities and channels available. The proposed heuristic is optimal in terms of energy consumption, being close to the optimum, about 5% above, in terms of transmission time.","PeriodicalId":378335,"journal":{"name":"2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPSW.2012.104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
The growing demand for mobile wireless access has stimulated the emergence of new communication technologies. Opportunistic Spectrum Access (OSA) is viewed as a promising alternative to overcome the problems caused by static spectrum assignment. Opportunistic access allows dynamic mapping of the transmission needs and communication opportunities. However, performing this task efficiently is not trivial. Indeed, it has been shown to be NP-complete. In this context, this paper presents an efficient heuristic for solving the problem of channel allocation and routing, according to the opportunities and channels available. The proposed heuristic is optimal in terms of energy consumption, being close to the optimum, about 5% above, in terms of transmission time.