Wireless sensor networks(WSNs)are widely used for various practical applications due to their simplicity and versatility.The quality of service in WSNs is greatly influenced by the coverage,which directly affects the ...Wireless sensor networks(WSNs)are widely used for various practical applications due to their simplicity and versatility.The quality of service in WSNs is greatly influenced by the coverage,which directly affects the monitoring capacity of the target region.However,low WSN coverage and uneven distribution of nodes in random deployments pose significant challenges.This study proposes an optimal node planning strategy for net-work coverage based on an adjusted single candidate optimizer(ASCO)to address these issues.The single candidate optimizer(SCO)is a metaheuristic algorithm with stable implementation procedures.However,it has limitations in avoiding local optimum traps in complex node coverage optimization scenarios.The ASCO overcomes these limitations by incorporating reverse learning and multi-direction strategies,resulting in updated equations.The performance of the ASCO algorithm is compared with other algorithms in the literature for optimal WSN node coverage.The results demonstrate that the ASCO algorithm offers efficient performance,rapid convergence,and expanded coverage capabilities.Notably,the ASCO achieves an archival coverage rate of 88%,while other approaches achieve coverage rates below or equal to 85%under the same conditions.展开更多
In this paper,we first model the mining structure as a arched shape in terms of the tunnel geometry.Based on the regularly placement of nodes in that model,a set of deployment patterns for seamless coverage and k-conn...In this paper,we first model the mining structure as a arched shape in terms of the tunnel geometry.Based on the regularly placement of nodes in that model,a set of deployment patterns for seamless coverage and k-connectivity is proposed,i.e.1-and 2-connectivity.Further,we figure out the maximum horizontal distance of tangent plane to determine the placement of nodes for k-coverage（k=1,2）.Besides,the mathematical relations between the communication radius and the sensing radius are derived,when the network keeps k-coverage（k=1,2） and k-connectivity（k=2,3） under certain regularity constrains for various patterns.Finally,we demonstrate the optimality of several approaches that we have proposed in the aspect of energy consumption and network lifetime.展开更多
基金supported by the VNUHCM-University of Information Technology’s Scientific Research Support Fund.
文摘Wireless sensor networks(WSNs)are widely used for various practical applications due to their simplicity and versatility.The quality of service in WSNs is greatly influenced by the coverage,which directly affects the monitoring capacity of the target region.However,low WSN coverage and uneven distribution of nodes in random deployments pose significant challenges.This study proposes an optimal node planning strategy for net-work coverage based on an adjusted single candidate optimizer(ASCO)to address these issues.The single candidate optimizer(SCO)is a metaheuristic algorithm with stable implementation procedures.However,it has limitations in avoiding local optimum traps in complex node coverage optimization scenarios.The ASCO overcomes these limitations by incorporating reverse learning and multi-direction strategies,resulting in updated equations.The performance of the ASCO algorithm is compared with other algorithms in the literature for optimal WSN node coverage.The results demonstrate that the ASCO algorithm offers efficient performance,rapid convergence,and expanded coverage capabilities.Notably,the ASCO achieves an archival coverage rate of 88%,while other approaches achieve coverage rates below or equal to 85%under the same conditions.
基金supported by the National Natural Science Foundation of China under Grant No.61562038
文摘In this paper,we first model the mining structure as a arched shape in terms of the tunnel geometry.Based on the regularly placement of nodes in that model,a set of deployment patterns for seamless coverage and k-connectivity is proposed,i.e.1-and 2-connectivity.Further,we figure out the maximum horizontal distance of tangent plane to determine the placement of nodes for k-coverage（k=1,2）.Besides,the mathematical relations between the communication radius and the sensing radius are derived,when the network keeps k-coverage（k=1,2） and k-connectivity（k=2,3） under certain regularity constrains for various patterns.Finally,we demonstrate the optimality of several approaches that we have proposed in the aspect of energy consumption and network lifetime.
