检索结果-内蒙古大学图书馆

A Location-Adaptive Key Establishment Scheme for Large-Scale distributed Wireless sensor networks

JOURNAL OF COMPUTERS 2009年第9期4卷 896-904页

作者： Das, Ashok Kumar Int Inst Informat Technol Dept Comp Sci & Engn Bhubaneswar 751013 Orissa India

The establishment of pairwise keys between communicating neighbor nodes in sensor networks is a challenging problem due to the unsuitability of public-key crypto-graphic techniques for the resource-constrained platforms of sensor networks and also due to vulnerability of physical captures of sensor nodes by an adversary/enemy. In this paper, we propose a new location-adaptive key establishment scheme which is considered as an improved alternative to the path key establishment phase of bootstrapping protocol in a sensor network. Our proposed scheme offers significantly better network connectivity compared to that for the path key establishment. Moreover, our scheme has better trade-off between communication overhead, computational overhead, network connectivity and resilience against node capture attack than the path key establishment.

关键词： distributed sensor networks Location-adaptive key pre-distribution Path key establishment Key establishment Security

来源：评论

学校读者我要写书评

暂无评论

A secure and effective access control scheme for distributed wireless sensor networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION networks AND distributed SYSTEMS 2015年第1期14卷 40-73页

作者： Chatterjee, Santanu Das, Ashok Kumar Sing, Jamuna Kanta Res Ctr Imarat Def Res & Dev Org Hyderabad 500069 Andhra Pradesh India Int Inst Informat Technol Ctr Secur Theory & Algorithm Res Hyderabad 500032 Andhra Pradesh India Jadavpur Univ Dept Comp Sci & Engn Kolkata 700032 India

The deployment of new nodes is often required in order to extend the lifetime of the sensor network because sensor network may be lost due to power exhaustion problem or deployment of malicious nodes by an attacker. To protect malicious nodes from joining the network, designing of access control schemes becomes a major challenging problem. In this paper, we first review the Huang-Liu's access control scheme. Though their scheme is energy efficient requiring low computational and communication overheads, but we show that their scheme is insecure against node replication attacks as well as it does not provide the mutual authentication between the base station (BS) and sensor nodes. We aim to propose a new efficient and secure access control scheme in order to remedy such security weaknesses found in Huang-Liu's scheme. Our proposed scheme makes use of only the one-way hash function and bitwise XOR operations for providing the authentication and key establishment. Our scheme also requires significantly less communication and computational costs as compared to other related schemes. We show through both informal and formal security analysis that our scheme has the ability to tolerate various known attacks. We further simulate our scheme for formal security verification using the widely accepted Automated Validation of Internet Security Protocols and Applications (AVISPA) tool and we show that our scheme is secure against passive as well as active attacks.

关键词： distributed sensor networks access control hash function key establishment authentication security

来源：评论

学校读者我要写书评

暂无评论

A NOVEL EFFICIENT ACCESS CONTROL SCHEME FOR LARGE-SCALE distributed WIRELESS sensor networks

引用

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2013年第5期24卷 625-653页

作者： Das, Ashok Kumar Chatterjee, Santanu Sing, Jamuna Kanta Int Inst Informat Technol Ctr Secur Theory & Algorithm Res Hyderabad 500032 Andhra Pradesh India Def Res & Dev Org Res Ctr Imarat Hyderabad 500069 Andhra Pradesh India Jadavpur Univ Dept Comp Sci & Engn Kolkata 700032 India

In a wireless sensor network, we often require the deployment of new nodes to extend the lifetime of the network because some sensor nodes may be lost due to power exhaustion problem or they may be also malicious nodes. In order to protect malicious nodes from joining the sensor network, access control mechanism becomes a major challenging problem in the design of sensor network protocols. Existing access control protocols designed for wireless sensor networks require either high communication overheads or they are not scalable due to involvement of the base station during authentication and key establishment processes. In this paper, we propose a new access control scheme for large-scale distributed wireless sensor networks, which not only identifies the identity of each node but it has also ability to differentiate between old nodes and new nodes. The proposed scheme does not require involvement of the base station during authentication and key establishment processes, and it can be easily implemented as a dynamic access control protocol. In addition, our scheme significantly reduces communication costs in order to authenticate neighbor nodes among each other and establish symmetric keys between neighbor nodes as compared with existing approaches. Further, our scheme is secure against different attacks and unconditionally secure against node capture attacks. The simulation results of our scheme using the AVISPA (Automated Validation of Internet Security Protocols and Applications) tool ensure that our scheme is safe.

关键词： distributed sensor networks access control key establishment authentication security RSA ECC

来源：评论

学校读者我要写书评

暂无评论

distributed wireless sensor networks with power efficient data modeling

Distributed wireless sensor networks with power efficient da...

引用

37th Southeastern Symposium on System Theory (SSST05)

作者： Ketel, M Dogan, NS Ugur, A N Carolina Agr & Tech State Univ Dept Comp Sci Greensboro NC 27411 USA

ISBN: (纸本)0780388089

In sensor networks, we are interested in prolonging the lifetime of the network and thus the energy conservation is one of the most important aspects to be considered in the design. In this paper, we present regression techniques to model the sensor data. In this framework, the nodes of the sensor network collaborate to fit a regression model to their local measurements. This model takes the form of a weighted sum of local basis functions. Instead of transmitting data to each other or outside the network, nodes communicate the model's parameters and thus the communication required is reduced [2]. Usually, sensors are densely deployed Therefore, to reduce further the energy cost, sensors in the same sensing area are used in turns.

关键词： distributed sensor networks regression

来源：评论

学校读者我要写书评

暂无评论

A compressive sensing-based adaptable secure data collection scheme for distributed wireless sensor networks

引用

INTERNATIONAL JOURNAL OF distributed sensor networks 2019年第6期15卷 1-12页

作者： Liu, Zhen Han, Yi-Liang Yang, Xiao-Yuan Armed Police Force Engn Univ Coll Cryptog Engn Xian 710086 Shaanxi Peoples R China

Toward the goal of high security and efficiency for data collection in wireless sensor network, this article proposed an adaptable secure compressive sensing-based data collection scheme for distributed wireless sensor network. It adopted public key cryptography technology to solve the key distribution problem, and compressive sensing over finite fields to reduce the communication cost of data collection. Under hardness of decisional learning with errors problem on lattice, it can ensure indistinguishability against chosen ciphertext attack (IND-CCA1) security scheme for collected data on the extranet and indistinguishability against chosen plaintext attack security for data during the process of distributed collection on the intranet. Owing to the similar linear structure for lattices and compressive sensing, data encryption collection can be all in the form of efficient linear operations, and internode data aggregation can be in the form of addition operation.

关键词： distributed sensor networks secure data collection encryption algorithm compressed sensing quantum attack resistant

来源：评论

学校读者我要写书评

暂无评论

Conformal distributed Remote Inference in sensor networks Under Reliability and Communication Constraints

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2025年 73卷 1485-1500页

作者： Zhu, Meiyi Zecchin, Matteo Park, Sangwoo Guo, Caili Feng, Chunyan Popovski, Petar Simeone, Osvaldo Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing Key Lab Network Syst Architecture & Conver Beijing 100876 Peoples R China Kings Coll London Ctr Intelligent Informat Proc Syst CIIPS Dept Engn Kings Communicat Learning & Informat Proc KCLIP La London WC2R 2LS England Imperial Coll London Dept Elect & Elect Engn London SW7 2AZ England Aalborg Univ Connect Sect DK-9220 Aalborg Denmark

This paper presents communication-constrained distributed conformal risk control (CD-CRC) framework, a novel decision-making framework for sensor networks under communication constraints. Targeting multi-label classification problems, such as segmentation, CD-CRC dynamically adjusts local and global thresholds used to identify significant labels with the goal of ensuring a target false negative rate (FNR), while adhering to communication capacity limits. CD-CRC builds on online exponentiated gradient descent to estimate the relative quality of the observations of different sensors, and on online conformal risk control (CRC) as a mechanism to control local and global thresholds. CD-CRC is proved to offer deterministic worst-case performance guarantees in terms of FNR and communication overhead, while the regret performance in terms of false positive rate (FPR) is characterized as a function of the key hyperparameters. Simulation results highlight the effectiveness of CD-CRC, particularly in communication resource-constrained environments, making it a valuable tool for enhancing the performance and reliability of distributed sensor networks.

关键词： Servers Reliability Multi label classification Accuracy Vectors Target tracking sensor fusion Bayes methods Aggregates Wireless communication Conformal risk control online learning distributed sensor networks multi-label tasks

来源：评论

学校读者我要写书评

暂无评论

distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks

引用

ARTIFICIAL INTELLIGENCE 2005年第1-2期161卷 55-87页

作者： Zhang, WX Wang, GD Xing, Z Wittenburg, L Washington Univ Dept Comp Sci & Engn St Louis MO 63130 USA

This research is motivated by some distributed scheduling problems in distributed sensor networks, in which computational and communication resources are scarce. We first cast these problems as distributed constraint satisfaction problems (DisCSPs) and distributed constraint optimization problems (DisCOPs) and model them as distributed graph coloring. To cope with limited resources and restricted real-time requirement, it is imperative to use distributed algorithms that have low overhead on resource consumption and high-quality anytime performance. To meet these requirements, we study two existing DisCSP algorithms, distributed stochastic search algorithm (DSA) and distributed breakout algorithm (DBA), for solving DisCOPs and the distributed scheduling problems. We experimentally show that DSA has a phase-transition or threshold behavior, in that its solution quality degenerates abruptly and dramatically when the degree of parallel executions of distributed agents increases beyond some critical value. We also consider the completeness and complexity of DBA for distributed graph coloring. We show that DBA is complete on coloring acyclic graphs, coloring an acyclic graph of n nodes in O(n(2)) steps. However, on a cyclic graph, DBA may never terminate. To improve DBA's performance on coloring cyclic graphs, we propose two stochastic variations. Finally, we directly compare DSA and DBA for solving distributed graph coloring and distributed scheduling problems in sensor networks. The results show that DSA is superior to DBA when controlled properly, having better or competitive solution quality and significantly lower communication cost than DBA. Therefore, DSA is the algorithm of choice for our distributed scheduling problems and other distributed problems of similar properties. (C) 2004 Elsevier B.V. All rights reserved.

关键词： distributed constraint satisfaction problem distributed constraint optimization problem distributed sensor networks distributed stochastic search distributed breakout algorithm breakout algorithm phase transitions distributed scheduling

来源：评论

学校读者我要写书评

暂无评论

Mobile-agent-based distributed variational Bayesian algorithm for density estimation in sensor networks

引用

IET SCIENCE MEASUREMENT & TECHNOLOGY 2017年第7期11卷 861-870页

作者： Mozaffari, Mohiyeddin Safarinejadian, Behrouz Shiraz Univ Technol Dept Elect Engn Shiraz Iran

This study considers the problem of probability density estimation and model order selection in distributed sensor networks. For this purpose, a mobile-agent-based distributed variational Bayesian algorithm is proposed. It is assumed that the measurements can be statistically modelled by a common Gaussian mixture model. In the proposed algorithm, the problems of model order selection and probability density estimation will be considered simultaneously using mobile agents and the variational concept. Initially, considering a component number greater than the true one, the variational Bayesian algorithm will be executed in different nodes. In other words, the mobile agents move through different routes in the network and compute the local sufficient statistics. Afterwards, the global sufficient statistics will be updated using these values and finally the parameters of the probability density function will be calculated. This procedure will be repeated until convergence is reached. At this moment, the component whose mixture probability is lower than a threshold value will be removed. The mentioned steps will continue until the true component number is reached. Convergence of the proposed method will also be analytically studied. Finally, the proposed algorithm will be applied to synthetic and also real-world data sets to show its promising performance.

关键词： distributed sensors Gaussian processes mixture models belief networks Bayes methods probability density estimation model order selection distributed sensor networks mobile-agent-based distributed variational Bayesian algorithm Gaussian mixture model global sufficient statistics

来源：评论

学校读者我要写书评

暂无评论

distributed Consensus Student-t Filter for sensor networks With Heavy-Tailed Process and Measurement Noises

引用

IEEE ACCESS 2020年 8卷 167865-167874页

作者： Wang, Jinran Dong, Peng Shen, Kai Song, Xun Wang, Xiaodong Beijing Inst Elect Syst Engn State Key Lab Intelligent Mfg Syst Technol Beijing 100854 Peoples R China Shanghai Jiao Tong Univ Sch Aeronaut & Astronaut Shanghai 200240 Peoples R China Southwest Jiaotong Univ Sch Elect Engn Chengdu 611756 Peoples R China

In the estimation of distributed sensor networks, process noise and measurement noise may have outliers which have heavy-tailed characteristics. To solve this problem, this paper proposes a distributed consensus estimating method for sensor networks based on Student-t distribution. In the state space model, both process noise and measurement noise are modeled as Student-t distributions with heavy-tailed characteristics. First, for the assumption that the process noise and measurement noise have the same degree of freedom parameters, an exact distributed consensus Student-t filtering algorithm is derived. In practical applications, this assumption is often not true, and due to the increasing degrees of freedom, the method will quickly converge to the traditional distributed consensus Kalman filter. Therefore, it is necessary to relax the assumption of the same degree of freedom and keep the degree of freedom unchanged within a certain range. Based on this, an approximate distributed consensus Student-t filter algorithm is proposed. Simulation results verify the effectiveness of the proposed algorithm.

关键词： Student-t distribution distributed consensus filter distributed sensor networks

来源：评论

学校读者我要写书评

暂无评论

POSE: Prediction-Based Opportunistic Sensing for Energy Efficiency in sensor networks Using distributed Supervisors

引用

IEEE TRANSACTIONS ON CYBERNETICS 2018年第7期48卷 2114-2127页

作者： Hare, James Z. Gupta, Shalabh Wettergren, Thomas A. Univ Connecticut Dept Elect & Comp Engn Storrs CT 06269 USA Naval Undersea Warfare Ctr Newport RI 02841 USA

This paper presents a distributed supervisory control algorithm that enables opportunistic sensing for energy-efficient target tracking in a sensor network. The algorithm called Prediction-based Opportunistic Sensing (POSE), is a distributed node-level energy management approach for minimizing energy usage. distributed sensor nodes in the POSE network self-adapt to target trajectories by enabling high power consuming devices when they predict that a target is arriving in their coverage area, while enabling low power consuming devices when the target is absent. Each node has a Probabilistic Finite State Automaton which acts as a supervisor to dynamically control its various sensing and communication devices based on target's predicted position. The POSE algorithm is validated by extensive Monte Carlo simulations and compared with random scheduling schemes. The results show that the POSE algorithm provides significant energy savings while also improving track estimation via fusion-driven state initialization.

关键词： distributed fusion distributed sensor networks multimodal network control network intelligence opportunistic sensing prediction-based control sensor scheduling

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：