A Heuristic Algorithm for Minimum Connected Dominating Set with Maximal Weight in Ad Hoc Networks


How to design a efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a minimum connected dominating set (MCDS) is a promising approach, where the search space for a route is reduced to nodes in the set (also called gateway nodes). So, to determine this set is a… (More)
DOI: 10.1007/978-3-540-24680-0_116