earticle

영어

In order to solve issues of grid network as a broadband wireless access network, such as high data transmission rate and long-distance signal coverage and so on, this paper proposes two heuristic algorithms with O (m3) time complexity, based on the user neighbors’ information and location information. The algorithm will meet transferring the minimum relay deployment problem required by users into the minimum clique partition problem of adjacency graph and gives specific algorithm steps. Experimental results show that: the proposed algorithm ensures network performance and reduces network cost.