Diabetes mellitus (DM) is a metabolic disorder characterized by blood glucose levels above normal limits. The impact of this disease on the population has increased in recent years. It is already a public health problem worldwide and one of the leading causes of death. Recently, several proposals have been developed for better and regular monitoring of glucose. However, theses proposals do not discard erroneous readings and they are not able to anticipate a critical condition. In this work, we propose an algorithm based on the double moving average supported by an IoT architecture to prevent possible complications in elderly patients. The algorithm uses historical readings to construct a series. Given a number of periods, it is possible to calculate averages of different subsets and trends for the next periods and, in this way, the prognosis is obtained. With the prognosis, it is possible to notify the doctor and relatives in advance about a possible critical condition in the patient. The aim of our work is to validate the architecture and prognosis algorithm used for elderly persons. Tests of the algorithm and the architecture were performed with different readings and it was shown that the system generated corresponding notifications before the glucose values were higher than those defined by the WHO (World Health Organization), thus avoiding unnecessary alarms.

Localization is one of the major problems in mobile wireless sensor networks, since it provides the location of an event occurrence. This paper evaluates the performance of range-based localization algorithms: the multilateration algorithm, the weighted multilateration algorithm, the maximum likelihood algorithm and the multilateration algorithm with a correcting factor. We also propose the weighted multilateration algorithm with a correcting factor through which the localization error is decreased through the addition of a factor that corrects the distance between the node of interest and the reference nodes. Our proposal includes the analysis of noise in the environment due to the time of arrival and the analysis of node of interest’s mobility in the calculation of the correlation matrix of the weighted multilateration algorithm and the calculation of the correcting factor. The localization algorithms analyzed in this study are evaluated in a single-hop scenario and a multi-hop scenario considering a well-defined distribution of the reference nodes and a random distribution of these in both scenarios. The results we obtained varying the number of reference nodes and noise proportion prove that the algorithm we propose yields a better performance than the other analyzed algorithms do, according to the normalized root mean squared error.

Localization is one of the main problems in Mobile Wireless Sensor Networks, since it provides the location of an event occurrence. This paper presents a performance evaluation of the localization algorithms: Multilateration Algorithm, Weighted Multilateration Algorithm and Probabilistic Multilateration Algorithm (PMA). In addition, we propose an Improved Probabilistic Multilateration Algorithm that decreases the localization error of the interest node by using an approach that computes iteratively the position of a node of interest until it reaches the solution that minimizes the localization error. The proposed approach regards the noisy environment by its impact on a correlation matrix that involves the variance of the separation distance between the node of interest and the respective reference nodes (RNs). Furthermore, we also introduce a constant parameter called damping factor; which enhances the convergence of the localization algorithm providing the solution that minimizes the localization error. In this study, we evaluate localization algorithms in a single-hop and multi-hop scenarios considering a distribution with solid geometry of the RNs and randomly distributed RNs in both scenarios. The results we obtained show that our proposed algorithm Improved PMA presents a better performance according to the Normalized Root Mean Squared Error varying the number of reference nodes and noise proportion.

Vehicle traffic surveillance (VTS) systems are based on the automatic analysis of video sequences to detect, classify, and track vehicles in urban environments. The design of new VTS systems requires computationally efficient architectures with high performance in accuracy. Conventional approaches based on multi-stage pipelines have been successfully used during the last decade. However, these systems need to be improved to face the challenges of complex, high-mobility traffic environments. This article proposes an efficient system based on transformer architectures for VTS channels. The proposed analysis system is evaluated in scenarios with high vehicle density and occlusions. The results demonstrate that the proposed scheme reduces the computational complexity required for multi-object detection and tracking and exhibits a Multiple Object Tracking Accuracy (MOTA) of 0.757 and an identity F1 score (IDF1) of 0.832 when compared to conventional multi-stage systems under the same conditions and parameters, along with achieving a high detection precision of 0.934. The results show the viability of implementing the proposed system in practical applications for high-density vehicle VTS channels.

This paper presents a proposal for an architecture in FPGA for the implementation of a low complexity near maximum likelihood (Near-ML) detection algorithm for a multiple input-multiple output (MIMO) quadrature spatial modulation (QSM) transmission system. The proposed low complexity detection algorithm is based on a tree search and a spherical detection strategy. Our proposal was verified in the context of a MIMO receiver. The effects of the finite length arithmetic and limited precision were evaluated in terms of their impact on the receiver bit error rate (BER). We defined the minimum fixed point word size required not to impact performance adversely for $n_T$ transmit antennas and $n_R$ receive antennas. The results showed that the proposal performed very near to optimal with the advantage of a meaningful reduction in the complexity of the receiver. The performance analysis of the proposed detector of the MIMO receiver under these conditions showed a strong robustness on the numerical precision, which allowed having a receiver performance very close to that obtained with floating point arithmetic in terms of BER; therefore, we believe this architecture can be an attractive candidate for its implementation in current communications standards.