Before revision:  The routing strategy must then decide where to send the package using only the label of the target node  and the routing table of the node the message is currently at. In this paper , we present the first routing scheme for the particular case in which the network is defined by the visibility graph of a polygon with n vertices and h holes.
After revision:  The routing strategy must then decide where to send the package using only the label of the target node and the routing table of the current node. For any fixed \varepsilon > 0 , we present the first routing scheme for the particular case in which the network is defined by the visibility graph of a polygon with n vertices and h holes.