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.
In Elastic Optical Networks (EONs), two communications requests sharing common fiber links have to be separated in the spectrum domain by a guard band to prevent the interference or satisfy the security requirement, since there are types of physical impairments or attacks in the optical layer. For different interference or security levels, the size of guard band should be adapted, while it is supposed...
We study the problem of maximizing the lifetime of data-gathering tree for wireless sensor networks (WSNs). Both data routing and aggregation are considered at the same time to improve the energy efficiency for data collection in WSNs. With different data-aggregation methods, three aggregation modes are studied: full aggregation, non-aggregation, and a hybrid partialaggregation using Compressive Sensing...
The construction of light-trees is one of the principal subproblems for all-optical multicast routing in sparse splitting wavelength division multiplexing (WDM) networks. Due to the light splitting constraint and the absence of wavelength converters, several light-trees may be required to establish a multicast session. However, the computation of the cost-optimal multicast light-trees is NP-hard....
All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The cost-optimal multicast light-tree is NP-hard to compute, especially when taking sparse splitting into account. Thus many heuristic algorithms have been proposed. In this paper, the approximation ratios of two classical heuristic AOMR algorithms for sparse splitting WDM network are studied. Let K be...
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.