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

10th ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, PE-WASUN 2013 - Co-located with ACM MSWiM 2013

作者： Bachorek, Adam Palanisamy, Bagavathiannan Schmitt, Jens B. Disco / Distributed Computer Systems Lab. University of Kaiserslautern Kaiserslautern Germany

ISBN: (纸本)9781450323604

Ensuring the aspired outcome quality of network-based applications has ever implied an appropriate prognosis of the performance behavior the underlying communication structures will exhibit prior to potential optimization steps. However, the reliable forecast of correlative metrics is still a challenging task, especially in terms of wireless network systems that reject centralized or manual administration. In the context of our prospective self-management concept for autonomous analysis and control of volatile performance characteristics in Wireless Sensor Networks (WSNs), we relate a common network property known as packet transfer delay to various adjustable parameters peculiar to such radio network technologies. Our hands-on experiments reveal the reproducible influence of packet size, backoff period, and number of active neighbor nodes on the medium access procedure and involved performance indicators. By means of a closed formulation of permutable weighted drivers, we investigate the average-case predictability of inter-node end-to-end delays for arbitrary configurations of given network parameters. We validate our prediction method against basic multi-hop networking scenarios while verifying its practicability on a typical resource-scarce WSN platform. Leveraging measurement-driven inspection and conditional modeling of network attributes based on regression analysis, yield field test results substantiate the high precision of our approach to the estimation of performance-related WSN properties as the basis for application-aware performance optimization subject to projected complements. © 2013 ACM.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2012年 7201 LNCS卷 V-VI页

作者： Schmitt, Jens B. University of Kaiserslautern Disco - Distributed Computer Systems Lab. Computer Science Department P.O. Box 3049 67663 Kaiserslautern Germany

来源：评论

学校读者我要写书评

暂无评论

SUDOKU: Secure and usable deployment of keys on wireless sensors

SUDOKU: Secure and usable deployment of keys on wireless sen...

引用

2010 6th IEEE Workshop on Secure Network Protocols, NPSec 2010

作者： Wilhelm, Matthias Martinovic, Ivan Uzun, Ersin Schmitt, Jens B. Disco / Distributed Computer Systems Lab. TU Kaiserslautern Germany Computer Science Department University of California Irvine CA United States

ISBN: (纸本)9781424489152

Initial deployment of secrets plays a crucial role in any security design, but especially in hardware constrained wireless sensor networks. Many key management schemes assume either manually pre-installed shared secrets or keys authenticated with the aid of out-of-band channels. While manually installing secret keys affects the practicability of the key deployment, out-of-band channels require additional interfaces of already hardware-limited wireless sensor nodes. In this work, we present a key deployment protocol that uses pair-wise ephemeral keys generated from physical layer information which subsequently enables an authenticated exchange of public keys. Hence, this work presents an elegant solution to the key deployment problem without requiring more capabilities than already available on common low-cost devices. To justify the feasibility of this solution, we implement and experimentally evaluate the proposed key deployment protocol using commodity wireless sensor motes. ©2010 IEEE.

关键词： Network layers

来源：评论

学校读者我要写书评

暂无评论

Statistical response time bounds in randomly deployed wireless sensor networks

Statistical response time bounds in randomly deployed wirele...

引用

Conference on Local computer Networks (LCN)

作者： Steffen Bondorf B. Schmitt Jens disco | Distributed Computer Systems Lab University of Kaiserslautern Germany Distributed Computer Systems Lab University of Kaiserslautern Germany

Response time bounds are important for many application scenarios of wireless sensor networks (WSN). Often, during the planning phase of a WSN its topology is not known. It rather results from a deployment process. This makes the provision of deterministic response time bounds difficult. In this paper, we strive for statistical response time bounds in WSNs that take the stochastic nature of the deployment process into account. Based on a Monte Carlo method we derive estimates for quantiles of the maximum response time distribution under uncertainty about the topology. In numerical experiments we show that the long but light tail of this distribution causes considerably lower bounds compared to the deterministic one even under small violation probabilities and, yet, on the other hand compare favourably with the median of the distribution.

关键词： Time factors Topology Wireless sensor networks Network topology Calculus Uncertainty Delay

来源：评论

学校读者我要写书评

暂无评论

SUDOKU: Secure and usable deployment of keys on wireless sensors

SUDOKU: Secure and usable deployment of keys on wireless sen...

引用

IEEE Workshop on Secure Network Protocols (NPSec)

作者： Matthias Wilhelm Ivan Martinovic Ersin Uzun Jens B. Schmitt Disco / Distributed Computer Systems Lab TU Kaiserslautern Germany Computer Science Department University of California Irvine USA

关键词： Sensors Protocols Wireless sensor networks Wireless communication Communication system security Base stations Cryptography

来源：评论

学校读者我要写书评

暂无评论

Node deployment in large wireless sensor networks: Coverage, energy consumption, and worst-case delay 09

Node deployment in large wireless sensor networks: Coverage,...

引用

Asian Internet Engineeering Conference, AINTEC 2009

作者： Poe, Wint Yi Schmitt, Jens B. Disco / Distributed Computer Systems Lab. University of Kaiserslautern Germany

ISBN: (纸本)9781605586144

Node deployment is a fundamental issue to be solved in Wireless Sensor Networks (WSNs). A proper node deployment scheme can reduce the complexity of problems in WSNs as, for example, routing, data fusion, communication, etc. Furthermore, it can extend the lifetime of WSNs by minimizing energy consumption. In this paper, we investigate random and deterministic node deployments for large-scale WSNs under the following performance metrics: coverage, energy consumption, and message transfer delay. We consider three competitors: a uniform random, a square grid, and a pattern-based Tri-Hexagon Tiling (THT) node deployment. A simple energy model is formulated to study energy consumption for each deployment strategy. Using basic geometry we propose a novel strategy for calculating the relative frequency of exactly k-covered points, which uses k-coverage maps, for both a square grid and THT. To model and consequently control the worst-case delay of a given WSN we build upon the so-called sensor network calculus (a recent methodology introduced in [7]). Finally, we analyze tradeoffs between these performance metrics for each deployment strategy to show which strategy is preferable under what factors, e.g., the number of nodes. Copyright 2009 ACM.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Sink placement without location information in large-scale wireless sensor networks 09

Sink placement without location information in large-scale w...

引用

Asian Internet Engineeering Conference, AINTEC 2009

作者： Poe, Wint Yi Schmitt, Jens B. Disco / Distributed Computer Systems Lab. University of Kaiserslautern Germany

ISBN: (纸本)9781605586144

Wireless Sensor Networks (WSN) comprise a large number of sensor nodes that possess scarce energy supplies. To minimize energy consumption and to consequently extend the lifetime of WSNs, we propose a local search technique for sink placement in WSNs. In addition, a proper sink placement plays a vital role in performance-sensitive WSN applications. Since it is not feasible for a sink to use global information, especially for large-scale WSNs, we introduce a self-organized sink placement (SOSP) strategy that combines the advantages of our previous works [7] and [8]. Besides, this paper is a substantial extension of [9]. The goal of this research is to provide a better sink placement strategy with a lower communication overhead. Avoiding the costly design of using the nodes' location information, each sink sets up its own group by communicating to its n-hop distance neighbors. While keeping the locally optimal placement, SOSP exhibits a better solution quality with respect to communication overhead and computational effort than previous solutions. To analyze performance issues, especially the worst-case delay of a given WSN, we use a methodology called sensor network calculus [10]. Copyright 2009 ACM.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Security by wireless: Why play fairer than the attacker 09

Security by wireless: Why play fairer than the attacker

引用

Asian Internet Engineeering Conference, AINTEC 2009

作者： Martinovic, Ivan Disco / Distributed Computer Systems Lab. Computer Science Department University of Kaiserslautern 67653 Kaiserslautern Germany

ISBN: (纸本)9781605586144

Security in wireless networks is a notorious problem, suffering from the following dilemma: On the one hand, wireless medium access puts the attacker into a much better position, on the other hand wireless devices most often have resource deficiencies (processing, memory, energy) which make conventional attack countermeasures based on cryptographic solutions impractical. Though, there have been many approaches towards lightweight security for wireless networks, this dilemma always persists, at least for the low-cost sector, say, for example, sensor networks or RFIDs. So far the overwhelming majority of wireless security approaches followed a conventional security paradigm which abstracts the physical communication as a logical channel. We depart from this paradigm, and try to leverage from the physical characteristics of wireless communications as much as possible, thus bringing us again in equality of arms with the attacker. This we coined the security by wireless principle. In the talk, several incarnations of the security by wireless principle are presented. These are taken from WLAN as well as wireless sensor network scenarios and show for different security goals that security by wireless designs can lead to interesting security solutions. Copyright 2009 ACM.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Self-organized sink placement in large-scale wireless sensor networks

Self-organized sink placement in large-scale wireless sensor...

引用

International Symposium on Modeling, Analysis and Simulation of computer and Telecommunication systems (MASCOTS)

作者： Wint Yi Poe Jens B. Schmitt Distributed Computer Systems Lab (DISCO) Technical University of Kaiserslautern Kaiserslautern Germany

ISBN: (纸本)9781424449279

The deficient energy supplies of wireless sensor networks (WSNs) drives network designers to optimize energy consumption in various ways. Not only with regard to the energy issue but also with respect to system performance, we design a local search technique for sink placement in WSNs that tries to minimize the maximum worst-case delay and extend the lifetime of a WSN, simultaneously. Since it is not feasible for a sink to use global information, which especially applies to large-scale WSNs, we introduce a self-organized sink placement (SOSP) strategy that combines the advantages of our previous works. The goal of this research is to provide a better sink placement strategy with a lower communication overhead. Avoiding the costly design of using nodes' location information, each sink sets up its own group by communicating to its n-hop distance neighbors. While keeping the locally optimal placement, SOSP exhibits a quality of the solutions with respect to communication overhead as well as computational effort that are better than previous solutions. To model and consequently control the worst-case delay of a given WSN we build upon the so-called sensor network calculus (a recent methodology first introduced).

关键词： Large-scale systems Wireless sensor networks Calculus Delay Design optimization Energy consumption System performance Spread spectrum communication Integer linear programming Routing

来源：评论

学校读者我要写书评

暂无评论

Placing multiple sinks in time-sensitive Wireless Sensor Networks using a Genetic Algorithm

Placing multiple sinks in time-sensitive Wireless Sensor Net...

引用

2008 14th GI/ITG Conference on Measuring, Modelling and Evaluation of computer and Communication systems, MMB 2008

作者： Poe, Wint Yi Schmitt, Jens B. Disco - Distributed Computer Systems Lab University of Kaiserslautern Germany

ISBN: (纸本)9783800730902

Performance issues in Wireless Sensor Networks (WSNs) play a vital role in many applications. Often the maximum allowable message transfer delay must be bounded in order to enable time-sensitive applications of WSNs like fire or intrusion detection systems. Hence, it is crucial to develop algorithms that minimize the worst-case delay in WSNs. In this work, we focus on the problem of placing multiple sinks such that the maximum worst-case delay is minimized while keeping the energy consumption as low as possible. For that purpose we develop an algorithm based on the Genetic Algorithm (GA) paradigm. To model and consequently control the worst-case delay of a given WSN we build upon the so-called sensor network calculus (a recent methodology introduced in [10]). In order to be able to assess the performance of the GA-based sink placement strategy we compare it to an exhaustive search algorithm as well as a Monte-Carlo search. All of the strategies are based on a discretization of the originally continuous search space into a finite search space, which forms a contribution of our work of independent interest. In the performance comparison with the other strategies the GA exhibits a favourable behaviour with respect to the quality of the solutions found and the computational effort invested. It thus seems to be a good candidate for addressing the problem of placing multiple sinks in large-scale time-sensitive WSNs.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：