European Conference on Networks and Communications, 2016
This paper addresses the use of Self-X functions to support Small Cell as a Service (SCaaS) provi... more This paper addresses the use of Self-X functions to support Small Cell as a Service (SCaaS) provisioning in multi-tenant scenarios, as one of the main components of the SESAME project. After presenting the scenarios, requirements and architecture of the project, the paper discusses the implications of multi-tenancy on different Self-X functions and describes current studies that are being carried out in the project.
This paper addresses the use of Self-X functions to support Small Cell as a Service (SCaaS) provi... more This paper addresses the use of Self-X functions to support Small Cell as a Service (SCaaS) provisioning in multi-tenant scenarios, as one of the main components of the SESAME project. After presenting the scenarios, requirements and architecture of the project, the paper discusses the implications of multi-tenancy on different Self-X functions and describes current studies that are being carried out in the project.
The concept of Ultra Dense Networks (UDNs) is often seen as a key enabler of the next generation ... more The concept of Ultra Dense Networks (UDNs) is often seen as a key enabler of the next generation mobile networks. However, existing analysis of UDNs, including Stochastic Geometry, has not been able to fully determine the potential gains and limits of densification. In this paper we study performance of UDNs in downlink and provide new insights on the impact of antenna height on the network performance. We focus our investigation on the probability of coverage, average rate and average area rate for random deployments and show that under a path-loss model which considers antenna height there exists an upper limit on network performance which is dependent on the path-loss model parameters. Our analysis shows an interesting finding that even for over-densified networks a non-negligible system performance can be achieved.
ABSTRACT Wireless networks are evolving into a unique heterogeneous scenario. Moreover, mobile te... more ABSTRACT Wireless networks are evolving into a unique heterogeneous scenario. Moreover, mobile terminals with multiple wireless interfaces have the ability to roam between different access networks. Allowing seamless and efficient vertical handoffs is becoming a key requirement for future wireless environments. We discuss the application of recent kind of network codes called batched sparse (BATS) codes on HARD vertical handoffs between LTE and IEEE 802.11n to reduce packet loss and to increase performances. The first part of our analysis demonstrates a reduction of packet loss by applying network coding. However, the second part shows that the redundancy of the codes increases the energy per bit consumed by mobile terminals. Index Terms ?? Network coding, LTE, IEEE 802.11n, vertical handoffs, energy consumption.
ABSTRACT Cooperative communications have been gaining huge attention lately, due to the increase ... more ABSTRACT Cooperative communications have been gaining huge attention lately, due to the increase in the number of mobile devices and the advancement in their capabilities. In this framework, a commonly suggested approach to benefit from cooperation is the formation of virtual groups of mobile terminals. Mobility-aware algorithms are commonly proposed, where nodes form cooperative clusters according their basic mobile characteristics. However, more detailed mobility pattern information is not used to improve the performance of these systems. The reason is the complexity of current mobility pattern recognition algorithms that require previous set up and advanced knowledge on the scenario. This paper presents a novel cognitive algorithm for the identification of mobility patterns that can be used for mobile group formation and that requires no configuration. The proposed algorithm, based on data mining techniques and cooperative optimization, can evaluate the number of mobility patterns in the scenario and classify nodes according these patterns in a distributive fashion. The algorithm is mathematically presented and tested with extended simulations in both Matlab and ns-2.
Coping with the extreme growth of the number of users is one of the main challenges for the futur... more Coping with the extreme growth of the number of users is one of the main challenges for the future IEEE 802.11 networks. The high interference level, along with the conventional standardized carrier sensing approaches, will degrade the network performance. To tackle these challenges, the Dynamic Sensitivity Control (DSC) and the BSS Color scheme are considered in IEEE 802.11ax and IEEE 802.11ah, respectively. The main purpose of these schemes is to enhance the network throughput and improve the spectrum efficiency in dense networks. In this paper, we evaluate the DSC and the BSS Color scheme along with the PARTIAL-AID (PAID) feature introduced in IEEE 802.11ac, in terms of throughput and fairness. We also, exploit the performance when the aforementioned techniques are combined. The simulations show a significant gain in total throughput when these techniques are applied.
Clustering became relevant in the past as a solution for the scalability problems of ad hoc netwo... more Clustering became relevant in the past as a solution for the scalability problems of ad hoc networking, but, the unsuccessful application of ad hoc solutions to real scenarios, such as the projects SURAN and PRNet, decreased the interest of research community on ad hoc communications, and subsequently, on clustering algorithms. Recently, however, clustering techniques have gained renewed interest due to the emergence of cooperative communications for cellular networking. Clustering is envisaged, in this scenario, as a technique to team up nodes to support efficient data aggregation for energy saving, scalability and privacy among other benefits. Moreover, research on 5G networks also envisages a connected society, where everything and everyone will be connected under the umbrella of Internet of Everything (IoE). This novel communication paradigm has fostered new research on clustering, which has yielded novel and more advanced algorithms and applications. This article surveys the State-of-the-Art in clustering techniques and provides detailed descriptions of the basics of clustering and the latest novel ideas. Open issues, technical challenges and directions for future research are also outlined.
European Conference on Networks and Communications, 2016
This paper addresses the use of Self-X functions to support Small Cell as a Service (SCaaS) provi... more This paper addresses the use of Self-X functions to support Small Cell as a Service (SCaaS) provisioning in multi-tenant scenarios, as one of the main components of the SESAME project. After presenting the scenarios, requirements and architecture of the project, the paper discusses the implications of multi-tenancy on different Self-X functions and describes current studies that are being carried out in the project.
This paper addresses the use of Self-X functions to support Small Cell as a Service (SCaaS) provi... more This paper addresses the use of Self-X functions to support Small Cell as a Service (SCaaS) provisioning in multi-tenant scenarios, as one of the main components of the SESAME project. After presenting the scenarios, requirements and architecture of the project, the paper discusses the implications of multi-tenancy on different Self-X functions and describes current studies that are being carried out in the project.
The concept of Ultra Dense Networks (UDNs) is often seen as a key enabler of the next generation ... more The concept of Ultra Dense Networks (UDNs) is often seen as a key enabler of the next generation mobile networks. However, existing analysis of UDNs, including Stochastic Geometry, has not been able to fully determine the potential gains and limits of densification. In this paper we study performance of UDNs in downlink and provide new insights on the impact of antenna height on the network performance. We focus our investigation on the probability of coverage, average rate and average area rate for random deployments and show that under a path-loss model which considers antenna height there exists an upper limit on network performance which is dependent on the path-loss model parameters. Our analysis shows an interesting finding that even for over-densified networks a non-negligible system performance can be achieved.
ABSTRACT Wireless networks are evolving into a unique heterogeneous scenario. Moreover, mobile te... more ABSTRACT Wireless networks are evolving into a unique heterogeneous scenario. Moreover, mobile terminals with multiple wireless interfaces have the ability to roam between different access networks. Allowing seamless and efficient vertical handoffs is becoming a key requirement for future wireless environments. We discuss the application of recent kind of network codes called batched sparse (BATS) codes on HARD vertical handoffs between LTE and IEEE 802.11n to reduce packet loss and to increase performances. The first part of our analysis demonstrates a reduction of packet loss by applying network coding. However, the second part shows that the redundancy of the codes increases the energy per bit consumed by mobile terminals. Index Terms ?? Network coding, LTE, IEEE 802.11n, vertical handoffs, energy consumption.
ABSTRACT Cooperative communications have been gaining huge attention lately, due to the increase ... more ABSTRACT Cooperative communications have been gaining huge attention lately, due to the increase in the number of mobile devices and the advancement in their capabilities. In this framework, a commonly suggested approach to benefit from cooperation is the formation of virtual groups of mobile terminals. Mobility-aware algorithms are commonly proposed, where nodes form cooperative clusters according their basic mobile characteristics. However, more detailed mobility pattern information is not used to improve the performance of these systems. The reason is the complexity of current mobility pattern recognition algorithms that require previous set up and advanced knowledge on the scenario. This paper presents a novel cognitive algorithm for the identification of mobility patterns that can be used for mobile group formation and that requires no configuration. The proposed algorithm, based on data mining techniques and cooperative optimization, can evaluate the number of mobility patterns in the scenario and classify nodes according these patterns in a distributive fashion. The algorithm is mathematically presented and tested with extended simulations in both Matlab and ns-2.
Coping with the extreme growth of the number of users is one of the main challenges for the futur... more Coping with the extreme growth of the number of users is one of the main challenges for the future IEEE 802.11 networks. The high interference level, along with the conventional standardized carrier sensing approaches, will degrade the network performance. To tackle these challenges, the Dynamic Sensitivity Control (DSC) and the BSS Color scheme are considered in IEEE 802.11ax and IEEE 802.11ah, respectively. The main purpose of these schemes is to enhance the network throughput and improve the spectrum efficiency in dense networks. In this paper, we evaluate the DSC and the BSS Color scheme along with the PARTIAL-AID (PAID) feature introduced in IEEE 802.11ac, in terms of throughput and fairness. We also, exploit the performance when the aforementioned techniques are combined. The simulations show a significant gain in total throughput when these techniques are applied.
Clustering became relevant in the past as a solution for the scalability problems of ad hoc netwo... more Clustering became relevant in the past as a solution for the scalability problems of ad hoc networking, but, the unsuccessful application of ad hoc solutions to real scenarios, such as the projects SURAN and PRNet, decreased the interest of research community on ad hoc communications, and subsequently, on clustering algorithms. Recently, however, clustering techniques have gained renewed interest due to the emergence of cooperative communications for cellular networking. Clustering is envisaged, in this scenario, as a technique to team up nodes to support efficient data aggregation for energy saving, scalability and privacy among other benefits. Moreover, research on 5G networks also envisages a connected society, where everything and everyone will be connected under the umbrella of Internet of Everything (IoE). This novel communication paradigm has fostered new research on clustering, which has yielded novel and more advanced algorithms and applications. This article surveys the State-of-the-Art in clustering techniques and provides detailed descriptions of the basics of clustering and the latest novel ideas. Open issues, technical challenges and directions for future research are also outlined.
Uploads
Papers by seiamak vahid