Notice of Violation of IEEE Publication Principles: Connected Optimal Two-Coverage of Sensor Networks

Abstract

Notice of Violation of IEEE Publication Principles<br><br>"Connected Optimal Two-Coverage of Sensor Networks,"<br>by Z. Yun, J. Teng, Z. Yu, D. Xuan, B. Chen, W. Zhao,<br>in the IEEE/ACM Transactions on Networking, vol.PP, no.99<br><br>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.<br><br>This paper contains significant portions of original text from 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. One author (Ziqiu Yun) was responsible for the violation, and this violation was done without the knowledge of the other authors.<br><br>"Planar Thinnest Deployment Pattern of Congruent Discs which Achieves 2-coverage"<br>by Ge Jun,<br>in his thesis presented at the School of Mathematical Sciences, Soochow University, Suzhou 215006, P. R. China, June 2010.<br><br> <br/> In wireless sensor networks, multiple-coverage, in which each point is covered by more than one sensor, is often required to improve detection quality and achieve high fault tolerance. However, finding optimal patterns that achieve multiple-coverage in a plane remains a long-lasting open problem. We first derive the optimal deployment density bound for two-covered deployment patterns where Voronoi polygons generated by sensor nodes are congruent. We then propose optimal two-coverage patterns based on the optimal bound. We further extend these patterns by considering the connectivity requirement and design a set of optimal patterns that achieve two-coverage and one-, two-, and three-connectivity. We also study optimal patterns under practical considerations. To our knowledge, our work is the very first that proves the optimality of multiple-covered deployment patterns.