Controlled Hopwise Averaging: Bandwidth/Energy-Efficient Asynchronous Distributed Averaging for Wireless Networks

This paper addresses the problem of averaging numbers across a wireless network from an important, but largely neglected, viewpoint: bandwidth/energy efficiency. We show that existing distributed averaging schemes have several drawbacks and are inefficient, producing networked dynamical systems that evolve with wasteful communications. Motivated by this, we develop Controlled Hopwise Averaging (CHA), a distributed asynchronous algorithm that attempts to "make the most" out of each iteration by fully exploiting the broadcast nature of wireless medium and enabling control of when to initiate an iteration. We show that CHA admits a common quadratic Lyapunov function for analysis, derive bounds on its exponential convergence rate, and show that they outperform the convergence rate of Pairwise Averaging for some common graphs. We also introduce a new way to apply Lyapunov stability theory, using the Lyapunov function to perform greedy, decentralized, feedback iteration control. Finally, through extensive simulation on random geometric graphs, we show that CHA is substantially more efficient than several existing schemes, requiring far fewer transmissions to complete an averaging task.Comment: 33 pages, 4 figure

An intelligent path management in heterogeneous vehicular networks

Achieving reliable connectivity in heterogeneous vehicular networks is a challenging task, owing to rapid topological changes and unpredictable vehicle speeds. As vehicular communication demands continue to evolve, multipath connectivity is emerging as an important tool, which promises to enhance network interoperability and reliability. Given the limited coverage area of serving access technologies, frequent disconnections are to be expected as the vehicle moves. To ensure seamless communication in dynamic vehicular environments, an intelligent path management algorithm for Multipath TCP (MPTCP) has been proposed. The algorithm utilizes a network selection mechanism based on Fuzzy Analytic Hierarchy Process (FAHP), which dynamically assigns the most appropriate underlying network for each running application. The selection process takes into account multiple factors, such as path quality, vehicle mobility, and service characteristics. In contrast to existing solutions, our proposed method offers a dynamic and comprehensive approach to network selection that is tailored to the specific needs of each service to ensure that it is always paired with the optimal access technology. The results of the evaluation demonstrate that the proposed method is highly effective in maintaining service continuity during vertical handover. By tailoring the network selection to the specific needs of each application, our path manager is able to ensure optimal connectivity and performance, even in challenging vehicular environments, delivering a better user experience, with more reliable connections, and smoother data transfers.FCT - Fundação para a Ciência e a Tecnologia(PD/BDE/150506/2019

Closing the loop of SIEM analysis to Secure Critical Infrastructures

Critical Infrastructure Protection is one of the main challenges of last years. Security Information and Event Management (SIEM) systems are widely used for coping with this challenge. However, they currently present several limitations that have to be overcome. In this paper we propose an enhanced SIEM system in which we have introduced novel components to i) enable multiple layer data analysis; ii) resolve conflicts among security policies, and discover unauthorized data paths in such a way to be able to reconfigure network devices. Furthermore, the system is enriched by a Resilient Event Storage that ensures integrity and unforgeability of events stored.Comment: EDCC-2014, BIG4CIP-2014, Security Information and Event Management, Decision Support System, Hydroelectric Da

Network selection based on chi-square distance and reputation for internet of things

The internet of things (IoT) has become one of the most important technologies of the 21st century. The IoT environment is composed of heterogeneous IoT communication networks. These technologies are complementary and need to be integrated to meet the requirements of different types of IoT applications that require the mobility of the IoT device under different IoT communication networks. In this paper, the vertical handover decision method is considered to select the appropriate network among different IoT technologies. So, IoT devices, equipped with several radio technologies, can select the most suitable network based on several criteria like quality of service (QoS), cost, power, and security. In this work, a multi-attribute decision-making algorithm (MADM) based on techniques for order preference by similarity to an ideal solution (TOPSIS) that uses chi-square distance instead of Euclidean distance is proposed. The network reputation is added to reduce the average number of handoffs. The proposed algorithm was implemented to select the best technology depending on the requirements of the different IoT traffic classes. The obtained results showed that our proposition outperforms the traditional MADM algorithms

Enhancing cooperation in wireless networks using different concepts of game theory

PhDOptimizing radio resource within a network and across cooperating heterogeneous networks is the focus of this thesis. Cooperation in a multi-network environment is tackled by investigating network selection mechanisms. These play an important role in ensuring quality of service for users in a multi-network environment. Churning of mobile users from one service provider to another is already common when people change contracts and in a heterogeneous communication environment, where mobile users have freedom to choose the best wireless service-real time selection is expected to become common feature. This real time selection impacts both the technical and the economic aspects of wireless network operations. Next generation wireless networks will enable a dynamic environment whereby the nodes of the same or even different network operator can interact and cooperate to improve their performance. Cooperation has emerged as a novel communication paradigm that can yield tremendous performance gains from the physical layer all the way up to the application layer. Game theory and in particular coalitional game theory is a highly suited mathematical tool for modelling cooperation between wireless networks and is investigated in this thesis. In this thesis, the churning behaviour of wireless service users is modelled by using evolutionary game theory in the context of WLAN access points and WiMAX networks. This approach illustrates how to improve the user perceived QoS in heterogeneous networks using a two-layered optimization. The top layer views the problem of prediction of the network that would be chosen by a user where the criteria are offered bit rate, price, mobility support and reputation. At the second level, conditional on the strategies chosen by the users, the network provider hypothetically, reconfigures the network, subject to the network constraints of bandwidth and acceptable SNR and optimizes the network coverage to support users who would otherwise not be serviced adequately. This forms an iterative cycle until a solution that optimizes the user satisfaction subject to the adjustments that the network provider can make to mitigate the binding constraints, is found and applied to the real network. The evolutionary equilibrium, which is used to 3 compute the average number of users choosing each wireless service, is taken as the solution. This thesis also proposes a fair and practical cooperation framework in which the base stations belonging to the same network provider cooperate, to serve each other‘s customers. How this cooperation can potentially increase their aggregate payoffs through efficient utilization of resources is shown for the case of dynamic frequency allocation. This cooperation framework needs to intelligently determine the cooperating partner and provide a rational basis for sharing aggregate payoff between the cooperative partners for the stability of the coalition. The optimum cooperation strategy, which involves the allocations of the channels to mobile customers, can be obtained as solutions of linear programming optimizations