Their best bet is to have multiple mobile C&C centers doing a random traverse around the cone and using some sort of scheme to decide who answers which calls -

Their best bet is to have multiple mobile C&C centers doing a random traverse around the cone and using some sort of scheme to decide who answers which calls - a consistent hashing scheme would work. Of course, those paths would probably follow major roads, reducing the solution space to find a mobile adversary -- they aren't going to be roaming over open fields / not all points are equally probable. It's an interesting cat-and-mouse problem, to be sure, but the blue team has far more computing power.