ACM Workshop on Security of ad hoc and Sensor Networks最新文献_第2页

Autonomous and distributed node recovery in wireless sensor networks 无线传感器网络中的自主和分布式节点恢复

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2006-10-30 DOI: 10.1145/1180345.1180360

M. Strasser, Harald Vogt

{"title":"Autonomous and distributed node recovery in wireless sensor networks","authors":"M. Strasser, Harald Vogt","doi":"10.1145/1180345.1180360","DOIUrl":"https://doi.org/10.1145/1180345.1180360","url":null,"abstract":"Intrusion or misbehaviour detection systems are an important and widely accepted security tool in computer and wireless sensor networks. Their aim is to detect misbehaving or faulty nodes in order to take appropriate countermeasures, thus limiting the damage caused by adversaries as well as by hard or software faults. So far, however, once detected, misbehaving nodes have just been isolated from the rest of the sensor network and hence are no longer usable by running applications. In the presence of an adversary or software faults, this proceeding will inevitably lead to an early and complete loss of the whole network.For this reason, we propose to no longer expel misbehaving nodes, but to recover them into normal operation. In this paper, we address this problem and present a formal specification of what is considered a secure and correct node recovery algorithm together with a distributed algorithm that meets these properties. We discuss its requirements on the soft- and hardware of a node and show how they can be fulfilled with current and upcoming technologies. The algorithm is evaluated analytically as well as by means of extensive simulations, and the findings are compared to the outcome of a real implementation for the BTnode sensor platform. The results show that recovering sensor nodes is an expensive, though feasible and worthwhile task. Moreover, the proposed program code update algorithm is not only secure but also fair and robust.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124963142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 20

Seven cardinal properties of sensor network broadcast authentication 传感器网络广播认证的七个基本特性

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2006-10-30 DOI: 10.1145/1180345.1180364

M. Luk, A. Perrig, Bram Whillock

引用次数: 114

Location-aware key predistribution scheme for wide area wireless sensor networks 广域无线传感器网络位置感知密钥预分配方案

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2006-10-30 DOI: 10.1145/1180345.1180365

K. Simonova, A. Ling, Xiaoyan Wang

{"title":"Location-aware key predistribution scheme for wide area wireless sensor networks","authors":"K. Simonova, A. Ling, Xiaoyan Wang","doi":"10.1145/1180345.1180365","DOIUrl":"https://doi.org/10.1145/1180345.1180365","url":null,"abstract":"Key predistribution in wireless sensor networks refers to the problem of distributing secret keys among sensors prior to deployment. Solutions appeared in the literature can be classified into two categories: basic schemes that achieve fixed probability of sharing a key between any pair of sensors in a network and location-aware schemes that use a priori knowledge about sensors' communication needs, such as location information, to guarantee connectivity only among sensors that need to and can talk. Location-aware schemes achieve performance enhancement over the basic schemes by using resources efficiently. However, existing location-aware solutions are not compatible with combinatorial methods that use a set of key groups to generate sensors' key rings. Combinatorial methods are appealing as they achieve deterministic performance close to optimal. Besides, existing location-aware solutions do not have enough flexibility in terms of trade-off between connectivity and resilience. In this paper we propose a general key predistribution framework that can use any key predistribution method as its underlying scheme, including combinatorial ones. The proposed framework provides the user with options on how to allocate available resources to achieve desired performance based on the needs of the application. We also consider heterogeneous sensor networks consisting of nodes with different amount of memory and communication ranges and show that special treatment of this case results in substantial performance improvement. We confirm the good performance of our framework by providing experimental and analytical results.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132507490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 39

How public key cryptography influences wireless sensor node lifetime 公钥加密如何影响无线传感器节点寿命

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2006-10-30 DOI: 10.1145/1180345.1180366

K. Piotrowski, P. Langendörfer, Steffen Peter

引用次数: 251

Attacker traceback with cross-layer monitoring in wireless multi-hop networks 无线多跳网络跨层监控攻击者溯源

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2006-10-30 DOI: 10.1145/1180345.1180361

Yongjin Kim, A. Helmy

{"title":"Attacker traceback with cross-layer monitoring in wireless multi-hop networks","authors":"Yongjin Kim, A. Helmy","doi":"10.1145/1180345.1180361","DOIUrl":"https://doi.org/10.1145/1180345.1180361","url":null,"abstract":"Denial-of-Service (DoS) and Distributed DoS (DDoS) attacks can cause serious problems in wireless networks due to its limited network/host resources. Attacker traceback is a promising solution to take a proper countermeasure near the attack origin, for forensics, and to discourage attacker from launching attacks. However, attacker traceback in wireless multi-hop networks is a challenging problem, and existing attacker traceback schemes developed for the Internet cannot be directly applied to wireless multi-hop networks due to the peculiar characteristics of wireless multi-hop networks (e.g., dynamic/autonomous network topology, limited network/host resources such as memory and bandwidth). We introduce a protocol framework for attacker traceback geared toward wireless multi-hop networks with special attention to cross-layer abnormality monitoring. The basic building blocks of our protocol framework consist of abnormality detection, abnormality characterization, abnormality searching, abnormality matching, and countermeasure. We show that our protocol framework successfully tracks down attacker (Avg. of 100% in DoS attacker traceback, avg. of 96% in DDoS attacker traceback) under diverse network environments (e.g., high background traffic, DDoS attack, and partial node compromise) with low communication, computation, and memory overhead.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133001589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Achieving privacy in mesh networks 在网状网络中实现隐私

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2006-10-30 DOI: 10.1145/1180345.1180348

Xiaoxin Wu, Ninghui Li

引用次数: 52

Mobile traffic sensor network versus motion-MIX: tracing and protecting mobile wireless nodes 移动交通传感器网络与运动混合:跟踪和保护移动无线节点

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102237

J. Kong, D. Wu, X. Hong, M. Gerla

引用次数: 12

Coordinated sensor deployment for improving secure communications and sensing coverage 协调传感器部署，改善安全通信和传感覆盖

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102239

Yinian Mao, Min Wu

{"title":"Coordinated sensor deployment for improving secure communications and sensing coverage","authors":"Yinian Mao, Min Wu","doi":"10.1145/1102219.1102239","DOIUrl":"https://doi.org/10.1145/1102219.1102239","url":null,"abstract":"Sensor network has a great potential in applications such as habitat monitoring, wildlife tracking, building surveillance, and military combat. The design of a sensor network system involves several important issues, including the sensing coverage, node-to-node or node-to-base-station communications, and the security in information gathering and relay by the sensors. In this paper, we show that the system performance on these aspects depends closely on how the sensors are deployed in the field, and on how the sensor locations can be adjusted after the initial deployment. For static sensor deployment, we investigate the hexagon and square lattice topology and analyze their impact on secure connectivity and sensing coverage. For advanced sensing devices that allow for location adjustment after deployment, we have established a new framework for coordinated updates of sensor locations. We propose two new sensor location updating algorithms, the VFSec and the Weighted Centroid algorithm, to jointly optimize sensing coverage and secure connectivity. Simulation results show that these new algorithms provide superior tradeoff over the existing approaches that do not take security into considerations.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122748023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 45

Key distribution and update for secure inter-group multicast communication 安全组间多播通信的密钥分配与更新

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102227

Weichao Wang, B. Bhargava

{"title":"Key distribution and update for secure inter-group multicast communication","authors":"Weichao Wang, B. Bhargava","doi":"10.1145/1102219.1102227","DOIUrl":"https://doi.org/10.1145/1102219.1102227","url":null,"abstract":"Group communication has become an important component in wireless networks. In this paper, we focus on the environments in which multiple groups coexist in the system, and both intra and inter group multicast traffic must be protected by secret keys. We propose a mechanism that integrates polynomials with flat tables to achieve personal key share distribution and efficient key refreshment during group changes. The proposed mechanism distributes keys via true broadcast. The contributions of the research include: (1) By switching from asymmetric algorithms to symmetric encryption methods, the proposed mechanism avoids heavy computation, and improves the processing efficiency of multicast traffic and the power usage at the wireless nodes. The group managers do not have to generate public-private key pairs when the group member changes. (2) It becomes more difficult for an attacker to impersonate another node since personal key shares are adopted. The additional storage overhead at the wireless nodes and the increased broadcast traffic during key refreshment are justified. In addition, we describe techniques to improve the robustness of the proposed mechanism under the complicated scenarios such as collusive attacks and batch group member changes.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133494366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 23

A key pre-distribution scheme for secure sensor networks using probability density function of node deployment 基于节点部署概率密度函数的安全传感器网络密钥预分配方案

ACM Workshop on Security of ad hoc and Sensor Networks Pub Date : 2005-11-07 DOI: 10.1145/1102219.1102233

Takashi Ito, H. Ohta, Nori Matsuda, Takeshi Yoneda

引用次数: 62