13,388 research outputs found

    Parametric Estimation of Handoff

    Full text link
    The efficiency of wireless technology depends upon the seamless connectivity to the user at anywhere any time.Heterogeneous wireless networks are an integration of different networks with diversified technologies. The most essential requirement for Seamless vertical handover is that the received signal strength should always be healthy. Mobile device enabled with multiple wireless technologies makes it possible to maintain seamless connectivity in highly dynamic environment.Since the available bandwidth is limited and the number of users is growing rapidly, it is a real challenge to maintain the received signal strength in a healthy stage.In this work, the proposed, cost effective parametric estimation for vertical handover shows that the received signal strength maintains a healthy level by considering the novel concept.Comment: 5 Pages,3 figures, NCCCS-12,ISBN:978-1-4673-2837-

    Monotonicity and error bounds for networks of Erlang loss queues

    Get PDF
    Networks of Erlang loss queues naturally arise when modelling finite communication systems without delays, among which, most notably are (i) classical circuit switch telephone networks (loss networks) and (ii) present-day wireless mobile networks. Performance measures of interest such as loss probabilities or throughputs can be obtained from the steady state distribution. However, while this steady state distribution has a closed product form expression in the first case (loss networks), it does not have one in the second case due to blocked (and lost) handovers. Product form approximations are therefore suggested. These approximations are obtained by a combined modification of both the state space (by a hypercubic expansion) and the transition rates (by extra redial rates). It will be shown that these product form approximations lead to (1) upper bounds for loss probabilities and \ud (2) analytic error bounds for the accuracy of the approximation for various performance measures.\ud The proofs of these results rely upon both monotonicity results and an analytic error bound method as based on Markov reward theory. This combination and its technicalities are of interest by themselves. The technical conditions are worked out and verified for two specific applications:\ud (1)• pure loss networks as under (2)• GSM networks with fixed channel allocation as under.\ud The results are of practical interest for computational simplifications and, particularly, to guarantee that blocking probabilities do not exceed a given threshold such as for network dimensioning

    Wireless Communications in the Era of Big Data

    Full text link
    The rapidly growing wave of wireless data service is pushing against the boundary of our communication network's processing power. The pervasive and exponentially increasing data traffic present imminent challenges to all the aspects of the wireless system design, such as spectrum efficiency, computing capabilities and fronthaul/backhaul link capacity. In this article, we discuss the challenges and opportunities in the design of scalable wireless systems to embrace such a "bigdata" era. On one hand, we review the state-of-the-art networking architectures and signal processing techniques adaptable for managing the bigdata traffic in wireless networks. On the other hand, instead of viewing mobile bigdata as a unwanted burden, we introduce methods to capitalize from the vast data traffic, for building a bigdata-aware wireless network with better wireless service quality and new mobile applications. We highlight several promising future research directions for wireless communications in the mobile bigdata era.Comment: This article is accepted and to appear in IEEE Communications Magazin

    A survey of machine learning techniques applied to self organizing cellular networks

    Get PDF
    In this paper, a survey of the literature of the past fifteen years involving Machine Learning (ML) algorithms applied to self organizing cellular networks is performed. In order for future networks to overcome the current limitations and address the issues of current cellular systems, it is clear that more intelligence needs to be deployed, so that a fully autonomous and flexible network can be enabled. This paper focuses on the learning perspective of Self Organizing Networks (SON) solutions and provides, not only an overview of the most common ML techniques encountered in cellular networks, but also manages to classify each paper in terms of its learning solution, while also giving some examples. The authors also classify each paper in terms of its self-organizing use-case and discuss how each proposed solution performed. In addition, a comparison between the most commonly found ML algorithms in terms of certain SON metrics is performed and general guidelines on when to choose each ML algorithm for each SON function are proposed. Lastly, this work also provides future research directions and new paradigms that the use of more robust and intelligent algorithms, together with data gathered by operators, can bring to the cellular networks domain and fully enable the concept of SON in the near future
    corecore