Search results for "NETWORKING"
showing 10 items of 1776 documents
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…
The indirect force method
1990
Abstract It is known that the matrix force method shows some advantages over the displacement method for certain classes of problems, particularly in optimization and in the stress concentration analysis. Notwithstanding this, few efforts have been made to employ this method in engineering problems. In this paper, within the elastic analysis of frames and trusses, the indirect force method, utilizing beam-node type finite elements, is proposed. This method is based on the kinematical and mechanical study of nodes and of beams, the latter connected with the nodes by their first extremes according to a preliminary arrangement. In this formulation kinematical singularities are included, in the…
A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms
2013
Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.
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…
Analysis of hazardous chemicals by “stand alone” drift tube ion mobility spectrometry: a review
2020
Ion mobility spectrometry (IMS) is a widely used technique based on gas phase ion separation under an electric field by differences in ion mobilities. In the last decade, IMS techniques have received increased attention due to their high operational speed and sensitivity. Currently, there are different IMS devices focused on solving different analytical performances, mainly based on linear drift tube (DT IMS), traveling wave, and field asymmetric waveform ion mobility spectrometers. In this review we summarize the main applications of DT-IMS devices for the determination of semi-volatile hazardous chemicals such as: illegal drugs, pesticides, explosives, chemical warfare agents, and others,…