Date Added: Jan 2012
Minimum latency broadcasting in wireless networks, where interference is in consideration, is known to be NP-complete. In Unit Disk Graph (UDG) network model, a node broadcasts a message at some constant transmission range even though no node locates that far. By reducing the transmission range of each node to the farthest not-yet-received node within its original transmission range, a node can broadcast to all its receiving nodes as before but producing less interference. As a result, more nodes get more chance to broadcast at the same time and less latency may be achieved.