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.展开更多
Node Localization is one of the key technology in the field of wireless sensor network(WSN)that has become a challenging research topic under the lack of distance measurement.In order to solve this problem,a localizat...Node Localization is one of the key technology in the field of wireless sensor network(WSN)that has become a challenging research topic under the lack of distance measurement.In order to solve this problem,a localization algorithm based on concentric circle distance calculation(LACCDC)is proposed.The LA-CCDC takes the beacon as the center of the concentric circle,then divides the task area into concentric circles with the k communication radius of sensor,which forms concentric rings.The node located in the k hops ring intersects the concentric circle with(k−1)r radius that forms an intersection area.This area is used to calculate the distance from the beacon to the unknown node,hyperbola is then adopted to locate the unknown node.In the application scenario with node random distribution,the simulation results show that the LA-CCDC algorithm gets the node location with low error under different node number,different beacons and different communication radius of sensor.展开更多
提出一种基于几何覆盖理论的Jamming攻击定位(GCL,geometry-covering based localization)算法。GCL算法利用计算几何中的凸壳理论,特别是最小包容圆方法,对Jamming攻击者进行定位。理论证明了该算法的正确性和较低的时间复杂度(O(nlogn...提出一种基于几何覆盖理论的Jamming攻击定位(GCL,geometry-covering based localization)算法。GCL算法利用计算几何中的凸壳理论,特别是最小包容圆方法,对Jamming攻击者进行定位。理论证明了该算法的正确性和较低的时间复杂度(O(nlogn));模拟实验表明,该算法在攻击者攻击范围、网络节点密度以及攻击者位置等度量值变化的情况下,比已有算法具有更好的定位准确度。展开更多
针对现有隐私保护数据聚集算法依赖某种网络拓扑结构和加解密次数过多的问题,本文提出了一种基于同心圆路线的隐私保护数据聚集算法PCIDA(Privacy-preserving and Concentric-circle Itinerary-based Data Aggregation algorithm).PCID...针对现有隐私保护数据聚集算法依赖某种网络拓扑结构和加解密次数过多的问题,本文提出了一种基于同心圆路线的隐私保护数据聚集算法PCIDA(Privacy-preserving and Concentric-circle Itinerary-based Data Aggregation algorithm).PCIDA沿着设计好的理想路线执行数据聚集,使得算法不依赖网络拓扑结构.PCIDA利用安全通道保证数据的隐私性,避免了数据聚集过程中的加解密运算.PCIDA沿着同心圆并行处理,使得算法数据处理延迟较小.理论分析和实验结果显示,PCIDA在较低通信量和能耗的情况下获得较高的数据隐私性和聚集精确度.展开更多
基金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.
基金the Yunnan Local Colleges Applied Basic Research Projects(2017FH001-059,2018FH001-010,2018FH001-061)National Natural Science Foundation of China(61962033).
文摘Node Localization is one of the key technology in the field of wireless sensor network(WSN)that has become a challenging research topic under the lack of distance measurement.In order to solve this problem,a localization algorithm based on concentric circle distance calculation(LACCDC)is proposed.The LA-CCDC takes the beacon as the center of the concentric circle,then divides the task area into concentric circles with the k communication radius of sensor,which forms concentric rings.The node located in the k hops ring intersects the concentric circle with(k−1)r radius that forms an intersection area.This area is used to calculate the distance from the beacon to the unknown node,hyperbola is then adopted to locate the unknown node.In the application scenario with node random distribution,the simulation results show that the LA-CCDC algorithm gets the node location with low error under different node number,different beacons and different communication radius of sensor.
文摘提出一种基于几何覆盖理论的Jamming攻击定位(GCL,geometry-covering based localization)算法。GCL算法利用计算几何中的凸壳理论,特别是最小包容圆方法,对Jamming攻击者进行定位。理论证明了该算法的正确性和较低的时间复杂度(O(nlogn));模拟实验表明,该算法在攻击者攻击范围、网络节点密度以及攻击者位置等度量值变化的情况下,比已有算法具有更好的定位准确度。
文摘针对现有隐私保护数据聚集算法依赖某种网络拓扑结构和加解密次数过多的问题,本文提出了一种基于同心圆路线的隐私保护数据聚集算法PCIDA(Privacy-preserving and Concentric-circle Itinerary-based Data Aggregation algorithm).PCIDA沿着设计好的理想路线执行数据聚集,使得算法不依赖网络拓扑结构.PCIDA利用安全通道保证数据的隐私性,避免了数据聚集过程中的加解密运算.PCIDA沿着同心圆并行处理,使得算法数据处理延迟较小.理论分析和实验结果显示,PCIDA在较低通信量和能耗的情况下获得较高的数据隐私性和聚集精确度.
