Dominating‐Set‐Based Routing in Ad Hoc Wireless Networks
Jie Wu · 2002
Chapter 20 reviews simple and efficient localized algorithms for calculating a connected dominating set in ad hoc wireless networks. A set of nodes is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. Applications of dominating sets in reducing the cost of routing and broadcasting are also discussed.