Nonlinear Time Series: Computations and ApplicationsView this Special Issue
Research Article | Open Access
Building Representative-Based Data Aggregation Tree in Wireless Sensor Networks
Data aggregation is an essential operation to reduce energy consumption in large-scale wireless sensor networks (WSNs). A compromised node may forge an aggregation result and mislead base station into trusting a false reading. Efficient and secure aggregation scheme is critical in WSN applications due to the stringent resource constraints. In this paper, we propose a method to build up the representative-based aggregation tree in the WSNs such that the sensing data are aggregated along the route from the leaf cell to the root of the tree. In the cinema of large-scale and high-density sensor nodes, representative-based aggregation tree can reduce the data transmission overhead greatly by directed aggregation and cell-by-cell communications. It also provides security services including the integrity, freshness, and authentication, via detection mechanism in the cells.
Wireless sensor networks (WSNs) have been used in many promising applications such as habitat monitoring, battlefield surveillance and target tracking. A larger number of tiny sensors collect measurement data and send them to processing center, which is usually called base station or sink node. However, the communication between sensors and processing center relies on multihop short range radio. As we know, WSNs also suffer from limited energy lifetime, slow computation, small memory, and limited communication capability. Obviously, the data aggregation can greatly reduce the communication consumption by eliminating redundant data in WSNs. It is known that aggregated traffic, modeled as fractal time series with complex characteristic [1, 2], has active applications in network security problems . The study on aggregated traffic is significant in the wireless sensor network.
On the other hand, the sensors even the aggregators are vulnerable to attacks especially if they are not equipped with tamper-resistant hardware. When a sensor or an aggregator is compromised, it is easy for the adversary to inject bogus data into WSNs and change the aggregation results. Some methods have been proposed to solve the problem above. The works [4, 5] use homomorphic encryption function to secure the aggregated data. The work in  proposes secure aggregation tree without persistent cryptographs operations to detect and prevent cheating. The works [7, 8] design the cheating detection mechanisms to guarantee the validation of aggregation data being sent in the WSN. The work in [9–11] depends on the statistical feature of specific aggregation function. However, it is difficult to extend most of them to the large and high-density WSN due to the complexity of the operations or the structures.
In this paper, we propose a method to build the representative-based aggregation tree in the WSN on the basis of the work in  such that the sensing data are aggregated along the route from the leaf cells to the root of the tree. In our scheme, the tree is not built directly on the sensors, but on the nonoverlapping cells which are divided with equal size in the target terrain. A representative sensor in each cell acts in name of the whole cell, including forwarding and aggregation of the sensing data in its cell and the receiving data from the neighbor cells. In the cinema of large-scale and high-density sensor nodes, our scheme cuts down the data transmission overhead from three aspects. The first is that the primary aggregation should be conducted in the cell, based on the observation that the measurement data in one small cell are almost identical. The second is that the aggregation operation in one large-scale network should be directed to avoid the dynamic change of the aggregation topology. The third is using cell-by-cell communication instead of hop by hop communication to reduce the density of communication and the complexity of the aggregation topology in the network. Also, each node in our scheme has a monitoring mechanism similar to the Watchdog that is proposed by Marti et al.  in order to achieve cheating detection. The proposed scheme provides security services including the integrity, freshness, and authentication, via detection mechanism in the cells.
The rest of this paper is organized as follows. Section 2 presents our network model and notations in this paper. Section 3 gives the details of our scheme. Section 4 states the security and communications volume analysis. And section 5 concludes this paper.
2. Network Model and Notations
2.1. Network Model
We assume that the dimensions of the large deployment area are known in advance and the sensor nodes are uniformly distributed in this area. A grid structure is used to divide the target terrain into small nonoverlapping cells of equal areas as Figure 1 shows .
We assume that each node is aware of the dimension and the location of the cell to which it belongs. It is a reasonable assumption since the sensors with locating system are supported by most of current manufactories. It could also be deduced that the sensor node can judge which cells are its neighbor cells.
In our model, each cell has a cell representative which is selected based on its reputation, remained power, and so forth. A monitoring mechanism similar to Watchdog  is set up in each node in order to monitor the cell representative operations. We donate that two cells are the neighbor cells which have the adjacent edge. Due to the broadcast feature of radio channels, the messages in this sensor network are propagated along the neighbor cells—the cells with border line as Figure 2 shows. The dimension of each cell is small enough to allow the radio range of each node to cover its neighbor cells. The messages from non-neighbor cells, even if being detecting, will be ignored automatically by the receiving cells.
The base station is responsible for broadcasting the initial query to the monitoring area, processing received answers for these queries, and deriving meaningful information that reflects the events in the target field . In order to simplify the illustration, the base station is located in the vertex of the target terrain even if base station is not there geographic. This assumption is reasonable since we can get one or more above graphs by rotating and dividing the coordinates if base station is in the boundary or middle of network.
The following notations are used throughout the paper.: The base station: Sensor node and sensor node , respectively: Two network wide shared keys preloaded to each senor node: Total number of nodes in the target terrain: Total number of cells in the target terrain: Reading data from and , respectively: The th cell: Reported data from the cell : The representative of the th cell: The number of nodes in each cell: The minimal number of nodes in one cell requiring to revoke a new : An aggregated function: The th query from BS: Local cell key for the th cell: Local cell key for the cell where BS locates: Intercell key shared between the th and the th cell: Message authentication code computed by using : Message authentication code computed by using : Aggregation data from the cell hop_count: The count of the cells on the route to the base station.
3. The Proposed Scheme
3.1. Main Idea
In a large-scale target terrain, the data aggregation may occur in any corner of network. The aggregating operation is also graduated up to the quietist. Obviously, the directed forwarding and aggregation along a steady skeleton have more advantages considering eliminating the duplicated sensing data and reducing energy consumption. Moreover, building such a steady skeleton in a hop-by-hop manner may not be a good choice in the situation of large-scale and high-density sensor nodes, which would lead to a deep and complex structure of the aggregation skeleton.
In our scheme, the queries from base station are spread along the cell by cell route. We build up an aggregation tree based on the cell. The aggregation data could be directionally delivered to the destination along nonoverlapped cells to avoid duplicated aggregation. The aggregation operations are conducted on each intermediate cell in the tree if necessary. A representative sensor in each cell acts in name of the whole cell, including forwarding and aggregation of the sensing data in its cell and the receiving data from the neighbor cells. Other sensor nodes in the same cell monitor the behavior of their representative by listening to the communication between their representative and the representatives of the neighbor cells.
As the cheating detection mechanism is not the emphasis of our discussion, we build up the tree on the basis of the work in , whereas other monitoring mechanisms could also be used in our scheme. In this cheating detection mechanism, each node monitors the behavior of other nodes within the same cell and then calculates the reputation value for them based on their participation in some cell operations such as sensing, forwarding, and aggregating. If the current representative is detected to be compromised, the revocation mechanism will be started to generate the new representative.
The bootstrap phase occurs in a short duration of time immediately after the network deployment. It is short enough to assume that no attacks are possible during this phase . In this phase the local cell keys and intercell keys shared between two neighbor cells are established. Many works have been done on this kind of topics, such as [13–15]. We adopt the key distribution scheme stated in , which uses similar way as Ren et al. .
In this phase, each sensor node in the cell computes the local cell key which is used to authenticate any communication in the cell by the following format:
where represents bit string concatenation and is the preloaded key.
After that, each node in the cell computes the intercell key which is used to authenticate the communication between and its neighbor cell by the following format:
where is the other preloaded key.
At the end of this phase, each sensor node deletes and to prevent the adversary from getting access and sets its initial hop count value to infinity.
3.3. Cheating Detection Mechanism
To enhance the accuracy of the aggregated data without trimming the abnormal and bogus reading, the cheating detection mechanism based on the reputation proposed in  is introduced into our scheme. We briefly illustrate it for the completeness of the paper.
Since the local and intercell keys have been set up in the network after the bootstrap phase, the behavior of each node is under the detection of all the nodes in the same cell, including the cell representative. As soon as the reads of the cell departure the judgments of t nodes, the representative is responsible for computing the new cell reading. Each node establishes a reputation table to record the amount of positive and negative rating of every behavior of the other nodes in the cell. As soon as the reputation of the representative falls below a certain threshold, the revocation mechanism is triggered to generate a new representative based on the reputation records.
3.4. Building Representative-Based Aggregation Tree (RAT)
Before building RAT, we introduce the packet formats in the whole working phase.
The packets have the following two formats:
where is the representative of the sending cell , is the representative of the receiving cell , and is the representative of parent cell of in the tree.
Now, we propose a distributed algorithm to build RAT along the route of neighbor cells. The distributed algorithm builds the tree from the base station and includes the following steps.
Step 1 (Invitation). The base station locally broadcasts an invitation message to all of its neighbor cells, indicating that they should be its children. Since the base station is the root of the tree, it has no parent and its hop count is zero. The invitation message from the base station is described as the following format:
A node in cell who has joined the tree locally broadcasts the following invitation message: where .
Step 2 (Join). Once the node in the neighbor Cell receives an invitation message, if this cell has not joined the aggregation tree, the node records the sender of the invitation message as its parent node and updates its hop count value as one plus the hop count value in the received invitation message from its parent.
The node joins the tree by sending its parent the following join message: where .
It is possible for a node to receive more than one invitation message. The node just takes the first invitation message as the active invitation due to the first invitation message would have the minimal hop count value normally. Once a node joins the tree, the later received invitation will be recorded for future use if its hop counts value is not bigger than the node’s current hop counts value.
The parent node will record its children by collecting the join messages. A cell is a leaf cell if it does not receive any join messages from any cell which announces to be its child.
Step 3 (Iteration). Repeat Steps 1 and 2 until all cells have joined the tree. The iteration process of invitation and join can be illustrated by Figure 3, where dot arrow line presents invitation message and arrow line presents join message.
3.5. Data Aggregation
An aggregation process begins when (the root of RAT) locally broadcasts a query to its children by the following message:
The data aggregation process includes the following two phases.
Phase 1 (Query spread). In the process of query spread, the intermediate cell propagates the query to its children by the following message:
The representative in a leaf cell can propagate to a node in its cell using the similar message format, if it randomly selects the reading as the reported data. Alternatively, it may take itself as the sensing node for simplify.
Phase 2 (Data aggregation). When a leaf cell receives the query , prepares of some physical phenomena as queried and sends it back to its parent by the following message:
If a node x is selected to report the sensing data in the last phase, it should report its reading to in advance by the following message: where .
When an intermediate cell receives the messages from its leaf, it verifies the for the received data. If it does not match the received data, the reading from is ignored. Otherwise, considers the received data as an input to the aggregation function. After the receives all the readings or data from its children and the reading of the cell , it computes the result of the aggregation function as its report data and sends it to its parent by the following message where .
The data aggregation process also can be illustrated by Figure 3, where dot arrow line presents query message and arrow line presents aggregation message.
4.1. Security Services Provided
The security requirements of data integrity, freshness, and authentication are achieved for the aggregation data in our scheme, since nodes share interkeys with the neighbor cells. As to the query message and the communication within the cell, the nodes in the same cell of the sender can authenticate it instead of the receiver, since nodes share local cell key in each cell. In fact, each monitoring node in the same cell can select some query messages randomly to low the energy consumption and prolong the lifetime of the cell. As the adversary is strong or the application is critical, the confidentiality could be achieved by encrypting the sensing data or aggregation data could be encrypted using inter/local keys.
4.2. Energy Cost Analysis of Data Transmission
Since the cell in RAT only communicates with the neighbor cells, the transmission distance is a constant value for each communication and the energy cost on data transmission is mainly decided by the amount of data transmitted. So, we will discuss the data transmission volume of one response to a query in the RAT. For one response to query, two times of data transmissions are required in one cell. One is that the sensor node reports the sensing data to the representative of the cell. The other is that the representative of the cell reports the aggregation data up to its parent in the tree.
For the data aggregation function with fixed output size, such as min/max, the energy cost on data transmission with any aggregation tree is where is the number of total cells, if we assume that b is the size of measurement data and c is the size of the subordinate in the message transmitted.
For some aggregation functions, the size of the return value is not fixed. It is a function of the total size of input data. We assume that such aggregation functions have fixed compression ratio of , where. As soon as sensing data pass by any one cell in the tree, they would be compressed once. Obviously, the total volume of data transmission in the tree depends on the structure of the aggregation tree. Assuming that each broadcast of the invitation message requires the same time, the first received invitation message should come along with the shortest path from the base station. The messages are only propagated along the neighbor cells that have the adjacent edge. Therefore the parent of one cell must be the upper neighbor or the left neighbor of its. Hence, the aggregation tree we build is an optimal tree with minimal communication cost.
Without losing generality, we still assume that is the size of measurement data and is the size of subordinate in the message. For a given aggregation tree, if denoting the maximal layer of the aggregation tree as , total number of cell nodes as , and the number of layer- node as, the total transmission cost of an aggregation tree is given by
Compared with the aggregation tree built on the hop-by-hop nodes in , the scale of RAT and transmission data are reduced to at least, in which is the number of nodes in one cell. The rate will be reached, if the hop-by-hop aggregation tree is also optimal and the output size of the aggregation function is fixed. Otherwise, we can get better result. In one word, our scheme shows a good property while facing the network of the large scale and high density.
The present results discussed above are assumed to be time invarying within a given interval of time, say , if we select the starting point of time as 0. In this case, we take the parameter as the time scale at which the present algorithm is valid.
Note that a payload has complicated dynamics. The dynamics of traffic payload is strongly related to the selected time scale as can be seen from [17–23] and references therein. In general, traffic is nonlinear with fractal properties. In addition, it is nonstationary at small time scaling and stationary at large time scaling . We now, taking (3.12) as an example, express the payload by
where m (m = 1, 2, ) is the index of the time interval. In this way, the previously discussed results should be all time varying with the index , opening an attractive issue in the field. This point of view may be more agreement with the situation of real computer networks that are complex and dynamical in nature [25–31].
In future, we shall work on the statistics of the present algorithm from a view of nonlinear time series, which is challenging.
In this paper we have proposed a method of establishing the representative-based aggregation tree in WSN, where the network is divided into equal and nonoverlapping cells. In the cinema of large-scale and high-density sensor nodes, representative-based aggregation tree can reduce the data transmission overhead greatly by directed and cell-by-cell aggregating and forwarding. We have given the quantitative analysis of data transmission in the representative-base aggregation tree. At the same time, the monitoring mechanism in the cells prevents the injection of bogus information and forged aggregation values. In the future work, the problems which should be studied further are how to synthetically analyze the aggregated traffic in WSN from the aspect of fractal time series, including the traffic in RAT, to make further view of their characteristic of dynamics and nonlinearity.
This work was supported by the National High Technology Research and Development Program (863) of China under Grant no. 2009AA01Z418 and National Natural Science Foundation of China under Grant no. 60573125, no. 60873264 and no. 60903188.
- M. Li, “Fractal time series—a tutorial review,” Mathematical Problems in Engineering, vol. 2010, Article ID 157264, 26 pages, 2010.
- M. Li and P. Borgnat, “Forward for the special issue on traffic modeling, its computations and applications,” Telecommunication Systems, vol. 43, no. 3-4, pp. 145–146, 2010.
- M. Li and W. Zhao, “Detection of variations of local irregularity of traffic under DDOS flood attack,” Mathematical Problems in Engineering, vol. 2008, Article ID 475878, 11 pages, 2008.
- C. Castelluccia, E. Mykletun, and G. Tsudik, “Efficient aggregation of encrypted data in wireless sensor networks,” in Proceedingsof the 2nd Annual International Conference on Mobile and Ubiquitous Systems-Networking and Services (MobiQuitous '05), pp. 109–117, San Diego, Calif, USA, July 2005.
- D. Westhoff, J. Girao, and M. Acharya, “Concealed data aggregation for reverse multicast traffic in sensor networks: encryption, key distribution, and routing adaptation,” IEEE Transactions on Mobile Computing, vol. 5, no. 10, pp. 1417–1431, 2006.
- K. Wu, D. Dreef, B. Sun, and Y. Xiao, “Secure data aggregation without persistent cryptographic operations in wireless sensor networks,” Ad Hoc Networks, vol. 5, no. 1, pp. 100–111, 2007.
- W. Du, J. Deng, Y. S. Han, and P. K. Varshney, “A witness-based approach for data fusion assurance in wireless sensor networks,” in IEEE Global Telecommunications Conference (GLOBECOM '03), vol. 3, pp. 1435–1439, San Francisco, Calif, USA, 2003.
- H. Alzaid, E. Foo, and J. G. Nieto, “RSDA: reputation-based secure data aggregation in wireless sensor networks,” in Proceedings of the 9th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT '08), pp. 419–424, Dunedin, New Zealand, December 2008.
- H. Çam, S. Özdemir, P. Nair, and D. Muthuavinashiappan, “ESPDA: energy-efficient and secure pattern-based data aggregation for wireless sensor networks,” in Proceedings of the 2nd IEEE International Conference on Sensors, vol. 2, no. 2, pp. 732–736, Toronto, Canada, October 2003.
- L. Hu and D. Evans, “Secure aggregation for wireless networks,” in Proceedings of Workshop on Security and Assurance in Ad Hoc Networks, pp. 384–391, January 2003.
- W. Zhang and G. Cao, “Group rekeying for filtering false data in sensor networks: a predistribution and local collaboration-based approach,” in Proceedings of the 24th Conference of the IEEE Communications Society (INFOCOM '05), vol. 1, pp. 503–514, Miami, Fla, USA, March 2005.
- S. Marti, T. J. Giuli, K. Lai, and M. Baker, “Mitigating routing misbehavior in mobile ad hoc networks,” in Proceedings of the Annual International Conference on Mobile Computing and Networking (MOBICOM '00), pp. 255–265, Boston, Mass, USA, August 2000.
- W. Du, J. Deng, Y. S. Han, S. Chen, and P. K. Varshney, “A key management scheme for wireless sensor networks using deployment knowledge,” in Proceedings of the 23rd Conference of the IEEE Communications Society (INFOCOM '04), vol. 1, pp. 586–597, Hong Kong, March 2004.
- H. Chan, A. Perrig, and D. Song, “Random key predistribution schemes for sensor networks,” in Proceedings of the IEEE Computer Society Symposium on Research in Security and Privacy, pp. 197–213, Berkeley, Calif, USA, May 2003.
- D. Liu and P. Ning, “Establishing pairwise keys in distributed sensor networks,” in Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS '03), pp. 52–61, Washington, DC, USA, October 2003.
- K. Ren, W. Lou, and Y. Zhang, “LEDS: providing location-aware end-to-end data security in wireless sensor networks,” IEEE Transactions on Mobile Computing, vol. 7, no. 5, pp. 585–598, 2008.
- M. Li and S. C. Lim, “Modeling network traffic using generalized Cauchy process,” Physica A, vol. 387, no. 11, pp. 2584–2594, 2008.
- M. Li and S. C. Lim, “Power spectrum of generalized Cauchy process,” Telecommunication Systems, vol. 43, no. 3-4, pp. 219–222, 2010.
- M. Li, “Generation of teletraffic of generalized Cauchy type,” Physica Scripta, vol. 81, no. 2, Article ID 025007, 10 pages, 2010.
- S. Wang, D. Xuan, R. Bettati, and W. Zhao, “Toward statistical QoS guarantees in a differentiated services network,” Telecommunication Systems, vol. 43, no. 3-4, pp. 253–263, 2010.
- C. Li and W. Zhao, “Stochastic performance analysis of non-feedforward networks,” Telecommunication Systems, vol. 43, no. 3-4, pp. 237–252, 2010.
- P. Abry, P. Borgnat, F. Ricciato, A. Scherrer, and D. Veitch, “Revisiting an old friend: on the observability of the relation between long range dependence and heavy tail,” Telecommunication Systems, vol. 43, no. 3-4, pp. 147–165, 2010.
- S. Uhlig, “On the complexity of Internet traffic dynamics on its topology,” Telecommunication Systems, vol. 43, no. 3-4, pp. 167–180, 2010.
- M. Li, W.-S. Chen, and L. Han, “Correlation matching method for the weak stationarity test of LRD traffic,” Telecommunication Systems, vol. 43, no. 3-4, pp. 181–195, 2010.
- F. Ricciato, “Traffic monitoring and analysis for the optimization of a 3G network,” IEEE Wireless Communications, vol. 13, no. 6, pp. 42–49, 2006.
- Z. Lan, Z. Zheng, and Y. Li, “Toward automated anomaly identification in large-scale systems,” IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 2, pp. 174–187, 2010.
- A. Erramilli, M. Roughan, D. Veitch, and W. Willinger, “Self-similar traffic and network dynamics,” Proceedings of the IEEE, vol. 90, no. 5, pp. 800–819, 2002.
- T. Kohda, “Information sources using chaotic dynamics,” Proceedings of the IEEE, vol. 90, no. 5, pp. 641–661, 2002.
- A. Abel and W. Schwarz, “Chaos communications—principles, schemes, and system analysis,” Proceedings of the IEEE, vol. 90, no. 5, pp. 691–710, 2002.
- G. Toma, “Specific differential equations for generating pulse sequences,” Mathematical Problems in Engineering, vol. 2010, Article ID 324818, 11 pages, 2010.
- E. G. Bakhoum and C. Toma, “Mathematical transform of traveling-wave equations and phase aspects of quantum interaction,” Mathematical Problems in Engineering, vol. 2010, Article ID 695208, 15 pages, 2010.
Copyright © 2010 Yanfei Zheng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.