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.
A Connected Dominating Set (CDS) performs a vital role in wireless ad-hoc sensor networks, which can establish a virtual backbone and thus leads to less maintenance overhead and information exchanges in wireless communications. In this paper, our algorithm first finds a prior CDS and then uses the Minimum-Weight Spanning Tree (MST) to optimize the result. Our algorithm applies effective degree, the...
A connected dominating set (CDS) performs a vital role in wireless ad-hoc sensor networks, which can establish virtual backbones and thus leads to less maintenance overhead and information exchanges in wireless communications. In the literature, many distributed algorithms applied in wireless ad-hoc sensor networks have been proposed. However, we find many of these algorithms are divided into different...
Network attack graphs are originally used to evaluate what the worst security state will be if a network is under attack. Along with observed intrusion evidences, we can further use attack graphs to extrapolate the current security state of a concerned network. Methods have been proposed in recent years to use observed intrusion evidences to compute the node belief metric of network attack graphs...
The computational costs of Cauchy Reed-Solomon (CRS) encoding operation make a great impact on the performance of its practical applications. The letter concentrates on how to construct a good Cauchy matrix which can lead to an efficient CRS coding scheme. We first formally model the problem by using a binary quadratic programming, then present an approximate method called localized greedy algorithm...
Global routing is a fundamental problem in VLSI physical design in which approximate paths for the interconnect (wires) of a circuit are decided. In this paper, a fast, order-free global routing technique is proposed by formulating the global routing problem as an integer linear programming (ILP) problem. A small set of high quality trees, in terms of congestion and length, for each net in the circuit...
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.