Incorporating Betweenness Centrality in Compressive Sensing for Congestion Detection

This paper presents a new Compressive Sensing (CS) scheme for detecting network congested links. We focus on decreasing the required number of measurements to detect all congested links in the context of network tomography. We have expanded the LASSO objective function by adding a new term corresponding to the prior knowledge based on the relationship between the congested links and the corresponding link Betweenness Centrality (BC). The accuracy of the proposed model is verified by simulations on two real datasets. The results demonstrate that our model outperformed the state-of-the-art CS based method with significant improvements in terms of F-Score

Missing Internet Traffic Reconstruction using Compressive Sampling

Missing traffic is a commonly problem in large-scale network. Because the traffic information is needed by network engineering task for network monitoring, there are several methods that recover the missing problem. In this paper, we proposed missing internet traffic reconstruction based on compressive sampling. The main contributions of this study are as follows: (i) explore the influence of the six missing patterns on the performance of the traffic matrix reconstruction algorithm; (ii) trace the link sensitivity; and (iii) detect the time sensitivity of the network. Using Abilene data, the simulation results show that compressive sampling can perform internet traffic monitoring such as reconstruction from missing traffic, finding link sensitivity, and detecting time sensitivity.

Device-free Localization using Received Signal Strength Measurements in Radio Frequency Network

Device-free localization (DFL) based on the received signal strength (RSS) measurements of radio frequency (RF)links is the method using RSS variation due to the presence of the target to localize the target without attaching any device. The majority of DFL methods utilize the fact the link will experience great attenuation when obstructed. Thus that localization accuracy depends on the model which describes the relationship between RSS loss caused by obstruction and the position of the target. The existing models is too rough to explain some phenomenon observed in the experiment measurements. In this paper, we propose a new model based on diffraction theory in which the target is modeled as a cylinder instead of a point mass. The proposed model can will greatly fits the experiment measurements and well explain the cases like link crossing and walking along the link line. Because the measurement model is nonlinear, particle filtering tracing is used to recursively give the approximate Bayesian estimation of the position. The posterior Cramer-Rao lower bound (PCRLB) of proposed tracking method is also derived. The results of field experiments with 8 radio sensors and a monitored area of 3.5m 3.5m show that the tracking error of proposed model is improved by at least 36 percent in the single target case and 25 percent in the two targets case compared to other models.Comment: This paper has been withdrawn by the author due to some mistake

Compressed Sensing in Multi-Hop Large-Scale Wireless Sensor Networks Based on Routing Topology Tomography

Data acquisition from multi-hop large-scale outdoor wireless sensor network (WSN) deployments for environmental monitoring is full of challenges. This is because of the severe resource constraints on tiny battery-operated motes (e.g., bandwidth, memory, power, and computing capacity), the data acquisition volume from large-scale WSNs, and the highly dynamic wireless link conditions in outdoor harsh communication environments. We present a novel compressed sensing approach, which can recover the sensing data at the sink with high fidelity when a very few data packets need to be collected, leading to a significant reduction of the network transmissions and thus an extension of the WSN lifetime. Interplaying with the dynamic WSN routing topology, the proposed approach is both efficient and simple to implement on the resource-constrained motes without motes' storing of any part of the random projection matrix, as opposed to other existing compressed sensing-based schemes. We further propose a systematic method via machine learning to find a suitable representation basis, for any given WSN deployment and data field, which is both sparse and incoherent with the random projection matrix in compressed sensing for data collection. We validate our approach and evaluate its performance using a real-world outdoor multihop WSN testbed deployment in situ. The results demonstrate that our approach significantly outperforms existing compressed sensing approaches by reducing data recovery errors by an order of magnitude for the entire WSN observation field while drastically reducing wireless communication costs at the same time

Active Topology Inference using Network Coding

Our goal is to infer the topology of a network when (i) we can send probes between sources and receivers at the edge of the network and (ii) intermediate nodes can perform simple network coding operations, i.e., additions. Our key intuition is that network coding introduces topology-dependent correlation in the observations at the receivers, which can be exploited to infer the topology. For undirected tree topologies, we design hierarchical clustering algorithms, building on our prior work. For directed acyclic graphs (DAGs), first we decompose the topology into a number of two-source, two-receiver (2-by-2) subnetwork components and then we merge these components to reconstruct the topology. Our approach for DAGs builds on prior work on tomography, and improves upon it by employing network coding to accurately distinguish among all different 2-by-2 components. We evaluate our algorithms through simulation of a number of realistic topologies and compare them to active tomographic techniques without network coding. We also make connections between our approach and alternatives, including passive inference, traceroute, and packet marking