scispace - formally typeset
Search or ask a question
Topic

Distributed algorithm

About: Distributed algorithm is a research topic. Over the lifetime, 20416 publications have been published within this topic receiving 548109 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: It is shown in the context of a fish war example that the algorithm given is in some aspects superior to various algorithms found in the literature, and is furthermore more meaningful for real world implementation.

171 citations

Proceedings ArticleDOI
01 Dec 2006
TL;DR: This work proposes three new algorithms for the distributed averaging and consensus problems: two for the fixed-graph case, and one for the dynamic-topology case, which is the first to be accompanied by a polynomial-time bound on the convergence time.
Abstract: We propose three new algorithms for the distributed averaging and consensus problems: two for the fixed-graph case, and one for the dynamic-topology case. The convergence rates of our fixed-graph algorithms compare favorably with other known methods, while our algorithm for the dynamic-topology case is the first to be accompanied by a polynomial-time bound on the convergence time.

171 citations

Journal ArticleDOI
TL;DR: This paper generalizes Yates' result and establishes a new framework, which is applicable to systems supporting opportunistic communications and with heterogeneous service requirements, and shows that the proposed algorithm yields significant improvement in throughput when compared with the conventional target tracking approach.
Abstract: Most power control algorithms that aim at hitting a signal-to-interference ratio (SIR) target fall within Yates' framework. However, for delay-tolerable applications, it is unnecessary to maintain the SIR at a certain level all the time. To maximize throughput, one should increase one's power when the interference level is low, and the information transmission rate is adjusted accordingly by adaptive modulation and coding techniques. This approach is called opportunistic communications. In this paper, we generalize Yates' result and establish a new framework, which is applicable to systems supporting opportunistic communications and with heterogeneous service requirements. Simulation results show that our proposed algorithm yields significant improvement in throughput when compared with the conventional target tracking approach.

171 citations

Journal ArticleDOI
TL;DR: This paper designs a periodic monitoring scheduling (PMS) algorithm in which each point along the barrier line is monitored periodically by mobile sensors and proposes a coordinated sensor patrolling (CSP) algorithm to further improve the barrier coverage.
Abstract: The barrier coverage problem in emerging mobile sensor networks has been an interesting research issue due to many related real-life applications. Existing solutions are mainly concerned with deciding one-time movement for individual sensors to construct as many barriers as possible, which may not be suitable when there are no sufficient sensors to form a single barrier. In this paper, we aim to achieve barrier coverage in the sensor scarcity scenario by dynamic sensor patrolling. Specifically, we design a periodic monitoring scheduling (PMS) algorithm in which each point along the barrier line is monitored periodically by mobile sensors. Based on the insight from PMS, we then propose a coordinated sensor patrolling (CSP) algorithm to further improve the barrier coverage, where each sensor's current movement strategy is derived from the information of intruder arrivals in the past. By jointly exploiting sensor mobility and intruder arrival information, CSP is able to significantly enhance barrier coverage. We prove that the total distance that sensors move during each time slot in CSP is the minimum. Considering the decentralized nature of mobile sensor networks, we further introduce two distributed versions of CSP: S-DCSP and G-DCSP. We study the scenario where sensors are moving on two barriers and propose two heuristic algorithms to guide the movement of sensors. Finally, we generalize our results to work for different intruder arrival models. Through extensive simulations, we demonstrate that the proposed algorithms have desired barrier coverage performances.

171 citations

Proceedings ArticleDOI
03 Jan 1996
TL;DR: The DEVS formalism for system modeling, and a DEVS implementation based on object oriented technology enabling a full exploita,tion of a para.llel simulation model execution are proposed and presented in the first paper.
Abstract: Parallel and distributed simulation (PDS) over the one and a half decade of its existence has turned out to be more foundational than merely solving the causality preservation di lemma in partially ordered event structures as they occur in parallel and distributed simulation executions. Today’s availability of parallel and distributed computing and communication technology ha.s given a new relevance to the field that could not, ha.ue been foreseen in its early days. The potentia,l improvement of elapsed time for large simula.tion experiments via the involvement of a set of individua.1 processing nodes of a parallel (shared or distributed memory) computer or distributed system is more promising t,oclay than at any time in history of the field. Accelerating simulation experiments for la.rge syst,em models is naturally the outstanding PDS resea.rch goal. But above this, many scientists, also from within the core of classical PDS field, have seen imp& of the PDS theory and methodology also in nonsta.nda.rd a.pplication areas such as parallel program execution. The intent, of this minitrack was to provide a forum for t,he exploration of new high performance simula.tion concepts and techniques, as well as their successful a.pplication on today’s and tomorrow’s parallel execution pla.tforms. Twenty-six contributions have been submitted by a.utjhors from France, Germany, Japa.n, Poland, Sweden, UK and the USA, after more than seventy authors a~nnouacecl pa.pers via abstracts. Eighty-four reviewers wit#h their expertise helped to select ten full papers a.nd two short papers for publication in the proceedings, a,ncl for oral presentation at the conference. Ea.& paper was reviewed by at least three, at most, six, and on a,verage by 3.96 reviewers. Due to t)he a.va.ilability of pa.pers in electronic format, the reviewing process could be managed almost exclusively by email. A concept8ual framework and an environment for high performance simulation is presented in the first paper. Zeigler, Moon, D. Kim and J.G. Kim propose the DEVS formalism for system modeling, and a DEVS implementation based on object oriented technology enabling a full exploita,tion of a para.llel simulation model execution. DEVS modeling is illustra.ted in the context of wildland fire simulation, performance comparisons a.re conducted for a, watershed model executing sequentially on a. Spare-1000 a.ncl in para.llel on a CM-5. The paper by Konas presents potentials of simulation a.t the confluence of object oriented system design and parallel processing: modularity, extensibility and reusability provide a na.tural a.nd well structured approach to the construction of complex simulation models, while at the same time promoting a higher execution efficiency on a. parallel platform. Young and Wilsey propose a new distributed fossil collection technique for the Time Wa.rp distributed discrete event simulation protocol. Basically, every fossil collector associated with a logical process (LP) by observing event arrival t imes establishes a. statistical model for rollback distances to determine in conjunction with a user defined rise fa.ctor tha.t controls the aggressiveness of fossil collectors a. probabilistic GVT bound. The approach appears beneficial for the reduction of the amount of used memory over GVT based fossil collection, but requires a.dditional checkpointing for possible “ca.tastrophic” rollbacks, i.e. restoration of states that have been fossil collected due to an overestimation of the actual GVT. RGnngren, Barriga a,nd Ayani have developed a benchmark suite for the performance evalua.tion of parallel simulation kernels on different a.rchitect,ures and the scalability analysis of certain simulation problems. It appears particularly hard t,o isolate performance influences stemming from the kernel a.s such or from the event structure underlying the simulation model executed by the kernel. Trying to a,bstra,ct a.s much a,s possible from the la.tter performance impact, the authors construct a. synthetic benchmark scala,ble

171 citations


Network Information
Related Topics (5)
Server
79.5K papers, 1.4M citations
94% related
Scheduling (computing)
78.6K papers, 1.3M citations
91% related
Network packet
159.7K papers, 2.2M citations
91% related
Wireless network
122.5K papers, 2.1M citations
91% related
Wireless sensor network
142K papers, 2.4M citations
89% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202381
2022135
2021583
2020759
2019876
2018845