Calcium requirements for Chinese adults by cross-sectional statistical analyses of calcium balance studies： an individual participant data and aggregate data meta-regression

Background Chinese dietary reference intakes for calcium are largely based on foreign studies. We undertook meta- regression to estimate calcium requirements for Chinese adults derived from calcium balance data in Chinese adults. Methods We searched PubMed, Cochrane CENTRAL, and SinoMed from inception to March 5, 2014, by using a structured search strategy. The bibliographies of any relevant papers and journals were also screened for potentially eligible studies. We extracted a standardized data set from studies in Chinese adults that reported calcium balance data. The relationship between calcium intake and output was examined by an individual participant data （IPD） and aggregate data （AD） meta-regression. Results We identified 11 metabolic studies in Chinese adults within 18-60 years of age. One hundred and forty-one IPD （n=35） expressed as mg/d, 127 IPD （n=32） expressed as mg.kg body wt-l-d-1, and 44 AD （n=132） expressed as mg/d were collected. The models predicted a neutral calcium balance （defined as calcium output （Y） equal to calcium intake （C）） at intakes of 460 mg/d （Y=0.60C＋183.98） and 8.27 mg.kg body wt-l.d-1 （Y=0.60C＋3.33） for IPD, or 409 mg/d （Y=0.66C＋139.00） for AD. Calcium requirements at upper intakes were higher than that at lower intakes in all these models. Conclusion Calcium requirement for Chinese adults 18-60 years of age approximately ranges between 400 mg/d and 500 mg/d when consuming traditional plant-based Chinese diets.

CONSERVATIVE ESTIMATING FUNCTION IN THE NONLINEAR REGRESSION MODEL WITH AGGREGATED DATA

The purpose of this paper is to study the theory of conservative estimating functions in nonlinear regression model with aggregated data. In this model, a quasi-score function with aggregated data is defined. When this function happens to be conservative, it is projection of the true score function onto a class of estimation functions. By constructing, the potential function for the projected score with aggregated data is obtained, which have some properties of log-likelihood function.

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.

Data Aggregation-based Transmission Method in Ultra-Dense Wireless Networks

As the Internet of Things(IoT)advances,machine-type devices are densely deployed and massive networks such as ultra-dense networks(UDNs)are formed.Various devices attend to the network to transmit data using machine-type communication(MTC),whereby numerous,various are generated.MTC devices generally have resource constraints and use wireless communication.In this kind of network,data aggregation is a key function to provide transmission efficiency.It can reduce the number of transmitted data in the network,and this leads to energy saving and reducing transmission delays.In order to effectively operate data aggregation in UDNs,it is important to select an aggregation point well.The total number of transmitted data may vary,depending on the aggregation point to which the data are delivered.Therefore,in this paper,we propose a novel data aggregation scheme to select the appropriate aggregation point and describe the data transmission method applying the proposed aggregation scheme.In addition,we evaluate the proposed scheme with extensive computer simulations.Better performances in the proposed scheme are achieved compared to the conventional approach.

Hierarchical Data Aggregation with Data Offloading Scheme for Fog Enabled IoT Environment

Fog computing is a promising technology that has been emerged to handle the growth of smart devices as well as the popularity of latency-sensitive and location-awareness Internet of Things(IoT)services.After the emergence of IoT-based services,the industry of internet-based devices has grown.The number of these devices has raised from millions to billions,and it is expected to increase further in the near future.Thus,additional challenges will be added to the traditional centralized cloud-based architecture as it will not be able to handle that growth and to support all connected devices in real-time without affecting the user experience.Conventional data aggregation models for Fog enabled IoT environ-ments possess high computational complexity and communication cost.There-fore,in order to resolve the issues and improve the lifetime of the network,this study develops an effective hierarchical data aggregation with chaotic barnacles mating optimizer(HDAG-CBMO)technique.The HDAG-CBMO technique derives afitness function from many relational matrices,like residual energy,average distance to neighbors,and centroid degree of target area.Besides,a chaotic theory based population initialization technique is derived for the optimal initial position of barnacles.Moreover,a learning based data offloading method has been developed for reducing the response time to IoT user requests.A wide range of simulation analyses demonstrated that the HDAG-CBMO technique has resulted in balanced energy utilization and prolonged lifetime of the Fog assisted IoT networks.

Discrete GWO Optimized Data Aggregation for Reducing Transmission Rate in IoT

The conventional hospital environment is transformed into digital transformation that focuses on patient centric remote approach through advanced technologies.Early diagnosis of many diseases will improve the patient life.The cost of health care systems is reduced due to the use of advanced technologies such as Internet of Things(IoT),Wireless Sensor Networks(WSN),Embedded systems,Deep learning approaches and Optimization and aggregation methods.The data generated through these technologies will demand the bandwidth,data rate,latency of the network.In this proposed work,efficient discrete grey wolf optimization(DGWO)based data aggregation scheme using Elliptic curve Elgamal with Message Authentication code(ECEMAC)has been used to aggregate the parameters generated from the wearable sensor devices of the patient.The nodes that are far away from edge node will forward the data to its neighbor cluster head using DGWO.Aggregation scheme will reduce the number of transmissions over the network.The aggregated data are preprocessed at edge node to remove the noise for better diagnosis.Edge node will reduce the overhead of cloud server.The aggregated data are forward to cloud server for central storage and diagnosis.This proposed smart diagnosis will reduce the transmission cost through aggrega-tion scheme which will reduce the energy of the system.Energy cost for proposed system for 300 nodes is 0.34μJ.Various energy cost of existing approaches such as secure privacy preserving data aggregation scheme(SPPDA),concealed data aggregation scheme for multiple application(CDAMA)and secure aggregation scheme(ASAS)are 1.3μJ,0.81μJ and 0.51μJ respectively.The optimization approaches and encryption method will ensure the data privacy.

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.

Efficient Packet Scheduling Technique for Data Merging in Wireless Sensor Networks

Wireless Sensor Networks(WSNs) has become a popular research topic due to its resource constraints. Energy consumption and transmission delay is crucial requirement to be handled to enhance the popularity of WSNs. In order to overcome these issues, we have proposed an Efficient Packet Scheduling Technique for Data Merging in WSNs. Packet scheduling is done by using three levels of priority queue and to reduce the transmission delay. Real-time data packets are placed in high priority queue and Non real-time data packets based on local or remote data are placed on other queues. In this paper, we have used Time Division Multiple Access(TDMA) scheme to efficiently determine the priority of the packet at each level and transmit the data packets from lower level to higher level through intermediate nodes. To reduce the number of transmission, efficient data merge technique is used to merge the data packet in intermediate nodes which has same destination node. Data merge utilize the maximum packet size by appending the merged packets with received packets till the maximum packet size or maximum waiting time is reached. Real-time data packets are directly forwarded to the next node without applying data merge. The performance is evaluated under various metrics like packet delivery ratio, packet drop, energy consumption and delay based on changing the number of nodes and transmission rate. Our results show significant reduction in various performance metrics.

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.

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.

A Trusted NUMFabric Algorithm for Congestion Price Calculation at the Internet-of-Things Datacenter

The important issues of network TCP congestion control are how to compute the link price according to the link status and regulate the data sending rate based on link congestion pricing feedback information.However,it is difficult to predict the congestion state of the link-end accurately at the source.In this paper,we presented an improved NUMFabric algorithm for calculating the overall congestion price.In the proposed scheme,the whole network structure had been obtained by the central control server in the Software Defined Network,and a kind of dual-hierarchy algorithm for calculating overall network congestion price had been demonstrated.In this scheme,the first hierarchy algorithm was set up in a central control server like Opendaylight and the guiding parameter B is obtained based on the intelligent data of global link state information.Based on the historical data,the congestion state of the network and the guiding parameter B is accurately predicted by the machine learning algorithm.The second hierarchy algorithm was installed in the Openflow link and the link price was calculated based on guiding parameter B given by the first algorithm.We evaluate this evolved NUMFabric algorithm in NS3,which demonstrated that the proposed NUMFabric algorithm could efficiently increase the link bandwidth utilization of cloud computing IoT datacenters.

NLDA non-linear regression model for preserving data privacy in wireless sensor networks

Recently,the application of Wireless Sensor Networks(WSNs)has been increasing rapidly.It requires privacy preserving data aggregation protocols to secure the data from compromises.Preserving privacy of the sensor data is a challenging task.This paper presents a non-linear regression-based data aggregation protocol for preserving privacy of the sensor data.The proposed protocol uses non-linear regression functions to represent the sensor data collected from the sensor nodes.Instead of sending the complete data to the cluster head,the sensor nodes only send the coefficients of the non-linear function.This will reduce the communication overhead of the network.The data aggregation is performed on the masked coefficients and the sink node is able to retrieve the approximated results over the aggregated data.The analysis of experiment results shows that the proposed protocol is able to minimize communication overhead,enhance data aggregation accuracy,and preserve data privacy.

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 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.

PVF-DA: Privacy-Preserving, Verifiable and FaultTolerant Data Aggregation in MEC

As an emergent-architecture, mobile edge computing shifts cloud service to the edge of networks. It can satisfy several desirable characteristics for Io T systems. To reduce communication pressure from Io T devices, data aggregation is a good candidate. However, data processing in MEC may suffer from many challenges, such as unverifiability of aggregated data, privacy-violation and fault-tolerance. To address these challenges, we propose PVF-DA: privacy-preserving, verifiable and fault-tolerant data aggregation in MEC based on aggregator-oblivious encryption and zero-knowledge-proof. The proposed scheme can not only provide privacy protection of the reported data, but also resist the collusion between MEC server and corrupted Io T devices. Furthermore, the proposed scheme has two outstanding features: verifiability and strong fault-tolerance. Verifiability can make Io T device to verify whether the reported sensing data is correctly aggregated. Strong fault-tolerance makes the aggregator to compute an aggregate even if one or several Io Ts fail to report their data. Finally, the detailed security proofs are shown that the proposed scheme can achieve security and privacy-preservation properties in MEC.

An Energy-Efficient Mobile Agent-Based Data Aggregation Scheme for Wireless Body Area Networks

Due to the advancement in wireless technology and miniaturization,Wireless Body Area Networks(WBANs)have gained enormous popularity,having various applications,especially in the healthcare sector.WBANs are intrinsically resource-constrained;therefore,they have specific design and development requirements.One such highly desirable requirement is an energy-efficient and reliable Data Aggregation(DA)mechanism for WBANs.The efficient and reliableDAmay ultimately push the network to operate without much human intervention and further extend the network lifetime.The conventional client-serverDAparadigm becomes unsuitable and inefficient for WBANs when a large amount of data is generated in the network.Similarly,in most of the healthcare applications(patient’s critical conditions),it is highly important and required to send data as soon as possible;therefore,reliable data aggregation in WBANs is of great concern.To tackle the shortcomings of the client-serverDAparadigm,theMobile Agent-Basedmechanismproved to be a more workable solution.In aMobile Agent-Based mechanism,a taskspecific mobile agent(code)traverses to the intended sources to gather data.Thesemobile agents travel on a predefined path called itinerary;however,planning a suitable and reliable itinerary for a mobile agent is also a challenging issue inWBANs.This paper presents a new Mobile Agent-Based DA scheme for WBANs,which is energy-efficient and reliable.Firstly,in the proposed scheme,the network is divided into clusters,and cluster-heads are selected.Secondly,a mobile agent is generated from the base station to collect the required data from cluster heads.In the case,if any fault occurs in the existing itinerary,an alternate itinerary is planned in real-time without compromising the network performance.In our simulation-based validation,we have found that the proposed system delivers significantly improved fault-tolerance and reliability with energy-efficiency and extended network lifetime in WBANs.

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.

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.

Shoot Biomass Assessments of the Marine Phanerogam Zostera marina for Two Methods of Data Gathering

In order to compare to data gathering methods for shoot biomass assessments of Zostera marina, we compare two allometric models each one representing a data gathering method, one at leaf level and the other in aggregated form. The first allometric model presented leaf dry weight in terms of leaf length as . The second model is expressed as a several-variables version of the allometric Equation (1) dry weight of each leaf in a given shoot can be considered to be a random variable therefore shoot biomass ws can be represented in the form Both models presented similar determination coefficients values of 0.85 and 0.87 respectively. We found no significant differences between parameters α (p = 0.11) and β (p = 0.50) fitted for each model, showing that both equations conduced to the same result. Moreover, both fitted models presented high Concordance Correlation Coefficients of reproducibility () (0.92 and 0.91). We concluded that for shoot weight assessments if larger samples and faster data processing is required then should model of Equation (2) be used. On the other hand, we proposed model of Equation (1) if data at leaf level is required for other endeavors.