This definition appears very rarely
and is found in the following Acronym Finder categories:
- Information technology (IT) and computers
See other meanings of CDS
We have 726 other definitions for CDS
in our Acronym Attic
Samples in periodicals archive:
Twenty papers explore sustainable growth for cellular wireless networks, self-organization activities in LTE networks, mobility prediction in LTE femtocells for enhanced handover performance, algorithms for determining stable connected dominating sets in MANET, and clustering protocols.
In graph theory, a group of nodes is called a connected dominating set if all of the vertices within it are connected to one another, and any other node within the graph is adjacent to at least one of those inside the group.
We will discuss the (i) Dijkstra's shortest path algorithm and its modifications for finding stable paths and bottleneck paths; (ii) Prim's minimum spanning tree algorithm and its modification for finding all pairs smallest and largest bottleneck paths; (iii) Minimum Steiner tree algorithm to connect a source node to all the receivers of a multicast group; (iv) A node-degree based algorithm to construct an approximate minimum connected dominating set (CDS) for sending information from one node to all other nodes in the network," and (v) Algorithms to find a sequence of link-disjoint, node-disjoint and zone-disjoint multi-path routes in MANETs.
Among the topics are reliable minimum connected dominating sets for topology control in probabilistic wireless sensor networks, fault tolerance and transmission reliability in wireless networks, green and flexible opportunistic grids, data partitioning for designing and simulating efficient huge databases, and virtualization techniques for graphics processing units.