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

Cooperative Localization in WSNs: A Hybrid Convex/Nonconvex Solution

IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS 2018年第1期4卷 162-172页

作者： Piovesan, Nicola Erseghe, Tomaso Univ Padua Dipartimento Ingn Informaz I-35131 Padua Italy Ctr Tecnol Telecomunicac Catalunya Barcelona 08860 Spain

We propose an efficient solution to peer-to-peer localization in a wireless sensor network that works in two stages. At the first stage the optimization problem is relaxed into a convex problem, given in the form recently proposed by Soares et al. The convex problem is efficiently solved in a distributed way by an alternating directionmethod of multipliers approach, which provides a significant improvement in speed with respect to the original solution. In the second stage, a soft transition to the original, nonconvex, non-relaxed formulation is applied in such a way to force the solution toward a local minimum. The algorithm is built in such a way to be fully distributed, and it is tested in meaningful situations, showing its effectiveness in localization accuracy and speed of convergence, as well as its inner robustness.

关键词： Alternating direction method of multipliers decentralized estimation distributed algorithms cooperative localization maximum likelihood optimization methods wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Approximation and Heuristic algorithms for Computing Backbones in Asymmetric Ad-hoc Networks

引用

THEORY OF COMPUTING SYSTEMS 2018年第8期62卷 1673-1689页

作者： Abu-Khzam, Faisal N. Markarian, Christine Heide, Friedhelm Meyer auf der Schubert, Michael Lebanese Amer Univ Dept Comp Sci Math Beirut Lebanon Univ Paderborn Heinz Nixdorf Inst D-33102 Paderborn Germany Univ Paderborn Dept Comp Sci D-33102 Paderborn Germany Univ Paderborn Dept Math D-33102 Paderborn Germany

We consider the problem of dominating set-based virtual backbone used for routing in asymmetric wireless ad-hoc networks. These networks have non-uniform transmission ranges and are modeled using directed disk graphs. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in it. Due to the dynamic nature of ad-hoc networks, distributed algorithms for this problem are of practical significance. Hence, we seek algorithms that do not require centralized computation and yet yield good approximation factors and/or behave well in practice. We present a first distributed approximation algorithm for this problem. The algorithm achieves a constant approximation ratio if the ratio of the maximum transmission range over the minimum transmission range in the network is bounded and takes O(Diam) rounds, where Diam is the diameter of the graph. Moreover, we present a simple distributed heuristic algorithm and conduct an extensive simulation study showing that our heuristic outperforms previously known approaches for the problem.

关键词： Ad-hoc networks Virtual backbone Dominating sets Disk graphs distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A survey of autonomous self-reconfiguration methods for robot-based programmable matter

引用

ROBOTICS AND AUTONOMOUS SYSTEMS 2019年 120卷

作者： Thalamy, Pierre Piranda, Benoit Bourgeois, Julien Univ Bourgogne Franche Comte FEMTO ST Inst CNRS 1 Cours Leprince Ringuet F-25200 Montbeliard France

While researchers envision exciting applications for metamorphic systems like programmable matter, current solutions to the shape formation problem are still a long way from meeting their requirements. To dive deeper into this issue, we propose an extensive survey of the current state of the art of self/reconfiguration algorithms and underlying models in modular robotic and self-organizing particle systems. We identify three approaches for solving this problem and we compare the different solutions using a synoptic graphical representation. We then close this survey by confronting existing methods to our vision of programmable matter, and by discussing a number of future research directions that would bring us closer to making it a reality. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Self-reconfiguration Modular robots Programmable matter distributed algorithms Self-organizing particle systems

来源：评论

学校读者我要写书评

暂无评论

Coordinated consensus for smart grid economic environmental power dispatch with dynamic communication network

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2018年第11期12卷 2603-2613页

作者： Hamdi, Mounira Chaoui, Mondher Idoumghar, Lhassane Kachouri, Abdennaceur Univ Sfax LETI ENIS St Soukra Sfax 3038 Tunisia UHA LMIA EA 3993 F-68093 Mulhouse France

Combined economic environmental dispatch problem (CEEDP) is one of the greatest challenges of the future smart grids. It aims at reducing the total cost during the power production process considering the growing environmental impact due to the emission of gaseous pollutants of fossil fuels. This study develops a robust distributed algorithm based on consensus protocols in multi-agent systems, to solve the smart grid CEEDP with a practical communication network consisting of a dynamic communication network, randomly communication failure, transmission delay and noise in communication channels. The proposed algorithm is fully distributed and cooperative in such a way that it eliminates the need for a central energy-management unit, or a leader. The performance of the fully decentralised consensus protocol was evaluated on the IEEE 30-bus and the IEEE 118-bus test system. A comparison with previous consensus algorithms proves the supremacy of the proposed approach in terms of its robustness under dynamic communication network with randomly link failure.

关键词： smart power grids load dispatching power system economics environmental factors distributed algorithms protocols multi-agent systems telecommunication channels telecommunication networks decentralised control power engineering computing coordinated consensus protocol smart grid dynamic communication network combined economic environmental dispatch problem CEEDP cost reduction power production process gaseous pollutant emission fossil fuel distributed algorithm multiagent system randomly communication failure transmission delay communication channel central energymanagement unit decentralised consensus protocol IEEE 30 bus test system IEEE 118-bus test system

来源：评论

学校读者我要写书评

暂无评论

Resilient First-Order Consensus and Weakly Stable, Higher Order Synchronization of Continuous-Time Networked Multiagent Systems

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2018年第3期5卷 1219-1231页

作者： LeBlanc, Heath J. Koutsoukos, Xenofon Ohio Northern Univ Elect & Comp Engn & Comp Sci Dept Ada OH 45810 USA Vanderbilt Univ Dept Elect Engn & Comp Sci 221 Kirkland Hall Nashville TN 37235 USA

Local interaction rules for consensus and synchronization are vital for many applications in distributed control of cyber-physical systems. However, most research in this area assumes all nodes (or agents) in the networked system cooperate. This paper considers local interaction rules for resilient first-order consensus and weakly stable, higher order synchronization whenever some of the agents in the network are Byzantine-like adversaries defined in a continuous-time setting. The normal agents have identical dynamics modeled by continuous-time, linear, time-invariant, weakly stable systems. Agents in the networked system influence one another by sharing state or output information according to a directed, time-varying graph. We present a resilient consensus protocol as well as dynamic state and output feedback control laws for the normal agents, to achieve the resilient consensus and synchronization objectives, respectively. We characterize the required network topologies using the property of network robustness. We demonstrate the results in simulation examples to illustrate the resilient synchronization output feedback control law.

关键词： Adversary Byzantine consensus distributed algorithms resilience robust networks synchronization

来源：评论

学校读者我要写书评

暂无评论

Matrix-Free Nonlinear Finite-Element Solver Using Transmission-Line Modeling on GPU

引用

IEEE TRANSACTIONS ON MAGNETICS 2019年第7期55卷

作者： Liu, Peng Li, Jiacong Dinavahi, Venkata Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G 2R3 Canada

The transmission-line modeling (TLM) used for nonlinear finite-element (FE) solution has a paramount feature that the admittance matrix is unchanged and only needs one-time factorization;and this feature becomes a drawback when the required number of TLM iterations increase due to the mismatch between the transmission-line impedance and the load. In this paper, a matrix-free TLM scheme is proposed to make use of the solved nonlinear reluctivities without employing any matrices at each timestep, thus substantially decreasing the number of required TLM iterations. The matrix-free solver is suitable for massively parallel processing and the design is implemented on the Tesla V100 graphics processing unit (GPU). A speedup of more than 27 times is obtained compared with a commercial FE package for different problem sizes while maintaining high accuracy.

关键词： distributed algorithms domain decomposition electromagnetic apparatus finite-element (FE) method graphics processing units (GPUs) massively parallel nonlinear system of equations transmission-line modeling (TLM)

来源：评论

学校读者我要写书评

暂无评论

An Optimal distributed (Δ+1)-Coloring Algorithm? 2018

An Optimal Distributed (Δ+1)-Coloring Algorithm?

引用

50th Annual ACM SIGACT Symposium on the Theory of Computing (STOC)

作者： Chang, Yi-Jun Li, Wenzheng Pettie, Seth Univ Michigan Ann Arbor MI 48109 USA Tsinghua Univ Inst Interdisciplinary Informat Sci ITCS Beijing Peoples R China

ISBN: (纸本)9781450355599

Vertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper we present a new algorithm for (Delta+ 1)-list coloring in the randomized LOCAL model running in O(log* n + Detd (poly logn)) time, where Detd (n') is the deterministic complexity of (deg + 1)-list coloring on n'-vertex graphs. This improves upon a previous randomized algorithm of Harris, Schneider, and Su (STOC 2016) with complexity O(p log.+ log logn + Detd (poly logn)), and (when. is sufficiently large) is much faster than the best known deterministic algorithm of Fraigniaud, Heinrich, and Kosowski (FOCS 2016), whose time complexity is O(v. log2.5. + log* n) time. Our algorithm appears to be optimal. It matches the O(log* n) randomized lower bound, due to Naor (SIDMA 1991) and sort of matches the O(Det(poly logn)) randomized lower bound due to Chang, Kopelowitz, and Pettie (FOCS 2016), where Det is the deterministic complexity of (Delta + 1)-list coloring. The best known upper bounds on Detd (n') and Det(n') are both 2O(v log n') (Panconesi and Srinivasan (J. Algor 1996)) and it is quite plausible that the complexities of both problems are the same, asymptotically.

关键词： distributed algorithms Local model Vertex Coloring

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for TDMA Link Scheduling in Sensor Networks

Distributed Algorithms for TDMA Link Scheduling in Sensor Ne...

引用

IEEE International Symposium on Parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Thamer Alsulaiman Sushil K. Prasad Alexander Zelikovsky Department of Computer Science Georgia State University Atlanta GA USA

The paper is devoted to Time Division Multiple Access Link Scheduling Protocols in wireless sensor networks for full duplex (two-way) communication, where each sensor is scheduled on an incident link as a transmitter and as a receiver in two different time slots. We formulate the full duplex link scheduling problem (FDLSP) as distance-2 edge coloring in bidirected graphs. We proves that there exists a Δ-approximation algorithm for FDLSP (Δ being the maximum node degree in the network). Then, we present two distributed algorithms. The first is a synchronous algorithm based on finding maximal independent sets. The second is an asynchronous depth first search (DFS) algorithm. The maximal independent set based algorithm requires only O(Δlog*n) communication rounds (where n is the number of processors in the network) for growth bounded graphs, which is a realistic geometric model of sensor networks. For general graphs, the maximal independent set based algorithm requires O(Δ 4 + Δ 3 log*n) communication rounds, improving upon the previous best algorithm with O(nΔ 2 +n 2 m) communication rounds (where m is the number of links in the network). The asynchronous DFS based algorithm requires only O(n) communication rounds for both general and growth bounded graphs. The simulations show that the proposed algorithms assign on average equal or fewer number of time slots compared to the best known distributed algorithm while being significantly faster.

关键词： Color distributed algorithms Scheduling Protocols Complexity theory Time division multiple access Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Game Theoretic Perspective of Optimal CSMA

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2018年第1期17卷 194-209页

作者： Jang, Hyeryung Yun, Se-Young Shin, Jinwoo Yi, Yung Korea Adv Inst Sci & Technol Dept Elect Engn Daejeon 34141 South Korea Korea Adv Inst Sci & Technol Dept Ind & Syst Engn Daejeon 34141 South Korea

Game-theoretic approaches have provided valuable insights into the design of robust local control rules for the individuals in multi-agent systems, e.g., Internet congestion control, road transportation networks, and so on. In this paper, we introduce a non-cooperative medium access control game for wireless networks and propose new fully distributed carrier sense multiple access (CSMA) algorithms that are provably optimal in the sense that their long-term throughputs converge to the optimal solution of a utility maximization problem over the maximum throughput region. The most significant part of our approach lies in introducing novel price functions in agents' utilities so that the proposed game admits an ordinal potential function with no price-of-anarchy. The game formulation naturally leads to game-based dynamics finding a Nash equilibrium, but they often require global information. Toward our goal of designing fully distributed operations, we propose new game-inspired dynamics by utilizing a certain property of CSMA that enables links to estimate their temporary throughputs without message passing. They can be thought of as stochastic approximations to the standard dynamics, which is a new feature in our work, not prevalent in other traditional game-theoretic approaches. We show that they converge to a Nash equilibrium, and numerically evaluate their performance to support our theoretical findings.

关键词： CSMA distributed algorithms game theory wireless ad-hoc network stochastic approximation

来源：评论

学校读者我要写书评

暂无评论

Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks 18

Sublinear-Time Quantum Computation of the Diameter in CONGES...

引用

37th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Le Gall, Francois Magniez, Frederic Kyoto Univ Grad Sch Informat Kyoto Japan Univ Paris Diderot CNRS IRIF Paris France

ISBN: (纸本)9781450357951

The computation of the diameter is one of the most central problems in distributed computation. In the standard CONGEST model, in which two adjacent nodes can exchange O(logn) bits per round (here n denotes the number of nodes of the network), it is known that exact computation of the diameter requires (O) over bar (n) rounds, even in networks with constant diameter. In this paper we investigate quantum distributed algorithms for this problem in the quantum CONGEST model, where two adjacent nodes can exchange O(logn) quantum bits per round. Our main result is a (O) over bar (root nD)-round quantum distributed algorithm for exact diameter computation, where D denotes the diameter. This shows a separation between the computational power of quantum and classical algorithms in the CONGEST model. We also show an unconditional lower bound (O) over bar (root n) on the round complexity of any quantum algorithm computing the diameter, and furthermore show a tight lower bound (O) over bar (root nD) for any distributed quantum algorithm in which each node can use only poly(logn) quantum bits of memory.

关键词： distributed algorithms quantum computation CONGEST model graph algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：