Visible Light Communications: A Novel Indoor Network Planning Approach

Mohsen Abedi; Alexis A. Dowhuszko; Risto Wichman

doi:10.1109/GLOBECOM46510.2021.9685571

Visible Light Communications: A Novel Indoor Network Planning Approach

Mohsen Abedi, Alexis A. Dowhuszko, Risto Wichman

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

1 Citation (Scopus)

25 Downloads (Pure)

Abstract

We propose a Partition-based Visibility (PV) graph modeling to find the minimum number of Visible Light Communications (VLC) nodes and their locations for reliable indoor coverage. VLC network offers a low-cost technology on a license-free spectrum to complement the contemporary mobile network services offered on Radio Frequency (RF) bands. However, VLC suffers from propagation limits: Firstly, in presence of opaque obstacles such as walls, doors, and even curtains, strong link blockage is experienced as the power of reflections is much weaker than the power of the Line-of-Sight (LoS) link. Secondly, the received optical power at users drops as the angle of irradiance between a LED lamp and the user increases, imposing a range constraint on the VLC nodes. So, inspired by the Art Gallery Problem, we optimize the number and the locations of VLC nodes by characterizing the PV graph as a dual presentation of the floor plan and a Maximal Clique Clustering algorithm, which is able to solve not only the art gallery problem but also to extend the approach for the range constrained case.

Original language	English
Title of host publication	2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings
Publisher	IEEE
Number of pages	7
ISBN (Electronic)	9781728181042
DOIs	https://doi.org/10.1109/GLOBECOM46510.2021.9685571
Publication status	Published - 2021
MoE publication type	A4 Article in a conference publication
Event	IEEE Global Communications Conference - Madrid, Spain Duration: 7 Dec 2021 → 11 Dec 2021 https://globecom2021.ieee-globecom.org/

Conference

Conference	IEEE Global Communications Conference
Abbreviated title	GLOBECOM
Country/Territory	Spain
City	Madrid
Period	07/12/2021 → 11/12/2021
Internet address	https://globecom2021.ieee-globecom.org/

Keywords

Art gallery problem
Indoor coverage
Irregular floor plan
Line-of-Sight
Network Planning
Visibility graph
Visible Light Communications

Access to Document

10.1109/GLOBECOM46510.2021.9685571

Abedi_Visible_light_communications_GlobecomAccepted author manuscript, 1.09 MB

OpenUrl availability

Full text

Cite this

@inproceedings{e37e55167c0b4600821bb72231888968,

title = "Visible Light Communications: A Novel Indoor Network Planning Approach",

abstract = "We propose a Partition-based Visibility (PV) graph modeling to find the minimum number of Visible Light Communications (VLC) nodes and their locations for reliable indoor coverage. VLC network offers a low-cost technology on a license-free spectrum to complement the contemporary mobile network services offered on Radio Frequency (RF) bands. However, VLC suffers from propagation limits: Firstly, in presence of opaque obstacles such as walls, doors, and even curtains, strong link blockage is experienced as the power of reflections is much weaker than the power of the Line-of-Sight (LoS) link. Secondly, the received optical power at users drops as the angle of irradiance between a LED lamp and the user increases, imposing a range constraint on the VLC nodes. So, inspired by the Art Gallery Problem, we optimize the number and the locations of VLC nodes by characterizing the PV graph as a dual presentation of the floor plan and a Maximal Clique Clustering algorithm, which is able to solve not only the art gallery problem but also to extend the approach for the range constrained case.",

keywords = "Art gallery problem, Indoor coverage, Irregular floor plan, Line-of-Sight, Network Planning, Visibility graph, Visible Light Communications",

author = "Mohsen Abedi and Dowhuszko, {Alexis A.} and Risto Wichman",

note = "Funding Information: This research work was partly supported by Academy of Finland under the grant 339446. Publisher Copyright: {\textcopyright} 2021 IEEE.; IEEE Global Communications Conference, GLOBECOM ; Conference date: 07-12-2021 Through 11-12-2021",

year = "2021",

doi = "10.1109/GLOBECOM46510.2021.9685571",

language = "English",

booktitle = "2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings",

publisher = "IEEE",

address = "United States",

url = "https://globecom2021.ieee-globecom.org/",

}

TY - GEN

T1 - Visible Light Communications: A Novel Indoor Network Planning Approach

AU - Abedi, Mohsen

AU - Dowhuszko, Alexis A.

AU - Wichman, Risto

PY - 2021

Y1 - 2021

N2 - We propose a Partition-based Visibility (PV) graph modeling to find the minimum number of Visible Light Communications (VLC) nodes and their locations for reliable indoor coverage. VLC network offers a low-cost technology on a license-free spectrum to complement the contemporary mobile network services offered on Radio Frequency (RF) bands. However, VLC suffers from propagation limits: Firstly, in presence of opaque obstacles such as walls, doors, and even curtains, strong link blockage is experienced as the power of reflections is much weaker than the power of the Line-of-Sight (LoS) link. Secondly, the received optical power at users drops as the angle of irradiance between a LED lamp and the user increases, imposing a range constraint on the VLC nodes. So, inspired by the Art Gallery Problem, we optimize the number and the locations of VLC nodes by characterizing the PV graph as a dual presentation of the floor plan and a Maximal Clique Clustering algorithm, which is able to solve not only the art gallery problem but also to extend the approach for the range constrained case.

AB - We propose a Partition-based Visibility (PV) graph modeling to find the minimum number of Visible Light Communications (VLC) nodes and their locations for reliable indoor coverage. VLC network offers a low-cost technology on a license-free spectrum to complement the contemporary mobile network services offered on Radio Frequency (RF) bands. However, VLC suffers from propagation limits: Firstly, in presence of opaque obstacles such as walls, doors, and even curtains, strong link blockage is experienced as the power of reflections is much weaker than the power of the Line-of-Sight (LoS) link. Secondly, the received optical power at users drops as the angle of irradiance between a LED lamp and the user increases, imposing a range constraint on the VLC nodes. So, inspired by the Art Gallery Problem, we optimize the number and the locations of VLC nodes by characterizing the PV graph as a dual presentation of the floor plan and a Maximal Clique Clustering algorithm, which is able to solve not only the art gallery problem but also to extend the approach for the range constrained case.

KW - Art gallery problem

KW - Indoor coverage

KW - Irregular floor plan

KW - Line-of-Sight

KW - Network Planning

KW - Visibility graph

KW - Visible Light Communications

UR - http://www.scopus.com/inward/record.url?scp=85127296517&partnerID=8YFLogxK

U2 - 10.1109/GLOBECOM46510.2021.9685571

DO - 10.1109/GLOBECOM46510.2021.9685571

M3 - Conference contribution

AN - SCOPUS:85127296517

BT - 2021 IEEE Global Communications Conference, GLOBECOM 2021 - Proceedings

PB - IEEE

T2 - IEEE Global Communications Conference

Y2 - 7 December 2021 through 11 December 2021

ER -

Visible Light Communications: A Novel Indoor Network Planning Approach

Abstract

Conference

Keywords

Access to Document

OpenUrl availability

Other files and links

Fingerprint