Search results for "work"

Channel aggregation with guard-band in D-OFDM based CRNs: Modeling and performance evaluation

2016

Channel aggregation (CA) techniques can offer flexible channel allocation and improve overall system performance in multi-channel cognitive radio networks (CRNs). Although many CA techniques have been proposed and studied, the impact of guard-band on CA for channel access has not been addressed in-depth. In this paper, we study the guard-band allocation mechanisms in discontinuous-orthogonal frequency division multiplexing (D-OFDM) based CRNs, and investigate the impact of guard-band sharing on SU flows when CA is enabled. Continuous time Markov chain (CTMC) based models have been developed in order to investigate the stochastic behavior of PU and SU flows. Based on our mathematical analysi…

Underlay Device-to-Device Communications on Multiple Channels

2018

Author´s accepted manuscript (postprint). © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Since the spectral efficiency of wireless communications is already close to its fundamental bounds, a significant increase in spatial efficiency is required to meet future traffic demands. Device-to-device (D2D) communications provide such an increase by allowing nearby u…

On the Performance of Channel Assembling and Fragmentation in Cognitive Radio Networks

2014

[EN] Flexible channel allocation may be applied to multi-channel cognitive radio networks (CRNs) through either channel assembling (CA) or channel fragmentation (CF). While CA allows one secondary user (SU) occupy multiple channels when primary users (PUs) are absent, CF provides finer granularity for channel occupancy by allocating a portion of one channel to an SU flow. In this paper, we investigate the impact of CF together with CA for SU flows by proposing a channel access strategy which activates both CF and CA and correspondingly evaluating its performance. In addition, we also consider a novel scenario where CA is enabled for PU flows. The performance evaluation is conducted based on…

Model and optimal Call Admission Policy in Cellular Mobile Networks

2000

For current cellular networks, two important Quality of Service (QoS) measures are the fractions of new and handoff calls that are blocked due to unavailability of channels. Based on these QoS measures, we propose a queuing network model with impatient users for handoff and new calls in cellular mobile networks. The number of simultaneous calls, that can be supported, is modeled by C identical servers with exponentially distributed session duration for each one of them. Priority is given to handoffs over new calls. We use for that a Guard Channel policy that reserves a set of CH channels for handoff calls, new calls being served at their arrival if there are more than CH available channels.…

<title>Statistical bandwidth allocation for multiservice networks</title>

2002

Multiservice networks will carry di erent kinds of applications in the near future. Bandwidth requirements change rapidly, and the network resource management will play an important role to guarantee the use of the limited resources in the most eAEcient way. We approach the channel capacity allocation problem by developing an SLA (Service Level Agreement) based channel allocation method. In our model, the channel may be wired or wireless, so this method can be adapted in multi-technique networks. The algorithm allocates resources to several di erent service classes via several di erent capacity routes. Service provider perfroms optimization by allocating data rate in such a way that the sat…

On the statistical properties of the capacity of double Hoyt fading channels

2010

The statistical properties of the capacity of narrowband double Hoyt fading channels are studied. Toward this end, analytical expressions for the probability density function (PDF) and cumulative distribution function (CDF) of the instantaneous channel capacity process are derived. Furthermore, for the characterization of the dynamical behavior of the time-varying channel capacity, expressions are provided for the level-crossing rate (LCR) and the average duration of fades (ADF). Since the double Rayleigh fading channel is a special case of the double Hoyt model, it is shown that the derived expressions can be reduced to the corresponding results already known for the capacity of the double…

Ideal Chaotic Pattern Recognition is achievable: The Ideal-M-AdNN - its design and properties

2013

Published version of a chapter in the book: Transactions on Computational Collective Intelligence XI. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-41776-4_2 This paper deals with the relatively new field of designing a Chaotic Pattern Recognition (PR) system. The benchmark of such a system is the following: First of all, one must be able to train the system with a set of “training” patterns. Subsequently, as long as there is no testing pattern, the system must be chaotic. However, if the system is, thereafter, presented with an unknown testing pattern, the behavior must ideally be as follows. If the testing pattern is not one of the trained patterns, the system …

The Community Structure of the Global Corporate Network

2013

We investigate the community structure of the global ownership network of transnational corporations. We find a pronounced organization in communities that cannot be explained by randomness. Despite the global character of this network, communities reflect first of all the geographical location of firms, while the industrial sector plays only a marginal role. We also analyze the network in which the nodes are the communities and the links are obtained by aggregating the links among firms belonging to pairs of communities. We analyze the network centrality of the top 50 communities and we provide the first quantitative assessment of the financial sector role in connecting the global economy.

2019

We consider the network of 5 416 537 articles of English Wikipedia extracted in 2017. Using the recent reduced Google matrix (REGOMAX) method we construct the reduced network of 230 articles (nodes) of infectious diseases and 195 articles of world countries. This method generates the reduced directed network between all 425 nodes taking into account all direct and indirect links with pathways via the huge global network. PageRank and CheiRank algorithms are used to determine the most influential diseases with the top PageRank diseases being Tuberculosis, HIV/AIDS, and Malaria. From the reduced Google matrix, we determine the sensitivity of world countries to specific diseases integrating th…

World Influence of Infectious Diseases from Wikipedia Network Analysis

2019

AbstractWe consider the network of 5 416 537 articles of English Wikipedia extracted in 2017. Using the recent reduced Google matrix (REGOMAX) method we construct the reduced network of 230 articles (nodes) of infectious diseases and 195 articles of world countries. This method generates the reduced directed network between all 425 nodes taking into account all direct and indirect links with pathways via the huge global network. PageRank and CheiRank algorithms are used to determine the most influential diseases with the top PageRank diseases being Tuberculosis, HIV/AIDS and Malaria. From the reduced Google matrix we determine the sensitivity of world countries to specific diseases integrat…