Cellular Backhaul Coverage Algortihms

摘要

Systems and methods for designing cellular backhaul networks are disclosed. The system can include an Adaptive Graph Minimum Spanning Tree (AG-MST) algorithm to identify and connect stranded cellular sites at minimum cost. The system can compare pending bids for new connections such as, for example, new microwave or fiber optic links at stranded sites to provide new connectivity. The system can design a network that connects the maximum number of stranded sites at the minimum average cost per site.

主权项

1. One or more non-transitory computer-readable media storing computer-executable instructions that, when executed on one or more processors, perform acts comprising:
identifying stranded sites in a cellular communication system; creating a stranded site cluster comprising a mesh network graph between stranded sites and relay sites for a portion of a network; updating weights for each vertex and edge for which there is an associated bid cost; identifying a first potential starting point in the stranded site cluster; updating the stranded site cluster by removing connected stranded sites; identifying a first, minimum weight spanning tree, solution for the first potential starting point.