In this research, we study the self-maintenance scheduling problem in next generation wireless networks, with the consideration of resource maintenance constraints and resource conflicting constraints. We propose a linear programming (ILP) model and two heuristic algorithms, and evaluate their effectiveness and time complexity via analysis and simulations. Our results show that all of the proposed approaches can effectively schedule the requests within a reasonable period of time, but with

more »

... rent suitable scenarios. The ILP approach is effective when the number of requests is large and yields close-to-optimal results; the RC-Cliques-RM algorithm is suitable at the presence of many constraints; while the RC-RM-Cliques algorithm can scale to large size networks at the expense of reduced accuracy. It is anticipated that the proposed scheduling algorithms will be generally applicable to various mobile wireless networks where self-maintenance is needed.