Power Aware Routing in Mobile Ad Hoc Networks

To support bursty traffic on the Internet (and especially WWW) efficiently, optical burst switching (OBS) is proposed as a way to streamline both protocols and hardware in building the future gener...

Optical burst switching (OBS) - a new paradigm for an optical Internet

Computer communications

In the fifth-generation (5G) mobile communication system, various service requirements of different communication environments are expected to be satisfied. As a new evolution network structure, heterogeneous network (HetNet) has been studied in recent years. Compared with homogeneous networks, HetNets can increase the opportunity in the spatial resource reuse and improve users’ quality of service by developing small cells into the coverage of macrocells. Since there is mutual interference among different users and the limited spectrum resource in HetNets, however, efficient resource allocation (RA) algorithms are vitally important to reduce the mutual interference and achieve spectrum sharing. In this article, we provide a comprehensive survey on RA in HetNets for 5G communications. Specifically, we first introduce the definition and different network scenarios of HetNets. Second, RA models are discussed. Then, we present a classification to analyze current RA algorithms for the existing works. Finally, some challenging issues and future research trends are discussed. Accordingly, we provide two potential structures for 6G communications to solve the RA problems of the next-generation HetNets, such as a learning-based RA structure and a control-based RA structure. The goal of this article is to provide important information on HetNets, which could be used to guide the development of more efficient techniques in this research area.

/pdf/a-survey-on-resource-allocation-for-5g-heterogeneous-4gmdtz8zbn.pdf

A Survey on Resource Allocation for 5G Heterogeneous Networks: Current Research, Future Trends, and Challenges

Next-generation wireless networks must support ultra-reliable, low-latency communication and intelligently manage a massive number of Internet of Things (IoT) devices in real-time, within a highly dynamic environment. This need for stringent communication quality-of-service (QoS) requirements as well as mobile edge and core intelligence can only be realized by integrating fundamental notions of artificial intelligence (AI) and machine learning across the wireless infrastructure and end-user devices. In this context, this paper provides a comprehensive tutorial that introduces the main concepts of machine learning, in general, and artificial neural networks (ANNs), in particular, and their potential applications in wireless communications. For this purpose, we present a comprehensive overview on a number of key types of neural networks that include feed-forward, recurrent, spiking, and deep neural networks. For each type of neural network, we present the basic architecture and training procedure, as well as the associated challenges and opportunities. Then, we provide an in-depth overview on the variety of wireless communication problems that can be addressed using ANNs, ranging from communication using unmanned aerial vehicles to virtual reality and edge caching.For each individual application, we present the main motivation for using ANNs along with the associated challenges while also providing a detailed example for a use case scenario and outlining future works that can be addressed using ANNs. In a nutshell, this article constitutes one of the first holistic tutorials on the development of machine learning techniques tailored to the needs of future wireless networks.

Artificial Neural Networks-Based Machine Learning for Wireless Networks: A Tutorial

Ad hoc networks are wireless mobile networks that can operate without infrastructure and without centralized network management. Traditional techniques of routing are not well adapted. Indeed, their lack of reactivity with respect to the variability of network changes makes them difficult to use. Moreover, conserving energy is a critical concern in the design of routing protocols for ad hoc networks, because most mobile nodes operate with limited battery capacity, and the energy depletion of a node affects not only the node itself but also the overall network lifetime. In all proposed single-path routing schemes a new path-discovery process is required once a path failure is detected, and this process causes delay and wastage of node resources. A multipath routing scheme is an alternative to maximize the network lifetime. In this paper, we propose an energy-efficient multipath routing protocol, called AOMR-LM (Ad hoc On-demand Multipath Routing with Lifetime Maximization), which preserves the residual energy of nodes and balances the consumed energy to increase the network lifetime. To achieve this goal, we used the residual energy of nodes for calculating the node energy level. The multipath selection mechanism uses this energy level to classify the paths. Two parameters are analyzed: the energy threshold beta and the coefficient alpha. These parameters are required to classify the nodes and to ensure the preservation of node energy. Our protocol improves the performance of mobile ad hoc networks by prolonging the lifetime of the network. This novel protocol has been compared with other protocols: AOMDV and ZD-AOMDV. The protocol performance has been evaluated in terms of network lifetime, energy consumption, and end-to-end delay.

/pdf/a-multipath-energy-conserving-routing-protocol-for-wireless-41bmkb3rwr.pdf

A multipath energy-conserving routing protocol for wireless ad hoc networks lifetime improvement

HTTP adaptive streaming (HAS) is a streaming video technique widely used over the Internet. However, it has many drawbacks that degrade its user quality of experience (QoE). Our investigation involves several HAS clients competing for bandwidth inside the same home network. Studies have shown that managing the bandwidth between HAS clients using traffic shaping methods improves the QoE. Additionally, the TCP congestion control algorithm in the HAS server may also impact the QoE because every congestion control variant has its own method to control the congestion window size. Based on previous work, we describe two traffic shaping methods, the Hierarchical Token Bucket shaping Method (HTBM) and the Receive Window Tuning Method (RWTM), as well as four popular congestion control variants: NewReno, Vegas, Illinois, and Cubic. In this paper, our objective is to provide a detailed comparative evaluation of combining these four congestion control variants with these two shaping methods. The main result indicates that Illinois with RWTM offers the best QoE without causing congestion. Results were validated through experimentation and objective QoE analytical criteria.

/pdf/combining-traffic-shaping-methods-with-congestion-control-4d6pxk9wvg.pdf

Combining traffic-shaping methods with congestion control variants for HTTP adaptive streaming

In this paper, we present a novel networking technique based on optical Multi-Band Orthogonal Frequency Division Multiplexing (MB-OFDM). We highlight the interesting features of the solution with respect to existing ones (fully opaque optical networks and transparent networks) for optical metro and core networks. We show that under certain traffic condition MB-OFDM may offer useful flexibility in the context of increasing wavelength bit rates.

/pdf/multi-band-ofdm-for-optical-networking-3iitq0sxwx.pdf

Multi-band OFDM for optical networking

Frequency reuse-1 model is required to satisfy the exponential increase of data demands in mobile networks, such as the Long Term Evolution (LTE) of Universal Mobile Terrestrial radio access System (UMTS). However, the simultaneous usage of the same frequency resources in adjacent LTE cells creates inter-cell interference problems, that mainly affect cell-edge users. Inter-Cell Interference Coordination (ICIC) techniques are proposed to avoid the negative impact of interference on system performance. They establish restrictions on resource usage, such as Fractional Frequency Reuse (FFR), and on power allocation such as Soft Frequency Reuse (SFR). In this paper, we classify the existing ICIC techniques, and investigate the performance of reuse-1, reuse-3, FFR, and SFR schemes under various user distributions, and for various network loads. Performance of cell-center and cell-edge users are inspected, as well as the overall spectral efficiency. System level simulations show the advantages and limitations of each of the examined techniques compared to frequency reuse-1 model under different network loads and user distributions, which helps us to determine the most suitable ICIC technique to be used.

/pdf/classification-and-comparative-analysis-of-inter-cell-4rbpnmdlyx.pdf

Classification and comparative analysis of inter-cell interference coordination techniques in LTE networks

In this article we study the multicast routing problem in all-optical WDM networks under the spare light splitting constraint. To implement a multicast session, several light-trees may have to be used due to the limited fanouts of network nodes. Although many multicast routing algorithms have been proposed in order to reduce the total number of wavelength channels used (total cost) for a multicast session, the maximum number of wavelengths required in one fiber link (link stress) and the end-to-end delay are two parameters which are not always taken into consideration. It is known that the shortest path tree (SPT) results in the optimal end-to-end delay, but it can not be employed directly for multicast routing in sparse light splitting WDM networks. Hence, we propose a novel wavelength routing algorithm which tries to avoid the multicast incapable branching nodes (MIBs, branching nodes without splitting capability) in the shortest-path-based multicast tree to diminish the link stress. Good parts of the shortest-path-tree are retained by the algorithm to reduce the end-to-end delay. The algorithm consists of tree steps: (1) a DijkstraPro algorithm with priority assignment and node adoption is introduced to produce a SPT with up to 38% fewer MIB nodes in the NSF topology and 46% fewer MIB nodes in the USA Longhaul topology, (2) critical articulation and deepest branch heuristics are used to process the MIB nodes, (3) a distance-based light-tree reconnection algorithm is proposed to create the multicast light-trees. Extensive simulations demonstrate the algorithm’s efficiency in terms of link stress and end-to-end delay.

https://hal.archives-ouvertes.fr/hal-00540918/document

Bernard Cousin

Papers

A multipath energy-conserving routing protocol for wireless ad hoc networks lifetime improvement

Combining traffic-shaping methods with congestion control variants for HTTP adaptive streaming

Multi-band OFDM for optical networking

Classification and comparative analysis of inter-cell interference coordination techniques in LTE networks

Avoidance of multicast incapable branching nodes for multicast routing in WDM networks