Next Article in Journal
A Survey on Sentiment Analysis and Opinion Mining in Greek Social Media
Next Article in Special Issue
Analysis of Power Allocation for NOMA-Based D2D Communications Using GADIA
Previous Article in Journal
Semantic Systematicity in Connectionist Language Production
 
 
Article
Peer-Review Record

A Node Localization Algorithm for Wireless Sensor Networks Based on Virtual Partition and Distance Correction

by Yinghui Meng *, Qianying Zhi, Minghao Dong and Weiwei Zhang
Reviewer 2: Anonymous
Submission received: 12 July 2021 / Revised: 4 August 2021 / Accepted: 12 August 2021 / Published: 16 August 2021
(This article belongs to the Special Issue 5G Networks and Wireless Communication Systems)

Round 1

Reviewer 1 Report

In this paper the authors proposed an algorithm to find the location of the coordinates of a WSN nodes in an unknown environment. Even though, the work is important for the research community, there are several questions that are not clear from the current work. The questions may be clarified. I am also providing some suggestions for further improvement.

  1. Even though, this work contains related work, it is not strong enough to bring forth a motivation for the present work. Node localization is a very rich research area with several pioneering works (includes triangularization methods). A through literature survey is necessary. There are several partition methods available. Please review and compare your work; without this, results look more biased.
  2. Used a non-standard referencing method (ignoring author’s name). Please follow a standard mechanism.
  3. What is the rationale in considering concentric circle-based partition of R/3 in size? If you increase the granularity, will your accuracy improve? Please justify.
  4. Again, you are dividing the region into three pie sectors (Si1, Si2, Si3). Why 3?
  5. First explain the partition algorithm clearly before proceeds to the equations. Otherwise, the equations look very abstract.
  6. For estimating shortest path, what algorithm you use? You cannot use Euclidean distance as the coordinate of the unknown nodes are not known. Similar papers use either distance vector or DUAL algorithm.
  7. 2.1: explain as an algorithm; justify the use of Ochiai coefficient.
  8. Distance correction: as before explaining as an algorithm before your calculations.

Author Response

Please see the attachment.

Author Response File: Author Response.docx

Reviewer 2 Report

A localization algorithm based on virtual partition and distance correction to improve the accuracy of Dv-Hop is proposed. The presentation is clear with fine simulations. I recommend the acceptance of this paper after revision.

  1. Some recent papers related to the improved version of Dv-Hop, the authors may introduce those works so broaden the scope of this paper as follows. (1) 

    “An Improved DV-HOP Algorithm was Applied for The Farmland Wireless Sensor Network”, Journal of Information Hiding and Multimedia Signal Processing, Vol. 8, No. 1, pp. 148-155, January 2017

    (2) 

    “A parallel compact cat swarm optimization and its application in DV-Hop node localization for wireless sensor network”, Wireless Networks, Vol. 27, No. 3, pp. 2081-2101

  2. The Poisson distribution model related to Eq. 5, Eq. 6 and Eq. 7, the authors may cite one related paper so that it is easier for the readers to study related theory.

Author Response

Please see the attachment.

Author Response File: Author Response.docx

Round 2

Reviewer 1 Report

Authors have addressed the concerns/suggestions to improve the overall presentation of this paper.

Back to TopTop