Reducing localisation overhead: a ranging protocol and an enhanced algorithm for UWB-based WSNs

International audienceThe ability for the nodes in a Wireless Sensor Network to determine their position is a desirable trait. Routing as well as other client applications can benefit from this information. In this paper, we introduce the results obtained from our UWB-based prototype. We implemented two adaptations of the Symmetric Double-Sided Two-Way Ranging (SDS- TWR) protocol, namely Sequential Symmetric Double-Sided Two- Way Ranging (SSDS-TWR), and Parallel Double-Sided Two-Way Ranging (PDS-TWR), the latter being one of our contributions. PDS-TWR significantly reduces the overhead associated with ranging. We also introduce the enhanced version of our localisation algorithm, inter-Ring Localisation Algorithm (iRingLA), which is a good alternative for conventional trilateration. This new version improves the ability to compute the position when thin rings are used by focusing on the exact intersection: the number of test points remains small and the algorithm can be implemented on computationally constrained platforms. Using PDS-TWR and 2 anchors, we obtained a 2D localisation error of 79cm in an indoor environment

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

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

Localized Mobility Management for SDN-Integrated LTE Backhaul Networks

Small cell (SCell) and Software Define Network (SDN) are two key enablers to meet the evolutional requirements of future telecommunication networks, but still on the initial study stage with lots of challenges faced. In this paper, the problem of mobility management in SDN-integrated LTE (Long Term Evolution) mobile backhaul network is investigated. An 802.1ad double tagging scheme is designed for traffic forwarding between Serving Gateway (S-GW) and SCell with QoS (Quality of Service) differentiation support. In addition, a dynamic localized forwarding scheme is proposed for packet delivery of the ongoing traffic session to facilitate the mobility of UE within a dense SCell network. With this proposal, the data packets of an ongoing session can be forwarded from the source SCell to the target SCell instead of switching the whole forwarding path, which can drastically save the path-switch signalling cost in this SDN network. Numerical results show that compared with traditional path switch policy, more than 50 signalling cost can be reduced, even considering the impact on the forwarding path deletion when session ceases. The performance of data delivery is also analysed, which demonstrates the introduced extra delivery cost is acceptable and even negligible in case of short forwarding chain or large backhaul latency

Sustainable Traffic Aware Duty-Cycle Adaptation in Harvested Multi-Hop Wireless Sensor Networks

International audienceSustainable power management techniques in energy harvesting wireless sensors currently adapt the consumption of sensors to their harvesting rate within the limits of their battery residual energy, but regardless of the traffic profile. To provide a fairer distribution of the energy according to application needs, we propose a new sustainable traffic aware duty-cycle adaptation scheme (STADA) that takes into account the traffic load in addition to previous factors. We evaluate our protocol in the specific context of multi-hop IEEE 802.15.4 beacon-enabled wireless sensor networks powered by solar energy. Simulations show that our solution outperforms traffic-unaware adaptation schemes while minimizing the variance of the quality of service provided to applications

New methods of partial transmit sequence for reducing the high peak-to-average-power ratio with low complexity in the ofdm and f-ofdm systems

The orthogonal frequency division multiplexing system (OFDM) is one of the most important components for the multicarrier waveform design in the wireless communication standards. Consequently, the OFDM system has been adopted by many high-speed wireless standards. However, the high peak-to-average- power ratio (PAPR) is the main obstacle of the OFDM system in the real applications because of the non-linearity nature in the transmitter. Partial transmit sequence (PTS) is one of the effective PAPR reduction techniques that has been employed for reducing the PAPR value 3 dB; however, the high computational complexity is the main drawback of this technique. This thesis proposes novel methods and algorithms for reducing the high PAPR value with low computational complexity depending on the PTS technique. First, three novel subblocks partitioning schemes, Sine Shape partitioning scheme (SS-PTS), Subsets partitioning scheme (Sb-PTS), and Hybrid partitioning scheme (H-PTS) have been introduced for improving the PAPR reduction performance with low computational complexity in the frequency-domain of the PTS structure. Secondly, two novel algorithms, Grouping Complex iterations algorithm (G-C-PTS), and Gray Code Phase Factor algorithm (Gray-PF-PTS) have been developed to reduce the computational complexity for finding the optimum phase rotation factors in the time domain part of the PTS structure. Third, a new hybrid method that combines the Selective mapping and Cyclically Shifts Sequences (SLM-CSS-PTS) techniques in parallel has been proposed for improving the PAPR reduction performance and the computational complexity level. Based on the proposed methods, an improved PTS method that merges the best subblock partitioning scheme in the frequency domain and the best low-complexity algorithm in the time domain has been introduced to enhance the PAPR reduction performance better than the conventional PTS method with extremely low computational complexity level. The efficiency of the proposed methods is verified by comparing the predicted results with the existing modified PTS methods in the literature using Matlab software simulation and numerical calculation. The results that obtained using the proposed methods achieve a superior gain in the PAPR reduction performance compared with the conventional PTS technique. In addition, the number of complex addition and multiplication operations has been reduced compared with the conventional PTS method by about 54%, and 32% for the frequency domain schemes, 51% and 65% for the time domain algorithms, 18% and 42% for the combining method. Moreover, the improved PTS method which combines the best scheme in the frequency domain and the best algorithm in the time domain outperforms the conventional PTS method in terms of the PAPR reduction performance and the computational complexity level, where the number of complex addition and multiplication operation has been reduced by about 51% and 63%, respectively. Finally, the proposed methods and algorithms have been applied to the OFDM and Filtered-OFDM (F-OFDM) systems through Matlab software simulation, where F-OFDM refers to the waveform design candidate in the next generation technology (5G)

Security requirements modelling for virtualized 5G small cell networks

It is well acknowledged that one of the key enabling factors for the realization of future 5G networks will be the small cell (SC) technology. Furthermore, recent advances in the fields of network functions virtualization (NFV) and software-defined networking (SDN) open up the possibility of deploying advanced services at the network edge. In the context of mobile/cellular networks this is referred to as mobile edge computing (MEC). Within the scope of the EU-funded research project SESAME we perform a comprehensive security modelling of MEC-assisted quality-of-experience (QoE) enhancement of fast moving users in a virtualized SC wireless network, and demonstrate it through a representative scenario toward 5G. Our modelling and analysis is based on a formal security requirements engineering methodology called Secure Tropos which has been extended to support MEC-based SC networks. In the proposed model, critical resources which need protection, and potential security threats are identified. Furthermore, we identify appropriate security constraints and suitable security mechanisms for 5G networks. Thus, we reveal that existing security mechanisms need adaptation to face emerging security threats in 5G networks

Beyond cellular green generation: Potential and challenges of the network separation

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. This article introduces the ideas investigated in the BCG2 project of the GreenTouch consortium. The basic concept is to separate signaling and data in the wireless access network. Transmitting the signaling information separately maintains coverage even when the whole data network is adapted to the current load situation. Such network-wide adaptation can power down base stations when no data transmission is needed and, thus, promises a tremendous increase in energy efficiency. We highlight the advantages of the separation approach and discuss technical challenges opening new research directions. Moreover, we propose two analytical models to assess the potential energy efficiency improvement of the BCG2 approach

A Framework for Analyzing Fog-Cloud Computing Cooperation Applied to Information Processing of UAVs

Unmanned aerial vehicles (UAVs) are a relatively new technology. Their application can often involve complex and unseen problems. For instance, they can work in a cooperative-based environment under the supervision of a ground station to speed up critical decision-making processes. However, the amount of information exchanged among the aircraft and ground station is limited by high distances, low bandwidth size, restricted processing capability, and energy constraints. These drawbacks restrain large-scale operations such as large area inspections. New distributed state-of-the-art processing architectures, such as fog computing, can improve latency, scalability, and efficiency to meet time constraints via data acquisition, processing, and storage at different levels. Under these amendments, this research work proposes a mathematical model to analyze distribution-based UAVs topologies and a fog-cloud computing framework for large-scale mission and search operations. The tests have successfully predicted latency and other operational constraints, allowing the analysis of fog-computing advantages over traditional cloud-computing architectures.Comment: Volume 2019, Article ID 7497924, 14 page