Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Andrea Malfitano is active.

Publication


Featured researches published by Andrea Malfitano.


Journal of Networks | 2011

GCAD: A Novel Call Admission Control Algorithm in IEEE 802.16 based Wireless Mesh Networks

Floriano De Rango; Andrea Malfitano; Salvatore Marano

In this paper, a GCAD-CAC (Greedy Choice with Bandwidth Availability aware Defragmentation) algorithm is proposed. It is able to guarantee respect for data flow delay constraints defined by three different traffic classes. To achieve good results, the algorithm tries to accept all the new requests, but when a higher priority request is received, a lower priority admitted request is preempted. This preemption can leave some small gaps which are not sufficient for new connection admission; these gaps can be collected by the GCAD algorithm by activating a bandwidth availability based defragmentation process. The quality of the algorithm is shown by a comparison with two other algorithms found in the literature.


International Journal of Mobile Network Design and Innovation | 2007

Interdisciplinary issues for the management of next generation autonomic wireless systems: nature-inspired techniques and organic computing

Floriano De Rango; Fiore Veltri; Mauro Tropea; Amilcare Francesco Santamaria; Peppino Fazio; Andrea Malfitano; Salvatore Marano

Next generation communication systems have become a hot research issue in these last few years. For an efficient management of these networks, multidisciplinary knowledge and cooperation between different research fields is important. In particular, the next generation of wireless systems needs to satisfy some self-properties such as self-describing, self-organising, self-managing, self-configuring, self-optimising, self-monitoring, self-adapting and self-healing. In order to provide these features traditional approaches cannot be employed, owing to the computing complexity involved, so new solutions must be considered. The most suitable techniques to solve the above-mentioned issues is certainly organic computing and nature inspired techniques. Therefore, the main goal of our work is to provide a description of the principal characteristics of these new kinds of network and an overview in the various nature-inspired and organic computing techniques such as the neural network, molecular computing, Cellular Automata (CA), Genetic Algorithms (GAs), epidemic propagation strategies and finally, Swarm Intelligence (SI).


global communications conference | 2006

SAT05-5: PER Evaluation for IEEE 802.16 - SC and 802.16e Protocol in HAP Architecture with User Mobility under Different Modulation Schemes

F. De Rango; Andrea Malfitano; Salvatore Marano

This paper presents a performance evaluation of IEEE 802.16e protocol. The 802.16e PHY/MAC protocol for wireless MAN has been applied to a high altitude platform (HAP) architecture with another protocol family member: 802.16SC (single carrier). In this work an HAP serves a rural scenario with low multipath effects. Two different time-variant wireless channels have been considered: the first one for a HAP- mobile user link that is characterized by path loss and doppler effects and the second one for a mobile user - mobile user link that presents also multipath fading. Many simulation scenarios with different mobility user speeds and different modulations are reported and interesting results concerning the PER of both channel, the first under single carrier (SC), and the second under an OFDM modulation, a specific multicarrier modulation, are presented. Thus PER evaluation under different modulation and for different payload sizes are presented. Simulation results showed good channel performance if the mobility of the user is low or the mobile user is near the vertical axis of the HAP segment, but also if QPSK modulation is used. Finally Matlab elaboration to obtain PER polynomial function are presented.


personal, indoor and mobile radio communications | 2009

A new call admission control algorithm for IEEE 802.16 distributed mesh networks

Floriano De Rango; Andrea Malfitano; Salvatore Marano

The mesh distributed mode supported by IEEE 802.16 protocol, with the capability to establish direct links between SSs (Subscriber Station) and with the wide coverage area and the promised bit rate, allows to create interesting scenarios. The protocol defines guidelines to realize request/grant process, but it does not proposes a distributed Call Admission Control (CAC) algorithm. This process is essential to guarantee QoS constraints to admitted connections. In this paper, we present GCAD-CAC (Greedy Choice with bandwidth Availabilities aware Defragmentation): a new call admission control algorithm to guarantee the respect of data flows delay constraints defined by three different traffic classes. In order to reach good results, a Greedy algorithm is used: all the new requests are accepted, but when a higher priority request is received, a lower priority admitted request is preempted. The preemption can leave in data subframe some little gaps not sufficient to new connection admission; these gaps can be collected by GCAD algorithm by activating a bandwidth availabilities defragmentation process. The algorithm quality is proved by a comparison with other two algorithms found in the literature.


wireless communications and networking conference | 2009

Instant Weighted Probability Model to Guarantee QoS in IEEE 802.16e Scenario

Floriano De Rango; Andrea Malfitano; Salvatore Marano

The IEEE 802.16 protocol is one of the most promising technologies in recent years, especially in its recent version that specifies user mobility support. The purpose of this paper is to illustrate a scenario characterized by this protocol and the presence of mobile users. The first goal is to create a model that can describe the time variant channel behaviour in terms of probability values, i.e. such as: what is the probability of receiving a wrong packet on the receiver side. The second goal is to use the model forecast to guarantee QoS to every type of application. In literature there is a great diffusion of Markov chain based models and of other kind of model, as ARMA or filter model, to describe channel behaviour, but none of these is independent of scenario configurations, and also none has been tested with a realistic dynamic scenario. As a consequence we have attempted to create a new model that can be used independently of the channel configuration to ensure compliance with the QoS bounds.


international conference on wireless communications and mobile computing | 2009

Instant weighed probability model for time variant channel in IEEE 802.16e scenario

Floriano De Rango; Andrea Malfitano; Salvatore Marano

The IEEE 802.16 protocol is one of the most promising technologies in recent years, especially in its recent version that specifies user mobility support. The purpose of this paper is to illustrate a scenario characterized by this protocol and the presence of mobile users. The goal is to create a model that can describe the time variant channel behaviour in terms of probability values, i.e. such as: what is the probability of receiving a wrong packet on the receiver side? In the literature there is a great diffusion of Markov chain based models to describe channel behaviour, but none of these is independent of scenario configurations, and also none has been tested with a realistic dynamic scenario. As a consequence we have attempted to create a new model that can be used independently of the channel configuration.


military communications conference | 2008

Markov chain based models comparison and hybrid model design in IEEE 802.16E scenario

F. De Rango; Andrea Malfitano; A. Procopio; Salvatore Marano

The IEEE 802.16e is a promising technology that allows to provide wireless broadband services to a great number of mobile users. Considering this interesting scenario enriched by further presence of HAPs (high altitude platform) with the role of base stations (BSs), we have proposed a comparison between performances of a set of Markov chain based models collected by literature. These following models: MTA (Markov-based trace analysis), Gilbert-Elliot, FSM (full-state Markov) and HMM (hidden Markov model) are designed using packet error traces (a sequence of ldquo1rdquo and ldquo0rdquo) obtained by a simulator that takes into account channel impairment effects such as path loss and Doppler effect. To compare the models performances, by each of them artificial traces are generated and then entropy normalized Kullback-Leibler distance, standard error and other statistical properties of random variable G (free error packets burst length) and B (corrupted packets burst length) of artificial traces are computed. The purpose of this work is not only to identify the model that best describes the channel error behaviour in IEEE 802.16e scenario but also to create a new one: after models comparison, a hybrid model designed to achieve excellent performance in the artificial traces generation will be presented.


WiMAX Security and Quality of Service: AN End-to-End Perspective | 2010

Cross‐Layer End‐to‐End QoS Architecture: The Milestone of WiMAX

Floriano De Rango; Andrea Malfitano; Salvatore Marano


international symposium on performance evaluation of computer and telecommunication systems | 2009

Bandwidth availability aware defragmentation based CAC algorithm for IEEE 802.16 distributed mesh networks

Floriano De Rango; Andrea Malfitano


international conference on wireless information networks and systems | 2008

MARKOV CHAIN BASED MODELS COMPARISON IN IEEE 802.16E SCENARIO

Floriano De Rango; Andrea Malfitano; Angela Procopio; Salvatore Marano

Collaboration


Dive into the Andrea Malfitano's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

F. De Rango

University of Calabria

View shared research outputs
Top Co-Authors

Avatar

A. Procopio

University of Calabria

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge