Research on Stability-Enhanced Clustering Algorithm Based on Distributed Node Status Judgment in MWSN
Round 1
Reviewer 1 Report
1. Title need to be shorter and more informative
2. Related Works are not sufficient
3. Need to compare Related Works in terms of clustering algorithm related features
Author Response
Point 1: Title need to be shorter and more informative.
Response 1: Thank you for your valuable comments. In this paper, we propose a solution for the negative impact of node movement on cluster stability in mobile wireless sensor networks. The solution is based on the node motion state to determine the node identity while combining intra-cluster multi-hop communication to mitigate the effect of mobility. The change in network communication complexity is noted while improving the cluster stability. Based on these ideas, the term weighted in the original paper title is deleted and MWSN is added to highlight the application scenarios of the clustering algorithm.
Point 2: Related Works are not sufficient.
Response 2: In response to your comments, we have added three important references in the related work section of Chapter 2, as well as some detailed process descriptions of existing algorithms and problem analysis. Some descriptions of the mechanism design of reference 16 have been added in line 127. From line 132 to line 134, reference 19 is mentioned for the effect of node properties in the network on the result of dominant set selection, along with an analysis of the communication overhead imposed by the method. The work done by Reference 21 on node mobility is added in lines 139 to 141. The algorithm proposed in this work considers the effect of the expected connection time in terms of dominant set selection. The increased energy consumption of Reference 24 in the clustering phase due to excessively large amount of computations is analyzed in lines 145 to 146. The deficiencies of the work presented in Reference 18 are added in line 157. Lines 158 to 166 add some descriptions of some work of references 23, 21, and 8 as well as a shortcoming analysis. The analysis of these works highlights the problem of communication delay due to complex communication routing and the possibility of multi-hop communication within clusters is analyzed. The specific new references are listed below.
- Tran Huu Phi,Jung WooSung,Yoo DaeSeung,Oh Hoon. Design and Implementation of a Multi-Hop Real-Time LoRa Protocol for Dynamic LoRa Networks[J]. Sensors,2022,22(9).
- Deng,Jingfeng Li,Lian-Feng Shen. Mobility-based clustering protocol for wireless sensor networks with mobile nodes.[J]. IET Wireless Sensor Systems,2011,1(1).
- Ramalingam Rajakumar,Muniyan Rajeswari,Dumka Ankur,Singh Devesh Pratap,Mohamed Heba G.,Singh Rajesh,Anand Divya,Noya Irene Delgado. Routing Protocol for MANET Based on QoS-Aware Service Composition with Dynamic Secured Broker Selection[J]. Electronics,2022,11(17).
Point 3: Need to compare Related Works in terms of clustering algorithm related features.
Response 3: A comparison of the proposed algorithm with other existing related algorithms is added at the end of the related work section in Chapter 2. The algorithms compared with our proposed algorithm are classical clustering algorithms such as LEACH, MBC, WCA, and new clustering algorithms such as ARBIC, JNSMIC, CBR. For the comparison of the algorithms, we design five perspectives of communication method, organization form, clustering stability, packet delivery ratio, and communication overhead. The comparison between different algorithms highlights the unique design of the proposed algorithms in this work in terms of intra-cluster communication method and the contribution made in terms of cluster stability.
Author Response File: 
Author Response.pdf
Reviewer 2 Report
After carefully reviewing the entire document, I discovered various flaws. Before publication, authors should carefully consider the following minor comments:
1-In terms of hierarchy, missing, gap, and what, the abstract part must be updated.
2-The entire document must be rechecked in terms of English.
3-The entire introduction section needs to be updated in terms of gap and method. This section also lacks sufficient citations. The authors advised to utilize and cite these important references.
https://link.springer.com/article/10.1007/s10586-022-03738-5
https://www.mdpi.com/2076-3417/12/17/8906
https://www.sciencedirect.com/science/article/abs/pii/S014036642200158X
https://www.mdpi.com/2079-9292/11/17/2637
4-If formulas are borrowed from other works, they must be referenced.
5-The related work section is insufficient. Please provide a related table and add your work to this table to demonstrate your uniqueness.
Author Response
Point 1: In terms of hierarchy, missing, gap, and what, the abstract part must be updated.
Response 1: Thank you for your comments on the abstract improvements. The abstract section first presents the role of node mobility in self-deployment and analyzes its problems. It then points out the common solutions to the node mobility problem today. However, the problem in terms of communication overhead has not been addressed. Then the specific problem to be solved in this paper is pointed out along with a detailed description of the solution. Finally simulations are performed to verify the feasibility of this work. A new line 12 adds a summary of the currently available solutions and indicates the problems that are not solved. Lines 18 to 21 revise the description of the solution proposed in this paper. It first describes the role of intra-cluster multi-hop communication in mitigating mobility. Then the role of the node state determination algorithm in reducing the routing complexity of intra-cluster communication is analyzed.
Point 2: The entire document must be rechecked in terms of English.
Response 2: Thank you for your suggestion. We have double-checked the grammar of the manuscript. Here are some of the changes that have been made.
- Line 42,149,247 ,287 modifies the singular-plural issue.
- The use of symbols is addressed in line 78.
- Line 123 modifies the use of the adjective weighted.
- Line 573 adds the crown word the before the radius of communication.
- Line 536 improves the structure of the statement and increases readability.
- Line 182 fixes a syntax issue.
Point 3: The entire introduction section needs to be updated in terms of gap and method. This section also lacks sufficient citations. The authors advised to utilize and cite these important references.
Response 3: Thank you for your comments and for the recommended references. These recommended references have been used in a reasonable manner.
1.The reference "Recent trends in clustering algorithms for wireless sensor networks: a comprehensive review" is cited to illustrate the importance of designing clustering schemes for energy consumption and communication efficiency in Line 45.
2.The reference "Resilient and dependability management in distributed environments: a systematic and comprehensive literature review" is used in line 47 to illustrate the importance of distributed systems in resisting single points of failure arising in open environments.
3.The reference "A Fuzzy-Based Method for Objects Selection in Blockchain-Enabled Edge-IoT Platforms Using a Hybrid Multi-Criteria Decision-Making Mode" is used in line 103 to show that changing the way nodes function in the network by designing some mechanism to differentiate node states can improve the division of labor and improve network performance.
4.Line 132 uses the reference "Routing Protocol for MANET Based on QoS-Aware Service Composition with Dynamic Secured Broker Selection," which proposes a scheme for node selection that considers various network parameters, a scheme that imposes significant computational overhead by attempting to obtain the best selection by weighting various parameters.
Some additions have been made to the introduction section to refine the specifics of how the different algorithms operate. The differences of different classes of clustering algorithms and the parts that deserve improvement are also analyzed. The analysis of the open environment is added in lines 47 to 49 to justify the use of the distributed approach in this algorithm. Lines 54 through 56 outline the characteristics of the weighted clustering algorithm for cluster head selection by considering a combination of factors. Lines 72 to 74 outline the main issues of concern for the current clustering algorithm using vice cluster heads, namely the communication mechanism and the choice of vice cluster heads. It also continues with the analysis of the problems that may be caused by the multi-hop communication mechanism in terms of data transmission delay, which leads to the node state determination scheme to be proposed in this algorithm. Line 102 illustrates the possible network performance improvement by distinguishing the states of different nodes by citing the literature.
Point 4: If formulas are borrowed from other works, they must be referenced.
Response 4: Thank you for pointing out the problem. The quoted formulas have been tagged with the source. The specific improvements are listed below.
- The probability density function of the Weibull distribution cited in line 212 is marked with its corresponding reference22.
- The node energy consumption model cited in line 239 is marked with its corresponding reference16.
- The EKF position prediction formula cited in line 441 identifies its corresponding reference32.
Point 5: The related work section is insufficient. Please provide a related table and add your work to this table to demonstrate your uniqueness.
Response 5: In response to your comments, we have added three important references in the related work section of Chapter 2, as well as some detailed process descriptions of existing algorithms and problem analysis. Some descriptions of the mechanism design of reference 16 have been added in line 127. From line 132 to line 134, reference 19 is mentioned for the effect of node properties in the network on the result of dominant set selection, along with an analysis of the communication overhead imposed by the method. The work done by Reference 21 on node mobility is added in lines 139 to 141. The algorithm proposed in this work considers the effect of the expected connection time in terms of dominant set selection. The increased energy consumption of Reference 24 in the clustering phase due to excessively large amount of computations is analyzed in lines 145 to 146. The deficiencies of the work presented in Reference 18 are added in line 157. Lines 158 to 166 add some descriptions of some work of references 23, 21, and 8 as well as a shortcoming analysis. The analysis of these works highlights the problem of communication delay due to complex communication routing and the possibility of multi-hop communication within clusters is analyzed. The specific new references are listed below.
A comparison of the proposed algorithm with other existing related algorithms is added at the end of the related work section in Chapter 2. The algorithms compared with our proposed algorithm are classical clustering algorithms such as LEACH, MBC, WCA, and new clustering algorithms such as ARBIC, JNSMIC, CBR. For the comparison of the algorithms, we design five perspectives of communication method, organization form, clustering stability, packet delivery ratio, and communication overhead. The comparison between different algorithms highlights the unique design of the proposed algorithms in this work in terms of intra-cluster communication method and the contribution made in terms of cluster stability.
Author Response File: Author Response.pdf
