{"title":"随机接入无线多跳网络的优化","authors":"M. Mardani, Seung-Jun Kim, G. Giannakis","doi":"10.1109/SPAWC.2011.5990464","DOIUrl":null,"url":null,"abstract":"Cross-layer design of medium access, routing and congestion control is considered for multi-hop wireless ad hoc networks with random access. A network utility maximization frame-work is adopted to jointly optimize link persistence probabilities, per-link flow rates, and end-to-end throughput. The optimization problem with flow conservation and probabilistic random access constraints is inherently non-convex. A series of convex surrogate problems is thus formulated using a successive convex approximation technique. A distributed algorithm is then developed based on the dual method, which is convergent to a (locally) optimal solution. To much practical appeal, solutions to the subproblems corresponding to different layers of the protocol stack, are obtained at each node with very low computational complexity. Numerical tests verify the proposed novel design.","PeriodicalId":102244,"journal":{"name":"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimization of wireless multi-hop networks with random access\",\"authors\":\"M. Mardani, Seung-Jun Kim, G. Giannakis\",\"doi\":\"10.1109/SPAWC.2011.5990464\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cross-layer design of medium access, routing and congestion control is considered for multi-hop wireless ad hoc networks with random access. A network utility maximization frame-work is adopted to jointly optimize link persistence probabilities, per-link flow rates, and end-to-end throughput. The optimization problem with flow conservation and probabilistic random access constraints is inherently non-convex. A series of convex surrogate problems is thus formulated using a successive convex approximation technique. A distributed algorithm is then developed based on the dual method, which is convergent to a (locally) optimal solution. To much practical appeal, solutions to the subproblems corresponding to different layers of the protocol stack, are obtained at each node with very low computational complexity. Numerical tests verify the proposed novel design.\",\"PeriodicalId\":102244,\"journal\":{\"name\":\"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAWC.2011.5990464\",\"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 12th International Workshop on Signal Processing Advances in Wireless Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2011.5990464","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimization of wireless multi-hop networks with random access
Cross-layer design of medium access, routing and congestion control is considered for multi-hop wireless ad hoc networks with random access. A network utility maximization frame-work is adopted to jointly optimize link persistence probabilities, per-link flow rates, and end-to-end throughput. The optimization problem with flow conservation and probabilistic random access constraints is inherently non-convex. A series of convex surrogate problems is thus formulated using a successive convex approximation technique. A distributed algorithm is then developed based on the dual method, which is convergent to a (locally) optimal solution. To much practical appeal, solutions to the subproblems corresponding to different layers of the protocol stack, are obtained at each node with very low computational complexity. Numerical tests verify the proposed novel design.