Layer-Based Data Aggregation and Performance Analysis in Wireless Sensor Networks

Due to the similarity and correlation among sensed data in wireless sensor network, it is an important way to reduce the number of packets transmitted with data aggregation technology so as to prolong the network lifetime. However, data aggregation is still a challenging issue since quality-of-service, such as end-to-end delay, is generally considered as a severe criterion required in many applications. We focus on the minimum-latency data aggregation problem and proposed a new efficient scheme for it. The basic idea is that we first build an aggregation tree by ordering nodes into layers, and then we proposed a scheduling algorithm on the basis of the aggregation tree to determine the transmission time slots for all nodes in the network with collision avoiding. We have proved that the upper bound for data aggregation with our proposed scheme is bounded by (15R+Δ-15) for wireless sensor networks in two-dimensional space. Extensive simulation results have demonstrated that the proposed scheme has better practical performance compared with related works

A Reliability-Oriented Local-Area Model for Large-Scale Wireless Sensor Networks

Large-scale wireless sensor networks (WSNs) have demonstrated some complex features which are similar to those of other types of complex networks, such as social networks. Based on these complex features, evolution process and characteristic of WSNs, we represent a WSN topologically by building a suitable model, which is named as the reliability-oriented local-area model (ROLM) and aimed at improving the performance of WSNs. For analyzing the performance of the ROLM, we define the reliability as the probability of that the relative error between the measurement and the true value is equal to or less than ε  (ε≥0) and proposed a parameter η to measure the reliability of the network. Based on them, we use η to analyze the influence of network structure on the reliability, and compared the reliabilities of the ROLM and the existing WSNs. Experiment results prove that the large-scale WSN follows a power-law distribution, and it has scale-free characteristic and small world characteristic. And it also shows that, comparing with existing model, ROLM not only balances energy consumption by limiting the connectivity of each node to prolong the lifetime of the network, but also improves the reliability substantially. And the ROLM can be used to express the topology of reliability-oriented WSNs and analyze the structure preferably

Near optimal scheduling of data aggregation in wireless sensor networks

Due to to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper focuses on the latency of data aggregation. Previously, it has been proved that the problem of minimizing the latency of data aggregation is NP-hard [1]. Many approximate algorithms have been proposed to address this issue. Using maximum independent set and first-fit algorithms, in this study we design a scheduling algorithm, Peony-tree-based Data Aggregation (PDA), which has a latency bound of 15R + Delta - 15, where R is the network radius (measured in hops) and Delta is the maximum node degree. We theoretically analyze the performance of PDA based on different network models, and further evaluate it through extensive simulations. Both the analytical and simulation results demonstrate the advantages of PDA over the state-of-art algorithm in [2], which has a latency bound of 23R + Delta - 18. (c) 2011 Elsevier B.V. All rights reserved