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

On Verification of a distributed algorithm of Databases Arranged as a Ring

On Verification of a Distributed Algorithm of Databases Arra...

International Conference on Innovative Computing and Communication/Asia-Pacific Conference on Information Technology and Ocean Engineering

作者： Qi, Minglong Guo, Qingping Zhong, Luo Wuhan Univ Technol Coll Comp Sci & Technol Wuhan 430070 Peoples R China

ISBN: (纸本)9780769539423

In a paper, Roscoe has proposed two algorithms that can preserve a form of consistency in the distributed databases arranged a ring, and validated them using a group-like algebra, invented by the same author. In this paper, we have simplified one of the algorithms and tried to validate it by applying a simple set theory. We suppose that each process located at a node of the ring emits one only one update in its history and all processes insert their updates in the ring at the same time. The behavior of the system is synchronized by a global system clock, and at each tick of the system clock, all updates move to their right neighbors.

关键词： algorithm verification distributed algorithm Ring databases Data consistency

来源：评论

学校读者我要写书评

暂无评论

Utility-Maximizing Data Collection in Crowd Sensing: An Optimal Scheduling Approach 12

Utility-Maximizing Data Collection in Crowd Sensing: An Opti...

引用

12th Annual IEEE International Conference on Sensing, Communication, and Networking - Workshops (SECON Workshops)

作者： Han, Yang Zhu, Yanmin Yu, Jiadi Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai Peoples R China Shanghai Key Lab Scalable Comp & Syst Shanghai Peoples R China

ISBN: (纸本)9781467373319

Sensing data collection is of great significance in mobile crowd sensing. We consider the problem of online maximization of data utility of the sensing data collected from smartphone users under a time average budget constraint. There are several major challenges, including random and unknown phone contexts, budget constraint and existence of data redundancy. Little work has studied this crucial problem. In this paper we formulate it as an online scheduling problem which determines sensing decisions for smartphones that are distributed over different regions of interest. We first propose a centralized online scheduling algorithm based on stochastic optimal control. To address the poor scalability issue of the centralized algorithm, we further propose a distributed online scheduling algorithm based on distributed correlated scheduling. It does not require any priori knowledge of future smartphone contexts, and hence sensing decisions can locally be made by individual smartphones. Rigorous theoretical analysis show that our algorithms can achieve a time average data utility that is within O(1/V) of the theoretical optimum. Extensive simnlations demonstrate that our algorithms produce high time average data utility.

关键词： Mobile crowd sensing data utility smartphone online scheduling distributed algorithm budget constraint

来源：评论

学校读者我要写书评

暂无评论

Throughput Optimality of Extended Back-pressure Traffic Signal Control algorithm 23

Throughput Optimality of Extended Back-pressure Traffic Sign...

引用

23rd Mediterranean Conference on Control and Automation (MED)

作者： Xiao, Nan Frazzoli, Emilio Luo, Yiwen Li, Yitong Wang, Yu Wang, Danwei Singapore MIT Alliance Res & Technol Ctr Singapore 138602 Singapore MIT Cambridge MA 02139 USA Nanyang Technol Univ EXQUISITUS Ctr E City Sch Elect & Elect Engn Singapore 639798 Singapore

ISBN: (纸本)9781479999361

The back-pressure/max-pressure traffic signal control algorithm proposed in the existing literature is distributed, maximizes network throughput, and can be implemented without knowing traffic arrival rates. In this paper, we present an extended back-pressure traffic signal control algorithm, which can further handle bounded measurement/estimation noises in queue lengths and incorporate online estimation of turning ratios and saturated flow rates. Therefore, the extended back-pressure algorithm forms an important step towards the real application of distributed traffic signal control. We prove that under certain conditions, the extended back-pressure algorithm still achieves maximum throughput, i.e., the expected long-term average of total queues is bounded from above under the extended back-pressure algorithm for largest possible set of arrival vectors.

关键词： Back-pressure distributed algorithm maximum throughput traffic signal control

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Fault-Tolerant Clustering algorithm for Wireless Sensor Networks 1

Energy Efficient Fault-Tolerant Clustering Algorithm for Wir...

引用

International Conference on Green Computing and Internet of Things (ICGCIoT)

作者： Nitesh, Kumar Azharuddin, Md Jana, Prasanta K. Indian Sch Mines Dept Comp Sci & Engn Dhanbad 826004 Bihar India

ISBN: (纸本)9781467379106

Energy utilization and fault tolerance are the two major issues in the development of a large scale wireless sensor networks (WSNs). In this paper, we propose a distributed algorithm to design an energy efficient cluster base WSN. We also propose a local recovery mechanism for the orphan sensor nodes, which are generated due to the failure of any cluster head. The proposed algorithm is based on cost function which is formulated with several parameters such as residual energy, distance and cluster cardinality. The algorithm is simulated rigorously over several performance metrics and the results acquired are compared with some existing algorithms to demonstrate its effectiveness.

关键词： distributed algorithm Wireless sensor networks Fault tolerance Clustering Residual energy

来源：评论

学校读者我要写书评

暂无评论

Minimal Synchrony for Byzantine Consensus 15

Minimal Synchrony for Byzantine Consensus

引用

34th Annual ACM Symposium on Principles of distributed Computing (PODC)

作者： Bouzid, Zohir Mostfaoui, Achour Raynal, Michel Univ Rennes IRISA Rennes France Univ Nantes LINA F-44322 Nantes France Inst Univ France Paris France

ISBN: (纸本)9781450336178

Solving the consensus problem requires in one way or another that the underlying system satisfies some synchrony assumption. Considering an asynchronous message-passing system of n processes where (a) up to t < n/3 may commit Byzantine failures, and (b) each pair of processes is connected by two uni-directional channels (with possibly different timing properties), this paper investigates the synchrony assumption required to solve consensus, and presents a signature-free consensus algorithm whose synchrony requirement is the existence of a process that is an eventual < t + 1 > bisource. Such a process p is a correct process that eventually has (a) timely input channels from t correct processes and (b) timely output channels to t correct processes ( these input and output channels can connect p to different subsets of processes). As this synchrony condition was shown to be necessary and sufficient in the stronger asynchronous system model (a) enriched with message authentication, and (b) where the channels are bidirectional and have the same timing properties in both directions, it follows that it is also necessary and sufficient in the weaker system model considered in the paper. In addition to the fact that it closes a long-lasting problem related to Byzantine agreement, a noteworthy feature of the proposed algorithm lies in its design simplicity, which is a first-class property.

关键词： Adopt-commit Asynchronous message-passing Byzantine process Consensus distributed algorithm Eventual timely channel Feasibility condition Lower bound Optimal resilience Reliable broadcast Signature-free algorithm Synchrony assumption

来源：评论

学校读者我要写书评

暂无评论

Ensemble Kernel Mean Matching 15

Ensemble Kernel Mean Matching

引用

IEEE International Conference on Data Mining (ICDM)

作者： Miao, Yun-Qian Farahat, Ahmed K. Kamel, Mohamed S. Univ Waterloo Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9781467395038

The Kernel Mean Matching (KMM) is an elegant algorithm that produces density ratios between training and test data by minimizing their maximum mean discrepancy in a kernel space. The applicability of KMM to large-scale problems is however hindered by the quadratic complexity of calculating and storing the kernel matrices over training and test data. To address this problem, this paper proposes a novel ensemble algorithm for KMM, which divides test samples into smaller partitions, estimates a density ratio for each partition and then fuses these local estimates with a weighted sum. Our theoretical analysis shows that the ensemble KMM has a lower error bound than the centralized KMM, which uses all the test data at once to estimate the density ratio. Considering its suitability for distributed implementation, the proposed algorithm is also favorable in terms of time and space complexities. Experiments on benchmark datasets confirm the superiority of the proposed algorithm in terms of estimation accuracy and running time.

关键词： Density ratio estimation Kernel mean matching Ensemble method distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Discovering The Intrinsic Communication Topology of Systems Using Ants Foraging Behavior

Discovering The Intrinsic Communication Topology of Systems ...

引用

Swarm/Human Blended Intelligence Workshop (SHBI 2015)

作者： Agharazi, Hanieh Kolacinski, Richard M. Loparo, Kenneth A. Case Western Reserve Univ Dept Elect Engn & Comp Sci Cleveland OH 44106 USA

ISBN: (纸本)9781467365222

Systems can be viewed as collections of interconnected elements that communicate with one another through physical phenomena. The principal focus of this work is the development of distributed algorithms for eliciting the intrinsic communication topology within a physical system and employ them for condition monitoring of the systems. The proposed approach in this paper provides the operators with graphs instead of tables or correlation matrices to identify the presence of a fault and request appropriate actions to mitigate it. Specifically, this paper considers physical systems and the available observations from a foraging perspective and discusses the application of ants foraging behavior techniques to discovery of the intrinsic communication topology of systems based on information-theoretic measures of information flow within systems. The mathematical framework of this approach and the application to an exemplary networked system are presented to illuminate discovery of the intrinsic communication topology.

关键词： information theory network theory (graphs) ants foraging behavior distributed algorithm information flow information theoretic measure interconnected elements networked system systems condition monitoring systems intrinsic communication topology Correlation Covariance matrices Mutual information Network topology Time series analysis Topology Yttrium topology distributed algorithms information flow Network topology time series analysis Information Theory Rare earths yttrium Ants foraging Covariance matrix variance covariance matrix Foraging behavior Communication Research

来源：评论

学校读者我要写书评

暂无评论

Decentralized Topology Management on Mobile Ad hoc Networks

Decentralized Topology Management on Mobile Ad hoc Networks

引用

Global Conference on Communication Technologies (GCCT)

作者： Pramanik, Aniket Choudhury, Biplav Choudhury, Tameem S. Arif, Wasim Mehedi, J. Natl Inst Technol Dept Elect & Commun Engn Silchar 788010 Assam India

ISBN: (纸本)9781479985531

In this paper, a new simulation tool is described which is used to present a decentralized approach on Mobile Ad Hoc Networks. The simulation is developed in Matlab using a decentralizing algorithm. The paper includes a distributed algorithm for adaptive movement of nodes in a MANET (Mobile Ad hoc Network) to maintain the overall topology of the network. The proposed algorithm assumes the presence of a GPS receiver in each node so that every node is aware of the position of every other node. A node measures the relative position and velocity of its neighbours and checks whether a certain critical condition is satisfied or not. If the condition is satisfied, it keeps its position unchanged;otherwise a rush call is made to that node by its nearest neighbour to get it back within the range. The overall advantage here is that our new tool doesn't involve any co-ordinator which significantly reduces the overhead on the network. The simulation of the algorithm has been carried out on a few synthetically generated network scenarios and the results thus obtained show the effectiveness of the proposed algorithm.

关键词： MANET Topology Management distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed Approach to Construct Minimum Spanning Tree in Cognitive Radio Networks

引用

Procedia Computer Science 2015年 70卷 166-173页

作者： Mahendra Kumar Murmu Computer Engineering Department National Institute of Technology Kurukshetra Haryana 136119 INDIA

The minimum spanning tree is useful for data disseminating or broadcasting where a leader node can regulate the data with minimum cost and time. The article presents an algorithm to construct minimum spanning tree in cognitive radio networks. The cognitive radio network works differently with single channel or multi-channel wireless networks than conventional wireless networks. The cognitive radio (or secondary user) nodes have multi-channel accessing capabilities during run time by adjusting the radio parameters according to the available spectrum. The primary user or licensed user holds the spectrum and if it is free, the secondary user can use this for any purpose. Initially, we identify the challenges related to formation of logical structure in cognitive radio network. Then, we present our time and message constrained based cost (or weight) estimation distributed algorithm to construct minimum spanning tree. We describe our algorithm with the help of state diagram representation. The correctness proof of the algorithm is also included.

关键词： Cognitive radio network Minimum spanning tree Minimum cost distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Adaptive and distributed sensor activation in WSN

Adaptive and distributed sensor activation in WSN

引用

International Conference on Wireless Communications and Signal Processing

作者： Mengyi Zhang Alban Goupil Maxime Colas Guillaume Gelle CReSTIC University of Reims Champagne-Ardenne

ISBN: (纸本)9781467376884

The selection of active units is an essential task for sensor networks because it allows to increase the service life of the networks while guaranteeing coverage. In this paper, we propose a fully distributed method for active units selection that automatically adapts to sensors extinction without activating unnecessary idle units. This method relies on both of the use of homology and the discrete Morse theory.

关键词： Coverage problem Sensor's activation Homology groups distributed algorithm Discrete vector field

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：