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.
We study the probe selection problem in all-optical networks for achieving unambiguous faulty links localization with two monitors in failure detection phase and one monitor in failure localization phase. The existing random walk algorithm can find feasible solutions to localize the faulty links unambiguously, but it consumed large number of probes and wavelengths in large-size networks. In this paper,...
With the current communication network failures intensifying, they have characteristics of complexity and adaptability. This is no longer possible that networks can completely resist all kinds of network attacks. Targeted attacks and random failures may cause link or node removal, which in turn can cause significant disruption to the availability of network services. Designing a network topology to...
In Cognitive radio networks (CRN), secondary users(SUs) can access the unlicensed channel dymanically, but must vacate the spectrum on the appearance of primary users(PUs). Therefore multiple SUs will be affected, which will cause the network partition if there is no other backup channels. We combine power control and channel assignment to construct a bi-channel connected and conflict-free topology...
An ant colony optimization-based dynamic energy efficient mobile agent routing algorithm (ADEEMA) is presented in this paper. In this algorithm, mobile agent (MA) has the character of an ant, and a novel probabilistic model is constructed to make MA can find an energy efficient route from processing node (PN) to target nodes (TN). The route considers both the energy consumption and the node residual...
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.