Heuristics-based PON deployment

This letter proposes a simple greedy algorithm and three of its variants for the passive optical network (PON) deployment on an arbitrary grid. The algorithms guarantee a result of 2-approximation to the optimal solution with worst case running time of O(n²+m²). This improves upon the best previously known result of 3-approximation with worst case running time of O(n⁵). We also improve the simulation study by introducing the concept of population density function embedded graphs. The experimental results reveal that the proposed algorithms save 45-65% of the deployment cost (fiber, equipment, etc.) on average.