4,626 research outputs found
Efficient Data Gathering in Wireless Sensor Networks Based on Matrix Completion and Compressive Sensing
Gathering data in an energy efficient manner in wireless sensor networks is
an important design challenge. In wireless sensor networks, the readings of
sensors always exhibit intra-temporal and inter-spatial correlations.
Therefore, in this letter, we use low rank matrix completion theory to explore
the inter-spatial correlation and use compressive sensing theory to take
advantage of intra-temporal correlation. Our method, dubbed MCCS, can
significantly reduce the amount of data that each sensor must send through
network and to the sink, thus prolong the lifetime of the whole networks.
Experiments using real datasets demonstrate the feasibility and efficacy of our
MCCS method
Collaborative data collection scheme based on optimal clustering for wireless sensor networks
© 2018 by the authors. Licensee MDPI, Basel, Switzerland. In recent years, energy-efficient data collection has evolved into the core problem in the resource-constrained Wireless Sensor Networks (WSNs). Different from existing data collection models in WSNs, we propose a collaborative data collection scheme based on optimal clustering to collect the sensed data in an energy-efficient and load-balanced manner. After dividing the data collection process into the intra-cluster data collection step and the inter-cluster data collection step, we model the optimal clustering problem as a separable convex optimization problem and solve it to obtain the analytical solutions of the optimal clustering size and the optimal data transmission radius. Then, we design a Cluster Heads (CHs)-linking algorithm based on the pseudo Hilbert curve to build a CH chain with the goal of collecting the compressed sensed data among CHs in an accumulative way. Furthermore, we also design a distributed cluster-constructing algorithm to construct the clusters around the virtual CHs in a distributed manner. The experimental results show that the proposed method not only reduces the total energy consumption and prolongs the network lifetime, but also effectively balances the distribution of energy consumption among CHs. By comparing it o the existing compression-based and non-compression-based data collection schemes, the average reductions of energy consumption are 17.9% and 67.9%, respectively. Furthermore, the average network lifetime extends no less than 20-times under the same comparison
A Case for Time Slotted Channel Hopping for ICN in the IoT
Recent proposals to simplify the operation of the IoT include the use of
Information Centric Networking (ICN) paradigms. While this is promising,
several challenges remain. In this paper, our core contributions (a) leverage
ICN communication patterns to dynamically optimize the use of TSCH (Time
Slotted Channel Hopping), a wireless link layer technology increasingly popular
in the IoT, and (b) make IoT-style routing adaptive to names, resources, and
traffic patterns throughout the network--both without cross-layering. Through a
series of experiments on the FIT IoT-LAB interconnecting typical IoT hardware,
we find that our approach is fully robust against wireless interference, and
almost halves the energy consumed for transmission when compared to CSMA. Most
importantly, our adaptive scheduling prevents the time-slotted MAC layer from
sacrificing throughput and delay
Unbalanced Expander Based Compressive Data Gathering in Clustered Wireless Sensor Networks
© 2013 IEEE. CConventional compressive sensing-based data gathering (CS-DG) algorithms require a large number of sensors for each compressive sensing measurement, thereby resulting in high energy consumption in clustered wireless sensor networks (WSNs). To solve this problem, we propose a novel energy-efficient CS-DG algorithm, which exploits the better reconstruction accuracy of the adjacency matrix of an unbalanced expander graph. In the proposed CS-DG algorithm, each measurement is the sum of a few sensory data, which are jointly determined by random sampling and random walks. Through theoretical analysis, we prove that the constructedM×N sparse binary sensing matrix is the adjacency matrix of a (k; ") unbalanced expander graph whenM=D O(N=k) and t=D O.Nc=(kq) for WSNs with Nc clusters, where 0 ≤q≤1 and Nc > k. Simulation results show our proposed CS-DG has better performance than existing algorithms in terms of reconstruction accuracy and energy consumption. When hybrid energy-efficient distributed clustering algorithm is used, to achieve the same reconstruction accuracy, our proposed CS-DG can save energy by at least 27:8%
Efficient performance monitoring for ubiquitous virtual networks based on matrix completion
Inspired by the concept of software-defined network and network function virtualization, vast virtual networks are generated to isolate and share wireless resources for different network operators. To achieve fine-grained resource control and scheduling among virtual networks (VNs), network performance monitoring is essential. However, due to limitation of hardware, real-time performance monitoring is impossible for a complete virtual network. In this paper, taking advantage of the low-rank characteristic of 90 virtual access points (VAPs) measurement data, we propose an intelligent measurement scheme, namely, adaptive and sequential sampling based on matrix completion (MC), which exploits from the MC to construct the complete data of VN performance from a partial direct monitoring data. First, to construct the initial measurement matrix, we propose a sampling correction model based on dispersion and coverage. Second, a stopping condition for the sequential sampling is introduced, based on the stopping condition, the sampling process for a period can stop without waiting for the matrix reconstruction to reach certain of accuracy level. Finally, the sampled VAPs are determined by referring the back-forth completed matrixes\u27 normalized mean absolute error. The experiments show that our approach can achieve a constant network perception and maintain a relatively low error rate with a small sampling rate
Group-Based Data Offloading Techniques Assisted by D2D Communication in 5G Mobile Network
Machine type communication devices proposed as one of the substantial data collections in the 5G of wireless networks. However, the existing mobile communication network is not designed to handle massive access from the MTC devices instead of human type communication. In this context, we propose the device-to-device communication assisted a mobile terminal (smartphone) on data computing, focusing on data generated from a correlated source of machine type communication devices. We consider the scenario that the MTC devices after collecting the data will transmit to a smartphone for computing. With the limitation of computing resources at the smartphone, some data are offloaded to the nearby mobile edge-computing server. By adopting the sensing capability on MTC devices, we use a power exponential function to compute a correlation coefficient existing between the devices. Then we propose two grouping techniques K-Means and hierarchical clustering to combine only the MTC devices, which are spatially correlated. Based on this framework, we compare the energy consumption when all data processed locally at a smartphone or remotely at mobile edge computing server with optimal solution obtained by exhaustive search method. The results illustrated that; the proposed grouping technique reduce the energy consumption at a smartphone while satisfying a required completion time. 
Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks
Spectrum sensing, which aims at detecting spectrum holes, is the precondition
for the implementation of cognitive radio (CR). Collaborative spectrum sensing
among the cognitive radio nodes is expected to improve the ability of checking
complete spectrum usage. Due to hardware limitations, each cognitive radio node
can only sense a relatively narrow band of radio spectrum. Consequently, the
available channel sensing information is far from being sufficient for
precisely recognizing the wide range of unoccupied channels. Aiming at breaking
this bottleneck, we propose to apply matrix completion and joint sparsity
recovery to reduce sensing and transmitting requirements and improve sensing
results. Specifically, equipped with a frequency selective filter, each
cognitive radio node senses linear combinations of multiple channel information
and reports them to the fusion center, where occupied channels are then decoded
from the reports by using novel matrix completion and joint sparsity recovery
algorithms. As a result, the number of reports sent from the CRs to the fusion
center is significantly reduced. We propose two decoding approaches, one based
on matrix completion and the other based on joint sparsity recovery, both of
which allow exact recovery from incomplete reports. The numerical results
validate the effectiveness and robustness of our approaches. In particular, in
small-scale networks, the matrix completion approach achieves exact channel
detection with a number of samples no more than 50% of the number of channels
in the network, while joint sparsity recovery achieves similar performance in
large-scale networks.Comment: 12 pages, 11 figure
- …