Summary form only given. In pervasive computing the involved agents and services must organize themselves dynamically both in cooperative and non-cooperative environments in order to enable sharing of distributed reso...
详细信息
Summary form only given. In pervasive computing the involved agents and services must organize themselves dynamically both in cooperative and non-cooperative environments in order to enable sharing of distributed resources and knowledge discovery. Provisioning of trusted services appears to be an important factor to enable the success of this new computing paradigm. Reputation-based trust management models are becoming a focus of the research community as a viable solution. On the one hand, the trust models must satisfy constraints imposed by the environment, such as scalability, on the other hand, they must comply with the unique properties of trust as a social and economic phenomenon. In this paper we classify and compare approaches that have been proposed to fulfil this task. The identified classes are: social networks, probabilistic estimation techniques and game-theoretic reputation systems. Social networks and probabilistic estimation techniques operate on so called probabilistic behavior, while game-theoretic models are suitable for rational behavior. Probabilistic techniques normally imply smaller implementation overheads than social networks and enable a more intuitive transition of reputation to trust, while social networks are believed to be able to better detect misbehavior in a broader range of settings. Game-theoretic models, as appropriate for rational economic agents maximizing their utilities, can under specific circumstances enforce trustworthy behavior.
One substantial element in the UMTS radio network planning process is the topology planning that identifies the node B sites and evaluates if the coverage and capacity requirements are met. The selection of the optima...
详细信息
One substantial element in the UMTS radio network planning process is the topology planning that identifies the node B sites and evaluates if the coverage and capacity requirements are met. The selection of the optimal sites is an iterative process of subsequently changing the network configuration and evaluating its quality. The latter task is commonly performed by quite time-consuming Monte Carlo simulations. In this paper we present an analytic method to determine the coverage area of a WCDMA network. This method yields slightly less accurate results in a considerably shorter time compared to a Monte Carlo simulation. Consequently, it should be used at the beginning of the planning process for a fast selection of cell sites. When a suitable solution is found, Monte Carlo or dynamic simulations should be used to validate the fine tuning of the site configuration. Although a lot of research focuses on the analytic modelling of WCDMA, few studies consider general WCDMA networks with arbitrary cell layout, spatial traffic distribution, service mix, and propagation losses. That however, is the prerequisite that makes an analytic model actually applicable in the planning process. We demonstrate the general applicability of our method by studying the impact of the network load and the shadow fading constant on the coverage area of an example network with irregular node B layout, heterogeneous spatial traffic distribution, and multiple services.
Efficient use and re-use of traffic data depends on an ITS architecture that enables information sharing across a wide variety of intelligent transportation systems and applications. Existing ITS architectures, such a...
详细信息
Efficient use and re-use of traffic data depends on an ITS architecture that enables information sharing across a wide variety of intelligent transportation systems and applications. Existing ITS architectures, such as KAREN or the national ITS architecture, can be used to develop systems within a given framework thereby facilitating such inter-system integration. However, these architectures typically include assumptions regarding the overall organization of system functionality that prohibit integration of previously deployed systems without major reengineering. This paper presents a framework for an ITS architecture that has been designed for integrating novel as well as existing intelligent transportation systems and applications. The iTransIT framework supports a number of possible systems interaction paradigms and proposes a layered data model to facilitate data exchange between systems with diverse service requirements and functional organizations. These data layers are defined within a common context model, may be distributed across multiple systems, and exploit the overlapping temporal and spatial aspects of information generated and used by both legacy and future systems.
Today, we witness a transformation of radio access network topologies from strictly tree-structured towards meshed architectures. Yet, these edge networks follow mostly circuit-switched paradigms to support quality of...
详细信息
In high volume manufacturing (HVM), system control is shared between automation and human workers. The social organisation of workers plays an important role in supporting human decisions. Advances in the application ...
详细信息
In high volume manufacturing (HVM), system control is shared between automation and human workers. The social organisation of workers plays an important role in supporting human decisions. Advances in the application of automation to a system, may change the social organisation associated with its operation. It establishes new work roles with broader information demands that require advanced decision support systems (DSS). Visualisation tools have been shown to improve decision-making in many situations. While guidelines exist for the visual representation of quantitative data, no methodology exists for displaying complex information structures. We apply cognitive work analysis (CWA) to a semiconductor HVM plant to derive a model of its information structures. This is a first step towards the creation of an interactive visual DSS. A number of modifications to CWA techniques are made to accommodate the complexity of HVM
The goals of the interdisciplinary project HORN were as well to improve competitiveness of service providers that deliver grocery items as to develop new hardware and software needed for its realisation. In the first ...
详细信息
ISBN:
(纸本)3885793903
The goals of the interdisciplinary project HORN were as well to improve competitiveness of service providers that deliver grocery items as to develop new hardware and software needed for its realisation. In the first part, we introduce this home replenishment project, and analyse the needs and challenges of mobile services with similar constraints. In the second part, we introduce our modular software engineering approach and especially present the adopted reconfiguration mechanism for autonomous mobile applications, and its profiling concept.
In this paper, we surveyed several wellknown batch verification multiple digital signatures. These schemes can batch verify multiple digital signatures which need only one verification instead of t verifications. Howe...
详细信息
In this paper, we surveyed several wellknown batch verification multiple digital signatures. These schemes can batch verify multiple digital signatures which need only one verification instead of t verifications. However, a number of weaknesses of these schemes are pointed out. According to our proposed issues and challenges, we compared and analyzed them. To sum up these schemes, a secure and efficient multiple digital signatures scheme which needs only one verification remains an open problem.
To provide statistical service guarantee and achieve high network utilization, measurement-based admission control (MBAC) has been studied for over one decade. Many MBAC algorithms have been proposed in the literature...
详细信息
The current generation of P2P networks is intended to provide cost-effective alternatives to the traditional client-server architecture. The main goal is to store and retrieve data in a decentralized manner. The chall...
详细信息
The current generation of P2P networks is intended to provide cost-effective alternatives to the traditional client-server architecture. The main goal is to store and retrieve data in a decentralized manner. The challenge in doing so consists in creating a stable overlay network that allows for fast and efficient searches. In this paper we consider the Chord P2P algorithm in this context and analyze its stability and efficiency with stochastic methods. We present realistic probabilities for a disconnection and investigate the corresponding scalability.
暂无评论