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

Quality of Information Maximization for Wireless Networks via a Fully Separable Quadratic Policy

IEEE-ACM TRANSACTIONS ON NETWORKING 2015年第2期23卷 574-586页

作者： Supittayapornpong, Sucha Neely, Michael J. Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA

An information collection problem in a wireless network with random events is considered. Wireless devices report on each event using one of multiple reporting formats. Each format has a different quality and uses different data lengths. Delivering all data in the highest-quality format can overload system resources. The goal is to make intelligent format selection and routing decisions to maximize time-averaged information quality subject to network stability. Lyapunov optimization theory can be used to solve such a problem by repeatedly minimizing the linear terms of a quadratic drift-plus-penalty expression. To reduce delays, this paper proposes a novel extension of this technique that preserves the quadratic nature of the drift minimization while maintaining a fully separable structure. In addition, to avoid high queuing delay, paths are restricted to at most 2 hops. The resulting algorithm can push average information quality arbitrarily close to optimum, with a tradeoff in queue backlog. The algorithm compares favorably to the basic drift-plus-penalty scheme in terms of backlog and delay.

关键词： Cross-layer design distributed algorithm Lyapunov analysis quality of information stochastic network optimization

来源：评论

学校读者我要写书评

暂无评论

Resistive Network Optimal Power Flow: Uniqueness and algorithms

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2015年第1期30卷 263-273页

作者： Tan, Chee Wei Cai, Desmond W. H. Lou, Xin City Univ Hong Kong Coll Sci & Engn Hong Kong Hong Kong Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xidian Peoples R China CALTECH Dept Elect Engn Pasadena CA 91125 USA

The optimal power flow (OPF) problem minimizes the power loss in an electrical network by optimizing the voltage and power delivered at the network buses, and is a nonconvex problem that is generally hard to solve. By leveraging a recent development on the zero duality gap of OPF, we propose a second-order cone programming convex relaxation of the resistive network OPF, and study the uniqueness of the optimal solution using differential topology, especially the Poincare-Hopf Index Theorem. We characterize the global uniqueness for different network topologies, e.g., line, radial, and mesh networks. This serves as a starting point to design distributed local algorithms with global behaviors that have low complexity, are computationally fast, and can run under synchronous and asynchronous settings in practical power grids.

关键词： Differential topology distributed algorithm optimal power flow optimization power system second-order cone programming

来源：评论

学校读者我要写书评

暂无评论

Fully distributed algorithms for Blind Rendezvous in Cognitive Radio Networks 14

Fully Distributed Algorithms for Blind Rendezvous in Cogniti...

引用

15th ACM International Symposium on Mobile Ad Hoc Networking and Computing

作者： Gu, Zhaoquan Hua, Qiang-Sheng Dai, Weiguo Tsinghua Univ Inst Interdisciplinary Informat Sci Beijing 100084 Peoples R China

ISBN: (纸本)9781450326209

Rendezvous process is the cornerstone to construct Cognitive Radio Networks (CRNs), through which a secondary user can establish a link for communication with its neighbor on a common channel. Although many blind rendezvous algorithms have been proposed which do not rely on a central controller or a common control channel, all of these works still rely on the global parameters such as the number of licensed channels N and the number of users. This paper aims to design fully distributed blind rendezvous algorithms only based on each user's local information. We first give the Synchronous Check & Hop (SCH) algorithm for two synchronous users where they start the rendezvous process at the same time. The SCH algorithm guarantees rendezvous in O(min{k(a), k(b)}N) time slots where ka, kb are the corresponding number of sensed channels of these two users. Our main contribution is a fully distributed algorithm called Conversion Based Hopping (CBH), where each user only uses its identifier (ID) and its number of sensed channels. CBH guarantees rendezvous between two asynchronous users in O((max{k(a), k(b)})(2)) time slots. To our knowledge, this is the first result with rendezvous time independent of the global parameter N. We also derive a lower bound of rendezvous time between two users as Omega((k(a) - k(g))(k(b) - k(g))) where kg is the number of their common channels. All of our results also apply to a more general blind rendezvous problem which we call Oblivious Blind Rendezvous where each user is free to assign their local labels to the sensed channels. Extensive simulation results compared with the state-of-the-art rendezvous algorithms corroborate our theoretical analyses.

关键词： cognitive radio networks blind rendezvous distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Nonnegative Edge Consensus of Networked Linear Systems

Nonnegative Edge Consensus of Networked Linear Systems

引用

第35届中国控制会议

作者： Xiaoling Wang Housheng Su Xiaofan Wang Guanrong Chen Department of Automation Shanghai Jiaotong Universityand Key Laboratory of System Control and Information ProcessingMinistry of Education of China School of Automation Image Processing and Intelligent Control Key Laboratory of Education Ministry of ChinaHuazhong University of Science and Technology Department of Electronic Engineering City University of Hong Kong

ISBN: (纸本)9781509009107

In this paper,nonnegative edge consensus of systems steered by general linear dynamics on directed network is *** the new approach,one first endows dynamics to each directed edge and then designs a distributed edge consensus protocol guiding all edges to reach a common *** the help of line graph theory,it is proved that strongly connected network can ensure reaching nonnegative edge consensus,if the initial conditions of all edges are *** simulations are provided to verify the theoretical results.

关键词： Networked system Nonnegative edge consensus distributed algorithm Line graph

来源：评论

学校读者我要写书评

暂无评论

Fast and robust self-organization for micro-electro-mechanical robotic systems

引用

COMPUTER NETWORKS 2015年 93卷 141-152页

作者： Lakhlef, Hicham Bourgeois, Julien UFC FEMTO ST UMR CNRS 6174 F-25201 Montbeliard France

Microrobots are low-power and low-capacity memory devices that can sense and act. They perform various missions and tasks in a wide range of applications including odor localization, firefighting, medical service, surveillance and security, search and rescue. To achieve these tasks nodes should reconfigure their physical topology to another target organization. The self-organization is one of the most challenging tasks in MEMS applications. In this paper, we propose a distributed and efficient parallel self-organization protocol for chains of MEMS nodes. This protocol is memory-efficient because it does not use the predefined positions of the target shape, which reduces the memory usage to a constant complexity. Our algorithm is implemented in a real environment simulator called DPRSim, the Dynamic Physical Rendering Simulator. (C) 2015 Elsevier B.V. All rights reserved.

关键词： MEMS microrobot distributed algorithm Self-reconfiguration Self-organization Logical topology

来源：评论

学校读者我要写书评

暂无评论

Downsampling algorithms for Large Sparse Matrices

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2015年第5期43卷 679-702页

作者： Langr, Daniel Tvrdik, Pavel Simecek, Ivan Dytrych, Tomas Czech Tech Univ Fac Informat Technol Dept Comp Syst Prague 16000 Czech Republic Louisiana State Univ Dept Phys & Astron Baton Rouge LA 70803 USA

Mapping of sparse matrices to processors of a parallel system may have a significant impact on the development of sparse-matrix algorithms and, in effect, to their efficiency. We present and empirically compare two downsampling algorithms for sparse matrices. The first algorithm is independent of particular matrix-processors mapping, while the second one is adapted for cases where matrices are partitioned among processors according to contiguous chunks of rows/columns. We show that the price for the versatility of the first algorithm is the collective communication performed by all processors. The second algorithm uses more efficient communication strategy, which stems from the knowledge of mapping of matrices to processors, and effectively outperforms the first algorithm in terms of running time.

关键词： Downsampling Sparse matrix Matrix-processors mapping distributed algorithm Parallel computing MPI Visualization

来源：评论

学校读者我要写书评

暂无评论

Efficient cache availability management in Information-Centric Networks

引用

COMPUTER NETWORKS 2015年 84卷 32-45页

作者： Saha, Sumanta Lukyanenko, Andrey Yla-Jaaski, Antti Aalto Univ Comp Sci & Engn Espoo 02150 Finland

In-network caching is one of the fundamental operations of Information-Centric Networks (ICN). The default caching strategy taken by most of the current ICN proposals is caching along-default-path, which makes popular objects to be cached redundantly across the network, resulting in a low utilization of available cache space. On the other hand, efficient use of network-wide cache space requires possible cooperation among caching routers without the use of excessive signaling burden. While most of the cache optimization efforts strive to improve the latency and the overall traffic efficiency, we have taken a different path in this work and improved the storage efficiency of the cache space so that it is utilized to its most. In this work we discuss the ICN caching problem, and propose a novel distributed architecture to efficiently use the network-wide cache storage space based on distributed caching. The proposal achieves cache retention efficiency by means of controlled traffic redirection and selective caching. We utilize the ICN mechanisms and routing protocol messages for decision making, thus reducing the overall signaling need. Our proposal achieves almost 9-fold increase in cache storage efficiency, and around 20% increase in server load reduction when compared to the classic caching methods used in contemporary ICN proposals. (C) 2015 Elsevier B.V. All rights reserved.

关键词： ICN Routing distributed algorithm Cache

来源：评论

学校读者我要写书评

暂无评论

Weighted Sum Energy Efficiency Maximization in Ad Hoc Networks

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2015年第3期4卷 233-236页

作者： Pan, Cunhua Xu, Wei Zhang, Wence Wang, Jiangzhou Ren, Hong Chen, Ming Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China Univ Kent Sch Engn & Digital Arts Canterbury CT2 7NZ Kent England

In this letter, we propose a distributed adaptive-pricing algorithm aimed at solving the weighted sum energy efficiency (EE) maximization problem in ad hoc networks. It is theoretically proven that the proposed distributed algorithm strictly converges to the Karush-Kuhn-Tucker (KKT) point of the problem. Significant performance enhancement is observed by numerical results with fast convergence. Moreover, it is shown that the proposed algorithm degrades gracefully when decreasing overhead of information exchange.

关键词： Energy efficiency distributed algorithm ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

ASSOCIATION-RULES-BASED DATA IMPUTATION WITH SPARK

ASSOCIATION-RULES-BASED DATA IMPUTATION WITH SPARK

引用

2016 4th IEEE International Conference on Cloud Computing and Intelligence Systems（IEEE CCIS2016）

作者： Zhaowei Qu Jianru Yan Sixing Yin Beijing University of Posts and Telecommunications

ISBN: (纸本)9781509012572

Due to technical bottlenecks and errors caused by artificial operation,the problem of incomplete data always exists in big data *** data imputation algorithms incur high complexity and the accuracy cannot reach the desired *** the same time,analysis and computation involved in mass data makes limitation of traditional algorithms and computing platform more *** this paper,we propose a data imputation method based on Apriori algorithm,and implement the corresponding algorithm on the distributed computing system built with *** experimental results show that the proposed algorithm outperforms a traditional data imputation algorithm in terms of efficiency and accuracy.

关键词： Association rules Data preprocessing Spark distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

On the Complexity of Universal Leader Election

引用

JOURNAL OF THE ACM 2015年第1期62卷 1–27页

作者： Kutten, Shay Pandurangan, Gopal Peleg, David Robinson, Peter Trehan, Amitabh Technion Israel Inst Technol IL-32000 Haifa Israel Nanyang Technol Univ Nanyang Singapore Brown Univ Providence RI 02912 USA Weizmann Inst Sci Rehovot Israel Natl Univ Singapore Dept Comp Sci Singapore 117548 Singapore Queens Univ Belfast Sch Elect Elect Engn & Comp Sci Belfast BT9 5BN Antrim North Ireland

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This article focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. In particular, the seemingly obvious lower bounds of Omega(m) messages, where m is the number of edges in the network, and Omega(D) time, where D is the network diameter, are nontrivial to show for randomized (Monte Carlo) algorithms. (Recent results, showing that even Omega(n), where n is the number of nodes in the network, is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms, except for the restricted case of comparison algorithms, where it was also required that nodes may not wake up spontaneously and that D and n were not known. We establish these fundamental lower bounds in this article for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (namely, algorithms that work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make any use of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time leader election algorithm is known. A slight adaptation of our lower bound technique gives rise to an Omega(m) message lower bound for randomized broadcast algorithms. An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. The answer is known to be negative in the deterministic setting. We answ

关键词： Theory algorithms Leader election lower bound distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：