Distributed Admission Control Research Articles

Distributed Resource Allocation and Flow Control Algorithms for mmWave IAB Networks

This paper presents a new distributed slot reservation frame-work for joint resource allocation and flow control in mmWave IAB networks. We derive the Dynamic Slot Reservation (DSR) algorithm from a novel approach to solve a minimum clearing time linear program in a completely distributed manner. The algorithm to solve this problem, the Static Slot Reservation (SSR) algorithm, is also a contribution of the paper. We compare the delay performance of the DSR algorithm with a well known optimal, centralized algorithm, the joint-MWM algorithm, for a realistic IAB network scenario of multi-hop flows. We show that flows that traverse several links have significantly lower delays under DSR than under the joint-MWM algorithm. This paper also provides an instantaneous rate control policy for IAB networks which changes flow rates based on the number of flows at each node in the network. The flow rates under this policy are the same as the steady-state flow rates achieved by the DSR algorithm. We prove that the proposed flow control policy provides stability for all flow arrival rate vectors that are achievable by any flow control policy. This paper provides distributed admission control policies to provide rate and/or latency guarantees to flows under dynamic scenarios with stochastic flow arrivals and changing access link rates.

PCCAMN—Path Constancy Based Channel Assignment in Mobile ADHOC Network for Healthcare Data Transmission

A MANET is a self-governing network for mobile devices in many crucial domains, including health care, for transmitting health data of the patients. The key challenge in MANETS is maintaining the links between devices under mobility; it creates limitless network disconnections and path loss frequently. Such issues, raises network delay and minimize packet delivery ratio (PDR) and entire set-up throughput brings reduced quality of services (QOS). To get better QoS, stable path selection and link disconnection count based nearby device selection carried out in this work. It’s on this basis that the thesis is exploring the design and the analysis of the FPC. The FPC is designed in network simulator with the support of optimized fuzzy logic (FL). It has obtained three inputs which is fallout to 27 set of laws. This law sets (LS) direct in the fortitude of the precedence to select best path set to transmit a packets from sender to destination. The analyses are with previous protocols of Distributed Admission Control Protocol (DACP) and Call Admission Protocol of MANET. The outcome results monitored with delay, Packet Delivery Ratio (PDR), throughput and overheads as the QOS metrics of network.

A game theoretic model and a distributed admission control scheme for quality of service routing

In this paper, we present an innovative distributed quality of service routing scheme suitable to operate in networks of general topology implementing a Diff-Serv service model for QoS support. The proposed scheme is based on a game theoretic non-cooperative model which exploits, on the one hand, the topological information distributed within the network by the current (non-QoS) link-state and distance-vector routing protocols and, on the other hand, the QoS information locally available at the node where the forwarding process takes place. In order to guarantee the satisfaction of a stability condition at each node, a distributed admission control (DAC) scheme is proposed to jointly operate with the non-cooperative routing scheme. The DAC decides if a new flow can be accepted without violating the nodes' stability constraints and provides each node with cumulative information about the status of the network downstream from its outgoing links.

A game theoretic model and a distributed admission control scheme for quality of service routing

A game theoretic model and a distributed admission control scheme for quality of service routing

Distributed admission control algorithm for random access wireless networks in the presence of hidden terminals

We address the problem of admission control for wireless clients in WLANs taking into account collisions between competing access points and considering explicitly the effect of hidden terminals, which play a prominent role in optimised client association. We propose an efficient, distributed admission control algorithm, where the wireless client node decides locally on which access point it will associate with in order to maximise its link throughput. The client can choose to optimise either its uplink or downlink throughput, depending on the type of traffic it predominantly intends to exchange with the network. The proposed approach takes into account the full contention resolution of the RTS/CTS IEEE802.11 medium access control protocol and leads towards an increase of the total throughput for the whole network. Finally, an algorithm is proposed, which can serve also as the basis for the development of efficient traffic offloading protocols in heterogeneous 5G networks.

Distributed and Dynamic Resource Management for Wireless Service Delivery to High-Speed Trains

With the fast development of high-speed railway (HSR), how to provide high-quality and cost-effective wireless services for HSR users has attracted increasing attention in recent years. A key issue is to design an efficient resource management scheme for wireless service delivery between the train and the ground. In this paper, we first provide an overview of the existing resource management schemes and some unsolved challenges are identified. To address these challenges, a cross-layer optimization framework is developed for facilitating the design and optimization of dynamic resource management. Then, the resource management problem is formulated as a stochastic optimization problem, which jointly considers the quality-of-service requirements and dynamic characteristics of HSR wireless communications. The stochastic network optimization theory is applied to transform the intractable stochastic optimization problem into a tractable deterministic optimization problem, which can be further decomposed into two separate subproblems: admission control and resource allocation. A fully distributed admission control scheme is proposed for the admission control subproblem, and a cooperative distributed resource allocation scheme is developed for the mixed-integer resource allocation subproblem with guaranteed global optimality. Finally, a distributed dynamic resource management algorithm is proposed to solve the original stochastic optimization problem with high reliability and robustness against central node failure. The performance of the proposed algorithm is analyzed theoretically and further validated by numerical simulations under realistic conditions for HSR wireless communications.

SoftMAC: Layer 2.5 Collaborative MAC for Multimedia Support in Multihop Wireless Networks

In this paper, we present the challenges in supporting multimedia, in particular, VoIP services over multihop wireless networks using commercial IEEE 802.11 MAC DCF hardware, and propose a novel software solution, called Layer 2.5 SoftMAC. Our proposed SoftMAC resides between the IEEE 802.11 MAC layer and the IP layer to coordinate the real-time (RT) multimedia and best-effort (BE) data packet transmission among neighboring nodes in a multihop wireless network. To effectively ensure acceptable VoIP services, channel busy time and collision rate need to be well controlled below appropriate levels. Targeted at this, our SoftMAC architecture employs three key mechanisms: 1) distributed admission control for regulating the load of RT traffic, 2) rate control for minimizing the impact of BT traffic on RT one, and 3) nonpreemptive priority queuing for providing high priority service to VoIP traffic. To evaluate the efficacy of these mechanisms, extensive simulations are conducted using the network simulator NS2. We also implement our proposed SoftMAC as a Windows network driver interlace specification (NDIS) driver and build a multihop wireless network testbed with 32 wireless nodes equipped with IEEE 802.11 a/b/g combo cards. Our evaluation and testing results demonstrate the effectiveness of our proposed software solution. Our proposed collaborative SoftMAC framework can also provide good support for A/V streaming in home networks where the network consists of hybrid WLAN (wireless LAN) and Ethernet

Distributed differential admission control algorithm for delay‐tolerant machine‐to‐machine devices

Machine-to-machine (M2M) is a new type of communication which can be used in e-health, smart meters and so on. However a huge number of M2M devices will cause access congestion in third generation long-term evolution systems. It will bring access delays which cannot satisfy the requirements for the M2M deceives, especially for the devices with low tolerant delays. In this study, the authors investigate a distributed differential admission control algorithm that improves the access fairness for M2M devices with different tolerant delays. To maximise the access fairness while maintaining the throughput, an optimisation model is established by formulating a fairness-throughput payoff function. Then, a parallel and distributed algorithm, namely, Jacobi algorithm, is introduced to solve the optimisation problem. Furthermore, the constraint of the key parameters is given to guarantee that the algorithm can converge to the optimal solution. The simulation results show that the M2M devices with different tolerant delays have the maximum access fairness in their own tolerant delays by using the proposed method.

A Distributed Adaptive Admission Control Scheme for Multimedia Wireless Mesh Networks <xref ref-type="fn" rid="fn1"/>

Due to recent advances in wireless technologies, wireless mesh networks (WMNs) are expected in the near future to fully handle content-rich multimedia services with various quality of services (QoS) guarantee. Unlike traditional data applications, multimedia applications require QoS support in order to satisfy the user's service requirements. Admission control has been advocated as a promising approach to tackle this challenging issue since it is a key management function for which a new flow is admitted based on the condition that the QoS requirements of all flows in the network can still be met after the new flow begins. In this paper, a Rate Adaptive Routing on Cliques Admission Control protocol (so-called RA-RCAC) for WMNs is proposed, which is able to provide feedbacks to the application layer whenever congestion occurs in the network. The RA-RCAC scheme merges the design features of two chosen benchmarking schemes, namely, an Interference-Aware Admission Control and QoS routing protocol in WMN (so-called IAAC) and a distributed admission control protocol for WMNs (so-called RCAC) to produce a protocol design that satisfies the QoS guarantee. Our proposed RA-RCAC protocol is evaluated using simulation analysis. The performance evaluation results demonstrate its superiority over the aforementioned benchmark schemes in terms of throughput, end-to-end delay, packet delivery ratio, and loss ratio performance evaluation metrics.

Sustainability Analysis and Resource Management for Wireless Mesh Networks with Renewable Energy Supplies

There is a growing interest in the use of renewable energy sources to power wireless networks in order to mitigate the detrimental effects of conventional energy production or to enable deployment in off-grid locations. However, renewable energy sources, such as solar and wind, are by nature unstable in their availability and capacity. The dynamics of energy supply hence impose new challenges for network planning and resource management. In this paper, the sustainable performance of a wireless mesh network powered by renewable energy sources is studied. To address the intermittently available capacity of the energy supply, adaptive resource management and admission control schemes are proposed. Specifically, the goal is to maximize the energy sustainability of the network, or equivalently, to minimize the failure probability that the mesh access points (APs) deplete their energy and go out of service due to the unreliable energy supply. To this end, the energy buffer of a mesh AP is modeled as a G/G/1(/N) queue with arbitrary patterns of energy charging and discharging. Diffusion approximation is applied to analyze the transient evolution of the queue length and the energy depletion duration. Based on the analysis, an adaptive resource management scheme is proposed to balance traffic loads across the mesh network according to the energy adequacy at different mesh APs. A distributed admission control strategy to guarantee high resource utilization and to improve energy sustainability is presented. By considering the first and second order statistics of the energy charging and discharging processes at each mesh AP, it is demonstrated that the proposed schemes outperform some existing state-of-the-art solutions.

The Cross-Layer per-Flow Admission Control with Adaptive Reservation of Bandwidth and Multiple QoS Guarantee in EDCA of IEEE 802.11e for Internet of Things

The static bandwidth’s reservation and resource allocation in 802.11e results in bad supporting to the Internet of things. The cross-layer per-flow distributed admission control with dynamic reservation of bandwidth and multiple OoS guarantee of EDCA in IEEE802.11e is presented in this paper. The adaptive bits allocation of OFDM in the station is presented to obtain the maximum Shannon’s capacity subjected to the maximum power at first and this information is crossed layer to the MAC. Then the dynamic bandwidth reservation is suggested based on it and the distributed measurement, which adapts to the requirement of the service and maximizes the efficiency of spectrum simultaneously. Meanwhile, the surplus factor’s central estimation based on model is presented to overcome the measurement’s inaccuracy. On the other hand, the relationship between the QoS and the probability of the collision is analyzed and the double criterion with collision probability and bandwidth is used to ensure multiple QoS such as bandwidth and delay. The simulation under MATLAB show that the mechanism presented in this paper outperforms the formers in the utilization of resource and the ability to track the network and service as well as admission of the service.

Application of Bayesian Networks for Autonomic Network Management

The ever evolving telecommunication networks in terms of their technology, infrastructure, and supported services have always posed challenges to the network managers to come up with an efficient Network Management System (NMS) for effective network management. The need for automated and efficient management of the current networks, more specifically the Next Generation Network (NGN), is the subject addressed in this research. A detailed description of the management challenges in the context of current networks is presented and then this work enlists the desired features and characteristics of an efficient NMS. It then proposes that there is a need to apply Artificial Intelligence (AI) and Machine Learning (ML) approaches for enhancing and automating the functions of NMS. The first contribution of this work is a comprehensive survey of the AI and ML approaches applied to the domain of NM. The second contribution of this work is that it presents the reasoning and evidence to support the choice of Bayesian Networks (BN) as a viable solution for ML-based NMS. The final contribution of this work is that it proposes and implements three novel NM solutions based on the BN approach, namely BN-based Admission Control (BNAC), BN-based Distributed Admission Control (BNDAC) and BN-based Intelligent Traffic Engineering (BNITE), along with the description of algorithms underpinning the proposed framework.

Toward Wireless Backhaul Using Circuit Emulation Over Optical Packet-Switched Metro WDM Ring Network

Optical WDM metro-ring networks have been considered to be promising solutions for wireless backhaul. In this paper, we propose an integrated traffic control scheme (ITCS), which facilitates circuit emulation service (CES) for wireless backhaul over a previously proposed experimental optical packet-switched WDM metro-ring network, HOPSMAN. The ITCS seamlessly integrates variable-bit-rate (VBR) CES wireless with connection-less best-effort data, satisfying stringent QoS requirements and retaining maximal network throughput. The ITCS ensures efficient setup of CES connections by employing a simple mean-rate-based distributed admission control followed by a novel slot-marking reservation. The total connection setup delay is comprised of the setup queueing delay and slot-marking delay. While the slot-marking delay is nearly a ring time, the mean setup queueing delay is formally computed through an accurate approximation based on an M/G/m queueing analysis. We show simulation results to demonstrate that the ITCS accommodates remarkably high CES traffic loads while satisfying a wide range of delay requirements for wireless backhaul. Taking the background best-effort traffic into account, ITCS achieves exceedingly low delay, jitter, and delay bound for CES under various traffic loads and burstiness.

Residual resources aware distributed admission control mechanism in mobile multi-hop network

Without considering current residual resources of the medium, nodes in mobile ad hoc networks (MANETs) admit the data flow arbitrarily, and the quality of service (QoS) of the data flows deteriorates. To release the contending on the resources induced by the overloaded flows, the admission control mechanism can effectively keep the balance between injected data flows and network capacity, and it is viewed as the most important technology in MANET. A novel distributed residual resources aware admission control mechanism is proposed in this paper, where the residual resources and the service rate are studied thoroughly. Considering the medium utilization, frame retransmission and backoff procedure, the passive method is applied to predict the residual resources, and the binomial distribution is utilized to model the medium status; moreover, based on the cooperation between the source node and intermediate nodes, the path meeting the resource demand is probed across the network, and the flows are rejected while the residual resources cannot meet its demand. Results show that the network load can be constrained by our proposed admission control mechanism, and the QoS of the data flows can be guaranteed effectively.

Advanced Technologies in Wireless Internet and Communications Networks (Editorial for WICON 2011 Special Issue)

Over the last two decades, wireless internet and communications networks have experienced an explosive growth in both the diversity of the techniques and its range of applications. Besides the traditional mobile communications services, current mobile communications networks can also provide internet access services. In order to provide higher data transmission rate, the 4th generation mobile communications systems, i.e., IMT-Advanced, have been developed and many advanced technologies, such as MIMO and OFDM, have been applied. The constantly developing wireless communications technologies also have enabled the extensive deployment of distributed wireless networks, such as the Ad Hoc networks. This kind of networks has applications in many important areas, such as military, healthcare, environment monitoring, and manufacturing. Due to the absence of central controllers, the distributed networks face many challenges. In recently years, radio spectrum has becoming exhausted because of the growing demands for wireless broadband communications. However, the traditional static spectrum allocation policy has prevented the spectrum utilization efficiency from further increasing. In order to overcome the spectrum shortage problem, cognitive wireless network, in which cognitive radio technique is applied, have drawn a great of research attentions. In the future wireless internet and communications networks, many advanced technologies, such as MIMO, OFDM, cognitive radio, distributed resource allocation/management, distributed admission control, etc., will be applied to satisfy the increasing demands for broadband wireless services. Our objectives for this special issue of ACM/Springer Mobile Networks & Applications are to collate and disseminate the most relevant achievements of research work on wireless network architectures, wireless access technologies, distributed admission control, advanced resource allocation/management, QoS guarantees, etc. In response to this call for papers, we have received a total of xx high-quality submissions, and 6 papers have been selected for publication after a rigorous review process. The first paper “Optimal Resource Allocation for Spectrum Sensing Based Cognitive Radio Networks with Statistical QoS Guarantees” by Y. Wang, P, Ren, Q. Du, and C. Zhang proposes an optimal resource allocation scheme for statistical QoS provisioning in spectrum sensing based cognitive radio networks subject to the average transmit and interference power constraints. The second paper “The Master–slave Stochastic Knapsack Modeling for Fully Dynamic Allocation” by S. Zhang, F. Yang, M. Zhao, and W. Zhou models the fully dynamic spectrum allocation scheme as a master–slave stochastic knapsack process, analyzes the equilibrium state transition, and derives the probability of blocking and forced termination for the secondary user. The third paper “A Method for Classifying Packets into Networks Flows Based on GHSOM” by H. Shi, T. Hamagami, H. Xu, P. Yu, and Y. Wu develops an intelligent network flow identifying method based on the neural network algorithm and suggests a new normalization for changing the raw network traffic to learn input vectors. The forth paper “Performance Improvement of the Precise Paging in CoLAC for 2G/3G Convergence Core Networks with Path Diversity” by Y. Su and X. Feng evaluates the system performance metrics in terms of handover success rate and P. Ren (*) Xi’an Jiaotong University, Xi’an, China e-mail: pyren@mail.xjtu.edu.cn

ASM: Adaptive Voice Stream Multicast over Low-Power Wireless Networks

Low-power Wireless Networks (LWNs) have become increasingly available for mission-critical applications such as security surveillance and disaster response. In particular, emerging low-power wireless audio platforms provide an economical solution for ad hoc voice communication in emergency scenarios. In this paper, we develop a system called Adaptive Stream Multicast (ASM) for voice communication over multihop LWNs. ASM is composed of several novel components specially designed to deliver robust voice quality for multiple sinks in dynamic environments: 1) an empirical model to automatically evaluate the voice quality perceived at sinks based on current network condition; 2) a feedback-based Forward Error Correction (FEC) scheme where the source can adapt its coding redundancy ratio dynamically in response to the voice quality variation at sinks; 3) a Tree-based Opportunistic Routing (TOR) protocol that fully exploits the broadcast opportunities on a tree based on novel forwarder selection and coordination rules; and 4) a distributed admission control algorithm that ensures the voice quality guarantees when admitting new voice streams. ASM has been implemented on a low-power hardware platform and extensively evaluated through experiments on a test bed of 18 nodes. The experiment results show that ASM can achieve satisfactory multicast voice quality in dynamic environments while incurring low-communication overhead.

RPR–EPON–WiMAX Hybrid Network: A Solution for Access and Metro Networks

The integration of Ethernet passive optical networks (EPONs) with wireless worldwide interoperability for microwave access (WiMAX) is an approved solution for an access network. A resilient packet ring (RPR) is a good candidate for a metro network. Hence RPR, EPON, and WiMAX integration is a viable solution for metro-access network bridging. The present paper examines such integration, including an architecture and a joint media access control (MAC) protocol, as a solution for both access and metro networks. The proposed architecture is reliable due to the dependability of the RPR standard and the protection mechanism employed in the EPON. Moreover, the architecture contains a high fault tolerance against node and connection failure. The suggested MAC protocol includes a multi-level dynamic bandwidth allocation algorithm, a distributed admission control, a scheduler, and a routing algorithm. This MAC protocol aims at maximizing the advantages of the proposed architecture by distributing its functionalities over different parts of the architecture and jointly executing the parts of the MAC protocol.

Distributed resource management and admission control in wireless ad hoc networks: a practical approach

The authors propose a novel and practical approach to estimate resources and perform a distributed admission control in multi-hop ad hoc networks based on multi-rate enabled IEEE 802.11 technology. The main challenge is to determine if there exist sufficient resources [i.e. the available bandwidth (AB)] for a new incoming flow to be admitted rather than quantifying the exact amount of existing resources. In order to determine the AB along a multi-hop path, the authors take into consideration the channel rate at each hop as well as the channel idle ratio of relevant neighbouring nodes. Furthermore, the admission control is performed at the same time as the AB is determined which minimises overhead. The proposed approach can be applied hop-by-hop in a distributed manner by the end-user, thus being suitable for wireless ad hoc networks. Analysis and simulation based on the Network Simulator version 2 (NS2) platform verify the proposed approach.

Distributed admission control protocol for end-to-end QoS assurance in ad hoc wireless networks

Abstract To reserve end-to-end bandwidth in quality of service (QoS) supported wireless ad hoc networks, local bandwidth requirement should be carefully determined by considering the number of contending nodes in an interference range. In this article, we propose a novel admission control protocol, called DACP (distributed admission control protocol), which is implemented over a reactive ad hoc routing protocol with minimal overhead. DACP computes the required bandwidth for end-to-end band-width provision at each node and estimates the available bandwidth at the medium access control layer. After that, DACP makes a decision for admitting a flow in a per-hop basis. Extensive simulations are carried out via the OPNET simulator. The simulation results demonstrate that DACP not only provides guaranteed end-to-end resource but also reduces the control overhead to provide QoS support, compared with the existing admission control schemes.

Distributed Admission Control in Wireless Mesh Networks: Models, Algorithms, and Evaluation

Wireless mesh networks (WMNs) have attracted increasing attention from the research community as a high-performance and low-cost solution to last-mile broadband Internet access. In WMNs, admission control is deployed to efficiently control different traffic loads and prevent the network from being overloaded. This paper introduces a distributed admission control scheme for WMNs, namely, routing on cliques admission control (RCAC). In particular, we propose an analytical model to compute the appropriate acceptance ratio and guarantee that the packet loss probability (PLP) in the network does not exceed a threshold value. The model also allows computing end-to-end delay to process flow requests with delay constraints. RCAC achieves scalability since it partitions the network into cliques, and only clique heads (CHs) are involved in the admission-control procedure. Using extensive simulations, we demonstrate that our RCAC achieves high resource utilization by providing lower blocking probabilities in a dynamic traffic-load environment while satisfying quality-of-service (QoS) constraints in terms of PLP and end-to-end delay. Moreover, we show that a contention access (CA) enforced with our RCAC outperforms the mesh deterministic access (MDA).