Search results for " networking"
showing 10 items of 1264 documents
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity
2014
Sensitivity, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstanding open problem, proposed by Nisan and Szegedy [7], is whether sensitivity and block sensitivity are polynomially related. Motivated by the constructions of functions which achieve the largest known separations, we study the relation between 1-certificate complexity and 0-sensitivity and 0-block sensitivity.
A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
2012
In this paper we generalize an encoding method due to Girod (cf. [6]) using prefix codes, that allows a bidirectional decoding of the encoded messages. In particular we generalize it to any finite alphabet A, to any operation defined on A, to any code with finite deciphering delay and to any key x ∈ A+ , on a length depending on the deciphering delay. We moreover define, as in [4], a deterministic transducer for such generalized method. We prove that, fixed a code X ∈ A* with finite deciphering delay and a key x ∈ A *, the transducers associated to different operations are isomorphic as unlabelled graphs. We also prove that, for a fixed code X with finite deciphering delay, transducers asso…
Randomized renaming in shared memory systems.
2021
Abstract Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m . The problem is called tight if m = n , and loose if m > n . In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O ( log n ) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m = ( 1 + ϵ ) ⋅ n and constant ϵ , they achieve a step complexity of O ( log log n ) . In this paper we consider tight as well as loos…
Minimum node weight spanning trees searching algorithm for broadcast transmission in sensor networks
2017
A minimum node weight spanning tree in a weighted, directed graph is a tree whose node with maximum out-weight is minimal among all spanning trees. This type of trees are important because they appear in the solutions of the maximum lifetime broadcasting problem in wireless sensor networks. In a complete graph build of N nodes there are NN-2 spanning trees and to find such trees it is necessary to perform more than O(NN-2) operations. In this paper we propose an algorithm for searching the minimum node weight spanning trees in the graph. In the proposed algorithm, instead of calculating the symbolic determinant of the generalized Laplacian matrix, numerical operations on its exponents are p…
Uncountable Realtime Probabilistic Classes
2018
We investigate the minimal cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On non-unary case, we obtain the same result for double logarithmic space, which is also tight. When replacing the work tape with a few counters, we can still achieve similar results for unary linear-space two-counter automata, unary sublinear-space three-counter automata, and non-unary sublinear-space two-counter automata. We also show how to slightly improve the sublinear-space constructions by using more counters.
The Spanning Tree based Approach for Solving the Shortest Path Problem in Social Graphs
2016
Nowadays there are many social media sites with a very large number of users. Users of social media sites and relationships between them can be modelled as a graph. Such graphs can be analysed using methods from social network analysis (SNA). Many measures used in SNA rely on computation of shortest paths between nodes of a graph. There are many shortest path algorithms, but the majority of them suits only for small graphs, or work only with road network graphs that are fundamentally different from social graphs. This paper describes an efficient shortest path searching algorithm suitable for large social graphs. The described algorithm extends the Atlas algorithm. The proposed algorithm so…
Dsdivn: A Distributed Software-Defined Networking Architecture for Infrastructure-Less Vehicular Networks
2017
International audience; In the last few years, the emerging network architecture paradigm of Software-Defined Networking (SDN), has become one of the most important technology to manage large scale networks such as Vehicular Ad-hoc Networks (VANETs). Recently, several works have shown interest in the use of SDN paradigm in VANETs. SDN brings flexibility, scalability and management facility to current VANETs. However, almost all of proposed Software-Defined VANET (SDVN) architectures are infrastructure-based. This paper will focus on how to enable SDN in infrastructure-less vehicular environments. For this aim, we propose a novel distributed SDN-based architecture for uncovered infrastructur…
A resilient distributed measurement system for smart grid application
2020
Since the production of energy from renewable energy sources is strongly increasing, the migration from the classical electric grid toward the smart grid is becoming a reality. Distribution System Operators, along with the control of the entire network and its stability, need to address the security and the reliability of the communication channels and the data itself. In this paper a solution is proposed to address these issues. It is based on a distributed measurement system that relies on a wireless network as well as a redundant Power Line communication system in order to transfer the electrical measures to a centralized SCADA server. The collected data are used to run a power flow algo…
Similarity of GPS Trajectories Using Dynamic Time Warping: An Application to Cruise Tourism
2019
The aim of this research is to propose an analysis of the trajectories of cruise passengers at their destination using Dynamic Time Warping algorithm. Data collected by means of GPS devices relating to the behavior of cruise passengers in the port of Palermo have been analyzed in order to show similarities and differences among their spatial trajectories at destination. A cluster analysis has been performed in order to identify segments of cruise passengers, based on the similarity of their trajectories. The results have been compared in terms of several metrics derived from GPS tracking data in order to validate the proposed approach. Our findings are of interest from a methodological pers…
Combinatorial Double Auction Radio Resource Allocation Model in Crowd Networks
2018
International audience; Industrial Partners (IPs) with Mobile Network Operators (MNOs) are extending the mobile network infrastructure with Small Cells (SCs) in order to meet the growing mobile traffic demand. Due to the increasing number of telecommunication market competitors and the scarcity of radio resources, static sharing schemes are no more efficient. New dynamic schemes should be considered to meet both user expectations and economic success. In a crowd networking context, we propose in this work a dynamic radio resource scheme based on combinatorial double auctions. The participants in these auctions are the MNOs considered as buyers and the IPs, providers of SCs, considered as se…