Routing Protocol with Optimal Location of Aggregation Point in Wireless Sensor Networks

Abstract A wireless sensor network is typically composed of hundreds, even thousands of tiny sensors used to monitor physical phenomena. As data collected by the sensors are often redundant, data aggregation is important for conserving energy. In this paper, we present a new routing protocol with optimal data aggregation. This routing protocol has good performance due-to its optimal selection of aggregation point locations. This paper details the optimal selection of aggregation point locations.

[1]  Jan M. Rabaey,et al.  Data funneling: routing with aggregation and compression for wireless sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[2]  A. Manjeshwar,et al.  TEEN: a routing protocol for enhanced efficiency in wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[3]  Cheng Shiduan.  A Density Control Algorithm Based on Probability Coverage Model in Wireless Sensor Networks , 2005 .

[4]  David E. Culler,et al.  Calibration as parameter estimation in sensor networks , 2002, WSNA '02.

[5]  Deborah Estrin,et al.  The impact of data aggregation in wireless sensor networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[6]  Krishna M. Sivalingam,et al.  Data Gathering Algorithms in Sensor Networks Using Energy Metrics , 2002, IEEE Trans. Parallel Distributed Syst..

[7]  Yanwei Wang,et al.  Relative location in wireless networks , 2001, IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202).

[8]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[9]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.