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.
Worldwide, network virtualization has attracted attention as a promising network technology and is expected to be utilized in new-generation networks. In this paper, we propose a topology design and admission control approach for such network virtualization with improved network robustness of both the physical and virtual networks. In our proposed method, first we construct a new network graph that...
Sensor Networks are inherently complex networks, and associated problems where analysis of some global features becomes more important than local ones, often arise. Localizing the holes in the overall coverage is one such problem. We present here, a distributed algorithm in a generalized combinatorial setting to localize holes in the coverage, with no a priori localization information for the nodes...
We design a routing scheme based on an extension of the algebraic connectivity concept for cognitive radio ad hoc networks. We observe that a cognitive radio network topology and its connectivity are highly influenced by the behavior of the primary users. In some cases, even if the physical proximity of secondary nodes would give rise to a connected topology, the primary user behavior could impact...
We present principal component centrality (PCC) as a measure of centrality that is more general and encompasses eigenvector centrality (EVC). We explain some of the difficulties in applying EVC to graphs and networks that contain more than just one neighborhood of nodes with high influence. We demonstrate the shortcomings of traditional EVC and contrast it against PCC. PCC's ranking procedure is based...
This paper reports on a probabilistic method for traffic engineering (specifically routing and resource allocation) in backbone networks, where the transport is the main service and robustness to the unexpected changes in network parameters is required. We analyze the network using the probabilistic betweenness of the network nodes (or links). The theoretical results lead to the definition of "criticality"...
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.