Severity: Warning
Message: file_get_contents(https://...@pubfacts.com&api_key=b8daa3ad693db53b1410957c26c9a51b4908&a=1): Failed to open stream: HTTP request failed! HTTP/1.1 429 Too Many Requests
Filename: helpers/my_audit_helper.php
Line Number: 176
Backtrace:
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 176
Function: file_get_contents
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 250
Function: simplexml_load_file_from_url
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 3122
Function: getPubMedXML
File: /var/www/html/application/controllers/Detail.php
Line: 575
Function: pubMedSearch_Global
File: /var/www/html/application/controllers/Detail.php
Line: 489
Function: pubMedGetRelatedKeyword
File: /var/www/html/index.php
Line: 316
Function: require_once
This paper proposes a novel power-efficient light-emitting diode (LED) placement algorithm for indoor visible light communication (VLC). In the considered model, the LEDs can be designedly placed for high power efficiency while satisfying the indoor communication and illumination requirements. This design problem is formulated as a power minimization problem under both communication and illumination level constraints. Due to the interactions among LEDs and the illumination uniformity constraint, the formulated problem is complex and non-convex. To solve the problem, we first transform the complex uniformity constraint into a series of linear constraints. Then an iterative algorithm is proposed to decouple the interactions among LEDs and transforms the original problem into a series of convex sub-problems. Then, we use Lagrange dual method to solve the sub-problem and obtain a convergent solution of the original problem. Simulation results show that the proposed LED placement algorithm can harvest 14% power consumption gain when compared with the baseline scheme with centrally placed LEDs.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1364/OE.410502 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!