Dominating‐Set‐Based Routing in Ad Hoc Wireless Networks

K-Connected M-Dominating Set Based Fault-Tolerant Virtual Backbone: A Survey

“…The minimum number of queens that can dominate all of the squares of an 8 x 8 chessboard turned out to be five. The five queen problem is about the placement of these five queens [7]. This problem was formulated as a dominating set of a graph G(V,E), with the vertices corresponding to squares on the chessboard, and (u,v) ∈ E if and only if a queen can move from the square corresponding to u to the square corresponding to v [8].…”

Efficient Broadcasting in Self-Organizing Sensor Networks

“…Therefore, the significant characteristics we note are the proportion of nodes which need to re-emit the message (size of the dominating set) and their mean degree, as well as their impact over the mean number of copies of the broadcast message that a node receives (useless receptions). Moreover, we simulate two different variants of the Neighbor Elimination Scheme of Wu and Li: the original one [21] where the node priority is the node Id, and a later version of it where the priority value is the node degree (plus Id to break ties) [5], still in the aim to study the impact of the relay degree over the broadcasting performances. We also have a look at the latency (time needed for the last node to receive the broadcast packet initiated at the source).…”

Clustering Wireless Sensor and Wireless Ad Hoc Networks using Dominating Tree Concepts

“…Many clustering schemes have been proposed [14,17,18,19,20,21,22] for different ad hoc networks and play an important role in self organizing them. A systematic classification of these clustering schemes enables one to better understand and make improvements.…”