Before revision:  We obtain the following results for unit disk graphs  . (I) Every n-vertex unit disk graph has a 5-hop spanner with at most 5.5n edges.
After revision:  We obtain the following results for unit disk graphs in the plane . (I) Every n-vertex unit disk graph has a 5-hop spanner with at most 5.5n edges.