Anomaly Detection in UASN Localization Based on Time Series Analysis and Fuzzy Logic

[EN] Underwater acoustic sensor network (UASN) offers a promising solution for exploring underwater resources remotely. For getting a better understanding of sensed data, accurate localization is essential. As the UASN acoustic channel is open and the environment is hostile, the risk of malicious activities is very high, particularly in time-critical military applications. Since the location estimation with false data ends up in wrong positioning, it is necessary to identify and ignore such data to ensure data integrity. Therefore, in this paper, we propose a novel anomaly detection system for UASN localization. To minimize computational power and storage, we designed separate anomaly detection schemes for sensor nodes and anchor nodes. We propose an auto-regressive prediction-based scheme for detecting anomalies at sensor nodes. For anchor nodes, a fuzzy inference system is designed to identify the presence of anomalous behavior. The detection schemes are implemented at every node for enabling identification of multiple and duplicate anomalies at its origin. We simulated the network, modeled anomalies and analyzed the performance of detection schemes at anchor nodes and sensor nodes. The results indicate that anomaly detection systems offer an acceptable accuracy with high true positive rate and F-Score.Das, AP.; Thampi, SM.; Lloret, J. (2020). Anomaly Detection in UASN Localization Based on Time Series Analysis and Fuzzy Logic. Mobile Networks and Applications (Online). 25(1):55-67. https://doi.org/10.1007/s11036-018-1192-y556725

An entropy evaluation algorithm to improve transmission efficiency of compressed data in pervasive healthcare mobile sensor networks

Data transmission is the most critical operation for mobile sensors networks in term of energy waste. Particularly in pervasive healthcare sensors network it is paramount to preserve the quality of service also by means of energy saving policies. Communication and data transmission are among the most critical operation for such devises in term of energy waste. In this paper we present a novel approach to increase battery life-span by means of shorter transmission due to data compression. On the other hand, since this latter operation has a non-neglectable energy cost, we developed a compression efficiency estimator based on the evaluation of the absolute and relative entropy. Such algorithm provides us with a fast mean for the evaluation of data compressibility. Since mobile wireless sensor networks are prone to battery discharge-related problems, such an evaluation can be used to improve the electrical efficiency of data communication. In facts the developed technique, due to its independence from the string or file length, is extremely robust both for small and big data files, as well as to evaluate whether or not to compress data before transmission. Since the proposed solution provides a quantitative analysis of the source's entropy and the related statistics, it has been implemented as a preprocessing step before transmission. A dynamic threshold defines whether or not to invoke a compression subroutine. Such a subroutine should be expected to greatly reduce the transmission length. On the other hand a data compression algorithm should be used only when the energy gain of the reduced transmission time is presumably greater than the energy used to run the compression software. In this paper we developed an automatic evaluation system in order to optimize the data transmission in mobile sensor networks, by compressing data only when this action is presumed to be energetically efficient. We tested the proposed algorithm by using the Canterbury Corpus as well as standard pictorial data as benchmark test. The implemented system has been proven to be time-inexpensive with respect to a compression algorithm. Finally the computational complexity of the proposed approach is virtually neglectable with respect to the compression and transmission routines themselves

Simulation of physical and media access control (MAC) for resilient and scalable wireless sensor networks

The resilience of wireless sensor networks is investigated. A key concept is that scale-free network principles can be adapted to artificially create resilient wireless sensor networks. As scale-free networks are known to be resilient to errors but vulnerable to attack, a strategy using "cold-start" diversity is proposed to reduce the vulnerability to attacks. The IEEE 802.15.4 MAC and ZigBee protocols are investigated for their ability to form resilient clusters. Our investigation reveals there exists deficiencies in these protocols and the possibility of selfdirected and attack-directed denial-of-service is significant. Through insights gained, techniques are recommended to augment the protocols, increasing their resilience without major changes to the standard itself. Since both topological and protocol resilience properties are investigated, our results reveal important insights. Simulation of the physical and media access control layers using ns-2 is carried out to validate key concepts and approach.http://archive.org/details/simulationofphys109452893Approved for public release; distribution is unlimited

Grand challenges in IoT and sensor networks

No abstract available

Network Traffic Prediction Based on Deep Belief Network and Spatiotemporal Compressive Sensing in Wireless Mesh Backbone Networks

Wireless mesh network is prevalent for providing a decentralized access for users and other intelligent devices. Meanwhile, it can be employed as the infrastructure of the last few miles connectivity for various network applications, for example, Internet of Things (IoT) and mobile networks. For a wireless mesh backbone network, it has obtained extensive attention because of its large capacity and low cost. Network traffic prediction is important for network planning and routing configurations that are implemented to improve the quality of service for users. This paper proposes a network traffic prediction method based on a deep learning architecture and the Spatiotemporal Compressive Sensing method. The proposed method first adopts discrete wavelet transform to extract the low-pass component of network traffic that describes the long-range dependence of itself. Then, a prediction model is built by learning a deep architecture based on the deep belief network from the extracted low-pass component. Otherwise, for the remaining high-pass component that expresses the gusty and irregular fluctuations of network traffic, the Spatiotemporal Compressive Sensing method is adopted to predict it. Based on the predictors of two components, we can obtain a predictor of network traffic. From the simulation, the proposed prediction method outperforms three existing methods

Robustness in Weighted Networks with Cluster Structure

The vulnerability of complex systems induced by cascade failures revealed the comprehensive interaction of dynamics with network structure. The effect on cascade failures induced by cluster structure was investigated on three networks, small-world, scale-free, and module networks, of which the clustering coefficient is controllable by the random walk method. After analyzing the shifting process of load, we found that the betweenness centrality and the cluster structure play an important role in cascading model. Focusing on this point, properties of cascading failures were studied on model networks with adjustable clustering coefficient and fixed degree distribution. In the proposed weighting strategy, the path length of an edge is designed as the product of the clustering coefficient of its end nodes, and then the modified betweenness centrality of the edge is calculated and applied in cascade model as its weights. The optimal region of the weighting scheme and the size of the survival components were investigated by simulating the edge removing attack, under the rule of local redistribution based on edge weights. We found that the weighting scheme based on the modified betweenness centrality makes all three networks have better robustness against edge attack than the one based on the original betweenness centrality