Improving Inter-service bandwidth fairness in Wireless Mesh Networks

Includes bibliographical references.We are currently experiencing many technological advances and as a result, a lot of applications and services are developed for use in homes, offices and out in the field. In order to attract users and customers, most applications and / or services are loaded with graphics, pictures and movie clips. This unfortunately means most of these next generation services put a lot of strain on networking resources, namely bandwidth. Efficient management of bandwidth in next generation wireless network is therefore important for ensuring fairness in bandwidth allocation amongst multiple services with diverse quality of service needs. A number of algorithms have been proposed for fairness in bandwidth allocation in wireless networks, and some researchers have used game theory to model the different aspects of fairness. However, most of the existing algorithms only ensure fairness for individual requests and disregard fairness among the classes of services while some other algorithms ensure fairness for the classes of services and disregard fairness among individual requests

Incentive Mechanisms in Peer-to-Peer Networks — A Systematic Literature Review

Centralized networks inevitably exhibit single points of failure that malicious actors regularly target. Decentralized networks are more resilient if numerous participants contribute to the network’s functionality. Most decentralized networks employ incentive mechanisms to coordinate the participation and cooperation of peers and thereby ensure the functionality and security of the network. This article systematically reviews incentive mechanisms for decentralized networks and networked systems by covering 165 prior literature reviews and 178 primary research papers published between 1993 and October 2022. Of the considered sources, we analyze 11 literature reviews and 105 primary research papers in detail by categorizing and comparing the distinctive properties of the presented incentive mechanisms. The reviewed incentive mechanisms establish fairness and reward participation and cooperative behavior. We review work that substitutes central authority through independent and subjective mechanisms run in isolation at each participating peer and work that applies multiparty computation. We use monetary, reputation, and service rewards as categories to differentiate the implementations and evaluate each incentive mechanism’s data management, attack resistance, and contribution model. Further, we highlight research gaps and deficiencies in reproducibility and comparability. Finally, we summarize our assessments and provide recommendations to apply incentive mechanisms to decentralized networks that share computational resources

Quality of Service in Vehicular Ad Hoc Networks: Methodical Evaluation and Enhancements for ITS-G5

After many formative years, the ad hoc wireless communication between vehicles has become a vehicular technology available in mass production cars in 2020. Vehicles form spontaneous Vehicular Ad Hoc Networks (VANETs), which enable communication whenever vehicles are nearby without need for supportive infrastructure. In Europe, this communication is standardised comprehensively as Intelligent Transport Systems in the 5.9 GHz band (ITS-G5). This thesis centres around Quality of Service (QoS) in these VANETs based on ITS-G5 technology. Whilst only a few vehicles communicate, radio resources are plenty, and channel congestion is a minor issue. With progressing deployment, congestion control becomes crucial to preserve QoS by preventing high latencies or foiled information dissemination. The developed VANET simulation model, featuring an elaborated ITS-G5 protocol stack, allows investigation of QoS methodically. It also considers the characteristics of ITS-G5 radios such as the signal attenuation in vehicular environments and the capture effect by receivers. Backed by this simulation model, several enhancements for ITS-G5 are proposed to control congestion reliably and thus ensure QoS for its applications. Modifications at the GeoNetworking (GN) protocol prevent massive packet occurrences in a short time and hence congestion. Glow Forwarding is introduced as GN extension to distribute delay-tolerant information. The revised Decentralized Congestion Control (DCC) cross-layer supports low-latency transmission of event-triggered, periodic and relayed packets. DCC triggers periodic services and manages a shared duty cycle budget dedicated to packet forwarding for this purpose. Evaluation in large-scale networks reveals that this enhanced ITS-G5 system can reliably reduce the information age of periodically sent messages. The forwarding budget virtually eliminates the starvation of multi-hop packets and still avoids congestion caused by excessive forwarding. The presented enhancements thus pave the way to scale up VANETs for wide-spread deployment and future applications

IEEE 802.11 parameters adaptation for Performance enhancement in high density Wireless networks

Tribunal : Ramón Agüero, Álvaro Martín, Federico LarrocaNowadays, it is common to find wireless networks that are based on the IEEE 802.11 standard deployed in an unplanned and unmanaged manner. Moreover, because of the low hardware cost and, trying to obtain optimal coverage and performance, a large number of devices are usually installed in reduced spaces generating high-density deployments. This kind of networks experiment a myriad of problems (e.g., interference, medium access control, etc.) related with the shared nature of the transmission medium. In recent years, different physical-layer- and link-layer-adaptation mechanisms have been proposed to palliate those problems, however, their feedback-loop-based behaviour in a highly complex RF medium makes their performance hard to assess. In this work, we study the problems of high-density networks, experimentally evaluate some existing solutions and propose a new adaptation mechanism, PRCS, that tackles some common weakness of those solutions. PRCS control the transmit power, the data rate, and the carrier sense threshold of APs of a wireless network so as to mitigate the effects of interference in high-density deployments without causing unfairness between links. In simulation-based experiments, PRCS outperforms similar existing mechanisms in various scenarios and in a particular scenario, where most mechanisms fail, duplicates global network throughput.En la actualidad, es muy común encontrar redes inalámbricas basadas en el estándar IEEE 802.11 desplegadas de manera no planificada ni gestionada. Además, debido al bajo costo de los dispositivos y con la intención de obtener una cobertura y rendimiento óptimos, un gran número de dispositivos son instalados en espacios reducidos, generado despliegues de alta densidad. Este tipo de redes experimentan una gran variedad de problemas (por ej., interferencia, control de acceso al medio, etc.) relacionados con el hecho de que utilizan un medio de transmisión compartido. En los últimos años, diferentes mecanismos de adaptación de parámetros de la capa física y de enlace han sido propuestos con el objetivo de mitigar estos problemas. Estas soluciones adaptan parámetros tales como la potencia de transmisión o la tasa de transmisión. En este trabajo, estudiamos los problemas de las redes inalámbricas de alta densidad, evaluamos mediante experimentos algunas de las soluciones existentes y proponemos un nuevo mecanismo de adaptación, PRCS, que aborda algunas de las debilidades de estas soluciones. PRCS controla la potencia de transmisión, la tasa de transmisión y el umbral del mecanismo de sensado de portadora de los puntos de acceso de una red inalámbrica. El objetivo de este mecanismo es mitigar los efectos de la interferencia en despliegues de alta densidad sin causar asimetrías entre los enlaces. En experimentos basados en simulaciones, mostramos que PRCS supera a los mecanismos existentes en varios escenarios y, en un escenario en particular donde la mayoría de los mecanismos fallan, duplica el rendimiento global de la red

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms

Resource allocation in networks via coalitional games

The main goal of this dissertation is to manage resource allocation in network engineering problems and to introduce efficient cooperative algorithms to obtain high performance, ensuring fairness and stability. Specifically, this dissertation introduces new approaches for resource allocation in Orthogonal Frequency Division Multiple Access (OFDMA) wireless networks and in smart power grids by casting the problems to the coalitional game framework and by providing a constructive iterative algorithm based on dynamic learning theory.  Software Engineering (Software)Algorithms and the Foundations of Software technolog

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms

QoS Scheduling in IEEE 802.16 Broadband Wireless Access Networks

With the exploding increase of mobile users and the release of new wireless applications, the high bandwidth requirement has been taking as a main concern for the design and development of the wireless techniques. There is no doubt that broadband wireless access with the support of heterogeneous kinds of applications is the trend in the next generation wireless networks. As a promising broadband wireless access standard, IEEE 802.16 has attracted extensive attentions from both industry and academia due to its high data rate and the inherent media access control (MAC) mechanism, which takes the service differentiation and quality of service (QoS) provisioning into account. To achieve service differentiation and QoS satisfaction for heterogenous applications is a very complicated issue. It refers to many fields, such as connection admission control (CAC), congestion control, routing algorithm, MAC protocol, and scheduling scheme. Among these fields, packet scheduling plays one of the most important roles in fulfilling service differentiation and QoS provisioning. It decides the order of packet transmissions, and provides mechanisms for the resource allocation and multiplexing at the packet level to ensure that different types of applications meet their service requirements and the network maintains a high resource utilization. In this thesis, we focus on the packet scheduling for difficult types of services in IEEE 802.16 networks, where unicast and mulitcast scheduling are investigated. For unicast scheduling, two types of services are considered: non-real-time polling service (nrtPS) and best effort (BE) service. We propose a flexible and efficient resource allocation and scheduling framework for nrtPS applications to achieve a tradeoff between the delivery delay and resource utilization, where automatic repeat request (ARQ) mechanisms and the adaptive modulation and coding (AMC) technique are jointly considered. For BE service, considering the heterogeneity of subscriber stations (SSs) in IEEE 802.16 networks, we propose the weighted proportional fairness scheduling scheme to achieve the flexible scheduling and resource allocation among SSs based on their traffic demands/patterns. For multicast scheduling, a cooperative multicast scheduling is proposed to achieve high throughput and reliable transmission. By using the two-phase transmission model to exploit the spatial diversity gain in the multicast scenario, the proposed scheduling scheme can significantly improve the throughput not only for all multicast groups, but also for each group member. Analytical models are developed to investigate the performance of the proposed schemes in terms of some important performance measurements, such as throughput, resource utilization, and service probability. Extensive simulations are conducted to illustrate the efficient of the proposed schemes and the accuracy of the analytical models. The research work should provide meaningful guidelines for the system design and the selection of operational parameters, such as the number of TV channels supported by the network, the achieved video quality of each SS in the network, and the setting of weights for SSs under different BE traffic demands

Topics in Distributed Algorithms: On Wireless Networks, Distributed Storage and Streaming

Distributed algorithms are executed on a set of computational instances. Werefer to these instances as nodes. Nodes are runningconcurrently and are independent from each other. Furthermore, they have their own instructions and information. In this context, the challenges are to show thatthe algorithm is correct, regardless of computational, or communication delaysand to show bounds on the usage of communication.We are especially interested the behaviour after transient faults and underthe existence of Byzantine nodes.This thesis discusses fundamental communication models for distributed algorithms. These models are implementing abstract communication methods. First, we address medium access control for a wireless medium with guaranteeson the communication delay. We discuss time division multiple access(TDMA) protocols for ad-hoc networks and we introduce an algorithm that creates aTDMA schedule without using external references for localisation, or time. We justify our algorithm by experimental results.The second topic is the emulation of shared memory on message passingnetworks. Both, shared memory and message passing are basic interprocessorcommunication models for distributed algorithms. We are providing a way ofemulating shared memory on top of an existing message passing network underthe presence of data corruption and stop-failed nodes. Additionally, we ensurethe privacy of the data that is stored in the shared memory. The third topic looks into streaming algorithms and optimisation. We study the problem of sorting a stream ofvehicles on a highway with severallanes so that each vehicle reaches its target lane. We look into optimality interms of minimising the number of move operations, as well as, minimising the length of the output stream. We present an exact algorithm for the case oftwo lanes and show that NP-Hardness for a increasing number of lanes