Internet of Things (IoT) can be used to promote many advanced applications by utilizing the sensed data collected from various settings. To reduce the energy consumption of IoT devices, and to extend the lifetime of network, the sensed data are usually compressed before their transmission through Compressed Sensing (CS) theory. By reconstructing the sensed data at the edge of network with more resourceful devices, such as laptops and servers, the intensive computation and energy consumption of the IoT nodes could be effectively offloaded. However, most of the existing data collection schemes are limited in their scalability, because the unified data reconstruction models of them are not suitable for large-scale surveillance scenarios. In our proposed scheme, the whole network is first partitioned into a number of data correlated clusters based on spatial correlation. Then, a data collection tree is built to collect the compressed data in a hybrid mode. Finally, the data reconstruction problem is modelled as a group sparse problem and solved through using an ADMM-based algorithm. The performance of data communication and reconstruction of the proposed scheme is evaluated through experiments with real data set. The experimental results show that the proposed scheme can indeed lower the amount of data transmission, prolong the network life, and achieve a higher level of accuracy in data collection compared to existing data collection schemes.
The low-rank matrix completion problem is fundamental in both machine learning and computer vision fields with many important applications, such as recommendation system, motion capture, face recognition, and image inpainting. In order to avoid solving the rank minimization problem which is NP-hard, several surrogate functions of the rank have been proposed in the literature. However, the matrix restored from the optimization problem based on the existing surrogate functions seriously deviates from the original one. In this paper, we first design a new non-convex Schatten capped p norm which generalizes several existing non-convex matrix norms and balances between the rank and the nuclear norm of the matrix. Then, a matrix completion method based on the Schatten capped p norm is proposed by exploiting the framework of the alternating direction method of multipliers. Meanwhile, the Schatten capped p norm regularized least squares subproblem is analyzed in detail and is solved explicitly. Finally, we evaluate the performance of the proposed matrix completion method based on extensive experiments in the field of image inpainting. All the experimental results demonstrate that the proposed method can indeed improve the accuracy of matrix completion compared with the existing methods.
25 November 2024 in IEEE Transactions on Services Computing
The rapid development of edge computing and the Industrial Internet of Things have facilitated near real-time optimization of compute-intensive industrial tasks. Mobile edge computing (MEC) and device-to-device (D2D) offloading are promising ways to achieve near-real-time optimization. In this paper, We propose a D2D-assisted MEC computing offloading framework by using deep reinforcement Learning (DRL) with entropy and attention mechanism (DMOEA). DMOEA considers interactions among related entities, including horizontal deviceto-device collaboration and vertical device-to-edge offloading. Then, a DRL-based model with multi-actor single-critic structure is designed to solve the offloading strategy. In addition, to further improve efficiency, an attention mechanism is introduced to adapt dynamic changes in network and enhance the exploration ability. The experimental results show that the proposed framework can obtain a fast convergence rate and small oscillation amplitude and also can effectively reduce latency.
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.