Various Distributed Shortest Path Routing Strategies for Wireless Ad Hoc Networks

摘要

In this paper, we describe and compare several distributed greedy algorithms that produce sets of nodes that can be used to form a virtual backbone for an ad hoc wireless network. The backbone produced is always a d-hop dominating, d-hop connected set and has a desirable "shortest path property". The perfomance of these algorithms for various parameters are compared.