Topology Adaptive Sum Rate Maximization in the Downlink of Dynamic Wireless Networks. Sugathapala, I., Hanif, M., F., Lorenzo, B., Glisic, S., Juntti, M., & Tran, L., N. *IEEE Transactions on Communications*, 66(8):3501-3516, 2018.

Paper abstract bibtex

Paper abstract bibtex

IEEE Dynamic network architectures (DNAs) have been developed under the assumption that some terminals can be converted into temporary access points (APs) anytime when connected to the Internet. In this paper, we consider the problem of assigning a group of users to a set of potential APs with the aim to maximize the downlink system throughput of DNA networks, subject to total transmit power and users & #x2019; quality of service (QoS) constraints. In our first method, we relax the integer optimization variables to be continuous. The resulting non-convex continuous optimization problem is solved using successive convex approximation framework to arrive at a sequence of second-order cone programs (SOCPs). In the next method, the selection process is viewed as finding a sparsity constrained solution to our problem of sum rate maximization. It is demonstrated in numerical results that while the first approach has better data rates for dense networks, the sparsity oriented method has a superior speed of convergence. Moreover, for the scenarios considered, in addition to comprehensively outperforming some well-known approaches, our algorithms yield data rates close to those obtained by branch and bound method.

@article{ title = {Topology Adaptive Sum Rate Maximization in the Downlink of Dynamic Wireless Networks}, type = {article}, year = {2018}, identifiers = {[object Object]}, keywords = {DNA networks,SOCP,beamforming,branch and bound algorithm,convex optimization,exhaustive search,throughput maximization,user association}, pages = {3501-3516}, volume = {66}, id = {861a2cd4-2ae1-362c-b617-8032f08d189d}, created = {2018-03-29T15:06:49.397Z}, file_attached = {true}, profile_id = {ae3c3618-3f38-3a00-9bd1-a1c94416d536}, last_modified = {2019-09-22T11:57:28.814Z}, read = {false}, starred = {false}, authored = {true}, confirmed = {true}, hidden = {false}, citation_key = {Sugathapala2018}, private_publication = {false}, abstract = {IEEE Dynamic network architectures (DNAs) have been developed under the assumption that some terminals can be converted into temporary access points (APs) anytime when connected to the Internet. In this paper, we consider the problem of assigning a group of users to a set of potential APs with the aim to maximize the downlink system throughput of DNA networks, subject to total transmit power and users & #x2019; quality of service (QoS) constraints. In our first method, we relax the integer optimization variables to be continuous. The resulting non-convex continuous optimization problem is solved using successive convex approximation framework to arrive at a sequence of second-order cone programs (SOCPs). In the next method, the selection process is viewed as finding a sparsity constrained solution to our problem of sum rate maximization. It is demonstrated in numerical results that while the first approach has better data rates for dense networks, the sparsity oriented method has a superior speed of convergence. Moreover, for the scenarios considered, in addition to comprehensively outperforming some well-known approaches, our algorithms yield data rates close to those obtained by branch and bound method.}, bibtype = {article}, author = {Sugathapala, Inosha and Hanif, Muhammad Fainan and Lorenzo, Beatriz and Glisic, Savo and Juntti, Markku and Tran, Le Nam}, journal = {IEEE Transactions on Communications}, number = {8} }

Downloads: 0

{"_id":"kfNWzYKgNFbgXP6Ds","bibbaseid":"sugathapala-hanif-lorenzo-glisic-juntti-tran-topologyadaptivesumratemaximizationinthedownlinkofdynamicwirelessnetworks-2018","authorIDs":[],"author_short":["Sugathapala, I.","Hanif, M., F.","Lorenzo, B.","Glisic, S.","Juntti, M.","Tran, L., N."],"bibdata":{"title":"Topology Adaptive Sum Rate Maximization in the Downlink of Dynamic Wireless Networks","type":"article","year":"2018","identifiers":"[object Object]","keywords":"DNA networks,SOCP,beamforming,branch and bound algorithm,convex optimization,exhaustive search,throughput maximization,user association","pages":"3501-3516","volume":"66","id":"861a2cd4-2ae1-362c-b617-8032f08d189d","created":"2018-03-29T15:06:49.397Z","file_attached":"true","profile_id":"ae3c3618-3f38-3a00-9bd1-a1c94416d536","last_modified":"2019-09-22T11:57:28.814Z","read":false,"starred":false,"authored":"true","confirmed":"true","hidden":false,"citation_key":"Sugathapala2018","private_publication":false,"abstract":"IEEE Dynamic network architectures (DNAs) have been developed under the assumption that some terminals can be converted into temporary access points (APs) anytime when connected to the Internet. In this paper, we consider the problem of assigning a group of users to a set of potential APs with the aim to maximize the downlink system throughput of DNA networks, subject to total transmit power and users & #x2019; quality of service (QoS) constraints. In our first method, we relax the integer optimization variables to be continuous. The resulting non-convex continuous optimization problem is solved using successive convex approximation framework to arrive at a sequence of second-order cone programs (SOCPs). In the next method, the selection process is viewed as finding a sparsity constrained solution to our problem of sum rate maximization. It is demonstrated in numerical results that while the first approach has better data rates for dense networks, the sparsity oriented method has a superior speed of convergence. Moreover, for the scenarios considered, in addition to comprehensively outperforming some well-known approaches, our algorithms yield data rates close to those obtained by branch and bound method.","bibtype":"article","author":"Sugathapala, Inosha and Hanif, Muhammad Fainan and Lorenzo, Beatriz and Glisic, Savo and Juntti, Markku and Tran, Le Nam","journal":"IEEE Transactions on Communications","number":"8","bibtex":"@article{\n title = {Topology Adaptive Sum Rate Maximization in the Downlink of Dynamic Wireless Networks},\n type = {article},\n year = {2018},\n identifiers = {[object Object]},\n keywords = {DNA networks,SOCP,beamforming,branch and bound algorithm,convex optimization,exhaustive search,throughput maximization,user association},\n pages = {3501-3516},\n volume = {66},\n id = {861a2cd4-2ae1-362c-b617-8032f08d189d},\n created = {2018-03-29T15:06:49.397Z},\n file_attached = {true},\n profile_id = {ae3c3618-3f38-3a00-9bd1-a1c94416d536},\n last_modified = {2019-09-22T11:57:28.814Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Sugathapala2018},\n private_publication = {false},\n abstract = {IEEE Dynamic network architectures (DNAs) have been developed under the assumption that some terminals can be converted into temporary access points (APs) anytime when connected to the Internet. In this paper, we consider the problem of assigning a group of users to a set of potential APs with the aim to maximize the downlink system throughput of DNA networks, subject to total transmit power and users & #x2019; quality of service (QoS) constraints. In our first method, we relax the integer optimization variables to be continuous. The resulting non-convex continuous optimization problem is solved using successive convex approximation framework to arrive at a sequence of second-order cone programs (SOCPs). In the next method, the selection process is viewed as finding a sparsity constrained solution to our problem of sum rate maximization. It is demonstrated in numerical results that while the first approach has better data rates for dense networks, the sparsity oriented method has a superior speed of convergence. Moreover, for the scenarios considered, in addition to comprehensively outperforming some well-known approaches, our algorithms yield data rates close to those obtained by branch and bound method.},\n bibtype = {article},\n author = {Sugathapala, Inosha and Hanif, Muhammad Fainan and Lorenzo, Beatriz and Glisic, Savo and Juntti, Markku and Tran, Le Nam},\n journal = {IEEE Transactions on Communications},\n number = {8}\n}","author_short":["Sugathapala, I.","Hanif, M., F.","Lorenzo, B.","Glisic, S.","Juntti, M.","Tran, L., N."],"urls":{"Paper":"https://bibbase.org/service/mendeley/ae3c3618-3f38-3a00-9bd1-a1c94416d536/file/11a95cf0-e642-94e1-52f2-d8482f368aee/Inosha_2018_TCOM.pdf.pdf"},"bibbaseid":"sugathapala-hanif-lorenzo-glisic-juntti-tran-topologyadaptivesumratemaximizationinthedownlinkofdynamicwirelessnetworks-2018","role":"author","keyword":["DNA networks","SOCP","beamforming","branch and bound algorithm","convex optimization","exhaustive search","throughput maximization","user association"],"downloads":0},"bibtype":"article","creationDate":"2019-09-22T12:10:03.428Z","downloads":0,"keywords":["dna networks","socp","beamforming","branch and bound algorithm","convex optimization","exhaustive search","throughput maximization","user association"],"search_terms":["topology","adaptive","sum","rate","maximization","downlink","dynamic","wireless","networks","sugathapala","hanif","lorenzo","glisic","juntti","tran"],"title":"Topology Adaptive Sum Rate Maximization in the Downlink of Dynamic Wireless Networks","year":2018}