The current implementation of Yk (S) picks a shortest outgoing edge in each cone at each point. But what if such an edge cannot be realized as a wireless transmission link? It might be too long, and the wireless antenna may be unable to send information that far. This is why it is important to limit the length of edges in a wireless communication graph. If d is the longest link that can be established by wireless antenna, then the communication graph for S should contain only edges from Gd (S). We will need to alter the implementation of the Yao algorithm to consider only edges from Gd (S), for a ﬁxed real value d.

This process will first involve computing the length L of the longest edge in the MST. Next, we will find the graph of the longest edge. Then we will compute Yk as a subgraph of the graph of the longest edge.