In some research, a host transmits a beacon at each TX power level adjustment and listens for beacon-replies to discover its neighbors. Then the host
labels each neighbor's route with the least TX power level necessary to reach that neighbor.  Packets destined for a neighbor are transmitted
with the power level labeling the neighbor's route.

If a host discovers neighbors with beacons independently of discovering routes with an ad hoc routing protocol, then sometimes a neighbor willhave two routes, one discovered by the beacon and one discovered by therouting protocol. Then the host will have a choice between shouting at afar away neighbor, or whispering to a nearer neighbor who will whisperto the far away neighbor. A strategy for choosing between one "loud" hop and several quiet ones could be quite complex, it seems. Suppose you tried to estimate and minimize the product of a packet's on-air time and the area silenced by its (re)transmission?
 Hurry up you gays! What are you waiting for?