{"title":"可见光通信系统中用户与照明约束的关联","authors":"Cong Shen, Shun Lou, Chen Gong, Zhengyuan Xu","doi":"10.1109/CISS.2016.7460505","DOIUrl":null,"url":null,"abstract":"The user association problem for light emitting diode (LED)-based visible light communication (VLC) systems is investigated in this paper. Unlike its counterpart in other RF communication systems, the LED-based VLC system has unique lighting constraints which have to be satisfied when making user association decisions. This work establishes a utility maximization framework for VLC user association with lighting constraints. The optimization problem is shown to be non-convex mixed integer, and hence is very difficult to solve. Two sub-optimal solutions are proposed and their performance is analyzed, one based on a greedy heuristic and the other based on a convex relaxation. Simulation results are provided to demonstrate the effectiveness of the solutions.","PeriodicalId":346776,"journal":{"name":"2016 Annual Conference on Information Science and Systems (CISS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"User association with lighting constraints in visible light communication systems\",\"authors\":\"Cong Shen, Shun Lou, Chen Gong, Zhengyuan Xu\",\"doi\":\"10.1109/CISS.2016.7460505\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The user association problem for light emitting diode (LED)-based visible light communication (VLC) systems is investigated in this paper. Unlike its counterpart in other RF communication systems, the LED-based VLC system has unique lighting constraints which have to be satisfied when making user association decisions. This work establishes a utility maximization framework for VLC user association with lighting constraints. The optimization problem is shown to be non-convex mixed integer, and hence is very difficult to solve. Two sub-optimal solutions are proposed and their performance is analyzed, one based on a greedy heuristic and the other based on a convex relaxation. Simulation results are provided to demonstrate the effectiveness of the solutions.\",\"PeriodicalId\":346776,\"journal\":{\"name\":\"2016 Annual Conference on Information Science and Systems (CISS)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 Annual Conference on Information Science and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2016.7460505\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Annual Conference on Information Science and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2016.7460505","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
User association with lighting constraints in visible light communication systems
The user association problem for light emitting diode (LED)-based visible light communication (VLC) systems is investigated in this paper. Unlike its counterpart in other RF communication systems, the LED-based VLC system has unique lighting constraints which have to be satisfied when making user association decisions. This work establishes a utility maximization framework for VLC user association with lighting constraints. The optimization problem is shown to be non-convex mixed integer, and hence is very difficult to solve. Two sub-optimal solutions are proposed and their performance is analyzed, one based on a greedy heuristic and the other based on a convex relaxation. Simulation results are provided to demonstrate the effectiveness of the solutions.