,Information
dissemination to construct routes
,Broadcast
by MPRs only through periodic TC (Topology Control) messages,
all nodes receive these messages and store the topology information
,Links
between an MPR and its selector set (Advertised Neighbor set) are
the minimum information that must be broadcast
,Run
a Shortest Path algorithm on partial topology info to determine shortest
hop path
–guaranteed to be
not longer than minimum hop path in full network topology