Terminal Management and Intelligent Access Selection in Heterogeneous Environments

This paper presents a mobile terminal architecture for devices operating in heterogeneous environments, which incorporates intelligence for supporting mobility and roaming across legacy access networks. It focuses on the structure and functionality of the proposed scheme that supports terminal-initiated and terminal-controlled access network selection in heterogeneous networks. It discusses the decomposition of the proposed Terminal Management System into separate modules, responsible for retrieving link-layer measurements from the attachment points in the terminal’s neighborhood, for handling the user’s profile and for performing intelligent access network selection. This latter function aims at independently determining the optimal local interface and attachment point through which applications can be obtained as efficiently as possible, by taking into account network status and resource availability, user preferences and service requirements.

TCP-BIAD for Enhancing TCP Performance in Broadband Wireless Access Networks

In this paper a new TCP variant, named TCP-Binary Increase, Adaptive Decrease is presented. The suggested congestion control algorithm is a joint approach of Westwood and an enhanced version of BIC, for improving TCP performance in broadband wireless access networks. BIAD has been evaluated with respect to other TCP variants such as Reno, Westwood, BIC, CUBIC, HSTCP and STCP with the use of network simulator 2. The results indicate that the proposed solution achieves high network utilization levels in a wide range of network settings, including wireless channel errors, link asymmetry and congestion. We also evaluated TCP-BIAD when multiple flows share a bottlenecked access link and we show that it demonstrates the fairness features required for network deployment.     

Decision-aided compensation of severe phase-impairment-induced inter-carrier interference in frequency-selective OFDM

A new, reduced complexity algorithm is proposed for compensating the Inter-Carrier Interference (ICI) caused by severe PHase Noise (PHN) and Residual Frequency Offset (RFO) in OFDM systems. The algorithm estimates and compensates the most significant terms of the frequency domain ICI process, which are optimally selected via a Minimum Mean Squared Error (MMSE) criterion. The algorithm requires minimal knowledge of the phase process statistics, the estimation of which is also considered. The scheme outperforms previously proposed compensation methods of similar complexity, when severe phase impairments are present.     

Cost optimization of MBSFN and PTM transmissions for reliable multicasting in LTE networks

Long Term Evolution (LTE) systems have been specified and designed to accommodate small, high performance, power-efficient, end-user devices. The evolved Multimedia Broadcast/Multicast Service (e-MBMS) feature is introduced by the 3rd Generation Partnership Project (3GPP) as a complement to the existing MBMS service in order to accommodate multicast groups that are interested in receiving the same data. MBMS service is provided by MBMS over a Single Frequency Network (MBSFN) and/or Point-To-Multipoint (PTM) transmission methods. One of the challenges of MBMS is the complete error recovery of the transmitted files, a matter of great importance since the distribution of binary data must result in 100% error-free download. To fulfill this tight requirement, Forward Error Correction (FEC) mechanism has been proposed by 3GPP. In this work, we investigate the reliable multicasting by introducing a transmission method that combines the advantages of MBSFN and PTM transmission methods. We compare several FEC-based file recovery methods and evaluate them against various network parameters in a realistic simulation environment. The comparison is based on a cost-oriented analysis of MBMS service that takes into account the transmission cost over all the interfaces and nodes of the LTE architecture. The simulation results are performed with the aid of a new simulation tool and show that the performance of the file repair schemes depend on the network configuration.     

Vertices of degree k in random unlabeled trees

Let ??_n be the class of unlabeled trees with n vertices, and denote by H _n a tree that is drawn uniformly at random from this set. The asymptotic behavior of the random variable deg_k(H _n) that counts vertices of degree k in H _n was studied, among others, by Drmota and Gittenberger in [J Graph Theory 31(3) (1999), 227–253], who showed that this quantity satisfies a central limit theorem. This result provides a very precise characterization of the “central region” of the distribution, but does not give any non‐trivial information about its tails. In this work, we study further the number of vertices of degree k in H _n. In particular, for k = ??((logn/(loglogn))^1/2) we show exponential‐type bounds for the probability that deg_k(H _n) deviates from its expectation. On the technical side, our proofs are based on the analysis of a randomized algorithm that generates unlabeled trees in the so‐called Boltzmann model. The analysis of such algorithms is quite well‐understood for classes of labeled graphs, see e.g. the work [Bernasconi et al., SODA '08: Proceedings of the 19th Annual ACM‐SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2008, pp. 132–141; Bernasconi et al., Proceedings of the 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization, Springer, Berlin, 2008, pp. 303–316] by Bernasconi, the first author, and Steger. Comparable algorithms for unlabeled classes are unfortunately much more complex. We demonstrate in this work that they can be analyzed very precisely for classes of unlabeled graphs as well. © 2011 Wiley Periodicals, Inc. J Graph Theory. 69:114‐130, 2012     

Predictive Reservation for Handover Optimization in Two-Tier Heterogeneous Cellular Networks

The mobile network operators seek ways to increase their capacity and coverage in order to be able to deliver high quality services even under surging mobile broadband demand. The deployment of femtocells is the most efficient, economical and technically feasible approach to achieve this goal. However, a two-layered femtocell/macrocell heterogeneous networks where users can handover from a femtocell to the overlaid macrocell requires innovative traffic management techniques. While call handover from a femtocell to a macrocell can be easily implemented based on already known procedures, on the other hand, the handover towards a femtocell is more challenging. More specifically, due to the limited bandwidth available at each femtocell, it is not spectrally efficient to use a typical guard channel scheme in order to prioritize handover calls over new calls. Therefore, in this paper we introduce a dynamic pre-reservation scheme, which is based on the predictive channel reservation concept and adjusts dynamically the reserved resources. We show both analytically and by simulation that the proposed scheme can be efficiently applied to a two-layered femtocell/macrocell heterogeneous mobile network.     

An evaluation of routing in vehicular networks using analytic hierarchy process

This paper presents a comprehensive study of the performance of routing protocols in distributed vehicular networks. We propose a novel and efficient routing protocol, namely cross‐layer, weighted, position‐based routing, which considers link quality, mobility and utilisation of nodes in a cross layer manner to make effective position‐based forwarding decisions. An analytic hierarchy process approach is utilised to combine multiple decision criteria into a single weighting function and to perform a comparative evaluation of the effects of aforementioned criteria on forwarding decisions. Comprehensive simulations are performed in realistic representative urban scenarios with synthetic and real traffic. Insights on the effect of different communication and mobility parameters are obtained. The results demonstrate that the proposed protocol outperforms existing routing protocols for vehicular ad hoc networks, including European Telecommunications Standards Institute (ETSI's) proposed greedy routing protocol, greedy traffic aware routing protocol and advanced greedy forwarding in terms of combined packet delivery ratio, end‐to‐end delay and overhead. Copyright © 2015 John Wiley & Sons, Ltd.     

SeekStream: adapting to dynamic user behavior in P2P video‐on‐demand

In recent years, the users' perceived quality of experience (QoE) in streaming services has gained a lot of attention. Particularly, a number of research efforts have focused on providing live streaming and video‐on‐demand (VoD) services using peer‐to‐peer (P2P) architectures. However, in these proposed architectures, the heterogeneity of users and their dynamic behavior has not been sufficiently studied. In a real life scenario, where users have highly heterogeneous bandwidth resources (cable, DSL, 3G networks, etc) and can arbitrarily decide to perform a VCR function (stop, fast forward and seeking), ignoring this behavior can significantly deteriorate the system's efficiency and the perceived QoE. In this paper, we present SeekStream, a scalable P2P VoD architecture that ensures the stable delivery of the video stream to every participating user even in cases of high heterogeneity and frequent seeking operations. Specifically, SeekStream is a set of algorithms that optimize the P2P overlay dynamically and in a distributed fashion, making it adaptive to users dynamic behavior and bandwidth changes. The available bandwidth resources of the participating users are optimally exploited, keeping the contribution from the media server(s) to a minimal level. To illustrate the performance of the proposed algorithms, we are using a centralized overlay network manager that discovers the optimal network graph as a reference. We have developed an extensive P2P VoD simulator that shows the efficiency, scalability, and stability of our system under variant and dynamic conditions. The algorithms of our proposed system introduce less than 4% bandwidth overhead while we achieve high offloading of the media server(s). SeekStream guarantees a high block reception rate for the users, even under extreme seeking patterns. Copyright © 2016 John Wiley & Sons, Ltd.