TY - GEN
T1 - Wireless Sensor or Access-Point Deployment Using Coverage-Area Maximization over Visibility Graph
AU - Gadiraju, Venkata
AU - Wu, Hsiao Chun
AU - Busch, Costas
AU - Neupane, Prasanga
AU - Chang, Shih Yu
N1 - Funding Information:
This work was supported in part by Louisiana Board of Regents Research Competitiveness Subprogram (Contract Number: LEQSF(2021-22)-RD-A-34).
Publisher Copyright:
© 2021 IEEE.
PY - 2021/8/4
Y1 - 2021/8/4
N2 - Wireless communication and sensor networks have been widely employed in our daily life. Sensing-range characteristics, inter-nodal connectivity, and communication capacity are critical factors in providing reliable quality-of-service. Placement of sensors or access-points indoors is always critical to the effectiveness of a wireless communication/sensor network. In this paper, we would like to investigate the important classical sensor/access-point placement problem in the discrete-graph domain. Instead of the conventional trial-and-error approach upon rigorous quality-of-service measurements, we study the sensor/access-point coverage-area maximization problem over visibility graphs and then design a new graph-theoretical approach to deal with it. This new approach just takes the bird's eye view of an indoor geometry (floor plan) as the only necessary input information and does not rely on any quality-of-service measurement. Thus, the crucial coverage-area maximization problem for sensor/access-point placement can be tackled algorithmically. Our new approach can be applied for indoor geometries as arbitrary polygons, either convex or nonconvex.
AB - Wireless communication and sensor networks have been widely employed in our daily life. Sensing-range characteristics, inter-nodal connectivity, and communication capacity are critical factors in providing reliable quality-of-service. Placement of sensors or access-points indoors is always critical to the effectiveness of a wireless communication/sensor network. In this paper, we would like to investigate the important classical sensor/access-point placement problem in the discrete-graph domain. Instead of the conventional trial-and-error approach upon rigorous quality-of-service measurements, we study the sensor/access-point coverage-area maximization problem over visibility graphs and then design a new graph-theoretical approach to deal with it. This new approach just takes the bird's eye view of an indoor geometry (floor plan) as the only necessary input information and does not rely on any quality-of-service measurement. Thus, the crucial coverage-area maximization problem for sensor/access-point placement can be tackled algorithmically. Our new approach can be applied for indoor geometries as arbitrary polygons, either convex or nonconvex.
KW - computational geometry
KW - maximal clique
KW - Optimal sensor/access-point placement
KW - visibility graph
KW - wireless communication/sensor network
UR - http://www.scopus.com/inward/record.url?scp=85116474627&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85116474627&partnerID=8YFLogxK
U2 - 10.1109/BMSB53066.2021.9547093
DO - 10.1109/BMSB53066.2021.9547093
M3 - Conference contribution
AN - SCOPUS:85116474627
T3 - IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, BMSB
BT - 2021 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, BMSB 2021
PB - IEEE Computer Society
T2 - 16th IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, BMSB 2021
Y2 - 4 August 2021 through 6 August 2021
ER -