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

An unbiased global coin flipping protocol on synchronous distributed systems

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2001年第1期E84D卷 40-47页

作者： Yoda, K Okabe, Y Kanazawa, N Kyoto Univ Grad Sch Engn Div Appl Syst Sci Kyoto 6068501 Japan Kyoto Univ Grad Sch Informat Kyoto 6068501 Japan Kyoto Univ Data Proc Ctr Kyoto 6068501 Japan

We present a distributed protocol for achieving totally unbiased global coin flipping in the presence of an adversary. We consider a synchronous system of n processors at most t of which may be corrupted and manipulated by a malicious adversary. and assume a complete network where every two processors are connected via a private channel. Our protocol is deterministic and assumes a very powerful adversary. Although the adversary cannot eavesdrop, it is computationally unbounded, capable of rushing and dynamic. This is the same model that is adopted in Yao's global coin flipping protocol. which we use as the base of our protocol. Our protocol tolerates almost n/3 processor failures: and terminates in t + 4 rounds. The resilience of our protocol is greatly improved from that of Yao's protocol at the slight expense of running time, which is only added just two rounds.

关键词： distributed protocol global coin flipping synchronous distributed system adversary

来源：评论

学校读者我要写书评

暂无评论

distributed Multi-Failure Localization protocol for All-Optical Networks

Distributed Multi-Failure Localization Protocol for All-Opti...

引用

International Conference on Optical Network Design and Modeling

作者： Khair, Mazen Zheng, Jun Mouftah, Hussein T. Univ Ottawa Sch Informat Technol & Engn Ottawa ON K1N 6N5 Canada

ISBN: (纸本)9781424441877

In this paper, we propose a distributed fault localization protocol, called Parallel Limited Perimeter Vector Matching (P-LVM) protocol, for localizing multi-link failures in all-optical networks. The P-LVM protocol is based on the Limited Perimeter Vector Matching (LVM) protocol for localizing single-link failures in all-optical networks. To handle multi-link failures, it tries to separate each failure in a small perimeter area after identifying each perimeter area with its corresponding failure and then localize the failures in parallel respectively in a distributed manner. Through simulation results, we show that the P-LVM protocol can effectively localize multi-link failures that occur simultaneously or at different times in all-optical networks.

关键词： fault localization multi-failure distributed protocol optical network

来源：评论

学校读者我要写书评

暂无评论

distributed protocolS FOR ACCESS ARBITRATION IN TREE-STRUCTURED COMMUNICATION CHANNELS

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1991年第3期39卷 416-425页

作者： MELEN, R TURNER, JS WASHINGTON UNIV ST LOUISMO 63130

We consider the problem of arbitrating access to a tree structured communication channel with large geographic extent, providing multipoint communication among a set of terminals. In our model, terminals transmit information in bursts consisting of many packets and compete for the right to transmit bursts. In the simplest case, the channel allows only one terminal to transmit at a time;this can be extended to k concurrent transmitters. The problem resembles contention resolution in local area networks. It is distinguished by the topology of the channel, the magnitude of the delays involved and the potential for multiple transmitters. In this paper, we identify two general approaches and several specific assess arbitration algorithms and make a preliminary assessment of their promise.

关键词： Access Arbitrating Device Terminal distributed protocol BURSTS multipoint communication TRANSMITTING token

来源：评论

学校读者我要写书评

暂无评论

distributed protocols for Constrained Optimization of Integrator Chain Multiagent Systems

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2024年第10期69卷 7197-7204页

作者： Zou, Yao Huang, Bomin Sun, Yongbin Li, Qing Meng, Ziyang He, Wei Univ Sci & Technol Beijing Sch Intelligence Sci & Technol Beijing 100083 Peoples R China Univ Sci & Technol Beijing Inst Artificial Intelligence Beijing 100083 Peoples R China Univ Sci & Technol Beijing Key Lab Intelligent Unmanned Syst B Minist Educ Beijing 100083 Peoples R China Jimei Univ Coll Comp Engn Xiamen 361021 Peoples R China Beihang Univ Sch Automat Sci & Elect Engn State Key Lab Virtual Real Technol & Syst Beijing 100191 Peoples R China Univ Sci & Technol Beijing USTB Sch Automat & Elect Engn Beijing 10083 Peoples R China Minist Educ Key Lab Knowledge Automat Ind Proc Beijing 10083 Peoples R China Tsinghua Univ Dept Precis Instrument Beijing 100084 Peoples R China

This article studies the constrained optimization problem of integrator chain multiagent systems from the distributed perspective. Particularly, all the agents collaborate to find an optimal solution of a global objective function summed by multiple local ones, each of which is just convex and belongs to an individual agent. However, the potential optimal solutions are simultaneously subject to set constraints and two kinds of equality constraints, i.e., individual equality constraint and aggregate equality constraint, whereas their involved constraint parameters are privately available to individual agents. With a proper coordinate transformation, a distributed optimization protocol is synthesized by introducing proper internal dynamics. Under the Lyapunov framework, it is shown with a convex theory that the synthesized distributed protocol enables the multiagent system to achieve the concerned constrained optimization objective. An example is finally given to confirm the optimization effectiveness.

关键词： Optimization protocols Multi-agent systems Linear programming STEM Aggregates Decision feedback equalizers Constrained optimization distributed protocol equality constraint integrator chain system set constraint

来源：评论

学校读者我要写书评

暂无评论

distributed In-Time Multiple Coverage Holes Healing protocol

引用

Journal of Electronic Science and Technology 2012年第2期10卷 185-191页

作者： Lin-Na Wei Zhi-Guang Qin School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China

Coverage holes often appear in wireless sensor networks due to sensor failure or the inheritance of sensor＇s random distribution. In the hybrid model, mobile sensors in the network are acquired to heal coverage holes by their mobifity. When multiple coverage holes appear in the sensor network and each of them has a time requirement （in which the coverage hole has to be healed）, conflicts for the requests of the same mobile sensor may arise. A distributed multiple mobile sensor schedufing protocol （DMS） is proposed in this paper to solve this problem by finding mobile sensors in the time response zone defined by the time requirement of each coverage hole. Simulation results show that DMS can well schedule the mobile sensors to move to multiple coverage holes within the time requirement.

关键词： Coverage bole distributed protocol mobile sensor dispatch sensor network time limited.

来源：评论

学校读者我要写书评

暂无评论

Efficient Model Checking of Fault-Tolerant distributed protocols

Efficient Model Checking of Fault-Tolerant Distributed Proto...

引用

IEEE/IFIP 41st International Conference on Dependable Systems and Networks (DSN)

作者： Bokor, Peter Kinder, Johannes Serafini, Marco Suri, Neeraj Tech Univ Darmstadt Darmstadt Germany Yahoo Res Barcelona Spain

ISBN: (纸本)9781424492312

To aid the formal verification of fault-tolerant distributed protocols, we propose an approach that significantly reduces the costs of their model checking. These protocols often specify atomic, process-local events that consume a set of messages, change the state of a process, and send zero or more messages. We call such events quorum transitions and leverage them to optimize state exploration in two ways. First, we generate fewer states compared to models where quorum transitions are expressed by single-message transitions. Second, we refine transitions into a set of equivalent, finer-grained transitions that allow partial-order algorithms to achieve better reduction. We implement the MP-Basset model checker, which supports refined quorum transitions. We model check protocols representing core primitives of deployed reliable distributed systems, namely: Paxos consensus, regular storage, and Byzantine-tolerant multicast. We achieve up to 92% memory and 85% time reduction compared to model checking with standard unrefined single-message transitions.

关键词： Model checking distributed protocol Quorum Formal verification Messages Leverage Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A Two-level Cluster-based Cognitive Radio Sensor Network: System Architecture, Hardware Design, and distributed protocols

A Two-level Cluster-based Cognitive Radio Sensor Network: Sy...

引用

2015 IEEE International Conference on Cloud Engineering

作者： Salameh, Haythem Bany Dhainat, Mohammed F. Al-hajji, Ali Aqeli, Raed Fathi, Mohammad Yarmouk Univ Irbid Jordan Jordan Civil Def Amman Jordan

ISBN: (纸本)9781479982189

In this paper, we present an integrated hardware design and software implementation for a cognitive-radio wireless sensor network (CR-WSN). The implemented CR-WSN is an event-driven cluster-based network, where the sensor nodes in the network are organized into a two-level hierarchy of clusters, each with its own cognitive-enabled cluster-head (CR-CH). According to CR-WSN, the sensed data by a sensor node is reported to the associated CR-CH. The CR-CH opportunistically transmits the collected information over one of the idle primary radio channels to the data collecting node (sink). Specifically, we first describe the hardware design and implementation of the CR-WSN. Then, we propose a novel hybrid MAC design for the CR-WSN that ensures reliable and timely data delivery. The proposed protocol divides the MAC-layer operation into two domains: single-channel intra-cluster and cognitive inter-cluster domains. Experimental results are provided, which verify the effectiveness of the proposed MAC protocol and demonstrate a reliable, robust and scalable performance of the proposed system.

关键词： Cognitive Radio Event detection Software-defined Radio Wireless Monitoring Wireless Sensor Network Cognitive radio Event detection computer hardware design Wireless sensor networks distributed protocol Wireless monitoring Software radio network node wireless channels software implementation

来源：评论

学校读者我要写书评

暂无评论

Time-optimal construction of overlay networks

引用

distributed COMPUTING 2023年第3期36卷 313-347页

作者： Goette, Thorsten Hinnenthal, Kristian Scheideler, Christian Werthmann, Julian Paderborn Univ Dept Comp Sci Warburger Str 100 D-33098 Paderborn Germany

This article shows how to construct an overlay network of constant degree and diameter O(log n) in O(log n) time starting from an arbitrary weakly connected graph. We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of, and new connections can be established by sending node identifiers. Suppose the initial network's graph is weakly connected and has constant degree. In that case, our algorithm constructs the desired topology with each node sending and receiving only O(log n) messages in each round in O(log n) time w.h.p., which beats the currently best O(log3/2 n) time algorithm of Gotte et al. (International colloquium on structural information and communication complexity (SIROCCO), Springer, 2019). Since the problem cannot be solved faster than by using pointer jumping for O(log n) rounds (which would even require each node to communicate Q(n) bits), our algorithm is asymptotically optimal. We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of Kwok and Lau (Approximation, randomization, and combinatorial optimization. Algorithms and techniques (APPROX/RANDOM 2014), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2014). Additionally, we show how our algorithm can be used to efficiently solve graph problems in hybrid networks (Augustine et al. in Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, SIAM, 2020). Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the initial edges is unrestricted, whereas only polylogarithmically many messages can be sent over edges that have been established throughout an algorithm's execution. For an (undirected) graph G with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in O(log n) time w.h.p.

关键词： distributed protocol Peer-to-peer network Randomized algorithm Expander

来源：评论

学校读者我要写书评

暂无评论

MUSTER: Adaptive Energy-Aware Multisink Routing in Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2011年第12期10卷 1694-1709页

作者： Mottola, Luca Picco, Gian Pietro Swedish Inst Comp Sci S-16440 Stockholm Sweden Univ Trento DISI I-38050 Povo TN Italy

Wireless sensor networks (WSNs) are increasingly proposed for applications characterized by many-to-many communication, where multiple sources report their data to multiple sinks. Unfortunately, mainstream WSN collection protocols are generally designed to account for a single sink and, dually, WSN multicast protocols optimize communication from a single source. In this paper, we present MUSTER, a routing protocol expressly designed for many-to-many communication. First, we devise an analytical model to compute, in a centralized manner, the optimal solution to the problem of simultaneously routing from multiple sources to multiple sinks. Next, we illustrate heuristics approximating the optimal solution in a distributed setting, and their implementation in MUSTER. To increase network lifetime, MUSTER minimizes the number of nodes involved in many-to-many routing and balances their forwarding load. We evaluate MUSTER in emulation and in a real WSN testbed. Results indicate that our protocol builds near-optimal routing paths, doubles the WSN lifetime, and overall delivers to the user 2.5 times the amount of raw data w.r.t. mainstream protocols. Moreover, MUSTER is intrinsically amenable to in-network aggregation, pushing the improvements up to a 180 percent increase in lifetime and a four-time increase in data yield.

关键词： Wireless sensor networks multisink routing analytical model distributed protocol performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Robust iterative learning protocols for finite-time consensus of multi-agent systems with interval uncertain topologies

引用

INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE 2015年第5期46卷 857-871页

作者： Meng, Deyuan Jia, Yingmin Du, Junping Beihang Univ BUAA Res Div 7 Beijing 100191 Peoples R China Beihang Univ BUAA Dept Syst & Control Beijing 100191 Peoples R China Beijing Univ Posts & Telecommun Sch Comp Sci & Technol Beijing Key Lab Intelligent Telecommun Software & Beijing 100876 Peoples R China

This paper is devoted to the robust finite-time output consensus problems of multi-agent systems under directed graphs, where all agents and their communication topologies are subject to interval uncertainties. distributed protocols are constructed by using iterative learning control (ILC) algorithms, where information is exchanged only at the end of one iteration and learning is used to update the control inputs after each iteration. It is proved that under ILC-based protocols, the finite-time consensus can be achieved with an increasing number of iterations if the communication network of agents is guaranteed to have a spanning tree. Moreover, if the information of any desired terminal output is available to a portion (not necessarily all) of the agents, then the consensus output that all agents finally reach can be enabled to be the desired terminal output. It is also proved that for all ILC-based protocols, gain selections can be provided in terms of bound values, and consensus conditions can be developed associated with bound matrices. Simulation results are given to demonstrate the effectiveness of our theoretical results.

关键词： robustness distributed protocol interval uncertainty iterative learning control finite-time consensus multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：