Search results for "Networking & Telecommunications"
showing 10 items of 962 documents
Estimation of the Velocity of a Walking Person in Non-Stationary Indoor Environments from the Received RF Signal
2018
Accurate estimation of the time-variant (TV) velocity, i.e., TV speed and TV direction of motion, of walking persons in indoor environment is of great importance in a variety of wireless indoor applications. This paper presents a novel method for estimating the velocity of a walking person in three-dimensional indoor environments, which are assumed to be equipped with a distributed 3 × 3 multiple-input multiple-output (MIMO) system. The approach estimates the TV speed, TV vertical angle-of-motion (VAOM), and TV horizontal angle-of-motion (HAOM) by fitting the spectrogram of the complex channel gain of a non-stationary indoor channel model to the spectrogram obtained from the received radio …
Novel Fault-Tolerant Routing Technique for ZMesh Topology based Network-on-Chip Design
2020
This paper proposes a novel fault-tolerant routing technique for ZMesh topology based Network-on-Chip (NoC) design. The proposed algorithm caters the link faults and routes the data packets seamlessly to the destination. This algorithm has been compared with the existing techniques proposed for mesh topology counterparts. The experimentations have been carried out by increasing ZMesh network size and percentage of link faults. The results show that in the event of link failures the proposed algorithm routes the data from source to destination flawlessly.
A gesture recognition framework for exploring museum exhibitions
2018
In this paper we present a gesture recognition framework for providing the visitors of a museum exhibition with a non intrusive interface for the multimedia enjoyment of digital contents. Early experiments were carried out at the Computer History Museum Exhibition of the University of Palermo.
Enabling Backoff for SCM Wake-Up Radio: Protocol and Modeling
2017
In sub-carrier modulation (SCM) wake-up radio (WuR) enabled wireless sensor networks, a node can initiate data transmission at any instant of time. In this letter, we propose to activate a backoff procedure before sending wake-up calls (WuCs) in order to avoid potential collisions among WuCs. Consequently, no backoff is needed for the main radio after a WuC is received. A discrete-time Markov chain model is developed to evaluate the performance. Numerical results on network throughput, energy efficiency, average delay, and collision probability reveal the benefits of enabling backoff for SCM-WuRs, especially under heavy traffic loads or saturated traffic conditions.
RootsGLOH2: embedding RootSIFT 'square rooting' in sGLOH2
2020
This study introduces an extension of the shifting gradient local orientation histogram doubled (sGLOH2) local image descriptor inspired by RootSIFT ‘square rooting’ as a way to indirectly alter the matching distance used to compare the descriptor vectors. The extended descriptor, named RootsGLOH2, achieved the best results in terms of matching accuracy and robustness among the latest state-of-the-art non-deep descriptors in recent evaluation contests dealing with both planar and non-planar scenes. RootsGLOH2 also achieves a matching accuracy very close to that obtained by the best deep descriptors to date. Beside confirming that ‘square rooting’ has beneficial effects on sGLOH2 as it happe…
Uncommon Suffix Tries
2011
Common assumptions on the source producing the words inserted in a suffix trie with $n$ leaves lead to a $\log n$ height and saturation level. We provide an example of a suffix trie whose height increases faster than a power of $n$ and another one whose saturation level is negligible with respect to $\log n$. Both are built from VLMC (Variable Length Markov Chain) probabilistic sources; they are easily extended to families of sources having the same properties. The first example corresponds to a ''logarithmic infinite comb'' and enjoys a non uniform polynomial mixing. The second one corresponds to a ''factorial infinite comb'' for which mixing is uniform and exponential.
A gap analysis of Internet-of-Things platforms
2016
We are experiencing an abundance of Internet-of-Things (IoT) middleware solutions that provide connectivity for sensors and actuators to the Internet. To gain a widespread adoption, these middleware solutions, referred to as platforms, have to meet the expectations of different players in the IoT ecosystem, including device providers, application developers, and end-users, among others. In this article, we evaluate a representative sample of these platforms, both proprietary and open-source, on the basis of their ability to meet the expectations of different IoT users. The evaluation is thus more focused on how ready and usable these platforms are for IoT ecosystem players, rather than on t…
FIRST
2018
Thanks to the collective action of participating smartphone users, mobile crowdsensing allows data collection at a scale and pace that was once impossible. The biggest challenge to overcome in mobile crowdsensing is that participants may exhibit malicious or unreliable behavior, thus compromising the accuracy of the data collection process. Therefore, it becomes imperative to design algorithms to accurately classify between reliable and unreliable sensing reports. To address this crucial issue, we propose a novel Framework for optimizing Information Reliability in Smartphone-based participaTory sensing (FIRST) that leverages mobile trusted participants (MTPs) to securely assess the reliabil…
Optimized Kernel Entropy Components
2016
This work addresses two main issues of the standard Kernel Entropy Component Analysis (KECA) algorithm: the optimization of the kernel decomposition and the optimization of the Gaussian kernel parameter. KECA roughly reduces to a sorting of the importance of kernel eigenvectors by entropy instead of by variance as in Kernel Principal Components Analysis. In this work, we propose an extension of the KECA method, named Optimized KECA (OKECA), that directly extracts the optimal features retaining most of the data entropy by means of compacting the information in very few features (often in just one or two). The proposed method produces features which have higher expressive power. In particular…
A survey on pseudonym changing strategies for Vehicular Ad-Hoc Networks
2017
International audience; The initial phase of the deployment of vehicular ad-hoc networks (VANETs) has begun and many research challenges still need to be addressed. Location privacy continues to be in the top of these challenges. Indeed, both academia and industry agreed to apply the pseudonym changing approach as a solution to protect the location privacy of VANETs' users. However, due to the pseudonyms linking attack, a simple changing of pseudonym shown to be inefficient to provide the required protection. For this reason, many pseudonym changing strategies have been suggested to provide an effective pseudonym changing. Unfortunately, the development of an effective pseudonym changing st…