Construction and Optimization of Biconnected and Wide-Coverage Topology Based on Node Mobility

Round 1

Reviewer 1 Report

See the attached document.

Comments for author File: Comments.pdf

Author Response

Please see the attachment.

Author Response File: Author Response.pdf

Reviewer 2 Report

This paper is about an NNR based approach to the sensor coverage problem. The contribution of this paper is to improve the coverage while minimizing the distance movements, and maximizing the resistance to failure (maintain connectivity). The approach was compared to a simplified version of NNR, and the method introduced in this paper outperformed the existing one in all aspects, namely coverage percentage, uncertainty resistance, as well as average movements.

The paper is well-written and easy to follow. The related work, however, lacks coverage of broader "coverage problems" and sensor planning·

The evaluation should be extended to compare with other coverage approaches. For example, the variation of generalized TSP, and other centralized methods. The paper works based on the assumption that NNR is best for this kind of coverage, that is why it is the only evaluation the authors consider. However, the choice of NNR must be better motivated and thus evaluated against other approaches.

It is not clear if we have sensors with, let's say, non-trivial kino dynamic constraints, how the formula are held. The current formula work for most types of sensors, but the assumption based on which the formula works must be stated clearly.

Author Response

Please see the attachment

Author Response File: Author Response.pdf