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

Request-based gossiping without deadlocks

AUTOMATICA 2018年 93卷 454-461页

作者： Liu, Ji Mou, Shaoshuai Morse, A. Stephen Anderson, Brian D. O. Yu, Changbin (Brad) Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA Purdue Univ W Lafayette IN 47907 USA Yale Univ New Haven CT 06520 USA Australian Natl Univ Canberra ACT Australia Natl ICT Australia Ltd Canberra ACT Australia Shandong Comp Sci Ctr Jinan Shandong Peoples R China

By the distributed averaging problem is meant the problem of computing the average value of a set of numbers possessed by the agents in a distributed network using only communication between neighboring agents. Gossiping is a well-known approach to the problem which seeks to iteratively arrive at a solution by allowing each agent to interchange information with at most one neighbor at each iterative step. Crafting a gossiping protocol which accomplishes this is challenging because gossiping is an inherently collaborative process which can lead to deadlocks unless careful precautions are taken to ensure that it does not. Many gossiping protocols are request-based which means simply that a gossip between two agents will occur whenever one of the two agents accepts a request to gossip placed by the other. In this paper, we present three deterministic request -based protocols. We show by example that the first can deadlock. The second is guaranteed to avoid deadlocks by exploiting the idea of local ordering together with the notion of an agent's neighbor queue;the protocol requires the simplest queue updates, which provides an in-depth understanding of how local ordering and queue updates avoid deadlocks. It is shown that a third protocol which uses a slightly more complicated queue update rule can lead to significantly faster convergence;a worst case bound on convergence rate is provided. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： ITERATIVE methods (Mathematics) STOCHASTIC convergence BOUNDS (Mathematics) QUEUING theory distributed network protocols

来源：评论

学校读者我要写书评

暂无评论

On efficient distributed construction of near optimal routing schemes

引用

distributed COMPUTING 2018年第2期31卷 119-137页

作者： Elkin, Michael Neiman, Ofer Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel

Given a distributed network represented by a weighted undirected graph on n vertices, and a parameter k, we devise a randomized distributed algorithm that whp computes a routing scheme in rounds, where D is the hop-diameter of the network. Moreover, for odd k, the running time of our algorithm is . Our running time nearly matches the lower bound of rounds (which holds for any scheme with polynomial stretch). The routing tables are of size , the labels are of size , and every packet is routed on a path suffering stretch at most . Our construction nearly matches the state-of-the-art for routing schemes built in a centralized sequential manner. The previous best algorithms for building routing tables in a distributed small messages model were by Lenzen and Patt-Shamir (In: Symposium on theory of computing conference, STOC'13, Palo Alto, CA, USA, 2013) and Lenzen and Patt-Shamir (In: Proceedings of the 2015 ACM symposium on principles of distributed computing, PODC 2015, Donostia-San Sebastian, Spain, 2015). The former has similar properties but suffers from substantially larger routing tables of size , while the latter has sub-optimal running time of (O) over tilde (min{(nD)(1/2) center dot n(1/k), n(2/3+2/(3k)) + D}).

关键词： distributed computing distributed network protocols ELECTRONIC data processing ROUTING (Computer network management) COMPUTER network management

来源：评论

学校读者我要写书评

暂无评论

Simultaneous H∞ stabilisation for distributed networked multimode control systems with multiple packet dropouts

引用

IET CONTROL THEORY AND APPLICATIONS 2016年第6期10卷 625-636页

作者： Zhu, Yanfei Yang, Fuwen Han, Qing-Long E China Univ Sci & Technol Sch Informat Sci & Engn Shanghai 200237 Peoples R China Griffith Univ Griffith Sch Engn Gold Coast Campus Nathan Qld 4222 Australia

This study is concerned with the simultaneous H-infinity stabilisation problem for a physically interconnected large-scale system working in multiple operation modes. A distributed networked control framework is developed. The network-based distributed DOF controllers are designed, which use not only the local measurements but also the neighbouring controllers' broadcasts. The designed controllers guarantee the mean-square stability of the large-scale system in multiple operation modes, and achieve the prescribed H-infinity disturbance attenuation level. Furthermore, the consecutive packet dropouts that occur in multiple communication channels (from the local sensor to the local controller, from the neighbouring controllers to the local controller, and from the local controller to the local actuator) are considered. Based on a stochastic control approach and an orthogonal complement space technique, a sufficient condition for the existence of the simultaneous H-infinity stabilisation controllers is provided, and a parameterisation of the controller gains is derived. An iterative LMI algorithm is established to seek a feasible solution. Finally, a numerical simulation example is exploited to illustrate the validity of the proposed scheme.

关键词： RESEARCH Control theory (Mathematics) Electronic controllers Multimode-mode optical fibers Data packets & packeting distributed network protocols

来源：评论

学校读者我要写书评

暂无评论

A distributed Recurrent network Contributes to Temporally Precise Vocalizations

引用

NEURON 2016年第3期91卷 680-693页

作者： Hamaguchi, Kosuke Tanaka, Masashi Mooney, Richard Duke Univ Sch Med Dept Neurobiol Durham NC 27710 USA Kyoto Univ Grad Sch Med Dept Biol Sci Kyoto 6068501 Japan

How do forebrain and brainstem circuits interact to produce temporally precise and reproducible behaviors? Birdsong is an elaborate, temporally precise, and stereotyped vocal behavior controlled by a network of forebrain and brainstem nuclei. An influential idea is that song premotor neurons in a forebrain nucleus (HVC) form a synaptic chain that dictates song timing in a top-down manner. Here we combine physiological, dynamical, and computational methods to show that song timing is not generated solely by a mechanism localized to HVC but instead is the product of a distributed and recurrent synaptic network spanning the forebrain and brainstem, of which HVC is a component.

关键词： distributed network protocols SOUND production by animals PROSENCEPHALON BRAIN stem BIRDSONGS STEREOTYPED response (Biology) NEURONS

来源：评论

学校读者我要写书评

暂无评论

A Novel Dynamic Method in distributed network Attack-Defense Game

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-7页

作者： Liu Xiaojian Yuan Yuyu Beijing Univ Posts & Telecommun Coll Comp Sci & Technol Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Coll Software Engn Beijing 100876 Peoples R China

We analyze the distributed network attack-defense game scenarios, and we find that attackers and defenders have different information acquisition abilities since the ownership of the target system. Correspondingly, they will have different initiative and reaction in the game. Based on that, we propose a novel dynamic game method for distributed network attack-defense game. The method takes advantage of defenders' information superiority and attackers' imitation behaviors and induces attackers' reaction evolutionary process in the game to gain more defense payoffs. Experiments show that our method can achieve relatively more average defense payoffs than previous work.

关键词： distributed network protocols GAME theory INFORMATION theory COMPUTER science DYNAMIC models

来源：评论

学校读者我要写书评

暂无评论

Transmission Power Control with the Guaranteed Communication Reliability in WSN

引用

INTERNATIONAL JOURNAL OF distributed SENSOR networkS 2015年第10期11卷 1-12页

作者： Kim, Dae-Young Jin, Zilong Choi, Jungwook Lee, Ben Cho, Jinsung Changshin Univ Chang Won 630764 South Korea Kyung Hee Univ Yongin 446701 South Korea LIG Nex1 Co Ltd Songnam 446798 South Korea Oregon State Univ Corvallis OR 97331 USA

In a wireless sensor network, sensor nodes are deployed in an ad hoc fashion and they deliver data packets using multihop transmission. However, transmission failures occur frequently in the multihop transmission over wireless media. Thus, a loss recovery mechanism is required to provide end-to-end reliability. In addition, because the sensor nodes are very small devices and have insufficient resources, energy-efficient data transmission is crucial for prolonging the lifetime of a wireless sensor network. This paper proposes a transmission power control mechanism for reliable data transmission, which satisfies communication reliability through recovery of lost packets. The proposed method calculates packet reception rate (PRR) of each hop to maintain end-to-end packet delivery rate (PDR), which is determined based on the desired communication reliability. Then, the transmission power is adjusted based on the PRR to reduce energy consumption. The proposed method was evaluated through extensive simulations, and the results show that it leads to more energy-efficient data transmission compared to existing methods.

关键词： DATA transmission systems TCP/IP (Computer network protocol) WIRELESS sensor nodes DATA packets & packeting TELECOMMUNICATION systems -- Energy consumption distributed network protocols

来源：评论

学校读者我要写书评

暂无评论

Device-independent quantum key distribution based on measurement inputs

引用

Physical Review A 2015年第6期92卷 062304-062304页

作者： Ramij Rahaman Matthew G. Parker Piotr Mironowicz Marcin Pawłowski Department of Mathematics University of Allahabad Allahabad 211002 U.P. India Institute of Theoretical Physics & Astrophysics University of Gdańsk 80-952 Gdańsk Poland Department of Informatics University of Bergen Post Box-7803 5020 Bergen Norway Department of Algorithms and System Modelling Faculty of Electronics Telecommunications and Informatics Gdańsk University of Technology Gdańsk 80-233 Poland National Quantum Information Centre in Gdańsk Sopot 81-824 Poland

We provide an analysis of a family of device-independent quantum key distribution (QKD) protocols that has the following features. (a) The bits used for the secret key do not come from the results of the measurements on an entangled state but from the choices of settings. (b) Instead of a single security parameter (a violation of some Bell inequality) a set of them is used to estimate the level of trust in the secrecy of the key. The main advantage of these protocols is a smaller vulnerability to imperfect random number generators made possible by feature (a). We prove the security and the robustness of such protocols. We show that using our method it is possible to construct a QKD protocol which retains its security even if the source of randomness used by communicating parties is strongly biased. As a proof of principle, an explicit example of a protocol based on the Hardy's paradox is presented. Moreover, in the noiseless case, the protocol is secure in a natural way against any type of memory attack, and thus allows one to reuse the device in subsequent rounds. We also analyze the robustness of the protocol using semidefinite programming methods. Finally, we present a postprocessing method, and observe a paradoxical property that rejecting some random part of the private data can increase the key rate of the protocol.

关键词： Quantum mechanics Quantum cryptography distributed network protocols Quantum theory Quantum entanglement Telecommunication protocols -- Mathematical models Semidefinite programming Bell's theorem

来源：评论

学校读者我要写书评

暂无评论

The Sensors Connectivity within SCADA Automation Environment and New Trends for Security Development during Multicasting Routing Transmission

引用

INTERNATIONAL JOURNAL OF distributed SENSOR networkS 2015年第10期11卷 1-15页

作者： Shahzad, Aamir Udagepola, Kalum Priyanath Lee, Young-Keun Park, Soojin Lee, Malrey Chonbuk Natl Univ Sch Elect & Informat Engn Ctr Adv Image & Informat Technol Jeonju 561756 South Korea Sci Res Dev Inst Technol Australia Dept Informat & Comp Sci Brisbane Qld 4131 Australia Chonbuk Natl Univ Hosp Dept Orthoped Surg Jeonju 561756 South Korea Sogang Univ Sogang Inst Adv Technol Grad Sch MOT Seoul 121742 South Korea

This study examined the security of SCADA system and its protocols, more specifically, SCADA/DNP3 protocol security. To achieve the study goals, a SCADA simulation environment is designed for water pumping process through connectivity of intelligent sensors, the payload is constructed, and security is deployed inside DNP3 protocol stack and then bytes are multicast to subcontrollers.

关键词： SUPERVISORY control & data acquisition systems AUTOMATION MULTICASTING (Computer networks) ROUTING (Computer network management) distributed network protocols INTELLIGENT sensors

来源：评论

学校读者我要写书评

暂无评论

distributed Congestion Mitigation and Medium Access in Duty Cycling Wireless Sensor networks

引用

INTERNATIONAL JOURNAL OF distributed SENSOR networkS 2014年第8期000卷 1-11页

作者： Liu, Hao Liu, Ye Southeast Univ Natl ASIC Syst Engn Res Ctr Nanjing 210096 Jiangsu Peoples R China Southeast Univ Suzhou Key Lab Integrated Circuits & Syst Suzhou 215123 Peoples R China

Duty cycling is an efficient design approach to achieve energy efficiency in wireless sensor networks. However, it may aggravate congestion due to long access delay and amplified hidden/exposed terminal problems. This paper first investigates some key facts that impact congestion and deteriorate packet transmission. With above observations, we propose a queue length based contention window adjustment approach, which allows congested nodes having high priority to access the channel. Then, a batch transmission scheme is introduced to drain accumulated packets rapidly. Finally, a random preamble mechanism is designed, so that congested nodes have more chances to get channel when other transmission is happening. Through the experiments on TelosB nodes test-bed using TinyOS, evaluation results show that our proposed schemes can mitigate congestion efficiently and have better performance than traditional approaches.

关键词： WIRELESS sensor networks -- Access control distributed network protocols DATA packets & packeting QUEUEING networks (Data transmission) WIRELESS sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Collaborative Opportunistic Scheduling in Heterogeneous networks: A distributed Approach

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2014年第1期2014卷 1-12页

作者： Sun, Donglai Liu, Yang Li, Jianhua Wu, Yue Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Shanghai 200240 Peoples R China Univ Michigan Dept EECS Ann Arbor MI 48105 USA

We consider a collaborative opportunistic scheduling problem in a decentralized network with heterogeneous users. While most related researches focus on solutions for optimizing decentralized systems' total performance, we proceed in another direction. Two problems are specifically investigated. (1) With heterogenous users having personal demands, is it possible to have it met by designing distributed opportunistic policies? (2) With a decentralized mechanism, how can we prevent selfish behaviors and enforce collaboration? In our research, we first introduce a multiuser network model along with a scheduling problem constrained by individual throughput requirement at each user's side. An iterative algorithm is then proposed to characterize a solution for the scheduling problem, based on which collaborative opportunistic scheduling scheme is enabled. Properties of the algorithm, including convergence, will be discussed. Furthermore in order to keep the users staying with the collaboration state, an additional punishment strategy is designed. Therefore selfish deviation can be detected and disciplined so that collaboration is enforced. We demonstrate our main findings with both analysis and simulations.

关键词： distributed network protocols PROBLEM solving STOCHASTIC convergence SCHEDULING PERFORMANCE evaluation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：