{"title":"认知无线网络中的联合频谱共享与公平路由","authors":"M. Ma, D. Tsang","doi":"10.1109/CCNC08.2007.225","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a cross-layer optimization framework to jointly design the spectrum sharing and flow routing with the interference considerations in cognitive radio networks. Given multiple traffic demands from different source nodes to destination nodes, we formulate an optimization problem in the form of mixed integer linear programming (MILP) to provide a fair routing. Different from the existing work, we consider bi-directional links because we believe the link level acknowledgements in an ad-hoc network are a must. For traffic routing we allow multi-path for each traffic demand. Numerical results show that the spectrum sharing among the secondary users is interference-free and a fair routing is guaranteed for different traffic demands.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":"{\"title\":\"Joint Spectrum Sharing and Fair Routing in Cognitive Radio Networks\",\"authors\":\"M. Ma, D. Tsang\",\"doi\":\"10.1109/CCNC08.2007.225\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a cross-layer optimization framework to jointly design the spectrum sharing and flow routing with the interference considerations in cognitive radio networks. Given multiple traffic demands from different source nodes to destination nodes, we formulate an optimization problem in the form of mixed integer linear programming (MILP) to provide a fair routing. Different from the existing work, we consider bi-directional links because we believe the link level acknowledgements in an ad-hoc network are a must. For traffic routing we allow multi-path for each traffic demand. Numerical results show that the spectrum sharing among the secondary users is interference-free and a fair routing is guaranteed for different traffic demands.\",\"PeriodicalId\":183858,\"journal\":{\"name\":\"2008 5th IEEE Consumer Communications and Networking Conference\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"44\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 5th IEEE Consumer Communications and Networking Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCNC08.2007.225\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 5th IEEE Consumer Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC08.2007.225","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Joint Spectrum Sharing and Fair Routing in Cognitive Radio Networks
In this paper, we propose a cross-layer optimization framework to jointly design the spectrum sharing and flow routing with the interference considerations in cognitive radio networks. Given multiple traffic demands from different source nodes to destination nodes, we formulate an optimization problem in the form of mixed integer linear programming (MILP) to provide a fair routing. Different from the existing work, we consider bi-directional links because we believe the link level acknowledgements in an ad-hoc network are a must. For traffic routing we allow multi-path for each traffic demand. Numerical results show that the spectrum sharing among the secondary users is interference-free and a fair routing is guaranteed for different traffic demands.