IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.最新文献_第8页

State-based key management scheme for wireless sensor networks 基于状态的无线传感器网络密钥管理方案

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542877

Jaemin Park, Z. Kim, Kwangjo Kim

{"title":"State-based key management scheme for wireless sensor networks","authors":"Jaemin Park, Z. Kim, Kwangjo Kim","doi":"10.1109/MAHSS.2005.1542877","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542877","url":null,"abstract":"In wireless sensor networks, the random key pre-distribution arises as the practical solution for sharing common keys between sensor nodes. Since sensor networks suffer from the resource constraints like limited memory space, key pre-distribution scheme should require less memory space as possible while supporting strong security strength, i.e., high resilience against node capture. However, the existing schemes still require a large number of keys for each sensor to carry. Although location information is facilitated as deployment knowledge for improvement, if two sensor nodes closely located each other have very low probability to be in active-state at the same time, unnecessary key assignments can be happened since keys shared only between them may be hardly used. In this paper, we propose a novel random key pre-distribution scheme that exploits new deployment knowledge, state of sensors, to avoid unnecessary key assignments and reduce the number of required keys that each sensor node should carry while supporting higher connectivity and better resilience against node captures. The analysis of our proposed scheme shows the better performance and security strength than the previous schemes","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131382652","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}

引用次数: 32

A link-quality and congestion-aware cross layer metric for multi-hop wireless routing 多跳无线路由的链路质量和拥塞感知跨层度量

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542855

Golnaz Karbaschi, A. Fladenmuller

引用次数: 43

Using multiple communication channels for efficient data dissemination in wireless sensor networks 在无线传感器网络中利用多种通信通道实现数据的高效传播

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542829

R. Simon, Leijun Huang, Emerson Farrugia, Sanjeev Setia

引用次数: 32

A practical approach to deploy large scale wireless sensor networks 一种部署大规模无线传感器网络的实用方法

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542806

Mike Sheldon, Deji Chen, M. Nixon, A. Mok

引用次数: 19

Geographical cluster based multihop ad hoc network routing with guaranteed delivery 基于地理集群的多跳自组网路由保证传输

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542838

Hannes Frey

{"title":"Geographical cluster based multihop ad hoc network routing with guaranteed delivery","authors":"Hannes Frey","doi":"10.1109/MAHSS.2005.1542838","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542838","url":null,"abstract":"Exploring the faces of a planar graph is a prominent approach to recover from routing failures which may occur during geographic greedy forwarding heuristics applied in multihop ad hoc networks. A recently studied variant of planar graph based recovery, termed geographical cluster based routing, performs face exploration along the edges of an overlay graph instead of using the network links directly. For this routing variant it has been observed, that there exist node placements which result in a connected physical network while any planar overlay graph which is constructed by simply removing edges from that graph is disconnected. This article for the first time describes a technique to locally construct an overlay graph which is both planar and connected. In addition we present a generic routing framework which is based on the overlay graph introduced in this work. In contrast to existing planar graph routing techniques the described framework allows major flexibility regarding the possible next hop candidate nodes. The framework is envisioned to serve as an interesting starting point for future performance measurements of a multitude of its possible instances","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132062199","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}

引用次数: 19

New non-interactive key agreement and progression (NIKAP) protocols and their applications to security in ad hoc networks 新的非交互式密钥协议和进展(NIKAP)协议及其在自组织网络安全中的应用

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542873

Zhenjiang Li, J. Garcia-Luna-Aceves

{"title":"New non-interactive key agreement and progression (NIKAP) protocols and their applications to security in ad hoc networks","authors":"Zhenjiang Li, J. Garcia-Luna-Aceves","doi":"10.1109/MAHSS.2005.1542873","DOIUrl":"https://doi.org/10.1109/MAHSS.2005.1542873","url":null,"abstract":"Symmetric cryptographic primitives are preferable in designing security protocols for mobile ad hoc networks (MANETs) because they are computationally affordable for resource-constrained mobile devices forming a MANET. Most proposed key-distribution and key-agreement schemes for symmetric cryptosystem assume services from on-line centralized authorities, or require the interaction between communicating parties. However, the presence of a centralized authority violates the ad hoc definition of MANETs, and interactive schemes require the routing of the ad hoc network to be established before the key agreement, which is difficult to ensure in a mobile ad hoc network (MANET). We propose a new non-interactive key agreement and progression (NIKAP) scheme for MANETs, which does not require an on-line centralized authority, can establish and update pairwise shared keys between any two nodes in a non-interactive manner, is configurable to operate synchronously (S-NIKAP) or asynchronously (A-NIKAP), and is able to provide differentiated security services w.r.t. specified security policies. As the name implies, NIKAP is especially valuable to scenarios in which shared secret keys are desired to be computed without negotiation between nodes over insecure channels, and need to be updated frequently","PeriodicalId":268267,"journal":{"name":"IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123530125","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}

引用次数: 8

Interactive operations for visualization of ad-hoc sensor system domains 用于自组织传感器系统域可视化的交互式操作

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542818

M. Livingston, E. Herbst

引用次数: 3

On-demand loop-free routing in ad hoc networks using source sequence numbers 使用源序列号的自组织网络中的按需无环路路由

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542859

H. Rangarajan, J. Garcia-Luna-Aceves

引用次数: 13

Cooperative spatial multiplexing in mobile ad hoc networks 移动自组织网络中的协同空间复用

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542823

S. Kim

引用次数: 21

Sensor networks deployment using flip-based sensors 使用翻转传感器部署传感器网络

IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005. Pub Date : 2005-12-12 DOI: 10.1109/MAHSS.2005.1542812

S. Chellappan, Xiaole Bai, Bin Ma, D. Xuan

引用次数: 57