Mathematical model about stochastic covering of local communication network and applications

In this paper, we focus on the full-covering repeater distribution problem of local communication network, especially for the case with random-distributing users. Through the improved hexagonal network structure composed by round domain which is covered by repeaters, a new Greedy Algorithm is applied into the established topological structure of the stochastic network. Thus, the optimal number of repeaters can be solved, and the locations of repeaters can be determined.