Reaching consensus about gossip: convergence times and costs
|
|
- Oscar Parker
- 6 years ago
- Views:
Transcription
1 Reaching consensus about gossip: convergence times and costs Florence Bénézit, Patrick Denantes, Alexandros G. Dimakis, Patrick Thiran, Martin Vetterli School of IC, Station 14, EPFL, CH-1015 Lausanne, Switzerland Department of Electrical Engineering and Computer Science (EECS) University of California, Berkeley Berkeley, CA 94720, USA Abstract Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust methods for distributed information processing over networks. However, for many topologies that are realistic for wireless adhoc and sensor networks (such as grids and random geometric graphs), the standard nearest-neighbor gossip converges however slowly. Moreover we show that convergence of gossip algorithms consists of a transient and a steady state phase, that have not been distinguished so far. In this paper, we first introduce a metric for convergence time and cost that allow us to clearly characterize the steady state regime of the convergence, not only for i.i.d. but for all stationary and ergodic time-varying networks. This metric is based on Oseledec s theorem, which gives an almost-sure description of the algorithm s convergence rate. We next describe a variation of geographic gossip that averages along routed paths, and which is proven to be order optimal (cost of O(n) messages for a network of n nodes) for grids and random geometric graphs, in sharp contrast with standard nearest-neighbor gossip (O(n 2 ) messages). This paper summarizes some of the results in [1] and [2]. I. INTRODUCTION Gossip algorithms are distributed message-passing schemes designed to disseminate and process information over wireless sensor and ad-hoc networks. They have received significant interest because the problem of computing a global function of data distributively over a network, using only localized message-passing, is fundamental for numerous applications. The simplest setup is the following: n nodes are placed on a graph whose edges correspond to reliable communication links. Each node is initially given a scalar (which could correspond to some sensor measurement like temperature) and we are interested in solving the distributed averaging problem: namely, to find a distributed message-passing algorithm by which all nodes can compute the average of all n scalars. A scheme that computes the average can easily be modified to compute any linear function (projection) of the measurements as well as more general functions. Furthermore, the scalars can be replaced with vectors and generalized to address problems like distributed filtering and optimization as well as distributed detection in sensor networks [5], [6], [7]. Gossip algorithms [8], [9] solve the averaging problem by iteratively having a random node wake up, pick one of its onehop neighbors and compute a pairwise average by exchanging messages with their current estimates. Initially all the nodes start with their own measurement as an estimate of the average. At each iteration, the node that wakes up and its chosen neighbor update their estimates with the pairwise average of their current estimates. An attractive property of gossip is that no coordination is required for convergence, as long as the communication graph is connected. We will refer to this algorithm as standard or nearest-neighbor gossip. Gossip algorithms can converge up to any desired level of accuracy but not to the exact value, which makes convergence time difficult to define. In this paper, we use a metric introduced in [2] which focuses on the stationary regime of the decay of the error to zero. It can be proven that, after a transient regime the error decays exponentially with a deterministic rate. This rate constitutes our definition of consensus time. We similarly define consensus cost as the number of messages needed to reduce the error by a factor of e in the stationary regime. These performance definitions are valid if the time variations of the network and the waking up processes in the algorithms are stationary and ergodic. The performance of gossip algorithms varies from one algorithm to the other, deteriorates with the number n of nodes in the network and depends on the graph topology modeling the network. For example, while standard gossip requires only O(n) messages to converge on a fully connected graph, it needs O(n 2 ) messages on the 2-D grid, where it thus scales as badly as flooding all the measurements everywhere. Unfortunately for standard gossip, grids and random geometric graphs are the more realistic topologies for sensor networks, on which this algorithm requires O(n 2 ) and O(n 2 / logn) messages, respectively. It is thus of great interest to design more competitive gossip algorithms specifically for these topologies. Dimakis et al. [10] introduced geographic gossip, which is based on a simple idea: since fully connected graphs spread gossip fast, the nodes can use geographic information to create a very well connected overlay graph using geographic routing. Geographic gossip converges on any connected graph as fast as standard gossip on the complete graph, but it is penalized by the extra cost of routing. Consensus cost in geographic gossip is thus O(n n) messages for grids and O(n n/ log n) for random geometric graphs. In this paper we explore a natural extension of geographic gossip: instead of averaging only the starting node and the
2 destination node of each route, what happens if the whole route s estimates are averaged together The surprising answer to this question is that this algorithm, which we call path averaging, actually converges as fast as standard gossip on the fully connected graph, i.e. only requires only O(n) messages which is order-optimal since it matches obvious lower bounds. In Section II, we formally define gossip algorithms, give conditions for convergence and precise network models. In Section III we show that consensus time and consensus cost have valid definitions under the ergodicity conditions detailed in Section II. Section IV states a theorem concerning the linear behavior of path averaging on grids with horizontal-vertical routing and gives the intuition of the proof. Section V presents experiments on path averaging on random geometric graphs with greedy routing, and we comment the results with the help of our analysis of Section IV. II. NETWORK MODEL AND PROBLEM FORMULATION A. Distributed averaging algorithms: the general case. We consider a time-varying network of n nodes, and the goal is to make available at each node the average value of the measurements of all the nodes in the network, or at least a good approximation. At each time-slot t (t discrete), the nodes can communicate with each other over all currently active graph edges, or communication links. We will restrict the exchanged messages to contain only a current estimate x i (t) of the sending node i, and in the path averaging case some routing information. Note that we assume that the messages have infinite accuracy; the effects of message quantization have only recently been explored [3], [4]. At each time step t, every node i may perform an update operation of its estimate x i (t) of the overall average. This operation is linear, and relies only on the current average estimates from node i and from the nodes i communicated with. The update equation for node i at time t then reads, for 1 i n, x i (t + 1) = w ii (t)x i (t) + w ij (t)x j (t), (1) j S i(t) where w ij (t) are the weighing factors gathered in a weight matrix W(t) such that x(t + 1) = W(t)x(t), where x(t) = [x 1 (t);... ; x n (t)] T. The weights values are defined by the specific averaging algorithm that is being used, and S i (t) is the set of nodes node i has been communicating with at time-slot t. x i (0) is the initial measurement at node i and x ave := 1 T x(0)/n = 1 T x(t)/n denotes the true average, where 1 = [1;...;1] T is the vector with all ones. Gossip is a particular class of distributed averaging algorithms: Definition 1: Gossip In gossip algorithms, at each time-slot t, a random set S(t) of nodes exchange their estimates, such that for every node i S(t), S i (t) = S(t), and moreover x i (t + 1) = 1 S(t) k S(t) x k (t). (2) For every node j / S(t), S j (t) is the empty set and w jj = 1. B. Conditions for convergence to true average. We denote by J n the n n averaging matrix with all elements J k,l = 1/n, and by 2 the spectral norm. It is also useful to define the matrix A(t) = W(t) J n and the vector of the estimation errors ǫ(t) = x(t) x ave 1. The algorithm converges almost surely (a.s.) if P[lim t ǫ(t) = 0] = 1. There are two necessary conditions for convergence: 1 T W(t) = 1 T W(t)1 = 1, which respectively ensure that the average is preserved at every iteration, and that 1 is a fixed point. Conditions for convergence in expectation and in mean square can be found in [9]. We present here sufficient conditions for a.s. convergence and convergence in second moment, in the case where {W(t)} t 0 is stationary and ergodic: Conservation properties: conditions (3). Contraction property: W(t) 2 1. Connectivity property: E[T η ] <, where T η := inf t {t 1 : t p=0 W(t p) η > 0} is a stopping time. In other words, there can be isolated nodes at any iteration, but every node has to eventually connect to the network, which has to be jointly connected. This result was recently proved in [11]. C. Stationary and ergodic networks It is important to notice that all distributed averaging algorithms present time-varying averaging weights. Moreover, these changes are random. That is, we can see the sequence of averaging matrices as a realization of a random process {W(t)} t 0. From there, it might seem difficult to define a deterministic convergence speed, which is observed not only in a particular run, but repeatedly in almost every 1 realization of the process {W(t)} t 0. We show in Section III that this is in fact possible, when this process satisfies two conditions: stationarity and ergodicity. These conditions are quite general and satisfied by most network models. In particular, they easily translate when using gossip algorithms: {W(t)} t 0 is stationary and ergodic if and only if {S(t)} t 0 is stationary and ergodic. For the latter condition to be fulfilled, it is necessary that the nodes actively connecting to the network form a stationary and ergodic process as well. The isolation of nodes are due to a number of factors, e.g. node failures, transmission channel quality, node sleeping modes, etc. Furthermore, the randomness of the algorithm itself has to be stationary and ergodic. This is easily done by waking up nodes i.i.d. over time and by making the woken up node design the rest of set S(t) i.i.d. over time too. As a conclusion, this paper deals with two different sources of randomness, the network topology variations and the randomized algorithm, which we aggregate into a single stochastic process {W(t)} t 0. Our analysis is valid as long as this process is stationary and ergodic, a condition satisfied by most natural network and algorithm definitions. 1 That is, with probability 1. (3)
3 III. METRICS FOR CONVERGENCE TIME AND COST For the distributed averaging algorithms described in Section II, the estimates x(t) and the error ǫ(t) = x(t) x ave 1 for t > 0 are random vectors, since the network is time-varying and the algorithms have a randomized behavior. However, in the long run, the error decays exponentially with a deterministic rate 1/T c, where T c is called consensus time. The following theorem, which is a direct application of Oseledec s theorem, precisely states the existence of this rate [2]: Theorem 1: If {W(t)} t 0 is a stationary and ergodic process, then the limit 1 lim log ǫ(t), (4) t t where denotes the l 2 norm, exists and is a constant γ with probability 1. Definition 2: Consensus time T c. Whenever the coefficient γ is well defined, consensus time T c is defined as follows: T c = 1 γ. (5) In other words, after a transient regime, the number of iterations needed to reduce the error ǫ by a factor e is almost surely equal to T c, which therefore characterizes the speed of convergence of the algorithm. T c is easy to measure in experiments, and has analytical upper bounds. However, lower bounding this quantity remains an open problem. Theorem 2: Bounding T c for gossip algorithms Whenever consensus time T c is well defined, then T c can be bounded as follows in the case of gossip algorithms: 2 T c (E[W]) log (λ 2 (E[W])) 2 1 λ 2 (E[W]). (6) Note that bounds can be found in [2] for more general averaging algorithms. We compare algorithms in terms of the amount of required communication. More specifically, let R(t) represent the number of one-hop radio transmissions required in time-slot t. In a standard gossip protocol, the quantity R(t) R is simply a constant, whereas for path averaging, which we will study in the next sections, {R(t)} t 1 is a sequence of i.i.d. random variables. The total communication cost up to time-slot t, measured in one-hop transmissions, is given by the random variable C(t) = t k=1 R(k). Consensus cost C cis defined as follows [2]: Theorem 3: If {W(t)} t 0 is a stationary and ergodic process, then the following limit exists and is a constant with probability 1: 1 lim log ǫ(t) (7) t C(t) Definition 3: Consensus time C c. Consensus cost C c is defined as following: 1 1 = lim C c t C(t) = lim t log ǫ(t) t C(t) lim t log ǫ(t). t Thus, C c = E[R(1)]T c is the number of one-hop transmissions needed in the long run to reduce the error by a factor e with probability 1. IV. PATH AVERAGING ON GRIDS A. Description and performance In this paper, a grid of n nodes is a torus of size n n. (, )-path averaging is a gossip algorithm that performs in the following way. At each iteration t, a random node I wakes up and randomly chooses a destination node J so that the random pairs (I, J) are independently and uniformly distributed. Node I also flips a fair coin to design the first direction: horizontal ( ) or vertical ( ). If for instance horizontal was picked as the first direction, the path between I and J is then defined by the shortest path between I and J that is routed horizontally first, then vertically. If vertical was picked then the path is routed vertically first. As the message goes to J, each node adds its own estimate to the message estimate (initiated with x I (t)) and also increments a counter that was started at 1 by node I. When J receives the message, he computes the average of the estimates of the route and routes this value back to I retracing the incoming message s steps. As in path averaging, the estimates of the nodes belonging to the random route are updated to their global average. Theorem 4 (Path averaging on grids): On a n n torus grid, the consensus time T c (n) of path averaging is O( n). Furthermore, the consensus cost is linear: C c (n) = O(n). This result is interesting since we cannot expect to achieve better than C c (n) = O(n). Indeed, at least n messages are required to average the values measured by n nodes. B. Intuition of the proof The detailed proof of Theorem 4 can be found in [1]. The proof, which relies on Theorem 2, has two steps: first evaluate the matrix E[W] and then upper bound its second largest eigenvalue. In Fig. 1, we show the entries of the matrix E[W ij ] as a function of the distance d(i, j) between node i and node j, for standard gossip, geographic gossip and path averaging. In standard gossip only neighboring nodes can average their estimates, so E[W ij ] falls to 0 if the distance d(i, j) is larger than the connecting radius r(n). In geographic gossip, every pair of nodes can average their estimates with equal chance, thus E[W ij ] is a constant. In path averaging, the closer nodes are, the more chance they have to be on the same route. In that case E[W ij ] is a decreasing function of d(i, j). The main phenomenon driving the estimates to the true average is diffusion. The larger the coefficients E[W ij ] are, the more efficient the diffusion is. Also, diffusion is a step by step phenomenon. In standard gossip, the information mixes slowly because many steps are needed to get information from node i to a far away node j (E[W ij ] = 0 if d(i, j) r(n)). On the opposite, diffusion in geographic gossip proceeds in one step since any pair of nodes can average their estimates together, but in this case E[W ij ] is small, which slows down the diffusion. However, one step diffusion is a good enough
4 1 x Standard gossip Geographic gossip Box path averaging 0.6 r(n) E[W ij ] d(i,j) 1: Behavior of E[W ij ] as a function of the distance in norm 1 between i and j for standard gossip, geographic gossip and box-path averaging. asset to make geographic gossip more efficient than standard gossip. The situation in path averaging is a trade-off between these two situations. The coefficients E[W ij ] concentrate on close nodes, which leads to high values of these coefficients, and this concentration is wide enough to reach nodes that are 1/2 away from each other in the unit square. In path averaging, we can describe the diffusion phenomenon as an efficient two step diffusion. This idea is formalized in the proof [1]. In conclusion, the proof teaches us that path averaging is a good tradeoff between promoting local averaging to increase averaging intensity (large E[W ij ]) and favoring long distance averaging to get an efficient diffusion pattern. V. PATH AVERAGING ON RANDOM GEOMETRIC GRAPHS A. Description of the algorithm We can now introduce the path averaging algorithm for random geometric graphs. At each time-slot one random node activates and selects a random position (target) on the unit square region where the nodes are spread out (no node needs to be located exactly on the target). It then creates a packet that contains its current estimate of the average, its position, the number of visited nodes so far (one), the target location, and passes the packet to a neighbor that is randomly chosen among the neighbors closer to the target. As nodes receive the packet, randomly and greedily forwarding it towards the target, they add their value to the sum and increase the counter. When the packet reaches its destination node (the first node whose nearest neighbors have larger distance to the target compared to it), the destination node computes the average of all the nodes on the path, and reroutes that information backwards on the same route. See Fig. 2 for an illustration of random greedy routing. The algorithm iterates this process of averaging along routes until any desired level of convergence. Node i 2: Random greedy routing. Node i has to choose the following node in the route among the nodes that are his neighbors (inside the ball of radius r(n) centered in node i) and that are closer to the target than i (inside the ball of radius centered in the target, where d is the distance between node i and the target). Next node is thus randomly chosen in the intersection of the two balls. B. Simulations Fig. 3 compares the behavior of standard gossip, geographic gossip and path averaging on random geometric graphs with an increasing number n of nodes and connection radius r(n) = c log n/n, c = 4.5. We can see that path averaging, also called gossip along the way, performs strikingly better than standard gossip and geographic gossip. This improvement can be explained with the analysis of path averaging on grids. Just as on grids, path averaging on random geometric graphs averages nodes together often if there are close, leading to a concentration of averaging coefficients E[W ij ]. Long distance averaging is also frequent enough to get an efficient diffusion pattern. Path averaging is a good trade-off between cheap short distance averaging and expensive, but diffusive long distance averaging. A closer look at simulations shows that as the scaling coefficient c of connection radius increases, consensus cost approaches a linear behavior in n. Proving this is part of future work. VI. CONCLUSION In this paper we introduced a novel gossip algorithm for distributed averaging. The proposed algorithm operates in a distributed and asynchronous manner on locally connected graphs and requires an order-optimal number of communicated messages. The execution of path averaging relies on knowledge of geographic locations; this location information is independently useful and likely to exist in many application scenarios. The key idea that makes path averaging so efficient is the opportunistic combination of routing and averaging. We believe that the idea of greedily routing towards a randomly pre-selected target (and possibly processing information on the routed paths) is a very useful primitive for designing message-passing algorithms on networks that have
5 number of messages 18 x gossip along the way geographic gossip standard gossip [8] D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. IEEE Conference of Foundations of Computer Science, (FOCS), [9] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. In IEEE Transactions on Information Theory, Special issue of IEEE Transactions on Information Theory and IEEE/ACM Transactions on Networking, [10] A. G. Dimakis, A. D. Sarwate, and M. J. Wainwright. Geographic gossip: efficient aggregation for sensor networks. In ACM/IEEE Symposium on Information Processing in Sensor Networks, [11] P. Denantes. Performance of Averaging Algorithms in Time-Varying Networks. Denantes.pdf, network size n 3: Consensus cost of standard gossip, geographic gossip (without rejection sampling) and path averaging with r(n) = p 4.5log n/n. The simulations were performed over 15 graphs per n. planar geometry. The reason is that the target introduces some directionality in the scheduling of message passing which avoids diffusive behavior. Other than computing linear functions, such path-processing algorithms can be designed for information dissemination or more general message passing computations such as marginal computations or MAP estimates for probabilistic graphical models. Processing and forwarding the messages on random paths can avoid the diffusive nature of random walks and accelerate the convergence of message-passing. We plan to investigate such protocols in future work. ACKNOWLEDGMENT This work was supported (in part) by the National Competence Center in Research on Mobile Information and Communication Systems (NCCR-MICS), a center supported by the Swiss National Science Foundation under grant number REFERENCES [1] F. Bénézit, A. G. Dimakis, P. Thiran, and M. Vetterli. Gossip along the way: Order-optimal consensus through randomized path averaging, submitted for publication, [2] P. Denantes, F. Bénézit, P. Thiran, M. Vetterli, Which Distributed Averaging Algorithm Should I Choose for my Sensor Network, Proc. IEEE Infocom 08, Phoenix, April [3] A. Nedic, A. Olshevsky, A. Ozdaglar, and J. N. Tsitsiklis. On Distributed Averaging Algorithms and Quantization Effects. submitted for publication, [4] T. C. Aysal, M. J. Coates and M. G. Rabbat. Rates of Convergence of Distributed Average Consensus Using Probabilistic Quantization. Proc. of the Allerton Conference on Communication, Control, and Computing Sep., 2007 [5] D. Spanos, R. Olfati-Saber, and R. Murray. Distributed Kalman filtering in sensor networks with quantifiable performance. In 2005 Fourth International Symposium on Information Processing in Sensor Networks, [6] L. Xiao, S. Boyd, and S. Lall. A scheme for asynchronous distributed sensor fusion based on average consensus. In 2005 Fourth International Symposium on Information Processing in Sensor Networks, [7] V. Saligrama, M. Alanyali, and O. Savas. Distributed detection in sensor networks with packet losses and finite capacity links. In IEEE Transactions on Signal Processing, to appear, 2007.
Greedy Gossip with Eavesdropping
Greedy Gossip with Eavesdropping Deniz Üstebay, Mark Coates, and Michael Rabbat Department of Electrical and Computer Engineering McGill University, Montréal, Québec, Canada Email: deniz.ustebay@mail.mcgill.ca,
More informationGOSSIP algorithms are distributed message passing
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 3, MARCH 2012 1731 The Impact of Mobility on Gossip Algorithms Anand Dilip Sarwate, Member, IEEE, and Alexandros G. Dimakis, Member, IEEE Abstract
More informationDistributed Averaging on Asynchronous Communication Networks
2005 Conference on Decision and Control (CDC) http://www.cds.caltech.edu/~murray/papers/2005m_meh+05-cdc.html Distributed Averaging on Asynchronous Communication Networks Mortada Mehyar, Demetri Spanos,
More informationIEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 3, MARCH
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 3, MARCH 2008 1205 Geographic Gossip: Efficient Averaging for Sensor Networks Alexandros D. G. Dimakis, Student Member, IEEE, Anand D. Sarwate, Student
More informationDistributed Detection in Sensor Networks: Connectivity Graph and Small World Networks
Distributed Detection in Sensor Networks: Connectivity Graph and Small World Networks SaeedA.AldosariandJoséM.F.Moura Electrical and Computer Engineering Department Carnegie Mellon University 5000 Forbes
More informationTHIS PAPER focuses on a distributed iterative procedure
512 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 15, NO. 3, JUNE 2007 Asynchronous Distributed Averaging on Communication Networks Mortada Mehyar, Demetri Spanos, John Pongsajapan, Steven H. Low, Senior Member,
More informationNETWORK coding is an area that has emerged in 2000 [1],
450 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 16, NO. 2, APRIL 2008 Efficient Broadcasting Using Network Coding Christina Fragouli, Jörg Widmer, and Jean-Yves Le Boudec, Fellow, IEEE Abstract We consider
More informationLATTICE networks are widely used, for example, in distributed parallel computation [2], distributed
SUBMITTED TO IEEE/ACM TANSACTIONS ON NETWOKING 1 Lattice Networks: Capacity Limits, Optimal outing and Queueing Behavior Guillermo Barrenetxea, Student Member, IEEE, Baltasar Beferull-Lozano, Member, IEEE,
More informationThis blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane?
Intersecting Circles This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane? This is a problem that a programmer might have to solve, for example,
More informationFractional Cascading in Wireless. Jie Gao Computer Science Department Stony Brook University
Fractional Cascading in Wireless Sensor Networks Jie Gao Computer Science Department Stony Brook University 1 Sensor Networks Large number of small devices for environment monitoring 2 My recent work Lightweight,
More informationUsing Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions
Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions R.Thamaraiselvan 1, S.Gopikrishnan 2, V.Pavithra Devi 3 PG Student, Computer Science & Engineering, Paavai College
More informationFigure (5) Kohonen Self-Organized Map
2- KOHONEN SELF-ORGANIZING MAPS (SOM) - The self-organizing neural networks assume a topological structure among the cluster units. - There are m cluster units, arranged in a one- or two-dimensional array;
More informationGossip Sensor Networks for Power Quality Monitoring in Smart Grids
European Association for the International Conference on Renewable Energies and Power Quality Development of Renewable Energies, Environment (ICREPQ1) and Power Quality (EA4EPQ) Santiago de Compostela
More informationDelay-minimal Transmission for Energy Constrained Wireless Communications
Delay-minimal Transmission for Energy Constrained Wireless Communications Jing Yang Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, M0742 yangjing@umd.edu
More informationAvailable online at ScienceDirect. Procedia Computer Science 20 (2013 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 20 (2013 ) 522 527 Complex Adaptive Systems, Publication 3 Cihan H. Dagli, Editor in Chief Conference Organized by Missouri
More informationECE 333: Introduction to Communication Networks Fall 2001
ECE : Introduction to Communication Networks Fall 00 Lecture : Routing and Addressing I Introduction to Routing/Addressing Lectures 9- described the main components of point-to-point networks, i.e. multiplexed
More informationThe loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus
The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus by Jason Schweinsberg University of California at San Diego Outline of Talk 1. Loop-erased random walk 2.
More informationRandom Walk Distributed Dual Averaging Method For Decentralized Consensus Optimization
Random Walk Distributed Dual Averaging Method For Decentralized Consensus Optimization Cun Mu, Asim Kadav, Erik Kruus, Donald Goldfarb, Martin Renqiang Min Machine Learning Group, NEC Laboratories America
More informationStochastic Control of Path Optimization for Inter-Switch Handoffs in Wireless ATM Networks
336 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 9, NO. 3, JUNE 2001 Stochastic Control of Path Optimization for Inter-Switch Handoffs in Wireless ATM Networks Vincent W. S. Wong, Member, IEEE, Mark E. Lewis,
More informationExact Algorithms Lecture 7: FPT Hardness and the ETH
Exact Algorithms Lecture 7: FPT Hardness and the ETH February 12, 2016 Lecturer: Michael Lampis 1 Reminder: FPT algorithms Definition 1. A parameterized problem is a function from (χ, k) {0, 1} N to {0,
More informationInternational Journal of Engineering, Business and Enterprise Applications (IJEBEA)
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Engineering, Business and Enterprise
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationStochastic Multiscale Approaches to Consensus Problems
Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9-, 8 Stochastic Multiscale Approaches to Consensus Problems Jong-Han Kim, Matthew West, Sanjay Lall, Eelco Scholte,
More informationOnline Facility Location
Online Facility Location Adam Meyerson Abstract We consider the online variant of facility location, in which demand points arrive one at a time and we must maintain a set of facilities to service these
More informationNotes for Lecture 24
U.C. Berkeley CS170: Intro to CS Theory Handout N24 Professor Luca Trevisan December 4, 2001 Notes for Lecture 24 1 Some NP-complete Numerical Problems 1.1 Subset Sum The Subset Sum problem is defined
More informationEnd-To-End Delay Optimization in Wireless Sensor Network (WSN)
Shweta K. Kanhere 1, Mahesh Goudar 2, Vijay M. Wadhai 3 1,2 Dept. of Electronics Engineering Maharashtra Academy of Engineering, Alandi (D), Pune, India 3 MITCOE Pune, India E-mail: shweta.kanhere@gmail.com,
More informationLecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize.
Cornell University, Fall 2017 CS 6820: Algorithms Lecture notes on the simplex method September 2017 1 The Simplex Method We will present an algorithm to solve linear programs of the form maximize subject
More informationProbabilistic Modeling of Leach Protocol and Computing Sensor Energy Consumption Rate in Sensor Networks
Probabilistic Modeling of Leach Protocol and Computing Sensor Energy Consumption Rate in Sensor Networks Dezhen Song CS Department, Texas A&M University Technical Report: TR 2005-2-2 Email: dzsong@cs.tamu.edu
More informationLocating Mobile Nodes with EASE: Learning Efficient Routes from Encounter Histories Alone
1 Locating Mobile Nodes with EASE: Learning Efficient Routes from Encounter Histories Alone Matthias Grossglauser, Member, IEEE, and Martin Vetterli, Fellow, IEEE Abstract Routing in large-scale mobile
More informationGeo-Routing. Chapter 2. Ad Hoc and Sensor Networks Roger Wattenhofer
Geo-Routing Chapter 2 Ad Hoc and Sensor Networks Roger Wattenhofer 2/1 Application of the Week: Mesh Networking (Roofnet) Sharing Internet access Cheaper for everybody Several gateways fault-tolerance
More informationCHAPTER 5 PROPAGATION DELAY
98 CHAPTER 5 PROPAGATION DELAY Underwater wireless sensor networks deployed of sensor nodes with sensing, forwarding and processing abilities that operate in underwater. In this environment brought challenges,
More informationModeling the protocol under different capture and sensing capabilities
Modeling the 82. protocol under different capture and sensing capabilities Mathilde Durvy EPFL CH-5 Lausanne, Switzerland mathilde.durvy@epfl.ch Olivier Dousse Deutsch Telekom Laboratories 587 Berlin,
More informationOptimal Anycast Technique for Delay-Sensitive Energy-Constrained Asynchronous Sensor Networks
1 Optimal Anycast Technique for Delay-Sensitive Energy-Constrained Asynchronous Sensor Networks Joohwan Kim, Xiaoun Lin, and Ness B. Shroff School of Electrical and Computer Engineering, Purdue University
More informationConsensus on the Average on Arbitrary Strongly Connected Digraphs Based on Broadcast Gossip Algorithms
1 Consensus on the Average on Arbitrary Strongly Connected Digraphs Based on Broadcast Gossip Algorithms Mauro Franceschelli, Alessandro Giua and Carla Seatzu Abstract In this paper we propose a new decentralized
More informationGeographical routing 1
Geographical routing 1 Routing in ad hoc networks Obtain route information between pairs of nodes wishing to communicate. Proactive protocols: maintain routing tables at each node that is updated as changes
More informationEvaluation of Cartesian-based Routing Metrics for Wireless Sensor Networks
Evaluation of Cartesian-based Routing Metrics for Wireless Sensor Networks Ayad Salhieh Department of Electrical and Computer Engineering Wayne State University Detroit, MI 48202 ai4874@wayne.edu Loren
More informationImproving Connectivity via Relays Deployment in Wireless Sensor Networks
Improving Connectivity via Relays Deployment in Wireless Sensor Networks Ahmed S. Ibrahim, Karim G. Seddik, and K. J. Ray Liu Department of Electrical and Computer Engineering, and Institute for Systems
More informationComputing Aggregate Functions in Sensor Networks
Computing Aggregate Functions in Sensor Networks Antonio Fernández Anta 1 Miguel A. Mosteiro 1,2 Christopher Thraves 3 1 LADyR, GSyC,Universidad Rey Juan Carlos 2 Dept. of Computer Science, Rutgers University
More informationAnalysis of Slotted Multi-Access Techniques for Wireless Sensor Networks
Analysis of Slotted Multi-Access Techniques for Wireless Sensor Networks Kiran Yedavalli and Bhaskar Krishnamachari Department of Electrical Engineering - Systems University of Southern California, Los
More informationEnergy-Aware Routing in Wireless Ad-hoc Networks
Energy-Aware Routing in Wireless Ad-hoc Networks Panagiotis C. Kokkinos Christos A. Papageorgiou Emmanouel A. Varvarigos Abstract In this work we study energy efficient routing strategies for wireless
More information13 Sensor networks Gathering in an adversarial environment
13 Sensor networks Wireless sensor systems have a broad range of civil and military applications such as controlling inventory in a warehouse or office complex, monitoring and disseminating traffic conditions,
More informationRouting. 4. Mar INF-3190: Switching and Routing
Routing 4. Mar. 004 1 INF-3190: Switching and Routing Routing: Foundations! Task! To define the route of packets through the network! From the source! To the destination system! Routing algorithm! Defines
More informationarxiv: v1 [cs.ni] 28 Apr 2015
Succint greedy routing without metric on planar triangulations Pierre Leone, Kasun Samarasinghe Computer Science Department, University of Geneva, Battelle A, route de Drize 7, 1227 Carouge, Switzerland
More informationQueuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks
Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute Troy, NY bisnin@rpi.edu, abouzeid@ecse.rpi.edu
More informationOn Performance Evaluation of Reliable Topology Control Algorithms in Mobile Ad Hoc Networks (Invited Paper)
On Performance Evaluation of Reliable Topology Control Algorithms in Mobile Ad Hoc Networks (Invited Paper) Ngo Duc Thuan 1,, Hiroki Nishiyama 1, Nirwan Ansari 2,andNeiKato 1 1 Graduate School of Information
More informationMODEL SELECTION AND REGULARIZATION PARAMETER CHOICE
MODEL SELECTION AND REGULARIZATION PARAMETER CHOICE REGULARIZATION METHODS FOR HIGH DIMENSIONAL LEARNING Francesca Odone and Lorenzo Rosasco odone@disi.unige.it - lrosasco@mit.edu June 6, 2011 ABOUT THIS
More informationDistributed non-convex optimization
Distributed non-convex optimization Behrouz Touri Assistant Professor Department of Electrical and Computer Engineering University of California San Diego/University of Colorado Boulder AFOSR Computational
More informationAn Evolutionary Algorithm for the Multi-objective Shortest Path Problem
An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China
More informationGATEWAY MULTIPOINT RELAYS AN MPR-BASED BROADCAST ALGORITHM FOR AD HOC NETWORKS. Ou Liang, Y. Ahmet Şekercioğlu, Nallasamy Mani
GATEWAY MULTIPOINT RELAYS AN MPR-BASED BROADCAST ALGORITHM FOR AD HOC NETWORKS Ou Liang, Y. Ahmet Şekercioğlu, Nallasamy Mani Centre for Telecommunication and Information Engineering Monash University,
More informationData gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks
Mobile Information Systems 9 (23) 295 34 295 DOI.3233/MIS-364 IOS Press Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks Keisuke Goto, Yuya Sasaki, Takahiro
More informationMODEL SELECTION AND REGULARIZATION PARAMETER CHOICE
MODEL SELECTION AND REGULARIZATION PARAMETER CHOICE REGULARIZATION METHODS FOR HIGH DIMENSIONAL LEARNING Francesca Odone and Lorenzo Rosasco odone@disi.unige.it - lrosasco@mit.edu June 3, 2013 ABOUT THIS
More informationExact Optimized-cost Repair in Multi-hop Distributed Storage Networks
Exact Optimized-cost Repair in Multi-hop Distributed Storage Networks Majid Gerami, Ming Xiao Communication Theory Lab, Royal Institute of Technology, KTH, Sweden, E-mail: {gerami, mingx@kthse arxiv:14012774v1
More informationDiversity Coloring for Distributed Storage in Mobile Networks
Diversity Coloring for Distributed Storage in Mobile Networks Anxiao (Andrew) Jiang and Jehoshua Bruck California Institute of Technology Abstract: Storing multiple copies of files is crucial for ensuring
More informationLecture 2 September 3
EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give
More informationEnergy Conservation of Sensor Nodes using LMS based Prediction Model
Energy Conservation of Sensor odes using LMS based Prediction Model Anagha Rajput 1, Vinoth Babu 2 1, 2 VIT University, Tamilnadu Abstract: Energy conservation is one of the most concentrated research
More informationEstimating the Free Region of a Sensor Node
Estimating the Free Region of a Sensor Node Laxmi Gewali, Navin Rongratana, Jan B. Pedersen School of Computer Science, University of Nevada 4505 Maryland Parkway Las Vegas, NV, 89154, USA Abstract We
More information6. Concluding Remarks
[8] K. J. Supowit, The relative neighborhood graph with an application to minimum spanning trees, Tech. Rept., Department of Computer Science, University of Illinois, Urbana-Champaign, August 1980, also
More informationReview of the Robust K-means Algorithm and Comparison with Other Clustering Methods
Review of the Robust K-means Algorithm and Comparison with Other Clustering Methods Ben Karsin University of Hawaii at Manoa Information and Computer Science ICS 63 Machine Learning Fall 8 Introduction
More informationAdvanced Topics on Wireless Ad Hoc Networks. Lecture 4: Energy-aware Routing Algorithms
Advanced Topics on Wireless Ad Hoc Networks Lecture 4: Energy-aware Routing Algorithms Sotiris Nikoletseas Professor CEID - ETY Course 2017-2018 Sotiris Nikoletseas, Professor Efficient Data propagation
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationGeographical Routing Algorithms In Asynchronous Wireless Sensor Network
Geographical Routing Algorithms In Asynchronous Wireless Sensor Network Vaishali.S.K, N.G.Palan Electronics and telecommunication, Cummins College of engineering for women Karvenagar, Pune, India Abstract-
More informationWeek 10: DTMC Applications Randomized Routing. Network Performance 10-1
Week 10: DTMC Applications Randomized Routing Network Performance 10-1 Random Walk: Probabilistic Routing Random neighbor selection e.g. in ad-hoc/sensor network due to: Scalability: no routing table (e.g.
More informationCluster Analysis. Prof. Thomas B. Fomby Department of Economics Southern Methodist University Dallas, TX April 2008 April 2010
Cluster Analysis Prof. Thomas B. Fomby Department of Economics Southern Methodist University Dallas, TX 7575 April 008 April 010 Cluster Analysis, sometimes called data segmentation or customer segmentation,
More informationDiversity Coded 5G Fronthaul Wireless Networks
IEEE Wireless Telecommunication Symposium (WTS) 2017 Diversity Coded 5G Fronthaul Wireless Networks Nabeel Sulieman, Kemal Davaslioglu, and Richard D. Gitlin Department of Electrical Engineering University
More informationCapacity and Delay Tradeoffs for Ad-Hoc Mobile Networks
Capacity and Delay Tradeoffs for Ad-Hoc Mobile etworks Michael J. eely University of Southern California http://www-rcf.usc.edu/ mjneely Eytan Modiano Massachusetts Inst. of Technology http://web.mit.edu/modiano/www/
More informationAn algorithm for Performance Analysis of Single-Source Acyclic graphs
An algorithm for Performance Analysis of Single-Source Acyclic graphs Gabriele Mencagli September 26, 2011 In this document we face with the problem of exploiting the performance analysis of acyclic graphs
More informationTRANSITIVE GRAPHS UNIQUELY DETERMINED BY THEIR LOCAL STRUCTURE
TRANSITIVE GRAPHS UNIQUELY DETERMINED BY THEIR LOCAL STRUCTURE JOSHUA FRISCH AND OMER TAMUZ Abstract. We give an example of an infinite, vertex transitive graph that has the following property: it is the
More informationA Token-Based Approach for Distributed Computation in Sensor Networks Venkatesh Saligrama and Murat Alanyali
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, VOL. 5, NO. 4, AUGUST 2011 817 A Token-Based Approach for Distributed Computation in Sensor Networks Venkatesh Saligrama and Murat Alanyali Abstract
More informationMobility Control for Complete Coverage in Wireless Sensor Networks
Mobility Control for Complete Coverage in Wireless Sensor Networks Zhen Jiang Computer Sci. Dept. West Chester University West Chester, PA 9383, USA zjiang@wcupa.edu Jie Wu Computer Sci. & Eng. Dept. Florida
More informationAnalytic Performance Models for Bounded Queueing Systems
Analytic Performance Models for Bounded Queueing Systems Praveen Krishnamurthy Roger D. Chamberlain Praveen Krishnamurthy and Roger D. Chamberlain, Analytic Performance Models for Bounded Queueing Systems,
More informationEfficient Broadcast Algorithms To Reduce number of transmission Based on Probability Scheme
Efficient Broadcast s To Reduce number of transmission Based on Probability Scheme S.Tharani, R.Santhosh Abstract Two main approaches to broadcast packets in wireless ad hoc networks are static and dynamic.
More information2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006
2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,
More informationIEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 54, NO. 8, AUGUST
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 54, NO. 8, AUGUST 2009 1807 Data Transmission Over Networks for Estimation and Control Vijay Gupta, Member, IEEE, Amir F. Dana, Member, IEEE, Joao P. Hespanha,
More informationEfficient Second-Order Iterative Methods for IR Drop Analysis in Power Grid
Efficient Second-Order Iterative Methods for IR Drop Analysis in Power Grid Yu Zhong Martin D. F. Wong Dept. of Electrical and Computer Engineering Dept. of Electrical and Computer Engineering Univ. of
More informationDevice-to-Device Networking Meets Cellular via Network Coding
Device-to-Device Networking Meets Cellular via Network Coding Yasaman Keshtkarjahromi, Student Member, IEEE, Hulya Seferoglu, Member, IEEE, Rashid Ansari, Fellow, IEEE, and Ashfaq Khokhar, Fellow, IEEE
More informationA Singular Example for the Averaged Mean Curvature Flow
To appear in Experimental Mathematics Preprint Vol. No. () pp. 3 7 February 9, A Singular Example for the Averaged Mean Curvature Flow Uwe F. Mayer Abstract An embedded curve is presented which under numerical
More information554 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 2, FEBRUARY /$ IEEE
554 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 2, FEBRUARY 2008 Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks Yalin Evren Sagduyu, Member, IEEE, and
More informationHierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks Presentation: Alexandros Manolakos EE 360 Stanford University February 13, 2012 Table of Contents What are we trying to solve?
More informationMultihop Hierarchical MIMO A Multicast Structure in wireless ad hoc networks
Multihop Hierarchical MIMO A Multicast Structure in wireless ad hoc networks January 11, 2008 Abstract In this paper, we study multicast in large-scale wireless ad hoc networks. Consider N nodes that are
More informationGeometric Considerations for Distribution of Sensors in Ad-hoc Sensor Networks
Geometric Considerations for Distribution of Sensors in Ad-hoc Sensor Networks Ted Brown, Deniz Sarioz, Amotz Bar-Noy, Tom LaPorta, Dinesh Verma, Matthew Johnson, Hosam Rowaihy November 20, 2006 1 Introduction
More informationCALCULATION OF INFERENCE IN AD-HOC NETWORK
CALCULATION OF INFERENCE IN AD-HOC NETWORK POOJA GROVER, 2 NEHA GUPTA, 3 RANJIT KUMAR Asst. Prof., Department of Computer Science & Engineering, MDU, Rohtak, India-3300 2 Lecturer, Department of Information
More informationA Review: Optimization of Energy in Wireless Sensor Networks
A Review: Optimization of Energy in Wireless Sensor Networks Anjali 1, Navpreet Kaur 2 1 Department of Electronics & Communication, M.Tech Scholar, Lovely Professional University, Punjab, India 2Department
More informationDegrees of Freedom in Cached Interference Networks with Limited Backhaul
Degrees of Freedom in Cached Interference Networks with Limited Backhaul Vincent LAU, Department of ECE, Hong Kong University of Science and Technology (A) Motivation Interference Channels 3 No side information
More informationSmartGossip: : an improved randomized broadcast protocol for sensor networks
SmartGossip: : an improved randomized broadcast protocol for sensor networks Presented by Vilas Veeraraghavan Advisor Dr. Steven Weber Presented to the Center for Telecommunications and Information Networking
More informationConnected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees
Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees Pouya Ostovari Department of Computer and Information Siences Temple University Philadelphia, Pennsylvania, USA Email: ostovari@temple.edu
More informationFAST QUEUING POLICIES FOR MULTIMEDIA APPLICATIONS. Anonymous ICME submission
FAST QUEUING POLICIES FOR MULTIMEDIA APPLICATIONS Anonymous ICME submission ABSTRACT We present an analytical framework for providing Quality of Service (QoS) using queuing policies that achieves a given
More informationMedium Access Control Protocols With Memory Jaeok Park, Member, IEEE, and Mihaela van der Schaar, Fellow, IEEE
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 18, NO. 6, DECEMBER 2010 1921 Medium Access Control Protocols With Memory Jaeok Park, Member, IEEE, and Mihaela van der Schaar, Fellow, IEEE Abstract Many existing
More informationAchieve Significant Throughput Gains in Wireless Networks with Large Delay-Bandwidth Product
Available online at www.sciencedirect.com ScienceDirect IERI Procedia 10 (2014 ) 153 159 2014 International Conference on Future Information Engineering Achieve Significant Throughput Gains in Wireless
More informationWhen does a digraph admit a doubly stochastic adjacency matrix?
When does a digraph admit a doubly stochastic adjacency matrix? Bahman Gharesifard and Jorge Cortés Abstract Digraphs with doubly stochastic adjacency matrices play an essential role in a variety of cooperative
More informationExperimental Framework and Simulator for the MAC of Power-Line Communications
Experimental Framework and Simulator for the MAC of Power-Line Communications Technical Report Christina Vlachou EPFL, Switzerland christinavlachou@epflch Julien Herzen EPFL, Switzerland julienherzen@epflch
More informationDistributed Averaging Via Lifted Markov Chains Kyomin Jung, Devavrat Shah, and Jinwoo Shin
634 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 1, JANUARY 2010 Distributed Averaging Via Lted Markov Chains Kyomin Jung, Devavrat Shah, and Jinwoo Shin Abstract Motivated by applications of
More informationLoopy Belief Propagation
Loopy Belief Propagation Research Exam Kristin Branson September 29, 2003 Loopy Belief Propagation p.1/73 Problem Formalization Reasoning about any real-world problem requires assumptions about the structure
More informationVirtual Circuit Blocking Probabilities in an ATM Banyan Network with b b Switching Elements
Proceedings of the Applied Telecommunication Symposium (part of Advanced Simulation Technologies Conference) Seattle, Washington, USA, April 22 26, 21 Virtual Circuit Blocking Probabilities in an ATM Banyan
More informationA METHOD TO MODELIZE THE OVERALL STIFFNESS OF A BUILDING IN A STICK MODEL FITTED TO A 3D MODEL
A METHOD TO MODELIE THE OVERALL STIFFNESS OF A BUILDING IN A STICK MODEL FITTED TO A 3D MODEL Marc LEBELLE 1 SUMMARY The aseismic design of a building using the spectral analysis of a stick model presents
More informationFountain Codes Based on Zigzag Decodable Coding
Fountain Codes Based on Zigzag Decodable Coding Takayuki Nozaki Kanagawa University, JAPAN Email: nozaki@kanagawa-u.ac.jp Abstract Fountain codes based on non-binary low-density parity-check (LDPC) codes
More informationDistributed STDMA in Ad Hoc Networks
Distributed STDMA in Ad Hoc Networks Jimmi Grönkvist Swedish Defence Research Agency SE-581 11 Linköping, Sweden email: jimgro@foi.se Abstract Spatial reuse TDMA is a collision-free access scheme for ad
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More informationStructured System Theory
Appendix C Structured System Theory Linear systems are often studied from an algebraic perspective, based on the rank of certain matrices. While such tests are easy to derive from the mathematical model,
More informationA Two-phase Distributed Training Algorithm for Linear SVM in WSN
Proceedings of the World Congress on Electrical Engineering and Computer Systems and Science (EECSS 015) Barcelona, Spain July 13-14, 015 Paper o. 30 A wo-phase Distributed raining Algorithm for Linear
More informationEnergy-Latency Tradeoff for In-Network Function Computation in Random Networks
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks P. Balister 1 B. Bollobás 1 A. Anandkumar 2 A.S. Willsky 3 1 Dept. of Math., Univ. of Memphis, Memphis, TN, USA 2 Dept. of
More information