50 research outputs found

    Mobile Networks

    Get PDF
    The growth in the use of mobile networks has come mainly with the third generation systems and voice traffic. With the current third generation and the arrival of the 4G, the number of mobile users in the world will exceed the number of landlines users. Audio and video streaming have had a significant increase, parallel to the requirements of bandwidth and quality of service demanded by those applications. Mobile networks require that the applications and protocols that have worked successfully in fixed networks can be used with the same level of quality in mobile scenarios. Until the third generation of mobile networks, the need to ensure reliable handovers was still an important issue. On the eve of a new generation of access networks (4G) and increased connectivity between networks of different characteristics commonly called hybrid (satellite, ad-hoc, sensors, wired, WIMAX, LAN, etc.), it is necessary to transfer mechanisms of mobility to future generations of networks. In order to achieve this, it is essential to carry out a comprehensive evaluation of the performance of current protocols and the diverse topologies to suit the new mobility conditions

    4G and Beyond - Exploiting Heterogeneity in Mobile Networks

    Get PDF

    Sesi贸n 506, Ordinaria. Modalidad H铆brida. Vig茅simo Quinto Consejo Acad茅mico. 1 de junio de 2023

    Get PDF
    脥ndice.-- Lista de asistencia. -- Orden del d铆a. -- Acta de la Sesi贸n 506. -- Acuerdos 506. -- Acta 503. -- Acta 504. -- Acta 505. -- Dictamen que presenta la Comisi贸n encargada de dictaminar sobre el otorgamiento del Premio a las 脕reas de Investigaci贸n, correspondiente al a帽o 2023. -- Jurado calificador del Concurso Diploma a la Investigaci贸n 2022. -- Renuncia del Mtro. Alejandro Le贸n Galicia, Titular de la Comisi贸n Dictaminadora Divisional de Ciencias B谩sicas e Ingenier铆a, quien fue seleccionado como integrante de dicha Comisi贸n en la Sesi贸n 491 del Consejo Acad茅mico, celebrada el 1 de febrero del 2022. Renuncia por periodo Sab谩tico. -- Propuesta de Convocatoria y las modalidades que efectuar谩 el Consejo Acad茅mico para integrar la lista de cuando menos cinco personas aspirantes que deber谩 proponerse al Rector General, para el nombramiento de la persona titular de la Rector铆a de la Unidad Azcapotzalco, periodo 2023-2027. -- Asuntos Generales

    Spectrum Sharing Methods in Coexisting Wireless Networks

    Get PDF
    Radio spectrum, the fundamental basis for wireless communication, is a finite resource. The development of the expanding range of radio based devices and services in recent years makes the spectrum scarce and hence more costly under the paradigm of extensive regulation for licensing. However, with mature technologies and with their continuous improvements it becomes apparent that tight licensing might no longer be required for all wireless services. This is from where the concept of utilizing the unlicensed bands for wireless communication originates. As a promising step to reduce the substantial cost for radio spectrum, different wireless technology based networks are being deployed to operate in the same spectrum bands, particularly in the unlicensed bands, resulting in coexistence. However, uncoordinated coexistence often leads to cases where collocated wireless systems experience heavy mutual interference. Hence, the development of spectrum sharing rules to mitigate the interference among wireless systems is a significant challenge considering the uncoordinated, heterogeneous systems. The requirement of spectrum sharing rules is tremendously increasing on the one hand to fulfill the current and future demand for wireless communication by the users, and on the other hand, to utilize the spectrum efficiently. In this thesis, contributions are provided towards dynamic and cognitive spectrum sharing with focus on the medium access control (MAC) layer, for uncoordinated scenarios of homogeneous and heterogeneous wireless networks, in a micro scale level, highlighting the QoS support for the applications. This thesis proposes a generic and novel spectrum sharing method based on a hypothesis: The regular channel occupation by one system can support other systems to predict the spectrum opportunities reliably. These opportunities then can be utilized efficiently, resulting in a fair spectrum sharing as well as an improving aggregated performance compared to the case without having special treatment. The developed method, denoted as Regular Channel Access (RCA), is modeled for systems specified by the wireless local resp. metropolitan area network standards IEEE 802.11 resp. 802.16. In the modeling, both systems are explored according to their respective centrally controlled channel access mechanisms and the adapted models are evaluated through simulation and results analysis. The conceptual model of spectrum sharing based on the distributed channel access mechanism of the IEEE 802.11 system is provided as well. To make the RCA method adaptive, the following enabling techniques are developed and integrated in the design: a RSS-based (Received Signal Strength based) detection method for measuring the channel occupation, a pattern recognition based algorithm for system identification, statistical knowledge based estimation for traffic demand estimation and an inference engine for reconfiguration of resource allocation as a response to traffic dynamics. The advantage of the RCA method is demonstrated, in which each competing collocated system is configured to have a resource allocation based on the estimated traffic demand of the systems. The simulation and the analysis of the results show a significant improvement in aggregated throughput, mean delay and packet loss ratio, compared to the case where legacy wireless systems coexists. The results from adaptive RCA show its resilience characteristics in case of dynamic traffic. The maximum achievable throughput between collocated IEEE 802.11 systems applying RCA is provided by means of mathematical calculation. The results of this thesis provide the basis for the development of resource allocation methods for future wireless networks particularly emphasized to operate in current unlicensed bands and in future models of the Open Spectrum Alliance

    Sesi贸n 495, Ordinaria Modalidad Virtual. Vig茅simo Cuarto Consejo Acad茅mico, 12 de julio de 2022

    Get PDF
    1 archivo PDF (305 p谩ginas) + 1 archivo zipLista de asistencia. -- Orden del D铆a. -- Acta de la Sesi贸n 495 Ordinaria. -- Acuerdos de la Sesi贸n 495 Ordinaria. -- Acta de la Sesi贸n 494. -- Jurados Diploma a la Investigaci贸n 2021. -- Renuncias Comisiones Dictaminadoras Divisionales (Dr. Ernesto Rodrigo V谩zquez Cer贸n, Mtro. Fabricio Vanden Broeck y Dr. Le贸n Tom谩s Ejea Mendoza). -- Dictamen creaci贸n de 脕rea Mec谩nica -- Dictamen Premio a las 脕reas 2022 -- Escrito DCSH.AZC.336.22 Dictamen C. Docencia Consejo Divisional CSH. -- Escrito suscrito por el Dr. Sa煤l Jer贸nimo Romero con fecha 11 de julio de 2022 y anexos. -- Escrito con fecha 12 de julio de 2022 firmado por un grupo del sector estudiantil relativo a la petici贸n de un di谩logo p煤blico con el Rector de la Unidad Azcapotzalco

    State-Dependent Bandwidth Sharing Policies for Wireless Multirate Loss Networks

    Get PDF
    We consider a reference cell of fixed capacity in a wireless cellular network while concentrating on next-generation network architectures. The cell accommodates new and handover calls from different service-classes. Arriving calls follow a random or quasi-random process and compete for service in the cell under two bandwidth sharing policies: 1) a probabilistic threshold (PrTH) policy or 2) the multiple fractional channel reservation (MFCR) policy. In the PrTH policy, if the number of in-service calls (new or handover) of a service-class exceeds a threshold (difference between new and handover calls), then an arriving call of the same service-class is accepted in the cell with a predefined state-dependent probability. In the MFCR policy, a real number of channels is reserved to benefit calls of certain service-classes; thus, a service priority is introduced. The cell is modeled as a multirate loss system. Under the PrTH policy, call-level performance measures are determined via accurate convolution algorithms, while under the MFCR policy, via approximate but efficient models. Furthermore, we discuss the applicability of the proposed models in 4G/5G networks. The accuracy of the proposed models is verified through simulation. Comparison against other models reveals the necessity of the new models and policies

    Performance Evaluation of Connectivity and Capacity of Dynamic Spectrum Access Networks

    Get PDF
    Recent measurements on radio spectrum usage have revealed the abundance of under- utilized bands of spectrum that belong to licensed users. This necessitated the paradigm shift from static to dynamic spectrum access (DSA) where secondary networks utilize unused spectrum holes in the licensed bands without causing interference to the licensed user. However, wide scale deployment of these networks have been hindered due to lack of knowledge of expected performance in realistic environments and lack of cost-effective solutions for implementing spectrum database systems. In this dissertation, we address some of the fundamental challenges on how to improve the performance of DSA networks in terms of connectivity and capacity. Apart from showing performance gains via simulation experiments, we designed, implemented, and deployed testbeds that achieve economics of scale. We start by introducing network connectivity models and show that the well-established disk model does not hold true for interference-limited networks. Thus, we characterize connectivity based on signal to interference and noise ratio (SINR) and show that not all the deployed secondary nodes necessarily contribute towards the network\u27s connectivity. We identify such nodes and show that even-though a node might be communication-visible it can still be connectivity-invisible. The invisibility of such nodes is modeled using the concept of Poisson thinning. The connectivity-visible nodes are combined with the coverage shrinkage to develop the concept of effective density which is used to characterize the con- nectivity. Further, we propose three techniques for connectivity maximization. We also show how traditional flooding techniques are not applicable under the SINR model and analyze the underlying causes for that. Moreover, we propose a modified version of probabilistic flooding that uses lower message overhead while accounting for the node outreach and in- terference. Next, we analyze the connectivity of multi-channel distributed networks and show how the invisibility that arises among the secondary nodes results in thinning which we characterize as channel abundance. We also capture the thinning that occurs due to the nodes\u27 interference. We study the effects of interference and channel abundance using Poisson thinning on the formation of a communication link between two nodes and also on the overall connectivity of the secondary network. As for the capacity, we derive the bounds on the maximum achievable capacity of a randomly deployed secondary network with finite number of nodes in the presence of primary users since finding the exact capacity involves solving an optimization problem that shows in-scalability both in time and search space dimensionality. We speed up the optimization by reducing the optimizer\u27s search space. Next, we characterize the QoS that secondary users can expect. We do so by using vector quantization to partition the QoS space into finite number of regions each of which is represented by one QoS index. We argue that any operating condition of the system can be mapped to one of the pre-computed QoS indices using a simple look-up in Olog (N) time thus avoiding any cumbersome computation for QoS evaluation. We implement the QoS space on an 8-bit microcontroller and show how the mathematically intensive operations can be computed in a shorter time. To demonstrate that there could be low cost solutions that scale, we present and implement an architecture that enables dynamic spectrum access for any type of network ranging from IoT to cellular. The three main components of this architecture are the RSSI sensing network, the DSA server, and the service engine. We use the concept of modular design in these components which allows transparency between them, scalability, and ease of maintenance and upgrade in a plug-n-play manner, without requiring any changes to the other components. Moreover, we provide a blueprint on how to use off-the-shelf commercially available software configurable RF chips to build low cost spectrum sensors. Using testbed experiments, we demonstrate the efficiency of the proposed architecture by comparing its performance to that of a legacy system. We show the benefits in terms of resilience to jamming, channel relinquishment on primary arrival, and best channel determination and allocation. We also show the performance gains in terms of frame error rater and spectral efficiency
    corecore