The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Connected dominating set (CDS) problem in unit disk graph has a significant impact on an efficient design of routing protocols in wireless sensor networks. In this paper, an algorithm is proposed for finding minimum connected dominating set (MCDS) using dominating set. Dominating sets are connected by using Steiner tree. The algorithm goes through three phases. In first phase dominating set is found,...
The Connected Dominating Set (CDS) of a graph acts as a virtual backbone in ad-hoc wireless network. In this paper, a simple and efficient algorithm is proposed for the determination of CDS in a graph. The algorithm starts by finding a root node in the graph; a priority queue is maintained centrally to decide whether an element would be a part of CDS. This concept is extended to distributed version...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.