Before revision:  ( iii ) Every n-vertex unit disk graph has a 2-hop spanner with O(n ^{3/2 ) edges.
After revision:  ( iii ) Every n-vertex unit disk graph has a 2-hop spanner with O(n \log n ) edges.