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

Formal Methods in Computer Aided Design (FMCAD)

作者： Annu John Igor Konnov Ulrich Schmid Helmut Veith Josef Widder Vienna University of Technology (TU Wien)

ISBN: (纸本)9781479926848

We introduce an automated parameterized verification method for fault-tolerant distributed algorithms (FTDA). FTDAs are parameterized by both the number of processes and the assumed maximum number of faults. At the center of our technique is a parametric interval abstraction (PIA) where the interval boundaries are arithmetic expressions over parameters. Using PIA for both data abstraction and a new form of counter abstraction, we reduce the parameterized problem to finite-state model checking. We demonstrate the practical feasibility of our method by verifying safety and liveness of several fault-tolerant broadcasting algorithms, and finding counter examples in the case where there are more faults than the FTDA was designed for.

关键词： Radiation detectors Abstracts Skeleton Resilience Model checking distributed algorithms Concrete

来源：评论

学校读者我要写书评

暂无评论

distributed Online algorithms for the Agent Migration Problem in WSNs

引用

MOBILE NETWORKS & APPLICATIONS 2013年第5期18卷 622-638页

作者： Tziritas, Nikos Lalis, Spyros Khan, Samee Ullah Loukopoulos, Thanasis Xu, Cheng-Zhong Lampsas, Petros Chinese Acad Sci Beijing Peoples R China Univ Thessaly Thessaly Greece IRETETH CERTH Thessaly Greece N Dakota State Univ Fargo ND 58105 USA Technol Educ Inst Lamia Lamia Greece Wayne State Univ Detroit MI USA

The mobile agent paradigm has been adopted by several systems in the area of wireless sensor networks as it enables a flexible distribution and placement of application components on nodes, at runtime. Most agent placement and migration algorithms proposed in the literature, assume that the communication rates between agents remain stable for a sufficiently long time to amortize the migration costs. Then, the problem is that frequent changes in the application-level communication may lead to several non-beneficial agent migrations, which may actually increase the total network cost, instead of decreasing it. To tackle this problem, we propose two distributed algorithms that take migration decisions in an online fashion, trying to deal with fluctuations in agent communication. The first algorithm is more of theoretical value, as it assumes infinite storage to keep information about the message exchange history of agents, while the second algorithm is a refined version that works with finite storage and limited information. We describe these algorithms in detail, and provide proofs for their competitive ratio vs. an optimal oracle. In addition, we evaluate the performance of the proposed algorithms for different parameter settings through a series of simulated experiments, also comparing their results with those achieved by an optimal static placement that is computed with full (a posteriori) knowledge of the execution scenarios. Our theoretical and experimental results are a strong indication for the robustness and effectiveness of the proposed algorithms.

关键词： distributed algorithms Online algorithms Optimizing network cost Wireless sensor and actuator networks Agent placement Agent migration Agent-based programming

来源：评论

学校读者我要写书评

暂无评论

Structuring distributed algorithms for mobile hosts

Structuring distributed algorithms for mobile hosts

引用

International Conference on distributed Computing Systems

作者： B.R. Badrinath A. Acharya T. Imielinski Department of Computer Science Rutgers University New Brunswick NJ USA

distributed algorithms have hitherto been designed for networks with static hosts. A mobile host (MH) can connect to the network from different locations at different times. This paper presents an operational system model for explicitly incorporating the effects of host mobility and proposes a general principle for structuring efficient distributed algorithms in this model. This principle is used to redesign two classical algorithms for distributed mutual exclusion for the mobile environment. We then consider a problem introduced solely by host mobility viz, location management for groups of MHs, and propose the concept of group location as an efficient approach to tackle the problem. Lastly, we present a framework which enables host mobility to be decoupled from the design of a distributed algorithm per se, to varying degrees.< >

关键词： distributed algorithms Mobile computing Algorithm design and analysis Mobile communication distributed computing Computer networks Portable computers Computer science Electrical capacitance tomography Protocols

来源：评论

学校读者我要写书评

暂无评论

Message complexity of distributed algorithms revisited

Message complexity of distributed algorithms revisited

引用

International Conference on Parallel distributed and Grid Computing (PDGC)

作者： Behnish Mann Alex Arvavid University of Northern British Columbia Prince George Canada

distributed systems offer many features such as resource sharing, scalability, fault tolerance and reliability. Several distributed algorithms have been proposed in literature to solve fundamental problems such as mutual exclusion and leader election in distributed systems. When more than one algorithm is invented to solve the same problem particularly in asynchronous distributed systems, their performance is compared mostly based on the message complexity. This paper reviews the concept of message complexity and offers more clarity by studying the performance of the two most popular distributed algorithms - Ricart-Agrawala's algorithm and Raymond algorithm designed to solve the mutual exclusion problem. The paper has four main contributions (i) observes how the message complexity is understood and computed in the asynchronous distributed system so far and exposes its elusiveness; (ii) offers a more suitable definition of message complexity; (iii) briefly presents the simulator designed to study the performance of the distributed algorithms using the refined metric; and finally (iv) discusses about the simulation study to illustrate the significance and usefulness of the proposed metric.

关键词： Complexity theory Topology Algorithm design and analysis Network topology distributed algorithms Measurement Engines

来源：评论

学校读者我要写书评

暂无评论

A correct-by-construction approach for proving distributed algorithms in spanning trees

A correct-by-construction approach for proving distributed a...

引用

International Conference on Computer and Information Science (ACIS)

作者： Faten Fakhfakh Mohamed Tounsi Mohamed Mosbah Dominique Mery Ahmed Hadj Kacem ReDCad Laboratory FSEGS Tunisia LaBRI Laboratory University of Bordeaux France LORIA University of Lorrain Nancy France

Dynamic networks are characterized by frequent topology changes due to the unpredictable appearance and disappearance of mobile devices and/or communication links. In this paper, we propose a correct-by-construction approach for proving distributed algorithms in a forest of spanning trees. Our approach consists in two phases. The first one aims to control the dynamic structure of the network by triggering a maintenance operation when the forest is altered. To do so, we develop a formal pattern using the Event-B method which is based on an existing model for building and maintaining a spanning forest in dynamic networks. The second phase of our approach deals with distributed algorithms which can be applied to spanning trees. We illustrate our pattern through an example of a leader election algorithm. The proof statistics show that our solution can save efforts on specifying as well as proving the correctness of distributed algorithms in a forest of spanning trees.

关键词： Vegetation distributed algorithms Network topology Topology Heuristic algorithms Computational modeling Buildings

来源：评论

学校读者我要写书评

暂无评论

A note on the study of Bluetooth networks' distributed algorithms

A note on the study of Bluetooth networks' distributed algor...

引用

IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Ahmed Jedda Nejib Zaguia Guy-Vincent Jourdan University of Ottawa Canada

Bluetooth has provided many features that enable wireless ad-hoc networks, but it has also introduced many problems. The root cause of these problems lies in its communication mechanisms. We argue in this paper that the models that have been used to study distributed algorithms on Bluetooth networks do not adequately model these networks in most cases, and were often oversimplified. This is mainly due to how the many restrictions that the Bluetooth specifications impose on such networks are taken into account, and the lack of ldquoshared knowledgerdquo of these restrictions among the researchers of this field. We give some examples to back our argument. We give also some suggestions and proposals to overcome these issues.

关键词： Bluetooth distributed algorithms Algorithm design and analysis Ad hoc networks Proposals Mobile ad hoc networks Interference Costs Spread spectrum communication Noise robustness

来源：评论

学校读者我要写书评

暂无评论

Adaptive distributed algorithms for power-efficient data gathering in sensor networks

Adaptive distributed algorithms for power-efficient data gat...

引用

International Conference on Wireless Networks, Communications and Mobile Computing

作者： J. Acimovic B. Beferull-Lozano R. Cristescu Laboratory of Nonlinear Systems EPF Lausanne Lausanne Switzerland Audiovisual Communications Laboratory (LCAV) EPF Lausanne Lausanne Switzerland Center for Mathematics of Information Caltech Pasadena CA USA

In this work, we consider the problem of designing adaptive distributed processing algorithms in large sensor networks that are efficient in terms of minimizing the total power spent for gathering the spatially correlated data from the sensor nodes to a sink node. We take into account both the power spent for purposes of communication as well as the power spent for local computation. Our distributed algorithms are also matched to the nature of the correlated field, namely, for piecewise smooth signals, we provide two distributed multiresolution wavelet-based algorithms, while for correlated Gaussian fields, we use distributed prediction based processing. In both cases, we provide distributed algorithms that perform network division into groups of different sizes. The distribution of the group sizes within the network is the result of an optimal trade-off between the local communication inside each group needed to perform decorrelation, the communication needed to bring the processed data (coefficients) to the sink and the local computation cost, which grows as the network becomes larger. Our experimental results show clearly that important gains in power consumption can be obtained with respect to the case of not performing any distributed decorrelating processing.

关键词： distributed algorithms Decorrelation Process design Algorithm design and analysis distributed processing Signal processing Spatial resolution Signal resolution Computer networks distributed computing

来源：评论

学校读者我要写书评

暂无评论

On collective motion in sensor networks: sample problems and distributed algorithms

On collective motion in sensor networks: sample problems and...

引用

IEEE Conference on Decision and Control

作者： A. Ganguli S. Susca S. Martinez F. Bullo J. Cortes Department of Mechanical and Environmental Engineering University of California슠Santa Barbara Santa Barbara CA USA Coordinated Science Laboratory University of Illinois Urbana-Champaign Urbana IL USA Department of Mechanical and Environmental Engineering and with the Center for Control Dynamical Systems and Computation University of California슠Santa Barbara Santa Barbara CA USA Department of Applied Mathematics and Statistics University of California Santa Cruz Santa Cruz CA USA

Adopting a tutorial approach, this paper surveys some control and systems theory problems that have recently gained interest in the context of multi-vehicle and sensor networks. By means of illustrative examples, we discuss some challenges in modeling of robotic networks, motion coordination algorithms, sensing and estimation tasks, and complexity of distributed algorithms.

关键词： Intelligent networks distributed algorithms Robot kinematics Robot sensing systems Sensor systems Sensor phenomena and characterization Marine animals Target tracking Control systems Biosensors

来源：评论

学校读者我要写书评

暂无评论

Contention-aware metrics for distributed algorithms: comparison of atomic broadcast algorithms

Contention-aware metrics for distributed algorithms: compari...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： P. Urban X. Defago A. Schiper Département de Systémes de Communication École Polytechnique Fédérale de Lausanne Lausanne Switzerland

Resource contention is widely recognized as having a major impact on the performance of distributed algorithms. Nevertheless, the metrics that are commonly used to predict their performance take little or no account of contention. We define two performance metrics for distributed algorithms that account for network contention as well as CPU contention. We then illustrate the use of these metrics by comparing four atomic broadcast algorithms, and show that our metrics allow for a deeper understanding of performance issues than conventional metrics.

关键词： distributed algorithms Broadcasting Performance analysis Time measurement Delay Algorithm design and analysis Analytical models Computational modeling Systems engineering and theory Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Real-time distributed algorithms for nonconvex optimal power flow

Real-time distributed algorithms for nonconvex optimal power...

引用

American Control Conference

作者： Yuejiang Liu Jean-Hubert Hours Giorgos Stathopoulos Colin N. Jones Automatic Control Laboratory Ecole Polytechnique Federale de Lausanne (EPFL)

ISBN: (纸本)9781509045839

The optimal power flow (OPF) problem, a fundamental problem in power systems, is generally nonconvex and computationally challenging for networks with an increasing number of smart devices and real-time control requirements. In this paper, we first investigate a fully distributed approach by means of the augmented Lagrangian and proximal alternating minimization method to solve the nonconvex OPF problem with a convergence guarantee. Given time-critical requirements, we then extend the algorithm to a distributed parametric tracking scheme with practical warm-starting and termination strategies, which aims to provide a closed-loop sub-optimal control policy while taking into account the grid information updated at the time of decision making. The effectiveness of the proposed algorithm for real-time nonconvex OPF problems is demonstrated in numerical simulations.

关键词： optimal load flow distributed algorithms Minimization methods Power flow control strategy Real time control power systems algorithms Smart devices

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：