LMAC (2003) @ https://research.utwente.nl/files/5427399/VanHoesel_INSS04_0... seemed to target energy efficiency on bursty, short messages on fixed topology wireless networks, whereas we were discussing the potential for ad-hoc mesh for a general use case using existing wireless chipsets.

To take up the tangent, it seems to me that the graph coloring problem can either be (1) solved universally (any local mesh will have distinct boundaries which make absolute coordination feasible) by adding some sort of explicitly negotiated or progressively developed shared state to act as a coordination layer (2) solved temporarily, for example by implementing a best-effort failover/fallback (CSMA/CD feeds back to "color") (3) Ignored.

Solution class 1 is obviously challenging to apply to for mobile and ad-hoc mesh networks. Solution class 2 seems more realistic for this category of use case. Solution class 3 works well if you have full control of the application layer (eg. wireless sensor network is push-only with short packets with high temporal tolerance for retransmissions).

Feels a bit like "Energy optimization / throughput / ad-hoc topology / traffic generality. Choose any three."