期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Privacy preserving secure expansive aggregation with malicious node identification in linear wireless sensor networks
1
作者 Kaushal SHAH Devesh JINWALA 《Frontiers of Computer Science》 SCIE EI CSCD 2021年第6期155-163,共9页
The Wireless Sensor Networks(WSNs)used for the monitoring applications like pipelines carrying oil,water,and gas;perimeter surveillance;border monitoring;and subway tunnel monitoring form linearWSNs.Here,the infrastru... The Wireless Sensor Networks(WSNs)used for the monitoring applications like pipelines carrying oil,water,and gas;perimeter surveillance;border monitoring;and subway tunnel monitoring form linearWSNs.Here,the infrastructure being monitored inherently forms linearity(straight line through the placement of sensor nodes).Therefore,suchWSNs are called linear WSNs.These applications are security critical because the data being communicated can be used for malicious purposes.The contemporary research of WSNs data security cannot fit in directly to linear WSN as only by capturing few nodes,the adversary can disrupt the entire service of linear WSN.Therefore,we propose a data aggregation scheme that takes care of privacy,confidentiality,and integrity of data.In addition,the scheme is resilient against node capture attack and collusion attacks.There are several schemes detecting the malicious nodes.However,the proposed scheme also provides an identification of malicious nodes with lesser key storage requirements.Moreover,we provide an analysis of communication cost regarding the number of messages being communicated.To the best of our knowledge,the proposed data aggregation scheme is the first lightweight scheme that achieves privacy and verification of data,resistance against node capture and collusion attacks,and malicious node identification in linear WSNs. 展开更多
关键词 linear wireless sensor networks secure data aggregation PRIVACY malicious node identification
原文传递
Efficient Algorithm for K-Barrier Coverage Based on Integer Linear Programming 被引量:15
2
作者 Yanhua Zhang Xingming Sun Baowei Wang 《China Communications》 SCIE CSCD 2016年第7期16-23,共8页
Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied af... Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a region of interest.However,in certain applications,barrier coverage cannot be satisfied after random deployment.In this paper,we study how mobile sensors can be efficiently relocated to achieve k-barrier coverage.In particular,two problems are studied:relocation of sensors with minimum number of mobile sensors and formation of k-barrier coverage with minimum energy cost.These two problems were formulated as 0–1 integer linear programming(ILP).The formulation is computationally intractable because of integrality and complicated constraints.Therefore,we relax the integrality and complicated constraints of the formulation and construct a special model known as RELAX-RSMN with a totally unimodular constraint coefficient matrix to solve the relaxed 0–1 ILP rapidly through linear programming.Theoretical analysis and simulation were performed to verify the effectiveness of our approach. 展开更多
关键词 k-barrier coverage linear programming wireless sensor networks
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部