By Topic

Notice of Violation of IEEE Publication Principles
Latency optimized workload-based Query Routing Tree algorithm in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mao Yingchi ; College of Computer and Information, Hohai University, Nanjing, China ; Li Xiaofang ; Liang Yi

Notice of Violation of IEEE Publication Principles

"Latency Optimized Workload-based Query Routing Tree Algorithm in Wireless Sensor Networks,"
by Yingchi Mao, Xiaofang Li, Yi Liang,
in the Proceedings of the 2nd International Conference on Information Science and Engineering (ICISE), 2010, December 2010, pp.2159-2162

After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.

This paper was found to be a near verbatim copy of the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.

Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:

"ETC: Energy-driven Tree Construction in Woreless Sensor Networks"
by P. Andreou, A. Pamboris, D. Zeinalipour-Yazti, P.K. Chrysanthis, and G. Samaras,
in the Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware, May 2009, pp. 513-518

Constructing an effective Query Routing Tree is the premise for continuous queries in a Wireless Sensor Networks (WSN). The query routing tree structures can provide sensors with a path to the querying nodes. At present, the data acquisition systems for WSN construct the routing structures in an ad-hoc manner, therefore, there is no guarantee that a given query workload will be distributed equally among all sensors. That leads to data collisions which represent a major source of energy waste. In addition, if the path of query routing is too long, it seriously suffers from the increased data delivery delay. The high end-to-end delay is not acceptable in the delay-constrained applications. In this paper, we present - a data collection timing model for query results acquisition. Based on the timing model, we propose a delay-optimized and workload-based query routing tree construction algorithm, which balances the workload among nodes and optimizes the data delivery delay, thus reducing energy consumption and the data delivery time in the course of data acquisition. The simulation experiments from Intel Research illustrate that the proposed query routing tree algorithm can significantly reduce energy consumption under a variety of conditions and prolong the lifetime of a wireless sensor network.

Published in:

Information Science and Engineering (ICISE), 2010 2nd International Conference on

Date of Conference:

4-6 Dec. 2010