Cloud-Edge Collaborative Federated GAN Based Data Processing for IoT-Empowered Multi-Flow Integrated Energy Aggregation Dispatch

The convergence of Internet of Things(IoT),5G,and cloud collaboration offers tailored solutions to the rigorous demands of multi-flow integrated energy aggregation dispatch data processing.While generative adversarial networks(GANs)are instrumental in resource scheduling,their application in this domain is impeded by challenges such as convergence speed,inferior optimality searching capability,and the inability to learn from failed decision making feedbacks.Therefore,a cloud-edge collaborative federated GAN-based communication and computing resource scheduling algorithm with long-term constraint violation sensitiveness is proposed to address these challenges.The proposed algorithm facilitates real-time,energy-efficient data processing by optimizing transmission power control,data migration,and computing resource allocation.It employs federated learning for global parameter aggregation to enhance GAN parameter updating and dynamically adjusts GAN learning rates and global aggregation weights based on energy consumption constraint violations.Simulation results indicate that the proposed algorithm effectively reduces data processing latency,energy consumption,and convergence time.

Optimizing data aggregation and clustering in Internet of things networks using principal component analysis and Q-learning

The Internet of things(IoT)is a wireless network designed to perform specific tasks and plays a crucial role in various fields such as environmental monitoring,surveillance,and healthcare.To address the limitations imposed by inadequate resources,energy,and network scalability,this type of network relies heavily on data aggregation and clustering algorithms.Although various conventional studies have aimed to enhance the lifespan of a network through robust systems,they do not always provide optimal efficiency for real-time applications.This paper presents an approach based on state-of-the-art machine-learning methods.In this study,we employed a novel approach that combines an extended version of principal component analysis(PCA)and a reinforcement learning algorithm to achieve efficient clustering and data reduction.The primary objectives of this study are to enhance the service life of a network,reduce energy usage,and improve data aggregation efficiency.We evaluated the proposed methodology using data collected from sensors deployed in agricultural fields for crop monitoring.Our proposed approach(PQL)was compared to previous studies that utilized adaptive Q-learning(AQL)and regional energy-aware clustering(REAC).Our study outperformed in terms of both network longevity and energy consumption and established a fault-tolerant network.

An efficient data aggregation scheme with local differential privacy in smart grid

By integrating the traditional power grid with information and communication technology, smart grid achieves dependable, efficient, and flexible grid data processing. The smart meters deployed on the user side of the smart grid collect the users' power usage data on a regular basis and upload it to the control center to complete the smart grid data acquisition. The control center can evaluate the supply and demand of the power grid through aggregated data from users and then dynamically adjust the power supply and price, etc. However, since the grid data collected from users may disclose the user's electricity usage habits and daily activities, privacy concern has become a critical issue in smart grid data aggregation. Most of the existing privacy-preserving data collection schemes for smart grid adopt homomorphic encryption or randomization techniques which are either impractical because of the high computation overhead or unrealistic for requiring a trusted third party.

Data Aggregation Scheduling with Guaranteed Lifetime and Efficient Latency in Wireless Sensor Networks

In scenarios of real-time data collection of long-term deployed Wireless Sensor Networks （WSNs）, low-latency data collection with long net- work lifetime becomes a key issue. In this paper, we present a data aggregation scheduling with guaran- teed lifetime and efficient latency in WSNs. We first Construct a Guaranteed Lifetime Mininmm Ra- dius Data Aggregation Tree （GLMRDAT） which is conducive to reduce scheduling latency while pro- viding a guaranteed network lifetime, and then de-sign a Greedy Scheduling algorithM （GSM） based on finding the nmzximum independent set in conflict graph to schedule he transmission of nodes in the aggregation tree. Finally, simulations show that our proposed approach not only outperfonm the state-of-the-art solutions in terms of schedule latency, but also provides longer and guaranteed network lifetilre.

A Survey on the Privacy-Preserving Data Aggregation in Wireless Sensor Networks

Wireless sensor networks(WSNs)consist of a great deal of sensor nodes with limited power,computation,storage,sensing and communication capabilities.Data aggregation is a very important technique,which is designed to substantially reduce the communication overhead and energy expenditure of sensor node during the process of data collection in a WSNs.However,privacy-preservation is more challenging especially in data aggregation,where the aggregators need to perform some aggregation operations on sensing data it received.We present a state-of-the art survey of privacy-preserving data aggregation in WSNs.At first,we classify the existing privacy-preserving data aggregation schemes into different categories by the core privacy-preserving techniques used in each scheme.And then compare and contrast different algorithms on the basis of performance measures such as the privacy protection ability,communication consumption,power consumption and data accuracy etc.Furthermore,based on the existing work,we also discuss a number of open issues which may intrigue the interest of researchers for future work.

Differentially Private Support Vector Machines with Knowledge Aggregation

With the widespread data collection and processing,privacy-preserving machine learning has become increasingly important in addressing privacy risks related to individuals.Support vector machine(SVM)is one of the most elementary learning models of machine learning.Privacy issues surrounding SVM classifier training have attracted increasing attention.In this paper,we investigate Differential Privacy-compliant Federated Machine Learning with Dimensionality Reduction,called FedDPDR-DPML,which greatly improves data utility while providing strong privacy guarantees.Considering in distributed learning scenarios,multiple participants usually hold unbalanced or small amounts of data.Therefore,FedDPDR-DPML enables multiple participants to collaboratively learn a global model based on weighted model averaging and knowledge aggregation and then the server distributes the global model to each participant to improve local data utility.Aiming at high-dimensional data,we adopt differential privacy in both the principal component analysis(PCA)-based dimensionality reduction phase and SVM classifiers training phase,which improves model accuracy while achieving strict differential privacy protection.Besides,we train Differential privacy(DP)-compliant SVM classifiers by adding noise to the objective function itself,thus leading to better data utility.Extensive experiments on three high-dimensional datasets demonstrate that FedDPDR-DPML can achieve high accuracy while ensuring strong privacy protection.

An Efficient and Privacy-Preserving Data Aggregation Scheme Supporting Arbitrary Statistical Functions in IoT

The Internet of Things(IoT)has profoundly impacted our lives and has greatly revolutionized our lifestyle.The terminal devices in an IoT data aggregation application sense real-time data for the remote cloud server to achieve intelligent decisions.However,the high frequency of collecting user data will raise people concerns about personal privacy.In recent years,many privacy-preserving data aggregation schemes have been proposed.Unfortunately,most existing schemes cannot support either arbitrary aggregation functions,or dynamic user group management,or fault tolerance.In this paper,we propose an efficient and privacy-preserving data aggregation scheme.In the scheme,we design a lightweight encryption method to protect the user privacy by using a ring topology and a random location sequence.On this basis,the proposed scheme supports not only arbitrary aggregation functions,but also flexible dynamic user management.Furthermore,the scheme achieves faulttolerant capabilities by utilizing a future data buffering mechanism.Security analysis reveals that the scheme can achieve the desired security properties,and experimental evaluation results show the scheme's efficiency in terms of computational and communication overhead.

A Path-Based Approach for Data Aggregation in Grid-Based Wireless Sensor Networks

Sensor nodes in a wireless sensor network （WSN） are typically powered by batteries, thus the energy is constrained. It is our design goal to efficiently utilize the energy of each sensor node to extend its lifetime, so as to prolong the lifetime of the whole WSN. In this paper, we propose a path-based data aggregation scheme （PBDAS） for grid-based wireless sensor networks. In order to extend the lifetime of a WSN, we construct a grid infrastructure by partitioning the whole sensor field into a grid of cells. Each cell has a head responsible for aggregating its own data with the data sensed by the others in the same cell and then transmitting out. In order to efficiently and rapidly transmit the data to the base station （BS）, we link each cell head to form a chain. Each cell head on the chain takes turn becoming the chain leader responsible for transmitting data to the BS. Aggregated data moves from head to head along the chain, and finally the chain leader transmits to the BS. In PBDAS, only the cell heads need to transmit data toward the BS. Therefore, the data transmissions to the BS substantially decrease. Besides, the cell heads and chain leader are designated in turn according to the energy level so that the energy depletion of nodes is evenly distributed. Simulation results show that the proposed PBDAS extends the lifetime of sensor nodes, so as to make the lifetime of the whole network longer.

Research on stateful public key based secure data aggregation model for wireless sensor networks

Data aggregation technology reduces traffic overhead of wireless sensor network and extends effective working time of the network,yet continued operation of wireless sensor networks increases the probability of aggregation nodes being captured and probability of aggregated data being tampered.Thus it will seriously affect the security performance of the network. For network security issues,a stateful public key based SDAM( secure data aggregation model) is proposed for wireless sensor networks( WSNs),which employs a new stateful public key encryption to provide efficient end-to-end security. Moreover,the security aggregation model will not impose any bound on the aggregation function property,so as to realize the low cost and high security level at the same time.

A Differentially Private Data Aggregation Method Based on Worker Partition and Location Obfuscation for Mobile Crowdsensing

With the popularity of sensor-rich mobile devices,mobile crowdsensing(MCS)has emerged as an effective method for data collection and processing.However,MCS platform usually need workers’precise locations for optimal task execution and collect sensing data from workers,which raises severe concerns of privacy leakage.Trying to preserve workers’location and sensing data from the untrusted MCS platform,a differentially private data aggregation method based on worker partition and location obfuscation(DP-DAWL method)is proposed in the paper.DP-DAWL method firstly use an improved K-means algorithm to divide workers into groups and assign different privacy budget to the group according to group size(the number of workers).Then each worker’s location is obfuscated and his/her sensing data is perturbed by adding Laplace noise before uploading to the platform.In the stage of data aggregation,DP-DAWL method adopts an improved Kalman filter algorithm to filter out the added noise(including both added noise of sensing data and the system noise in the sensing process).Through using optimal estimation of noisy aggregated sensing data,the platform can finally gain better utility of aggregated data while preserving workers’privacy.Extensive experiments on the synthetic datasets demonstrate the effectiveness of the proposed method.

Secure Data Aggregation Approach Based on Monitoring in Wireless Sensor Networks

In order to avoid internal attacks during data aggregation in wireless sensor networks, a grid-based network architecture fit for monitoring is designed and the algorithms for network division, initialization and grid tree construction are presented. The characteristics of on-off attacks are first studied and monitoring mechanisms are then designed for sensor nodes. A Fast Detection and Slow Recovery (FDSR) algorithm is proposed to prevent on-off attacks by observing the behaviors of the nodes and computing reputations. A recovery mechanism is designed to isolate malicious nodes by identifying the new roles of nodes and updating the grid tree. In the experiments, some situations of on-off attacks are simulated and the results are compared with other approaches. The experimental results indicate that our approach can detect malicious nodes effectively and guarantee secure data aggregation with acceptable energy consumption.

Distributed Weighted Data Aggregation Algorithm in End-to-Edge Communication Networks Based on Multi-armed Bandit

As a combination of edge computing and artificial intelligence,edge intelligence has become a promising technique and provided its users with a series of fast,precise,and customized services.In edge intelligence,when learning agents are deployed on the edge side,the data aggregation from the end side to the designated edge devices is an important research topic.Considering the various importance of end devices,this paper studies the weighted data aggregation problem in a single hop end-to-edge communication network.Firstly,to make sure all the end devices with various weights are fairly treated in data aggregation,a distributed end-to-edge cooperative scheme is proposed.Then,to handle the massive contention on the wireless channel caused by end devices,a multi-armed bandit(MAB)algorithm is designed to help the end devices find their most appropriate update rates.Diffe-rent from the traditional data aggregation works,combining the MAB enables our algorithm a higher efficiency in data aggregation.With a theoretical analysis,we show that the efficiency of our algorithm is asymptotically optimal.Comparative experiments with previous works are also conducted to show the strength of our algorithm.

READA: Redundancy Elimination for Accurate Data Aggregation in Wireless Sensor Networks

In monitoring systems, multiple sensor nodes can detect a single target of interest simultaneously and the data collected are usually highly correlated and redundant. If each node sends data to the base station, energy will be wasted and thus the network energy will be depleted quickly. Data aggregation is an important paradigm for compressing data so that the energy of the network is spent efficiently. In this paper, a novel data aggregation algorithm called Redundancy Elimination for Accurate Data Aggregation (READA) has been proposed. By exploiting the range of spatial correlations of data in the network, READA applies a grouping and compression mechanism to remove duplicate data in the aggregated set of data to be sent to the base station without largely losing the accuracy of the final aggregated data. One peculiarity of READA is that it uses a prediction model derived from cached values to confirm whether any outlier is actually an event which has occurred. From the various simulations conducted, it was observed that in READA the accuracy of data has been highly preserved taking into consideration the energy dissipated for aggregating the

AEESPAN: Automata Based Energy Efficient Spanning Tree for Data Aggregation in Wireless Sensor Networks

In Wireless Sensor Networks (WSNs), sensor nodes are developed densely. They have limit processing ca-pability and low power resources. Thus, energy is one of most important constraints in these networks. In some applications of sensor networks, sensor nodes sense data from the environment periodically and trans-mit these data to sink node. In order to decrease energy consumption and so, increase network’s lifetime, volume of transmitted data should be decreased. A solution, which is suggested, is aggregation. In aggrega-tion mechanisms, the nodes aggregate received data and send aggregated result instead of raw data to sink, so, the volume of the transmitted data is decreased. Aggregation algorithms should construct aggregation tree and transmit data to sink based on this tree. In this paper, we propose an automaton based algorithm to con-struct aggregation tree by using energy and distance parameters. Automaton is a decision-making machine that is able-to-learn. Since network’s topology is dynamic, algorithm should construct aggregation tree peri-odically. In order to aware nodes of topology and so, select optimal path, routing packets must be flooded in entire network that led to high energy consumption. By using automaton machine which is in interaction with environment, we solve this problem based on automat learning. By using this strategy, aggregation tree is reconstructed locally, that result in decreasing energy consumption. Simulation results show that the pro-posed algorithm has better performance in terms of energy efficiency which increase the network lifetime and support better coverage.

Investigating Approaches of Data Integrity Preservation for Secure Data Aggregation in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) typically use in-network processing to reduce the communication overhead. Due to the fusion of data items sourced at different nodes into a single one during in-network processing, the sanctity of the aggregated data needs to be ensured. Especially, the data integrity of the aggregated result is critical as any malicious update to it can jeopardize not one, but many sensor readings. In this paper, we analyse three different approaches to providing integrity support for SDA in WSNs. The first one is traditional MAC, in which each leaf node and intermediate node share a key with parent (symmetric key). The second is aggregate MAC (AMAC), in which a base station shares a unique key with all the other sensor nodes. The third is homomorphic MAC (Homo MAC) that is purely symmetric key-based approach. These approaches exhibit diverse trade-off in resource consumption and security assumptions. Adding together to that, we also propose a probabilistic and improved variant of homomorphic MAC that improves the security strength for secure data aggregation in WSNs. We carry out simulations in TinyOS environment to experimentally evaluate the impact of each of these on the resource consumption in WSNs.

Injury severity analysis： comparison of multilevel logistic regression models and effects of collision data aggregation

This paper describes an empirical study aiming at identifying the main differences between different logistic regression models and collision data aggregation methods that are commonly applied in road safety literature for modeling collision severity. In particular, the research compares three popular multilevel logistic models （i.e., sequential binary logit models, ordered logit models, and multinomial logit models） as well as three data aggregation methods （i.e., occupant based, vehicle based, and collision based）. Six years of collision data （2001-2006） from 31 highway routes from across the province of Ontario, Canada were used for this analysis. It was found that a multilevel multinomial logit model has the best fit to the data than the other two models while the results obtained from occupant-based data are more reliable than those from vehicle- and collision-based data. More importantly, while generally consistent in terms of factors that were found to be significant between different models and data aggregation methods, the effect size of each factor differ sub- stantially, which could have significant implications forevaluating the effects of different safety-related policies and countermeasures.

A Granularity-Aware Parallel Aggregation Method for Data Streams

This paper focuses on the parallel aggregation processing of data streams based on the shared-nothing architecture. A novel granularity-aware parallel aggregating model is proposed. It employs parallel sampling and linear regression to describe the characteristics of the data quantity in the query window in order to determine the partition granularity of tuples, and utilizes equal depth histogram to implement partitio ning. This method can avoid data skew and reduce communi cation cost. The experiment results on both synthetic data and actual data prove that the proposed method is efficient, practical and suitable for time-varying data streams processing.

SAC-TA: A Secure Area Based Clustering for Data Aggregation Using Traffic Analysis in WSN

Clustering is the most significant task characterized in Wireless Sensor Networks (WSN) by data aggregation through each Cluster Head (CH). This leads to the reduction in the traffic cost. Due to the deployment of the WSN in the remote and hostile environments for the transmission of the sensitive information, the sensor nodes are more prone to the false data injection attacks. To overcome these existing issues and enhance the network security, this paper proposes a Secure Area based Clustering approach for data aggregation using Traffic Analysis (SAC-TA) in WSN. Here, the sensor network is clustered into small clusters, such that each cluster has a CH to manage and gather the information from the normal sensor nodes. The CH is selected based on the predefined time slot, cluster center, and highest residual energy. The gathered data are validated based on the traffic analysis and One-time Key Generation procedures to identify the malicious nodes on the route. It helps to provide a secure data gathering process with improved energy efficiency. The performance of the proposed approach is compared with the existing Secure Data Aggregation Technique (SDAT). The proposed SAC-TA yields lower average energy consumption rate, lower end-to-end delay, higher average residual energy, higher data aggregation accuracy and false data detection rate than the existing technique.

Green Architecture for Dense Home Area Networks Based on Radio-over-Fiber with Data Aggregation Approach

The high-density population leads to crowded cities. The future city is envisaged to encompass a large-scale network with diverse applications and a massive number of interconnected heterogeneous wireless-enabled devices. Hence, green technology elements are crucial to design sustainable and future-proof network architectures. They are the solutions for spectrum scarcity, high latency, interference, energy efficiency, and scalability that occur in dense and heterogeneous wireless networks especially in the home area network （HAN）. Radio-over-fiber （ROF） is a technology candidate to provide a global view of HAN＇s activities that can be leveraged to allocate orthogonal channel communications for enabling wireless-enabled HAN devices transmission, with considering the clustered-frequency-reuse approach. Our proposed network architecture design is mainly focused on enhancing the network throughput and reducing the average network communications latency by proposing a data aggregation unit （DAU）. The performance shows that with the DAU, the average network communications latency reduces significantly while the network throughput is enhanced, compared with the existing ROF architecture without the DAU.

A Power Efficient Aggregation of Encrypted Data in Wireless Sensor Network

In-network data aggregation in wireless sensor network has been shown to improve scalability, prolong sensor network lifetimes and diminish computational demands. However, the node that plays the role of data aggregation will consume much more energy than common nodes and may quit the mission in advance due to energy exhausting because of taxing decryption and re-encryption operation; moreover, it will bring complex key management to ensure the security of the data and corresponding keys. This paper was designed specifically to address above problem based on the thought of privacy homomorphism, It can achieve the perfect security level equal to one-time pad with much lower energy consumption; moreover, it can be proved to resist the attack of node capture. Using the simulation and analysis, we show that our scheme consume the energy only about 21% of AED scheme.