In this letter, a connected dominating set based on-demand routing (CDS-OR) mechanism is proposed for wireless ad hoc networks. We argue that there exists a trade-off between CDS size and the amount of information exchanged for CDS formation in a fully distributed ad hoc network. Smaller CDS size is beneficial and essential in minimizing the routing cost, but the amount of information exchanged (via hello or topology control messages) for CDS formation adds significant traffic overhead to the network. The proposed CDS-OR protocol assures that the hello message sizes never exceed a small constant, and an increase in network size has no impact on the hello message sizes. At the same time, the proposed protocol yields a constant approximation to the minimum CDS (MCDS), while assuring network-wide reachability of broadcast messages. Extensive simulations against benchmark routing protocols reveal noticeable superiority of the proposed mechanism in terms of packet delivery ratio and routing cost.

中文翻译：

---

适用于无线网状网络的连接支配集启用按需路由 (CDS-OR)


在这封信中，为无线自组织网络提出了一种基于按需路由（CDS-OR）机制的连接支配集。我们认为，在完全分布式自组织网络中，CDS 大小和 CDS 形成所交换的信息量之间存在权衡。较小的 CDS 大小对于最小化路由成本是有益且重要的，但用于 CDS 形成的交换信息量（通过 hello 或拓扑控制消息）会显着增加网络的流量开销。所提出的 CDS-OR 协议确保 hello 消息大小永远不会超过一个小常数，并且网络大小的增加不会影响 hello 消息大小。同时，所提出的协议产生对最小 CDS (MCDS) 的恒定近似，同时确保广播消息的网络范围可达性。针对基准路由协议的广泛模拟揭示了所提出的机制在数据包传递率和路由成本方面的显着优越性。