Notice of Violation of IEEE Publication PrinciplesA New Automatic Clustering Algorithm via Deadline Timer for Wireless Ad-hoc Sensor Networks

Notice of Violation of IEEE Publication Principles

"A New Automatic Clustering Algorithm via Deadline Timer for Wireless Ad-hoc Sensor Networks,"
by A. Bazregar, A. Movaghar, A. Barati, M.R.E. Nejhad, H. Barati,
in the 3rd International Conference on Information and Communication Technologies: From Theory to Applications, 2008. ICTTA 2008. pp.1-6

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 contains significant duplication of original text from the paper cited below. The original text was copied without attribution 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 paper:

"Automatic Decentralized Clustering for Wireless Sensor Networks"
by Chih-Yu Wen and William A. Sethares,
in EURASIP Journal on Wireless Communications and Networking 2005: 5, 686-697This paper proposes a decentralized algorithm to organize an ad-hoc sensor network into clusters. Each sensor operates independently, monitoring communication among others. Those sensors which have many neighbors that are not already part of a cluster are likely candidates to creating a new cluster by declaring themselves to be a new cluster-head. The clustering algorithm via deadline timer (CADT) provides a protocol whereby this can be achieved and the process continues until all sensors are part of a cluster. Because of the difficulty of analyses simplified models are used to study and abstract its performance. A simple formula to estimate the number of clusters which will be formed in an ad-hoc network is derived based on the analysis, and the results are compared to the behavior of the algorithm in a number of settings.