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

Telecommunications: The Infrastructure for the 21st Century

作者： Peter Danielis Maik Gotzmann Dirk Timmermann Thomas Bahls Daniel Duchow Institute of Applied Microelectronics and Computer Engineering 18051 Rostock Germany Nokia Siemens Networks GmbH & Co. KG Broadband Access Division 17489 Greifswald Germany

Internet service providers (ISPs) have to store session data of their customers for operation, management, and control tasks. Thereby, each access node (AN) of an ISP's access network keeps track of session data (e.g., IP addresses, MAC addresses, and lease times of IP addresses) of all connected customers. Session data is highly volatile due to continuous changes. It has to be stored persistently as it is required for regular data forwarding and traffic filtering. In case of an AN's restart or crash, it needs to be reloaded. Today, session data is stored in an AN's flash memory, which is limited in its availability and rewritability and intended for other purposes. Therefore, this paper proposes to organize ANs into a distributed hash table (DHT)-based Peer-to-Peer network to share their available RAM resources. Thereby, the DHT network serves as semi-permanent distributed memory for a structured redundant and interleaved storage of session data. In doing so, availability of session data is actually increased despite using RAM for data storage. After a restart or crash, an AN reloads session data by selectively reading required data from the DHT network.

关键词： Peer to peer computing Internet Multiplexing DSL Flash memory Servers Broadband communication

来源：评论

学校读者我要写书评

暂无评论

Devices Profile for Web Services and the REST

Devices Profile for Web Services and the REST

引用

IEEE International Conference on Industrial Informatics (INDIN)

作者： Guido Moritz Elmar Zeeb Steffen Prüter Frank Golatowski Dirk Timmermann Regina Stoll Institute of Applied Microelectronics and Computer Engineering University of Rostock Rostock Germany Institute of Preventive Medicine University of Rostock Rostock Germany Center for Life Science and Automation Rostock Germany

For future application scenarios of resource constrained and low cost smart cooperating objects, miscellaneous technologies for wireless connectivity are existing or upcoming in the near future. But further cross domain middleware and dedicated communication protocols to provide syntactic and semantic interoperability and not only technical interoperability are still missing. Thus, this paper investigates on two major candidates for IP based low power communication, based on known and matured technologies and protocols. Therefore, analyses and pitfalls of RESTful architectures based on HTTP and the Devices Profile for Web Services are presented. Furthermore, the paper discusses differences of DPWS and RESTful design and furthermore proposes an approach for a generic mapping of emerging Bluetooth Low Energy technology with RESTful device architectures for seamless and transparent connectivity.

关键词： Web services Monitoring Service oriented architecture Protocols Costs Bluetooth Wireless sensor networks Communication industry ZigBee Middleware

来源：评论

学校读者我要写书评

暂无评论

Generic platform for advanced E-health applications

Generic platform for advanced E-health applications

引用

International Conference on e-health Networking, Applications and Services (HealthCom)

作者： Elmar Zeeb Guido Moritz Wolfgang Thronicke Myriam Lipprandt Andreas Hein Frerk Müller Jan Krüger Oliver Dohndorf Anna Litvina Christoph Fiehe Ingo Lück Frank Golatowski Dirk Timmermann Institute of Applied Microelectronics and Computer Engineering University of Rostock Rostock Germany Siemens AG SIS C-LAB Paderborn Germany OFFIS - Institute for Information Technology Oldenburg Germany TU Dortmund University Dortmund Germany IMATERNA Information & Communications Dortmund Germany

The demographic change and the cost pressure in the healthcare sector drive the need for efficient and secure medical homecare solutions which apply for the people who are elderly or in anastasis. As the complexity of such systems is rising, there is a need of a common foundation of components which can be reused to lower the implementation effort of such systems. The European ITEA2 OSAmI research project targets such a common foundation of basic components for a basic, widely applicable service-oriented component platform. The German OSAmI-D subproject develops a construction kit based on the OSAmI component platform with a particular focus on services for medical and E-Health applications. The results of the ongoing project and especially the foundation of reusable components are demonstrated in the scenario of home-based ergometer training during the rehabilitation of patients with cardiologic illnesses.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Flexray goes graphical

引用

engineering and Technology 2009年第6期4卷 40-41页

作者： Abke, Jörg Eyrich, Christian Steeg, Matthias Wiewesiek, Wolfgang Department of Computer Sciences and Electrical Engineering University of Applied Sciences Aschaffenburg Aschaffenburg Germany Fujitsu Microelectronics Europe Germany

FlexRay was conceived as a safety-critical network for cars but it is possible to squeeze graphical data onto it, as one experiment shows. FlexRay is now being deployed in automotive electronic architectures, as demonstrated by its introduction in new cars such as the BMW X5 and X6, where it is used for dynamic suspension control. The BMW 7-series will incorporate FlexRay, with further cars from other manufacturers expected to follow.

关键词： Safety engineering

来源：评论

学校读者我要写书评

暂无评论

Minimizing cost of scalable distributed least squares localization

Minimizing cost of scalable distributed least squares locali...

引用

3rd International Conference on New Technologies, Mobility and Security, NTMS 2009

作者： Behnke, Ralf Salzmann, Jakob Timmermann, Dirk Institute of Applied Microelectronics and Computer Engineering University of Rostock 18057 Rostock Germany

ISBN: (纸本)9781424462735

Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspects of WSN research is location estimation. As a good solution of fine grained localization Reichenbach et al. introduced the Distributed Least Squares (DLS) algorithm, which splits the costly localization process in a complex precalculation and a simple postcalculation which is performed on constrained sensor nodes to finalize the localization by adding locale knowledge. This approach lacks for large WSNs, because cost of communication and computation theoretically increases with the network size. In practice the approach is even unusable for large WSNs. An important assumption of DLS is that each blind node is able to communicate with each beacon node to receive the precalculation and to determine distances to beacon nodes. This restriction have been overcome by scalable DLS (sDLS), which enabled to use the idea of DLS in large WSNs for the first time. In this work we present an adaptation of sDLS, that reduces the cost of update operations which are an integral part of sDLS. ©2009 IEEE.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

SBCL - Improved centroid estimation

SBCL - Improved centroid estimation

引用

2009 International Conference on Ultra Modern Telecommunications and Workshops

作者： Behnke, Ralf Salzmann, Jakob Timmermann, Dirk Institute of Applied Microelectronics and Computer Engineering University of Rostock 18057 Rostock Germany

ISBN: (纸本)9781424439416

Localization of sensor nodes is one of the key issues in Wireless Sensor Networks. It is a precondition for a variety of applications, as well as geographic clustering and routing. A simple approach for coarse grained localization is Centroid Localization (CL) which was firstly presented by Bulusu et al. and assumed regularly arranged beacons. Unfortunately, CL has a biased error whenever exactly three beacons are in range or the beacons are situated at the edges of the sensor field. In this work, we investigate the bias and its impacts on localization error. With our shape-based CL algorithms, we present possibilities to reduce this error and improve the localization accuracy of CL. However, since our new approaches introduce more complexity to CL, an analysis of the complexity of the algorithms is presented. © 2009 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

sDLS - Distributed least squares localization for large wireless sensor networks

sDLS - Distributed least squares localization for large wire...

引用

2009 International Conference on Ultra Modern Telecommunications and Workshops

作者： Behnke, Ralf Salzmann, Jakob Lieckfeldt, Dominik Timmermann, Dirk Institute of Applied Microelectronics and Computer Engineering University of Rostock 18057 Rostock Germany

ISBN: (纸本)9781424439416

Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspect of WSN research is location estimation. As a good solution of fine grained localization Reichenbach et al. introduced the Distributed Least Squares (DLS) algorithm, which splits the costly localization process in a complex precalculation and a simple postcalculation which is performed on constrained sensor nodes to finalize the localization by adding locale knowledge. This allows to perform an originally complex calculation with high precision on constrained nodes. Besides this advantage, DLS lacks in two harmful constraints concerning practical appliance. On the one hand the algorithm does not scale, i.e. calculation and communication increases with the number of beacon nodes or with network size, respectively. On the other hand DLS even does not work for large networks. An important assumption of DLS is that each blind node can communicate with each beacon node to receive the precalculation and to determine distances to beacon nodes. In this work we present an adaptation of DLS, concerning major changes, which enables DLS to be used in large WSNs for the first time. At the same time computational and communicational cost of each node becomes independent from network size, while precision is kept on the same high level. © 2009 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Free-CLASH - Improved localization-free clustering in large wireless sensor networks

Free-CLASH - Improved localization-free clustering in large ...

引用

2009 International Conference on Ultra Modern Telecommunications and Workshops

作者： Salzmann, Jakob Behnke, Ralf You, Jiaxi Timmermann, Dirk University of Rostock Institute of Applied Microelectronics and Computer Engineering 18051 Rostock Germany

ISBN: (纸本)9781424439416

This paper investigates topology management of large wireless sensor networks. Due to their random deployment, nodes have to organize themselves as energy efficient as possible to avoid redundant sensing and transceiving tasks while maintaining complete sensor coverage and connectivity as long as possible. In this work, we present a clustering algorithm for redundancy detection. With few local rules, nodes are able to cluster themselves autonomously without location information. As an enhancement to its predecessors, we propose additional local rules to provide regular cluster structure without routing holes. Inside each regular cluster, nodes' roles are completely exchangeable and only one node per cluster is active. Simulation results of stochastic deployment are used to demonstrate the performance of our algorithm, in terms of coverage abilities, lifetime and regularity. ©2009 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

sDLSnd - Scalable distributed least squares localization with reduced complexity

sDLSnd - Scalable distributed least squares localization wit...

引用

3rd International Conference on New Technologies, Mobility and Security, NTMS 2009

作者： Behnke, Ralf Salzmann, Jakob Timmermann, Dirk Institute of Applied Microelectronics and Computer Engineering University of Rostock 18057 Rostock Germany

ISBN: (纸本)9781424462735

Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspects of WSN research is location estimation. As a good solution of fine grained localization Reichenbach et al. introduced the Distributed Least Squares (DLS) algorithm, which splits the costly localization process in a complex precalculation and a simple postcalculation which is performed on constrained sensor nodes to finalize the localization by adding locale knowledge. This approach lacks for large WSNs, because cost of communication and computation theoretically increases with the network size. In practice the approach is even unusable for large WSNs. An important assumption of DLS is that each blind node is able to communicate with each beacon node to receive the precalculation and to determine distances to beacon nodes. This restriction have been overcome by scalable DLS (sDLS), which enabled to use the idea of DLS in large WSNs for the first time. In this work an adaptation of sDLS is presented, dramatically reducing cost of update operations, which are an integral part of sDLS. In addition, localization accuracy becomes improved. ©2009 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

4-MASCLE - Improved coverage aware clustering with self healing abilities

4-MASCLE - Improved coverage aware clustering with self heal...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing in Conjunction with the UIC'09 and ATC'09 Conferences, UIC-ATC 2009

作者： Salzmann, Jakob Behnke, Ralf Gag, Martin Timmermann, Dirk University of Rostock Institute of Applied Microelectronics and Computer Engineering 18051 Rostock Germany

ISBN: (纸本)9780769537375

In large wireless sensor networks, randomly deployed nodes have to organize themselves as energy efficient as possible to avoid redundant sensor and transceiver operations. In addition to its energy awareness, the network has to guarantee complete functionality as long as possible. This paper presents an enhanced version of the clustering algorithm 2-MASCLE. The proposed 4-MASCLE algorithm combines advantages of temporal and spatial network fragmentation by introducing a network division in a four phase based cell system. The assisting ability of adjacent cells is exploited to apply self healing features to the network. We compare our developed algorithm to the basic algorithms and achieve a significant improve of network lifetime. © 2009 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：