Isr develops, applies and teaches advanced methodologies of design and analysis to solve complex, hierarchical, heterogeneous and dynamic problems of engineering technology and systems for industry and government.Isr is a permanent institute of the university of maryland, within the a. James clark school of engineering. It is a graduated national science foundation engineering research center. Abstract-In this paper, we introduce the topology control problem for stable path routing in mobile multi-hop networks. We formulate the topology control problem of selective linkstate broadcast as a graph pruning problem with restricted local neighborhood information. We develop a multi-agent optimization framework where the decision policies of each agent are restricted to local policies on incident edges and independent of the policies of the other agents. We show that under a condition called the positivity condition, these independent local policies preserve the stable routing paths globally. We then provide an efficient algorithm to compute an optimal local policy that yields a minimal pruned graph, which we call the Stable Path Topology Control (SPTC) algorithm. Using simulations, we demonstrate that this algorithm, when used with the popular ETX metric, has lesser control overhead and the resulting pruned routing paths carry more upper layer traffic when compared with other topology control mechanisms commonly used for Mobile Ad Hoc Networks.