← Back to the chapter · Next detail →
Technical detail · Duty-Cycling and Topology Management
Self-organizing virtual topology
Some environments make static role assignment impractical. An underwater sensor field is one example: nodes drift with the current and radio propagation is severely limited, so connectivity itself has to be discovered rather than planned in advance. One published architecture for this case, Tic-Tac-Toe-Arch, builds its virtual topology and duty cycle through an automated discovery-and-scheduling cycle: a node broadcasts a neighbor-discovery request and collects replies, computes an expected connectivity duration for each neighbor and selects the one with the longest duration, then sets that link active for a duty-cycle window sized to the selected duration before repeating the cycle.
This pattern makes the general principle concrete: the wake schedule is not chosen first and checked against topology afterward. The topology evidence — which neighbor will stay reachable longest — is what decides the wake schedule. A review of this pattern should still ask the same questions as any other duty-cycle and topology decision: which neighbor was selected and why, how long the active window lasts, and what retest condition, such as a neighbor drifting out of range or a new discovery round, reopens the choice.