A distributed protocol for reducing neighborhood size in radio networks

A distributed protocol which specifies how modes select at random a subset of their adjacent link is described. The protocol results in a routing topology with nodal degree that does not exceed a predetermined limit, and allows late entries to be incorporated into the network and partitioned networks to be reconstituted. Simulation of the protocol has demonstrated a threshold effect for global network connectivity with respect to the average nodal degree. Moreover, if nodes are allowed to operate with their degree above the threshold, the probability that the protocol results in a connected routing graph is very close to one. That probability decreases sharply to zero as the nodal maximum degree drops below the threshold. Specifically, the threshold has been found to be between 3 and 7 for a large variety of network configuration and protocol conditions.<
>