Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links
Jie Wu · IEEE Transactions on Parallel and Distributed Systems · 2002
We extend dominating-set-based routing to networks with unidirectional links. Specifically, an efficient localized algorithm for determining a dominating and absorbant set of vertices (mobile hosts) is given and this set can be easily updated when the network topology changes dynamically. A host /spl nu/ is called a dominating neighbor (absorbant neighbor) of another host u if there is a directed edge from /spl nu/ to u (from u to /spl nu/). A subset of vertices is dominating and absorbant if every vertex not in the subset has one dominating neighbor and one absorbant neighbor in the subset. The derived dominating and absorbant set exhibits good locality properties; that is, the change of a node status (dominating/dominated) affects only the status of nodes in the neighborhood. The notion of dominating and absorbant set can also be applied iteratively on the dominating and absorbant set itself, forming a hierarchy of dominating and absorbant sets. The effectiveness of our approach is confirmed and the locality of node status update is verified through simulation.