Search results for " computing"

A Dynamic Distributed Algorithm for Multicast Path Setup

2005

In the past few years, there has been a considerable work on multicast route selection techniques, with the aim to design scalable protocols which can guarantee an efficient use of network resources. Steiner tree-based multicast algorithms produce optimal trees, but they are prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require a complete knowledge of the network topology. In this paper, we propose a new distributed approach that is efficient and suitable for real network adoption. Performance evaluation indicates that it outp…

An efficient distributed approach for dynamic multicast trees

2005

In this paper we present a distributed algorithm for constructing efficient multicast trees in large networks. The algorithm allows the set up of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been implemented and extensively tested both in simulation, and on experimental networks. Performance evaluation indicates that our approach outperforms the state-of-the-art distributed algorithms for multicast tree setup, providing good levels of convergence time and communication complexity. Furthermore, we introduce a distributed technique for dynamically updating the multicast tree. The approach monitors the accumulated damage as nodes join or…

Link adaptation with combined optimal frame size and rate selection in error-prone 802.11n networks

2008

In error-prone channel with low SNRs, the network throughput may drop significantly if the packet length becomes too large. On the other hand, too much protocol overhead will be introduced if the packet length is too small. In this paper, we study this tradeoff and propose an adaptive frame size algorithm for A-MPDU in 802.11n networks, which can maximize the throughput by selecting the optimized frame length under different channel conditions. When used together with rate selection, the network throughput can be further improved. Both analytical model and simulation results are presented, demonstrating that our algorithm outperforms the fixed length transmission scheme in 802.11n networks …

From vertical to horizontal architecture

2006

Some of the main challenges related to wireless sensor networks implementation are low-quality communication, energy conservation, resource-constrained computation, distributed network management, data processing and the scalability of the protocols. This combination makes the implementation of software a demanding task and encourages to new approaches when thinking of software architecture.In this paper an architecture combining a low protocol stack with a cross-layer management entity is presented. One of the main ideas behind the architecture presented is to make application programming easier and to simplify the protocol stack in such a way that it would suit better for the limited reso…

A Constructive Arboricity Approximation Scheme

2020

The arboricity \(\varGamma \) of a graph is the minimum number of forests its edge set can be partitioned into. Previous approximation schemes were nonconstructive, i.e., they approximate the arboricity as a value without computing a corresponding forest partition. This is because they operate on pseudoforest partitions or the dual problem of finding dense subgraphs.

On the collision property of chaotic iterations based post-treatments over cryptographic pseudorandom number generators

2018

International audience; There is not a proper mathematical definition of chaos, we have instead a quite big amount of definitions, each of one describes chaos in a more or less general context. Taking in account this, it is clear why it is hard to design an algorithm that produce random numbers, a kind of algorithm that could have plenty of concrete appliceautifat (anul)d bions. However we must use a finite state machine (e.g. a laptop) to produce such a sequence of random numbers, thus it is convenient, for obvious reasons, to redefine those aimed sequences as pseudorandom; also problems arise with floating point arithmetic if one wants to recover some real chaotic property (i.e. propertie…

Parallelization of the Wolff single-cluster algorithm.

2010

A parallel [open multiprocessing (OpenMP)] implementation of the Wolff single-cluster algorithm has been developed and tested for the three-dimensional (3D) Ising model. The developed procedure is generalizable to other lattice spin models and its effectiveness depends on the specific application at hand. The applicability of the developed methodology is discussed in the context of the applications, where a sophisticated shuffling scheme is used to generate pseudorandom numbers of high quality, and an iterative method is applied to find the critical temperature of the 3D Ising model with a great accuracy. For the lattice with linear size L=1024, we have reached the speedup about 1.79 times …

Research Direction for Developing an Infrastructure for Mobile & Wireless Systems: Consensus Report of the NSF Workshop Held on October 15, 2001 …

2002

The recent NSF Workshop on Infrastructure for Mobile and Wireless Systems, held on Oct. 15, 2001 in Phoenix had a goal of defining and establishing a common infrastructure for the discipline of mobile wireless networking. This consensus-based paper is the outcome of that workshop. The paper provides a foundation for implementation, standardization, and further research and discussion on the issues of what should constitute such an infrastructure. Workshop participants came from many different wireless communities, including those of communications, operating systems, core networking, mobility, databases, and middleware. The workshop presented various research directions in the field and inc…

Medical Biometry: Statistics or Black Magic?

2002

Further results on generalized centro-invertible matrices

2019

[EN] This paper deals with generalized centro-invertible matrices introduced by the authors in Lebtahi et al. (Appl. Math. Lett. 38, 106¿109, 2014). As a first result, we state the coordinability between the classes of involutory matrices, generalized centro-invertible matrices, and {K}-centrosymmetric matrices. Then, some characterizations of generalized centro-invertible matrices are obtained. A spectral study of generalized centro-invertible matrices is given. In addition, we prove that the sign of a generalized centro-invertible matrix is {K}-centrosymmetric and that the class of generalized centro-invertible matrices is closed under the matrix sign function. Finally, some algorithms ha…