@inProceedings{
 title = {Joint optimization of power consumption and load balancing in wireless dynamic network architecture},
 type = {inProceedings},
 year = {2017},
 identifiers = {[object Object]},
 keywords = {AP and power consumption minimization,Convex optimization,Downlink beamforming,Load balancing,SOCP,User association},
 pages = {121-125},
 id = {0437c144-2c8a-3e3d-aa21-b81cdc165a8a},
 created = {2017-08-10T13:58:20.843Z},
 file_attached = {false},
 profile_id = {ae3c3618-3f38-3a00-9bd1-a1c94416d536},
 last_modified = {2019-09-22T11:57:28.810Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {Sugathapala2017},
 private_publication = {false},
 abstract = {© 2017 IEEE. The concept of the wireless dynamic network architecture (DNA) stands for a system design, which allows terminals to convert into temporary access points (APs) when necessary. In this paper, we propose a framework to solve the problem of load balancing in DNA. Particularly, the user association in DNAs is optimized to minimize the number of active APs and the network cost in terms of tradeoff between power and load, while ensuring users' quality of service (QoS). In general, such a problem is a non-convex mixed integer nonlinear program in the sense that its continuous relaxation is a non-convex problem. To solve this optimization, we use the standard continuous relaxation method and approximate the relaxed problem by a series of second order cone programs with the aid of successive convex approximation (SCA) framework. Numerical results show that the proposed algorithm converges within a few iterations and jointly minimizes the network cost and the number of APs in the network.},
 bibtype = {inProceedings},
 author = {Sugathapala, Inosha and Glisic, Savo and Juntti, Markku and Tran, Le Nam},
 booktitle = {2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017}
}

{"_id":"EHhPBXZKdHvCgJiv9","bibbaseid":"sugathapala-glisic-juntti-tran-jointoptimizationofpowerconsumptionandloadbalancinginwirelessdynamicnetworkarchitecture-2017","authorIDs":[],"author_short":["Sugathapala, I.","Glisic, S.","Juntti, M.","Tran, L., N."],"bibdata":{"title":"Joint optimization of power consumption and load balancing in wireless dynamic network architecture","type":"inProceedings","year":"2017","identifiers":"[object Object]","keywords":"AP and power consumption minimization,Convex optimization,Downlink beamforming,Load balancing,SOCP,User association","pages":"121-125","id":"0437c144-2c8a-3e3d-aa21-b81cdc165a8a","created":"2017-08-10T13:58:20.843Z","file_attached":false,"profile_id":"ae3c3618-3f38-3a00-9bd1-a1c94416d536","last_modified":"2019-09-22T11:57:28.810Z","read":false,"starred":false,"authored":"true","confirmed":"true","hidden":false,"citation_key":"Sugathapala2017","private_publication":false,"abstract":"© 2017 IEEE. The concept of the wireless dynamic network architecture (DNA) stands for a system design, which allows terminals to convert into temporary access points (APs) when necessary. In this paper, we propose a framework to solve the problem of load balancing in DNA. Particularly, the user association in DNAs is optimized to minimize the number of active APs and the network cost in terms of tradeoff between power and load, while ensuring users' quality of service (QoS). In general, such a problem is a non-convex mixed integer nonlinear program in the sense that its continuous relaxation is a non-convex problem. To solve this optimization, we use the standard continuous relaxation method and approximate the relaxed problem by a series of second order cone programs with the aid of successive convex approximation (SCA) framework. Numerical results show that the proposed algorithm converges within a few iterations and jointly minimizes the network cost and the number of APs in the network.","bibtype":"inProceedings","author":"Sugathapala, Inosha and Glisic, Savo and Juntti, Markku and Tran, Le Nam","booktitle":"2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017","bibtex":"@inProceedings{\n title = {Joint optimization of power consumption and load balancing in wireless dynamic network architecture},\n type = {inProceedings},\n year = {2017},\n identifiers = {[object Object]},\n keywords = {AP and power consumption minimization,Convex optimization,Downlink beamforming,Load balancing,SOCP,User association},\n pages = {121-125},\n id = {0437c144-2c8a-3e3d-aa21-b81cdc165a8a},\n created = {2017-08-10T13:58:20.843Z},\n file_attached = {false},\n profile_id = {ae3c3618-3f38-3a00-9bd1-a1c94416d536},\n last_modified = {2019-09-22T11:57:28.810Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Sugathapala2017},\n private_publication = {false},\n abstract = {© 2017 IEEE. The concept of the wireless dynamic network architecture (DNA) stands for a system design, which allows terminals to convert into temporary access points (APs) when necessary. In this paper, we propose a framework to solve the problem of load balancing in DNA. Particularly, the user association in DNAs is optimized to minimize the number of active APs and the network cost in terms of tradeoff between power and load, while ensuring users' quality of service (QoS). In general, such a problem is a non-convex mixed integer nonlinear program in the sense that its continuous relaxation is a non-convex problem. To solve this optimization, we use the standard continuous relaxation method and approximate the relaxed problem by a series of second order cone programs with the aid of successive convex approximation (SCA) framework. Numerical results show that the proposed algorithm converges within a few iterations and jointly minimizes the network cost and the number of APs in the network.},\n bibtype = {inProceedings},\n author = {Sugathapala, Inosha and Glisic, Savo and Juntti, Markku and Tran, Le Nam},\n booktitle = {2017 IEEE International Conference on Communications Workshops, ICC Workshops 2017}\n}","author_short":["Sugathapala, I.","Glisic, S.","Juntti, M.","Tran, L., N."],"bibbaseid":"sugathapala-glisic-juntti-tran-jointoptimizationofpowerconsumptionandloadbalancinginwirelessdynamicnetworkarchitecture-2017","role":"author","urls":{},"keyword":["AP and power consumption minimization","Convex optimization","Downlink beamforming","Load balancing","SOCP","User association"],"downloads":0},"bibtype":"inProceedings","creationDate":"2019-09-22T12:10:03.405Z","downloads":0,"keywords":["ap and power consumption minimization","convex optimization","downlink beamforming","load balancing","socp","user association"],"search_terms":["joint","optimization","power","consumption","load","balancing","wireless","dynamic","network","architecture","sugathapala","glisic","juntti","tran"],"title":"Joint optimization of power consumption and load balancing in wireless dynamic network architecture","year":2017}