Search results for "NETWORKING"
showing 10 items of 1776 documents
Implementation of Universal Digital Architecture using 3D-NoC for Mobile Terminal
2014
International Conference on Control, Decision and Information Technologies (CoDIT), Ecole Natl Ingenieurs Metz, Metz, FRANCE, NOV 03-05, 2014; International audience; The need to integrate multiple wireless communication protocols into a single low-cost flexible hardware platform is prompted by the increasing number of emerging communication protocols and applications in modern embedded systems. So the current challenge is to design of new digital architectures, in addition to its ability to take over of many functions. In this paper we have identified similarities between the despreader units in Rake receiver and the processor element in FFT-SDF (Fast Fourier Transform-Single path Delay Fe…
Topology design to reduce energy consumption of distributed graph filtering in WSN
2017
The large number of nodes forming current sensor networks has made essential to introduce distributed mechanisms in many traditional applications. In the emerging field of graph signal processing, the distributed mechanism of information potentials constitutes a distributed graph filtering process that can be used to solve many different problems. An important limitation of this algorithm is that it is inherently iterative, which implies that the nodes incur in a repeated communication cost along the exchange periods of the filtering process. Since sensor nodes are battery powered and radio communications are one of the most energy demanding operations, in this work, we propose to redesign …
Joint Topology and Radio Resource Optimization for Device-to-Device Based Mobile Social Networks
2018
In this paper, we consider a joint topology and radio resource optimization for device-to-device (D2D) based mobile social networks. The considered social network is an interest based which is modeled as a d -intersection binomial random graph. The Radio network is also modeled as a random graph where an edge between any two distinct nodes is activated with a certain probability that is equivalent to the probability of exceeding a certain signal to interference ratio for that link. The entire network is then modeled as an intersection graph between the social and radio induced graphs. Thereafter, network topology is optimized such that enabled social edges satisfy certain network connectivi…
Towards adaptive localization in wireless sensor networks
2012
It is often useful or even indispensable to know the locations of the nodes in a wireless sensor network (WSN), from both network functionality and applications point of view. A potential yet one of the most challenging method is to utilize received signal strength indicator (RSSI) for distance estimation. Albeit easily adopted, using of RSSI is notorious for imprecise distance estimates which can lead to inaccuracies in location estimates. In this paper, we study RSSI-based localization in WSNs through simulation experiments. We evaluate and compare a hybrid algorithm and its modifications with well-known range-based and range-free localization algorithms. Simulation results indicate that …
Study of periodic Dielectric Frequency-Selective Surfaces under 3D plane wave incidence
2016
A periodic Dielectric Frequency-Selective Surface (DFSS) is studied under 3D plane-wave incidence, whose unit cell in the periodic direction is composed of a dielectric grating and a homogeneous dielectric layer. The structure is excited by a linearly polarized plane-wave. The procedure for computing the Brillouin diagram of the structure under 2D plane-wave incidence with TE or TM polarization was already described by the authors, and the extension to the 3D incidence case has been performed in a similar way. Following the same formalism, it has been obtained the Generalized Scattering Matrix (GSM) of one period of the infinite periodic lattice. This requires the knowledge of the modal spe…
A statistical analysis of the three-fold evolution of genomic compression through frame overlaps in prokaryotes
2007
Abstract Background Among microbial genomes, genetic information is frequently compressed, exploiting redundancies in the genetic code in order to store information in overlapping genes. We investigate the length, phase and orientation properties of overlap in 58 prokaryotic species evaluating neutral and selective mechanisms of evolution. Results Using a variety of statistical null models we find patterns of compressive coding that can not be explained purely in terms of the selective processes favoring genome minimization or translational coupling. The distribution of overlap lengths follows a fat-tailed distribution, in which a significant proportion of overlaps are in excess of 100 base…
Stackelberg Game Theory Based Energy Management Systems in the Presence of Renewable Energy Sources
2021
The game theory concept has been adapted for energy management between energy producers and consumers in the presence of renewable energy sources (RES) and electric vehicles (EVs). The objective of...
NVMM-Oriented Hierarchical Persistent Client Caching for Lustre
2021
In high-performance computing (HPC), data and metadata are stored on special server nodes and client applications access the servers’ data and metadata through a network, which induces network latencies and resource contention. These server nodes are typically equipped with (slow) magnetic disks, while the client nodes store temporary data on fast SSDs or even on non-volatile main memory (NVMM). Therefore, the full potential of parallel file systems can only be reached if fast client side storage devices are included into the overall storage architecture. In this article, we propose an NVMM-based hierarchical persistent client cache for the Lustre file system (NVMM-LPCC for short). NVMM-LPC…
Online topology estimation for vector autoregressive processes in data networks
2017
An important problem in data sciences pertains to inferring causal interactions among a collection of time series. Upon modeling these as a vector autoregressive (VAR) process, this paper deals with estimating the model parameters to identify the underlying causality graph. To exploit the sparse connectivity of causality graphs, the proposed estimators minimize a group-Lasso regularized functional. To cope with real-time applications, big data setups, and possibly time-varying topologies, two online algorithms are presented to recover the sparse coefficients when observations are received sequentially. The proposed algorithms are inspired by the classic recursive least squares (RLS) algorit…
Graph recursive least squares filter for topology inference in causal data processes
2017
In this paper, we introduce the concept of recursive least squares graph filters for online topology inference in data networks that are modelled as Causal Graph Processes (CGP). A Causal Graph Process (CGP) is an auto regressive process in the time series associated to different variables, and whose coefficients are the so-called graph filters, which are matrix polynomials with different orders of the graph adjacency matrix. Given the time series of data at different variables, the goal is to estimate these graph filters, hence the associated underlying adjacency matrix. Previously proposed algorithms have focused on a batch approach, assuming implicitly stationarity of the CGP. We propose…