Finding the optimum CDS "connected dominating sets" for ad-hoc networks

When an ad-hoc network becomes very large, the majority of traffic becomes broadcasr signalling used to build the network topology. For example in a simulation of a 10000 node AODV network, only 25% of the traffic was used to send data/ To help minimize this broadcast flooding problem, only certain nodes are nominated to forward signalling traffic. Some researcg in graph theory is needed to find out how many nodes are sufficient to keep a ad-hoc network running effiently