IEEE/ICACT20220099 Slide.10        [Big Slide]       [YouTube] Oral Presentation
we propose a three-stage gateway deployment algorithm that finds the approximate best gateway deployment solution that meets the node coverage requirements. Here we assume that the polygon consisting of nodes is a convex polygon in order to avoid the phenomenon of voids [15]. In the first phase, we propose a quadrangular segmentation based on typical triangle segmentation in computational geometry

[Go to Next Slide]
Select Voice: