Sciweavers

TPDS
2002

Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links

13 years 10 months ago
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, 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 v is called a dominating neighbor (absorbant neighbor) of another host u if there is a directed edge from v to u (from u to v). 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...
Jie Wu
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where TPDS
Authors Jie Wu
Comments (0)