With the increasing demand for security,building strong barrier coverage in directional sensor networks is important for effectively detecting un-authorized intrusions.In this paper,we propose an efficient scheme to f...With the increasing demand for security,building strong barrier coverage in directional sensor networks is important for effectively detecting un-authorized intrusions.In this paper,we propose an efficient scheme to form the strong barrier coverage by adding the mobile nodes one by one into the barrier.We first present the concept of target circle which determines the appropriate residence region and working direction of any candidate node to be added.Then we select the optimal relay sensor to be added into the current barrier based on its input-output ratio(barrier weight)which reflects the extension of barrier coverage.This strategy looses the demand of minimal required sensor nodes(maximal gain of each sensor)or maximal lifetime of one single barrier,leading to an augmentation of sensors to be used.Numerical simulation results show that,compared with the available schemes,the proposed method significantly reduces the minimal deploy density required to establish k-barrier,and increases the total service lifetime with a high deploy efficiency.展开更多
Water quality sensor networks are promising tools for the exploration of oceans.Some key areas need to be monitored effectively.Water quality sensors are deployed randomly or uniformly,however,and understanding how to...Water quality sensor networks are promising tools for the exploration of oceans.Some key areas need to be monitored effectively.Water quality sensors are deployed randomly or uniformly,however,and understanding how to deploy sensor nodes reasonably and realize effective monitoring of key areas on the basis of monitoring the whole area is an urgent problem to be solved.Additionally,energy is limited in water quality sensor networks.When moving sensor nodes,we should extend the life cycle of the sensor networks as much as possible.In this study,sensor nodes in non-key monitored areas are moved to key areas.First,we used the concentric circle method to determine the mobile sensor nodes and the target locations.Then,we determined the relationship between the mobile sensor nodes and the target locations according to the energy matrix.Finally,we calculated the shortest moving path according to the Floyd algorithm,which realizes the redeployment of the key monitored area.The simulation results showed that,compared with the method of direct movement,the proposed method can effectively reduce the energy consumption and save the network adjustment time based on the effective coverage of key areas.展开更多
基金This research was supported in part by the National Natural Science Foundation of China under Grant Nos.11405145,40241461,61374152,and 61876168Zhejiang Provincial Natural Science Foundation of China under Grant Nos.LY20F020024 and LY17F030016.
文摘With the increasing demand for security,building strong barrier coverage in directional sensor networks is important for effectively detecting un-authorized intrusions.In this paper,we propose an efficient scheme to form the strong barrier coverage by adding the mobile nodes one by one into the barrier.We first present the concept of target circle which determines the appropriate residence region and working direction of any candidate node to be added.Then we select the optimal relay sensor to be added into the current barrier based on its input-output ratio(barrier weight)which reflects the extension of barrier coverage.This strategy looses the demand of minimal required sensor nodes(maximal gain of each sensor)or maximal lifetime of one single barrier,leading to an augmentation of sensors to be used.Numerical simulation results show that,compared with the available schemes,the proposed method significantly reduces the minimal deploy density required to establish k-barrier,and increases the total service lifetime with a high deploy efficiency.
基金This research was funded by the National Natural Science Foundation of China(Grant No.61802010)National Social Science Fund of China(Grant No.19BGL184)+1 种基金Beijing Excellent Talent Training Support Project for Young Top-Notch Team(Grant No.2018000026833TD01)and Hundred-Thousand-Ten Thousand Talents Project of Beijing(Grant No.2020A28).
文摘Water quality sensor networks are promising tools for the exploration of oceans.Some key areas need to be monitored effectively.Water quality sensors are deployed randomly or uniformly,however,and understanding how to deploy sensor nodes reasonably and realize effective monitoring of key areas on the basis of monitoring the whole area is an urgent problem to be solved.Additionally,energy is limited in water quality sensor networks.When moving sensor nodes,we should extend the life cycle of the sensor networks as much as possible.In this study,sensor nodes in non-key monitored areas are moved to key areas.First,we used the concentric circle method to determine the mobile sensor nodes and the target locations.Then,we determined the relationship between the mobile sensor nodes and the target locations according to the energy matrix.Finally,we calculated the shortest moving path according to the Floyd algorithm,which realizes the redeployment of the key monitored area.The simulation results showed that,compared with the method of direct movement,the proposed method can effectively reduce the energy consumption and save the network adjustment time based on the effective coverage of key areas.
