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

2017 IEEE 6th Data Driven Control and Learning Systems Conference (DDCLS’17)

作者： Lingyu Li Weili Niu International Marketing Department China Electronics Technology Group Corporation School of Mathematics and Systems Science Beihang University (BUAA)

ISBN: (纸本)9781509054626

This paper deals with cooperative control problems for multi-agent networks subject to directed dynamic ***, the directed dynamic interactions in these networks are described by directed dynamic graphs which admit adjacency weights of edges in terms of transfer functions. Then a distributed dynamic protocol is proposed based on the nearest neighbor rule, and the Lyapunov-based approach is adopted to perform convergence analysis of networks. Once the adjacency weights are appropriately designed, it is verified that the networks can achieve consensus if and only if the directed dynamic graph contains a spanning tree. Finally, the simulations are given to illustrate the effectiveness of the proposed consensus results for cooperative networks in the presence of directed dynamic interactions.

关键词： Cooperative control multi-agent networks dynamic interaction distributed protocol consensus

来源：评论

学校读者我要写书评

暂无评论

Practical Timing Synchronization for Network Dynamics in Large Machine-to-Machine Networks

引用

China Communications 2016年第10期13卷 160-168页

作者： Lei Gu Shih-Chun Lin Fudan University and China Telecom Research Center Bank of Communication Ltd. the School of Electrical and Computer Engineering Georgia Institute of Technology

Efficient multi-machine cooperation and network dynamics still remain open that jeopardize great applications in largescale machine-to-machine(M2M) networks. Among all possible machine cooperation controls, to synchronize tremendous machines in a timing-efficient brings one of the greatest challenge and serves as the foundation for any other network control policies. In this paper, we propose a linear-time synchronization protocol in large M2M networks. Specifically, a closed-form of synchronization rate is provided by developing the statistical bounds of the second smallest eigenvalue of the graph Laplacian matrix. These bounds enable the efficient control of network dynamics, facilitating the timing synchronization in networks. Through a practical study in Metropolis, simulation results confirm our theoretical analysis and provide effective selection of wireless technologies, including Zigbee, Wi-Fi, and cellular systems, with respect to the deployed density of machines. Therefore, this paper successfully demonstrates a practical timing synchronization, to make a breakthrough of network dynamic control in real-world machine systems, such as Internet of Things.

关键词： timing synchronization network dynamics graph Laplacian matrix distributed protocol internet of things(IoTs) machine-to-machine(M2M) communications

来源：评论

学校读者我要写书评

暂无评论

Continuous finite-time output consensus tracking of high-order agents with matched and unmatched disturbances

引用

IET CONTROL THEORY AND APPLICATIONS 2016年第14期10卷 1716-1723页

作者： Yu, Shuanghe Long, Xiaojun Guo, Ge Dalian Maritime Univ Sch Informat Sci & Technol Dalian 116026 Peoples R China Dalian Univ Technol Sch Comp Sci & Technol Dalian 116024 Peoples R China

Finite-time output consensus tracking problem of n-order multi-agent systems (MAS) with matched and unmatched disturbances is investigated in this study. First, a distributed protocol is given for the nominal MAS to achieve finite-time consensus tracking. Second, the unmatched disturbances in every follower are converted to the matched ones through a state transformation, and a finite-time disturbance observer is utilised to estimate its disturbances and their derivatives up to the (n-l)-order (1ln) subject to the bounded (n-l+1)-order derivatives. Finally, the combined observer-based protocol achieves the finite-time output consensus tracking in spite of all the disturbances. Finally, simulation results validate the scheme.

关键词： observers mobile robots multi-robot systems graph theory continuous finite-time output consensus tracking high-order agents matched disturbances unmatched disturbances multiagent systems MAS distributed protocol state transformation finite-time disturbance observer disturbance estimation combined observer-based protocol

来源：评论

学校读者我要写书评

暂无评论

Simple and efficient local codes for distributed stable network construction

引用

distributed COMPUTING 2016年第3期29卷 207-237页

作者： Michail, Othon Spirakis, Paul G. Comp Technol Inst & Press Diophantus CTI N Kazantzaki StrPatras Univ CampusPOB 1382 Patras 26504 Greece Univ Liverpool Dept Comp Sci Liverpool Merseyside England

In this work, we study protocols so that populations of distributed processes can construct networks. In order to highlight the basic principles of distributed network construction, we keep the model minimal in all respects. In particular, we assume finite-state processes that all begin from the same initial state and all execute the same protocol. Moreover, we assume pairwise interactions between the processes that are scheduled by a fair adversary. In order to allow processes to construct networks, we let them activate and deactivate their pairwise connections. When two processes interact, the protocol takes as input the states of the processes and the state of their connection and updates all of them. Initially all connections are inactive and the goal is for the processes, after interacting and activating/deactivating connections for a while, to end up with a desired stable network. We give protocols ( optimal in some cases) and lower bounds for several basic network construction problems such as spanning line, spanning ring, spanning star, and regular network. The expected time to convergence of our protocols is analyzed under a uniform random scheduler. Finally, we prove several universality results by presenting generic protocols that are capable of simulating a Turing Machine ( TM) and exploiting it in order to construct a large class of networks. We additionally show how to partition the population into k supernodes, each being a line of log k nodes, for the largest such k. This amount of local memory is sufficient for the supernodes to obtain unique names and exploit their names and their memory to realize nontrivial constructions.

关键词： distributed network construction Stabilization Homogeneous population distributed protocol Interacting automata Fairness Random schedule Structure formation Self-organization

来源：评论

学校读者我要写书评

暂无评论

Energy efficient positioning of mobile base stations to improve wireless sensor network lifetime

引用

INTERNATIONAL JOURNAL OF SENSOR NETWORKS 2016年第2期20卷 92-103页

作者： Pradeepa, K. Duraisamy, S. Sri Krishna Coll Engn & Technol Dept Comp Applicat Coimbatore 641008 Tamil Nadu India

Base station placement problem has concerned the attention of lot of researchers as it has a major impact on the lifetime of wireless sensor network. This paper suggests using multiple mobile base stations and proposes a near optimal solution for maximising the lifetime of wireless sensor network. The base station placement problem relies on the idea of discretising the search space and is formulated as an optimisation problem. The optimum positions for base stations are obtained as the solution to an integer linear programming (ILP) formulation. The contribution of our paper is twofold. First we have offered a novel technique to transform the infinite solution space to a finite space with promising performance. Second we have formulated an ILP formulation to determine best locations for positioning the base station. We expand our contribution further to a distributed protocol which will provide a completely distributed and localised solution to the placement problem.

关键词： WSN wireless sensor network network lifetime mobile base station discretisation search space mobility distributed protocol

来源：评论

学校读者我要写书评

暂无评论

More agents may decrease global work: A case in butterfly decontamination

引用

THEORETICAL COMPUTER SCIENCE 2016年第PartA期655卷 41-57页

作者： Luccio, Fabrizio Pagli, Linda Univ Pisa Dipartimento Informat I-56100 Pisa Italy

This paper is a contribution to network decontamination with a view inherited from parallel processing. At the beginning some or all the vertices may be contaminated. The network is visited by a group of decontaminating agents. When a decontaminated vertex is left by the agents, it can be re-contaminated only if the number of infected neighbors exceeds a certain immunity threshold m. The main goal of the studies in this line is to minimize the number A of agents needed to do the job and, for a minimum team, to minimize the number M of agent moves. Instead of M we consider the number T of steps (i.e. parallel moves) as a measure of time, and evaluate the quality of a protocol on the basis of its work W = AT. Taking butterfly networks as an example, we compare different protocols and show that, for some values of m, a larger team of agents may require smaller work. (C) 2016 Published by Elsevier B.V.

关键词： Network decontamination distributed protocol Agent Work Butterfly Graph search

来源：评论

学校读者我要写书评

暂无评论

The Adversarial Noise Threshold for distributed protocols 16

The Adversarial Noise Threshold for Distributed Protocols

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete Algorithms

作者： William M. Hoza Leonard J. Schulman Caltech

ISBN: (纸本)9781510819672

We consider the problem of implementing distributed protocols, despite adversarial channel errors, on synchronous-messaging networks with arbitrary topology. In our first result we show that any n-party T-round protocol on an undirected communication network G can be compiled into a robust simulation protocol on a sparse (O(n) edges) subnetwork so that the simulation tolerates an adversarial error rate of Ω(1/n); the simulation has a round complexity of O((m log n)/n T), where m is the number of edges in G. (So the simulation is work-preserving up to a log factor.) The adversary's error rate is within a constant factor of optimal. Given the error rate, the round complexity blowup is within a factor of O(k log n) of optimal, where k is the edge connectivity of G. We also determine that the maximum tolerable error rate on directed communication networks is Θ(1/s) where s is the number of edges in a minimum equivalent digraph. Next we investigate adversarial per-edge error rates, where the adversary is given an error budget on each edge of the network. We determine the limit for tolerable per-edge error rates on an arbitrary directed graph to within a factor of 2. However, the construction that approaches this limit has exponential round complexity, so we give another compiler, which transforms T-round protocols into O(mT)-round simulations, and prove that for polynomial-query black box compilers, the per-edge error rate tolerated by this last compiler is within a constant factor of optimal.

关键词： Error analysis distributed protocol compilers networks(communications) error distribution noise threshold edges directed graphs Optimal

来源：评论

学校读者我要写书评

暂无评论

Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube 17

Massively-Parallel Similarity Join, Edge-Isoperimetry, and D...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete Algorithms

作者： Paul Beame Cyrus Rashtchian Computer Science & Engineering University of Washington

ISBN: (纸本)9781510836358

We study distributed protocols for finding all pairs of similar vectors in a large dataset. Our results pertain to a variety of discrete metrics, and we give concrete instantiations for Hamming distance. In particular, we give improved upper bounds on the overhead required for similarity defined by Hamming distance r > 1 and prove a lower bound showing qualitative optimality of the overhead required for similarity over any Hamming distance r. Our main conceptual contribution is a connection between similarity search algorithms and certain graph-theoretic quantities. For our upper bounds, we exhibit a general method for designing one-round protocols using edge-isoperimetric shapes in similarity graphs. For our lower bounds, we define a new combinatorial optimization problem, which can be stated in purely graph-theoretic terms yet also captures the core of the analysis in previous theoretical work on distributed similarity joins. As one of our main technical results, we prove new bounds on distance correlations in subsets of the Hamming cube.

关键词： Hamming distance Hypercube Upper bound distributed protocol Core analysis Lower bound

来源：评论

学校读者我要写书评

暂无评论

Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks 17

Uniform Information Exchange in Multi-channel Wireless Ad Ho...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Dongxiao Yu Li Ning Yong Zhang Hai Jin Yuexuan Wang Francis C. M. Lau Shengzhong Feng Services Computing Technology and System Lab Big Data Technology and System Lab Clusters and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Center for High Performance Computing Shenzhen Institutes of Advanced Technology CAS Department of Computer Science The University of Hong Kong

ISBN: (纸本)9781510855076

Information exchange is a basic primitive for maintaining the smooth running of a network or a system with multiple communicating agents. Given k packets initially stored at k nodes respectively, the problem is to disseminate the k packets to the whole network with the objective of minimizing the time used. We study this problem in single-hop multi-channel networks of n nodes, and target on devising uniform distributed protocols that do not rely on any prior knowledge of network parameters, such as the network size n or the number of packet holders k. Uniform protocols have better scalability and are more suitable for implementation in reality Specifically, we propose a uniform distributed protocol that with high probability accomplishes the dissemination in O(k/F+F·log n) rounds, assuming F available channels. This protocol is asymptotically optimal when k is large (k ≥ F~2 log n), and provides the best possible linear speedup with multiple channels comparing with the results using a single channel. To the best of our knowledge, this is the first uniform protocol for information exchange in multi-channel networks.

关键词： Information exchange Multi-channel networks distributed algorithm Uniform protocol information exchange distributed algorithms MULTICHANNEL Packet Uniform Uniforms Mobile ad hoc networks distributed protocol network parameters single-channel

来源：评论

学校读者我要写书评

暂无评论

A Graphical Game Theoretic Approach to Optimization of Energy Efficiency in Multihop Wireless Sensor Networks

A Graphical Game Theoretic Approach to Optimization of Energ...

引用

21st Asia-Pacific Conference on Communications (APCC)

作者： Jing, Hui Aida, Hitoshi Univ Tokyo Dept Elect Engn & Informat Syst Tokyo 1138656 Japan

Recently, multihop wireless sensor networks (WSNs) are widely developed and applied to energy efficient data collections from environments by establishing reliable transmission radio links and employing data aggregation algorithms, which can eliminate redundant transmissions and provide fusion information. In this paper, energy efficiency which consists of not only energy consumptions but also the amount of received data by the base station, as the performance metric to evaluate network utilities is presented for achieving energy efficient data collections. In order to optimize energy efficiency for improvements of network utilization, we firstly establish a graphical game theoretic model for energy efficiency in multihop WSNs, considering message length, practical energy consumptions and packet success probabilities. Afterwards, we propose a graphical protocol for performance optimization from Nash equilibrium of the graphical game theory. The approach also consists of the distributed protocol for generating optimum tree networks in practical WSNs. The experimental results show energy efficient multihop communications can be achieved by optimum tree networks of the approach. The quantitative evaluation and comparisons with related work are presented for the metric with respect to network energy consumptions and the amount of received data by the base station. The performances of our proposal are improved in all experiments. As an example, our proposal can achieve up to about 52% energy efficiency more than collection tree protocol (CTP). The corresponding tree structure is provided for the experiment.

关键词： multihop wireless sensor networks optimization energy efficiency graphical game theoretic model Nash equilibrium graphical approach distributed protocol

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：