{"title":"多跳无线网络中的最小能量和最大容量路径","authors":"D. Quintas, V. Friderikos","doi":"10.1109/GreenCom.2011.6082503","DOIUrl":null,"url":null,"abstract":"Multi hop cellular networks have the potential of higher capacity and less energy consumption than their traditional single hop counterparts. However, to achieve meaningful performance gains, effective routing strategies are needed. From the perspective that both maximum throughput capacity and minimum energy consumption are equally desirable objectives, we develop efficient polynomial time algorithms to construct maximum capacity paths, minimum energy paths and maximum capacity paths with minimum energy or vice-versa.","PeriodicalId":179862,"journal":{"name":"2011 IEEE Online Conference on Green Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Minimum energy and maximum capacity paths in multi hop wireless networks\",\"authors\":\"D. Quintas, V. Friderikos\",\"doi\":\"10.1109/GreenCom.2011.6082503\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multi hop cellular networks have the potential of higher capacity and less energy consumption than their traditional single hop counterparts. However, to achieve meaningful performance gains, effective routing strategies are needed. From the perspective that both maximum throughput capacity and minimum energy consumption are equally desirable objectives, we develop efficient polynomial time algorithms to construct maximum capacity paths, minimum energy paths and maximum capacity paths with minimum energy or vice-versa.\",\"PeriodicalId\":179862,\"journal\":{\"name\":\"2011 IEEE Online Conference on Green Communications\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Online Conference on Green Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GreenCom.2011.6082503\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Online Conference on Green Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GreenCom.2011.6082503","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Minimum energy and maximum capacity paths in multi hop wireless networks
Multi hop cellular networks have the potential of higher capacity and less energy consumption than their traditional single hop counterparts. However, to achieve meaningful performance gains, effective routing strategies are needed. From the perspective that both maximum throughput capacity and minimum energy consumption are equally desirable objectives, we develop efficient polynomial time algorithms to construct maximum capacity paths, minimum energy paths and maximum capacity paths with minimum energy or vice-versa.