##
**Building representative-based data aggregation tree in wireless sensor networks.**
*(English)*
Zbl 1191.68067

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

### MSC:

68M10 | Network design and communication in computer systems |

68P99 | Theory of data |

90B18 | Communication networks in operations research |

PDF
BibTeX
XML
Cite

\textit{Y. Zheng} et al., Math. Probl. Eng. 2010, Article ID 732892, 11 p. (2010; Zbl 1191.68067)

### References:

[1] | M. Li, “Fractal time series-a tutorial review,” Mathematical Problems in Engineering, vol. 2010, Article ID 157264, 26 pages, 2010. · Zbl 1191.37002 |

[2] | 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. |

[3] | 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. · Zbl 1189.68114 |

[4] | 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. |

[5] | 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. · Zbl 05340629 |

[6] | 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. · Zbl 05387797 |

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

[8] | 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. |

[9] | H. \cCam, 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. |

[10] | 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. |

[11] | 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. |

[12] | 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. |

[13] | 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. |

[14] | 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. |

[15] | 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. |

[16] | 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. · Zbl 05340528 |

[17] | M. Li and S. C. Lim, “Modeling network traffic using generalized Cauchy process,” Physica A, vol. 387, no. 11, pp. 2584-2594, 2008. |

[18] | M. Li and S. C. Lim, “Power spectrum of generalized Cauchy process,” Telecommunication Systems, vol. 43, no. 3-4, pp. 219-222, 2010. · Zbl 05803253 |

[19] | M. Li, “Generation of teletraffic of generalized Cauchy type,” Physica Scripta, vol. 81, no. 2, Article ID 025007, 10 pages, 2010. · Zbl 1191.90013 |

[20] | 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. · Zbl 05803256 |

[21] | C. Li and W. Zhao, “Stochastic performance analysis of non-feedforward networks,” Telecommunication Systems, vol. 43, no. 3-4, pp. 237-252, 2010. · Zbl 05803255 |

[22] | 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. · Zbl 05803248 |

[23] | S. Uhlig, “On the complexity of Internet traffic dynamics on its topology,” Telecommunication Systems, vol. 43, no. 3-4, pp. 167-180, 2010. · Zbl 05803249 |

[24] | 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. · Zbl 05803250 |

[25] | F. Ricciato, “Traffic monitoring and analysis for the optimization of a 3G network,” IEEE Wireless Communications, vol. 13, no. 6, pp. 42-49, 2006. |

[26] | 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. |

[27] | 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. |

[28] | T. Kohda, “Information sources using chaotic dynamics,” Proceedings of the IEEE, vol. 90, no. 5, pp. 641-661, 2002. |

[29] | A. Abel and W. Schwarz, “Chaos communications-principles, schemes, and system analysis,” Proceedings of the IEEE, vol. 90, no. 5, pp. 691-710, 2002. |

[30] | G. Toma, “Specific differential equations for generating pulse sequences,” Mathematical Problems in Engineering, vol. 2010, Article ID 324818, 11 pages, 2010. · Zbl 1191.37052 |

[31] | 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. · Zbl 1191.35220 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.