Computing and Communicating Functions over Sensor Networks
|
|
- Mae Page
- 6 years ago
- Views:
Transcription
1 Computing and Communicating Functions over Sensor Networks Solmaz Torabi Dept. of Electrical and Computer Engineering Drexel University Advisor: Dr. John M. Walsh 1/35 1
2 Refrences [1] A. Giridhar and P. R. Kumar, Computing and communicating functions over sensor networks, Selected Areas in Communications, IEEE Journal on, vol. 23, no. 4, pp , /35 2
3 Outline Model of the problem Network topologies Random planar network Collocated network Classes of functions Type threshold function Type sensitive function Results 3/35 3
4 Summary Order of difficulty of computations Θ( 1 n ) Average, Mode, Type vector in Collocated network: Data Downloading Θ( 1 log n ) Average, Mode, Type in Random Multi-hop network Max, Min in Collocated network 1 Θ( log log n ) Max, Min in Random Multi-hop network 4/35 4
5 Problem model n sensor nodes ρ ij is the distance between two nodes i, j. Fusion node needs to calculate f n (x 1,..., x n ) exactly. At time t, sensor i takes a measurement x i (t) {1,.., X } No probability distribution on x i (t) Non-information theoretic formulation They adopt packet based collision model of wireless communication 5/35 5
6 Problem model All nodes share a common transmission range r. Receiver should be outside other transmitters interference footprints Node i can succesuty transmit packet to j if ρij r and for every other simultaneously transmitting node k, ρ kj (1 + )r Successful communication between two nodes takes place at a rate W bits/second. 6/35 6
7 Problem model Block coding allowed: M measurements of node 1: x 1 x 1 (1), x 1 (2),..., x 1 (M) M measurements of node 2: x 2 x 2 (1), x 2 (2),..., x 2 (M)... M measurements of node n: x n x n (1), x n (2),..., x n (M) M functions to compute: f ( x 1 (1),.., x n (1) ),..., f ( x 1 (M),..., x n (M) ) The matrix of measurements x X Mn is a n M matrix. If all M functions are computed in time T, the computational rate is R = M T 7/35 7
8 List of notations f n : X n Y n is the function of interest. R(f, n) is the range of f n S M,n is a scheme or strategy T (S M,n ) is the time taken by scheme S M,n worst case over all X X nm R(S M,n ) = R (n) M T (S M,n ) is the rate of the scheme. max is the supremum of rates R(S M,n ) over all schemes S M,n and block length M R max = sup S,M M T (S M,n ) G (n) is the spatial graph consists of the set of n nodes, with edges between nodes that are within a distance r of each other. 8/35 8
9 Outline Model of the problem Network topologies Random planar network Collocated network Classes of functions Type threshold function Type sensitive function Results 9/35 9
10 Network Topologies Collocated Networks: These are networks with ρ ij r for all i, j so every transmission is heard by all nodes. Random Planar Networks: The n nodes along with the sink node s are uniformly and independently distributed on a unit square Note: The common range r of all the n nodes is so chosen that, by using multihop communication, the graph is connected 10/35 10
11 Review Lemma: For random planar networks, if range r(n) = connected w.h.p. and d(g(n)) c log n w.h.p. 2 log n n then G (n) is Result follows from earlier paper on critical power for asymptotic connectivity. 11/35 11
12 A trivial upper bound The sink node can receive at most W bits/s Representing f (.) requires log R(f, n) R max (n) W log R(f, n) (1) 12/35 12
13 Outline Model of the problem Network topologies Random planar network Collocated network Classes of functions Type threshold function Type sensitive function Results 13/35 13
14 Types of functions Divisible functions Definition given a subset S = {i 1,..., i k } [n], denote by x S = [x i1,..., x ik ] A function f : X n Y n is divisible if R(f, n) is nondecreasing in n given any partition Π(S) = {S1,.., S j } of S [n], a function g Π(S) f (x S ) = g Π(S)( f (x S1 ), f (x S2 ),..., f (x Sk ) ) (2) Example max(1, 2, 3, 4, 5) = max(max(1, 2), max(3, 4), max(5)) 14/35 14
15 Computing divisible function over random planar network Theorem For a divisible function f, and d(g (n) ) = O(log R(f, n) ), 1 R max (n) = Θ( log R(f,n) ) Proof Tessellation of plane into square cells of side r 2 Cell Graph: Define on a set of non-empty cells as vertices Two cells are adjacent if there are two nodes within each cell which are adjacent in G n relay node Sink node relay node 15/35 15
16 Proof Neighboring occupied cells can communicate with each other Consider a rooted spanning tree of the cell graph Designate the cell with the sink node as the root, s Choose a relay node (u) in each cell and a parent (v) in the next cell towards the root Each cell has one relay node (picked out of possibly multiple choices) relay node Sink node relay node 16/35 16
17 Proof For each node u, define the descendant set D u as If u is a relay node of a c, Du is the set of all nodes that either belong to c or to descendants of c If u is the relay parent of {u 1,..., u l }, D u = {u} D u1... D ul. relay node Sink node relay node Else Du = u Locally compute and pass on along tree to root Collect data from deg(g n ) nodes within cell Collect functional value of log R(f n ) bits from child cells Pass on functional value of 17/35log R(f n ) bits to parent cell 17
18 Computing a divisible function Special cases Data Downloading: log R(f, n) = log X n = O(n) R max (n) = Θ( 1 n ) (3) if d(g n ) = O(n) (For any connected graph) Frequency histogram or the type-vector τ(x) = [τ 1 (x), τ 2 (x),..., τ X (x)] (4) where τ i (x) = {j : x j = i} (5) is the number of occurrences of i in x. 18/35 18
19 Histogram The number of type vectors of a vector of size n is the number of nonnegative integer solutions to the equation and ( n X ) X y 1 + y y X = n (6) ( ) n + X 1 R(f, n) = X 1 (7) ( ) n + X 1 (n + 1) X (8) X 1 1 R max (n) = Θ( log n ) if d(g n ) = O(log n) (9) if r(n) is chosen properly d(g n ) = O(log n) w.h.p 19/35 19
20 Symmetric Function Definition Functions which are invariant with respect to permutations of their arguments. Note f (x 1,..., x n ) = f (σ(x 1,..., x n )) for all permutations σ (10) Symmetric functions depend only on type vector τ = (τ 1, τ 2,..., τ X ) Note f n (x 1,..., x n ) = f (τ 1, τ 2,..., τ X ) (11) The data generated by a sensor is of primary importance, rather than its identity. 20/35 20
21 Computing a Symmetric Function An obvious strategy to compute any symmetric function is to simply communicate the entire type or frequency-histogram 1 R max = Ω( log n ) (12) Is it possible to do better? Two disjoint subclasses Type-Sensitive Functions Type-Threshold Functions 21/35 21
22 Type-Sensitive Functions A symmetric function is type-sensitive if 0 < γ < 1, and k Z +, and any j n [γn], given any subset {x 1,..., x j }, there are two subsets of values {y j+1,..., y n } and {z j+1,.., z n } such that f (x 1,.., x j, z j+1,.., z n ) f (x 1,..., x j, y j+1,.., y n ) (13) There is a γ such that a fraction γ of values is never enough to pin down the value of the function f n The value of a type-sensitive function cannot be determined if a large enough fraction of the arguments are un-known. Examples Mode : If more than half the x i s are unknown, the mode is undetermined Mean, Median, Majority 22/35 22
23 Type-Threshold Functions A symmetric function f is said to be type-threshold if θ-vector called the threshold vector, such that f (x) = f (τ(x)) = f (min(τ(x), θ)) for all x X n (14) Only want to know whether each τ i exceeds a threshold θ i Examples Max, Min: θ = [1, 1,..., 1] k th largest value: θ = [1, 1,..., 1] Mean of the k largest values: Indicator function I {x i = k for some i}, with θ = [0, 0,..., 1,..., 0, 0] 23/35 23
24 Collision-free strategies (CFS) in collocated Networks Without loss of generality, suppose that time is slotted, and one bit is transmitted in each slot. W = 1 Collision-free strategy is a strategy which is required to explicitly avoid collisions. consists of φ m : {0, 1} m 1 {1,..., n} (15) ψ m : X N {0, 1} m 1 {0, 1} (16) Node φ 1 transmit packet ψ 1 (x φ1 ) at time 1. Node φ 2 (ψ 1 (x φ1 )) transmit packet ψ 2 (ψ 1 (x φ1 ), x φ2 ) at time /35 24
25 Collision-free strategies (CFS) in collocated Networks The node designated to transmit at time m is fixed by the value φ m (ψ m 1, ψ m 2,..., ψ 1 ), which can be computed by all the nodes. The identity of the transmitting node is automatically known to all. The medium access problem is resolved in a distributed but collision-free fashion. The strategies described above are required to explicitly avoid collisions 25/35 25
26 Type-Sensitive Functions in Collocated Networks Theorem The maximum rate for computing a type-sensitive function in a collocated network, using any CFS is Θ( 1 n ), which is of the same order as communicating the entire data. 26/35 26
27 Type-Sensitive Functions in Collocated Networks Proof Wlog suppose X = 2 initially x g1 is in the set S 0 g1 with the cardinality S 0 g1 = 2M After first transmission,x g1 can be in one of two sets depending on whether it transmits 0 or 1 Let the transmission correspond to the larger set, call it be S 1 g1 S 1 g1 1/2 S 0 g1 After t-th transmission of node k, let x k lie in Sk t with Sk t t 1 1/2 Sk 27/35 27
28 Type-Sensitive Functions in Collocated Networks So at the end, uncertainty set is: S 1 S 2... S n 2 nm T Thus at least nm T places in the nm values (x 1, x 2,..., x n ) are undetermined However to compute f n (x(1), x(2),..., x(m)), at least cnm values are needed So nm T (1 c)nm SoT cnm Hence R = M/T O( 1 cn ) Thus R max (n) = O( 1 n ) for collocated case 28/35 28
29 Type-Threshold Functions in Collocated Networks Theorem The maximum rate for computing a nonconstant type-threshold function in a collocated network, using any CFS is Θ( 1 log n ) Proof First prove the result for the case X = 2, and the max function f (x 1, x 2,..., x n ) = max{x i : 1 i n} θ = [1, 1,..., 1] 29/35 29
30 Proof Achievability Goal : providing a sequence of CFS s S M,n, asymptotically achieving the rate Ω( 1 log n ) Take block length M = ln > n Let the number of 1 s in the vector X i be M i Define S i = {1 j M : X i (j) = 1, X k (j) = 0, for all k < i} Define M i = S i, for each 1 i n Note : S i s are disjoint. Note : i M i M Note : Communicating the sets S 1, S 2,..,S n to the sink suffices to reconstruct the function. 30/35 30
31 Proof A collision free strategy S M,n Node i compute M i, and communicate its value in log M slots. Now S i is one of the ( M j<i M j ) M i Node i communicate the identity of the set S i in log ( M j<i M j ) M i By bounding RHS T (S M,n ) = n log M + i ( ) M j<i M j log M i (17) T (S M,n ) < n log l(n + 1) + l(n + 1) log(n + 1)e (18) R = M T = Ω( 1 log n ) (19) 31/35 31
32 Proof Upper bound Goal: R max (n) = O( 1 log n ) Take M > 2n. Consider a set of measurement matrices: x 1 (1),x 1 (2),...,x 1 (N) x 2 (1),x 2 (2),...,x 2 (N)... x n (1),x n (2),...,x n (N) Exactly N 2n 1 Exactly N 2n 1 at most one 1 at most one 1 at most one 1 Claim: For each set of transmissions P 1, P 2,..., P T, there is unique such x in the above set that produces it. 32/35 32
33 Suppose not. Then there are two: x and y which produce same transmissions. They differ in some x k y k Then also produces same transmissions since node k hears the same under x k or y k and so reacts the same. But this has different Max values from x Thus Max functions are not determined from transmissions Number of such vectors x = ( M (i 1) M ) 2n i > (n 1) M So 2 T > (n 1) M So T > M log(n 1) So R = M T 1 log(n 1) Rn max = O( 1 log n ) Rn max = Θ( 1 log n ) M 2n 33/35 33
34 Summary Order of difficulty of computations Θ( 1 n ) Average, Mode, Type vector in Collocated network: Data Downloading Θ( 1 log n ) Average, Mode, Type in Random Multi-hop network Max, Min in Collocated network 1 Θ( log log n ) Max, Min in Random Multi-hop network 34/35 34
35 Thank You! Question? 35/35 35
Queue Length Stability in Trees under Slowly Convergent Traffic using Sequential Maximal Scheduling
1 Queue Length Stability in Trees under Slowly Convergent Traffic using Sequential Maximal Scheduling Saswati Sarkar and Koushik Kar Abstract In this paper, we consider queue-length stability in wireless
More informationOptimal computation of symmetric Boolean functions in Tree networks
Optimal computation of symmetric Boolean functions in Tree networks Hemant Kowshik CSL and Department of ECE University of Illinois Urbana-Champaign Email: kowshik2@illinoisedu P R Kumar CSL and Department
More informationLinear Codes, Target Function Classes, and Network Computing Capacity
Linear Codes, Target Function Classes, and Network Computing Capacity Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, and Kenneth Zeger IEEE Transactions on Information Theory Submitted:
More informationSource Coding and Function Computation: Optimal Rate in Zero-Error and Vanishing Zero-Error Regime
Source Coding and Function Computation: Optimal Rate in Zero-Error and Vanishing Zero-Error Regime Solmaz Torabi Dept. of Electrical and Computer Engineering Drexel University st669@drexel.edu Advisor:
More informationEntropy Vectors and Network Information Theory
Entropy Vectors and Network Information Theory Sormeh Shadbakht and Babak Hassibi Department of Electrical Engineering Caltech Lee Center Workshop May 25, 2007 1 Sormeh Shadbakht and Babak Hassibi Entropy
More informationPCPs and Inapproximability Gap-producing and Gap-Preserving Reductions. My T. Thai
PCPs and Inapproximability Gap-producing and Gap-Preserving Reductions My T. Thai 1 1 Hardness of Approximation Consider a maximization problem Π such as MAX-E3SAT. To show that it is NP-hard to approximation
More informationDominating Set. Chapter 7
Chapter 7 Dominating Set In this chapter we present another randomized algorithm that demonstrates the power of randomization to break symmetries. We study the problem of finding a small dominating set
More informationA New Measure of Wireless Network Connectivity
A New Measure of Wireless Network Connectivity Soura Dasgupta, Fellow IEEE, Guoqiang Mao, Senior Member IEEE and Brian Anderson, Life Fellow IEEE 1 Abstract Despite intensive research in the area of network
More informationData Gathering and Personalized Broadcasting in Radio Grids with Interferences
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences Jean-Claude Bermond a,, Bi Li a,b, Nicolas Nisse a, Hervé Rivano c, Min-Li Yu d a Coati Project, INRIA I3S(CNRS/UNSA), Sophia
More informationData Gathering and Personalized Broadcasting in Radio Grids with Interferences
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences Jean-Claude Bermond a,b,, Bi Li b,a,c, Nicolas Nisse b,a, Hervé Rivano d, Min-Li Yu e a Univ. Nice Sophia Antipolis, CNRS,
More informationREVERSALS ON SFT S. 1. Introduction and preliminaries
Trends in Mathematics Information Center for Mathematical Sciences Volume 7, Number 2, December, 2004, Pages 119 125 REVERSALS ON SFT S JUNGSEOB LEE Abstract. Reversals of topological dynamical systems
More informationThe Algorithmic Aspects of the Regularity Lemma
The Algorithmic Aspects of the Regularity Lemma N. Alon R. A. Duke H. Lefmann V. Rödl R. Yuster Abstract The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in
More informationLECTURE 3. Last time:
LECTURE 3 Last time: Mutual Information. Convexity and concavity Jensen s inequality Information Inequality Data processing theorem Fano s Inequality Lecture outline Stochastic processes, Entropy rate
More informationOn improving matchings in trees, via bounded-length augmentations 1
On improving matchings in trees, via bounded-length augmentations 1 Julien Bensmail a, Valentin Garnero a, Nicolas Nisse a a Université Côte d Azur, CNRS, Inria, I3S, France Abstract Due to a classical
More informationRandomized Sorting Algorithms Quick sort can be converted to a randomized algorithm by picking the pivot element randomly. In this case we can show th
CSE 3500 Algorithms and Complexity Fall 2016 Lecture 10: September 29, 2016 Quick sort: Average Run Time In the last lecture we started analyzing the expected run time of quick sort. Let X = k 1, k 2,...,
More informationA Note on Interference in Random Networks
CCCG 2012, Charlottetown, P.E.I., August 8 10, 2012 A Note on Interference in Random Networks Luc Devroye Pat Morin Abstract The (maximum receiver-centric) interference of a geometric graph (von Rickenbach
More informationShortest Link Scheduling with Power Control under Physical Interference Model
2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks Shortest Link Scheduling with Power Control under Physical Interference Model Peng-Jun Wan Xiaohua Xu Department of Computer Science
More information2. The Concept of Convergence: Ultrafilters and Nets
2. The Concept of Convergence: Ultrafilters and Nets NOTE: AS OF 2008, SOME OF THIS STUFF IS A BIT OUT- DATED AND HAS A FEW TYPOS. I WILL REVISE THIS MATE- RIAL SOMETIME. In this lecture we discuss two
More informationDesign and Analysis of Algorithms
CSE 101, Winter 2018 Design and Analysis of Algorithms Lecture 5: Divide and Conquer (Part 2) Class URL: http://vlsicad.ucsd.edu/courses/cse101-w18/ A Lower Bound on Convex Hull Lecture 4 Task: sort the
More informationDominating Set. Chapter 26
Chapter 26 Dominating Set In this chapter we present another randomized algorithm that demonstrates the power of randomization to break symmetries. We study the problem of finding a small dominating set
More informationDominating Set. Chapter Sequential Greedy Algorithm 294 CHAPTER 26. DOMINATING SET
294 CHAPTER 26. DOMINATING SET 26.1 Sequential Greedy Algorithm Chapter 26 Dominating Set Intuitively, to end up with a small dominating set S, nodes in S need to cover as many neighbors as possible. It
More informationGradient Clock Synchronization
Noname manuscript No. (will be inserted by the editor) Rui Fan Nancy Lynch Gradient Clock Synchronization the date of receipt and acceptance should be inserted later Abstract We introduce the distributed
More informationGraphs with few total dominating sets
Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph
More informationACO Comprehensive Exam October 14 and 15, 2013
1. Computability, Complexity and Algorithms (a) Let G be the complete graph on n vertices, and let c : V (G) V (G) [0, ) be a symmetric cost function. Consider the following closest point heuristic for
More informationOn the Quality of Wireless Network Connectivity
Globecom 2012 - Ad Hoc and Sensor Networking Symposium On the Quality of Wireless Network Connectivity Soura Dasgupta Department of Electrical and Computer Engineering The University of Iowa Guoqiang Mao
More informationAsymptotics, asynchrony, and asymmetry in distributed consensus
DANCES Seminar 1 / Asymptotics, asynchrony, and asymmetry in distributed consensus Anand D. Information Theory and Applications Center University of California, San Diego 9 March 011 Joint work with Alex
More informationGraph Theorizing Peg Solitaire. D. Paul Hoilman East Tennessee State University
Graph Theorizing Peg Solitaire D. Paul Hoilman East Tennessee State University December 7, 00 Contents INTRODUCTION SIMPLE SOLVING CONCEPTS 5 IMPROVED SOLVING 7 4 RELATED GAMES 5 5 PROGENATION OF SOLVABLE
More informationFacets for Node-Capacitated Multicut Polytopes from Path-Block Cycles with Two Common Nodes
Facets for Node-Capacitated Multicut Polytopes from Path-Block Cycles with Two Common Nodes Michael M. Sørensen July 2016 Abstract Path-block-cycle inequalities are valid, and sometimes facet-defining,
More informationCSCE 750 Final Exam Answer Key Wednesday December 7, 2005
CSCE 750 Final Exam Answer Key Wednesday December 7, 2005 Do all problems. Put your answers on blank paper or in a test booklet. There are 00 points total in the exam. You have 80 minutes. Please note
More informationTime Synchronization
Massachusetts Institute of Technology Lecture 7 6.895: Advanced Distributed Algorithms March 6, 2006 Professor Nancy Lynch Time Synchronization Readings: Fan, Lynch. Gradient clock synchronization Attiya,
More informationarxiv: v1 [math.co] 23 Feb 2015
Catching a mouse on a tree Vytautas Gruslys Arès Méroueh arxiv:1502.06591v1 [math.co] 23 Feb 2015 February 24, 2015 Abstract In this paper we consider a pursuit-evasion game on a graph. A team of cats,
More informationCharacterising Probability Distributions via Entropies
1 Characterising Probability Distributions via Entropies Satyajit Thakor, Terence Chan and Alex Grant Indian Institute of Technology Mandi University of South Australia Myriota Pty Ltd arxiv:1602.03618v2
More informationSilence is Golden and Time is Money: Power-Aware Communication for Sensor Networks
Silence is Golden and Time is Money: Power-Aware Communication for Sensor Networks Christina Fragouli École Polytechnique Fédérale de Lausanne christina.fragouli@epfl.ch Alon Orlitsky University of California
More informationDominating Connectivity and Reliability of Heterogeneous Sensor Networks
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks Kenneth A. Berman Email: ken.berman@uc.edu Fred S. Annexstein Email: fred.annexstein@uc.edu Aravind Ranganathan Email: rangana@email.uc.edu
More informationOn the Throughput-Optimality of CSMA Policies in Multihop Wireless Networks
Technical Report Computer Networks Research Lab Department of Computer Science University of Toronto CNRL-08-002 August 29th, 2008 On the Throughput-Optimality of CSMA Policies in Multihop Wireless Networks
More informationThe Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks
1 The Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks Urs Niesen, Piyush Gupta, and Devavrat Shah Abstract arxiv:0809.1344v3 [cs.it] 24 Jun 2009 We consider the question of determining
More informationModeling and Stability Analysis of a Communication Network System
Modeling and Stability Analysis of a Communication Network System Zvi Retchkiman Königsberg Instituto Politecnico Nacional e-mail: mzvi@cic.ipn.mx Abstract In this work, the modeling and stability problem
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationPartitioning Metric Spaces
Partitioning Metric Spaces Computational and Metric Geometry Instructor: Yury Makarychev 1 Multiway Cut Problem 1.1 Preliminaries Definition 1.1. We are given a graph G = (V, E) and a set of terminals
More informationThe Inclusion Exclusion Principle
The Inclusion Exclusion Principle 1 / 29 Outline Basic Instances of The Inclusion Exclusion Principle The General Inclusion Exclusion Principle Counting Derangements Counting Functions Stirling Numbers
More informationOnline Interval Coloring and Variants
Online Interval Coloring and Variants Leah Epstein 1, and Meital Levy 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. Email: lea@math.haifa.ac.il School of Computer Science, Tel-Aviv
More informationACO Comprehensive Exam 19 March Graph Theory
1. Graph Theory Let G be a connected simple graph that is not a cycle and is not complete. Prove that there exist distinct non-adjacent vertices u, v V (G) such that the graph obtained from G by deleting
More informationMath 730 Homework 6. Austin Mohr. October 14, 2009
Math 730 Homework 6 Austin Mohr October 14, 2009 1 Problem 3A2 Proposition 1.1. If A X, then the family τ of all subsets of X which contain A, together with the empty set φ, is a topology on X. Proof.
More informationRadio communication in random graphs
Journal of Computer and System Sciences 72 (2006) 490 506 www.elsevier.com/locate/jcss Radio communication in random graphs R. Elsässer a,,1,l.garsieniec b a Department of Mathematics, University of California,
More informationRadio Network Clustering from Scratch
Radio Network Clustering from Scratch Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer {kuhn,moscitho,wattenhofer}@inf.ethz.ch Department of Computer Science, ETH Zurich, 8092 Zurich, Switzerland Abstract.
More informationUnderstanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-hop Wireless Networks
1 Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-hop Wireless Networks Changhee Joo, Member, IEEE, Xiaojun Lin, Member, IEEE, and Ness B. Shroff, Fellow, IEEE Abstract
More informationConnectivity of Wireless Sensor Networks with Constant Density
Connectivity of Wireless Sensor Networks with Constant Density Sarah Carruthers and Valerie King University of Victoria, Victoria, BC, Canada Abstract. We consider a wireless sensor network in which each
More informationCooperative HARQ with Poisson Interference and Opportunistic Routing
Cooperative HARQ with Poisson Interference and Opportunistic Routing Amogh Rajanna & Mostafa Kaveh Department of Electrical and Computer Engineering University of Minnesota, Minneapolis, MN USA. Outline
More information18.10 Addendum: Arbitrary number of pigeons
18 Resolution 18. Addendum: Arbitrary number of pigeons Razborov s idea is to use a more subtle concept of width of clauses, tailor made for this particular CNF formula. Theorem 18.22 For every m n + 1,
More informationPacket Scheduling with Interference
Computer Science Computer Science Department Thomas Keßelheim Packet Scheduling with Interference Diploma Thesis January 3, 2009 Thesis advisor: Second advisor: Prof. Dr. Berthold Vöcking Prof. Dr. Petri
More informationIS 709/809: Computational Methods in IS Research Fall Exam Review
IS 709/809: Computational Methods in IS Research Fall 2017 Exam Review Nirmalya Roy Department of Information Systems University of Maryland Baltimore County www.umbc.edu Exam When: Tuesday (11/28) 7:10pm
More informationNonparametric one-sided testing for the mean and related extremum problems
Nonparametric one-sided testing for the mean and related extremum problems Norbert Gaffke University of Magdeburg, Faculty of Mathematics D-39016 Magdeburg, PF 4120, Germany E-mail: norbert.gaffke@mathematik.uni-magdeburg.de
More informationRadio Number for Square of Cycles
Radio Number for Square of Cycles Daphne Der-Fen Liu Melanie Xie Department of Mathematics California State University, Los Angeles Los Angeles, CA 9003, USA August 30, 00 Abstract Let G be a connected
More informationAlgorithms Reading Group Notes: Provable Bounds for Learning Deep Representations
Algorithms Reading Group Notes: Provable Bounds for Learning Deep Representations Joshua R. Wang November 1, 2016 1 Model and Results Continuing from last week, we again examine provable algorithms for
More informationQuivers of Period 2. Mariya Sardarli Max Wimberley Heyi Zhu. November 26, 2014
Quivers of Period 2 Mariya Sardarli Max Wimberley Heyi Zhu ovember 26, 2014 Abstract A quiver with vertices labeled from 1,..., n is said to have period 2 if the quiver obtained by mutating at 1 and then
More informationOn the complexity of maximizing the minimum Shannon capacity in wireless networks by joint channel assignment and power allocation
On the complexity of maximizing the minimum Shannon capacity in wireless networks by joint channel assignment and power allocation Mikael Fallgren Royal Institute of Technology December, 2009 Abstract
More informationCleaning Interval Graphs
Cleaning Interval Graphs Dániel Marx and Ildikó Schlotter Department of Computer Science and Information Theory, Budapest University of Technology and Economics, H-1521 Budapest, Hungary. {dmarx,ildi}@cs.bme.hu
More informationDistributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient
Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient Viveck R Cadambe, Syed A Jafar, Hamed Maleki Electrical Engineering and
More informationCognitive Networks Achieve Throughput Scaling of a Homogeneous Network
Cognitive Networks Achieve Throughput Scaling of a Homogeneous Network Sang-Woon Jeon, Student Member, IEEE, Natasha Devroye, Mai vu, Member, IEEE Sae-Young Chung, Senior Member, IEEE, and Vahid Tarokh
More informationNAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key
NAME: Mathematics 205A, Fall 2008, Final Examination Answer Key 1 1. [25 points] Let X be a set with 2 or more elements. Show that there are topologies U and V on X such that the identity map J : (X, U)
More informationThe Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks
1 The Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks Urs Niesen, Piyush Gupta, and Devavrat Shah Abstract arxiv:0809.1344v5 [cs.it] 21 Jan 2010 We consider the question of determining
More informationCommon Information of Random Linear Network Coding Over A 1-Hop Broadcast Packet Erasure Channel
Wang, ISIT 2011 p. 1/15 Common Information of Random Linear Network Coding Over A 1-Hop Broadcast Packet Erasure Channel Chih-Chun Wang, Jaemin Han Center of Wireless Systems and Applications (CWSA) School
More informationON THE NUMBER OF COMPONENTS OF A GRAPH
Volume 5, Number 1, Pages 34 58 ISSN 1715-0868 ON THE NUMBER OF COMPONENTS OF A GRAPH HAMZA SI KADDOUR AND ELIAS TAHHAN BITTAR Abstract. Let G := (V, E be a simple graph; for I V we denote by l(i the number
More informationOn shredders and vertex connectivity augmentation
On shredders and vertex connectivity augmentation Gilad Liberman The Open University of Israel giladliberman@gmail.com Zeev Nutov The Open University of Israel nutov@openu.ac.il Abstract We consider the
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationMa/CS 6b Class 25: Error Correcting Codes 2
Ma/CS 6b Class 25: Error Correcting Codes 2 By Adam Sheffer Recall: Codes V n the set of binary sequences of length n. For example, V 3 = 000,001,010,011,100,101,110,111. Codes of length n are subsets
More informationLecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past.
1 Markov chain: definition Lecture 5 Definition 1.1 Markov chain] A sequence of random variables (X n ) n 0 taking values in a measurable state space (S, S) is called a (discrete time) Markov chain, if
More informationAsymptotic redundancy and prolixity
Asymptotic redundancy and prolixity Yuval Dagan, Yuval Filmus, and Shay Moran April 6, 2017 Abstract Gallager (1978) considered the worst-case redundancy of Huffman codes as the maximum probability tends
More informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationProperly colored Hamilton cycles in edge colored complete graphs
Properly colored Hamilton cycles in edge colored complete graphs N. Alon G. Gutin Dedicated to the memory of Paul Erdős Abstract It is shown that for every ɛ > 0 and n > n 0 (ɛ), any complete graph K on
More informationCHAPTER 6. Representations of compact groups
CHAPTER 6 Representations of compact groups Throughout this chapter, denotes a compact group. 6.1. Examples of compact groups A standard theorem in elementary analysis says that a subset of C m (m a positive
More informationMath 225B: Differential Geometry, Final
Math 225B: Differential Geometry, Final Ian Coley March 5, 204 Problem Spring 20,. Show that if X is a smooth vector field on a (smooth) manifold of dimension n and if X p is nonzero for some point of
More informationChapter 7 Network Flow Problems, I
Chapter 7 Network Flow Problems, I Network flow problems are the most frequently solved linear programming problems. They include as special cases, the assignment, transportation, maximum flow, and shortest
More informationREAL AND COMPLEX ANALYSIS
REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any
More informationLecture: Analysis of Algorithms (CS )
Lecture: Analysis of Algorithms (CS483-001) Amarda Shehu Spring 2017 1 Outline of Today s Class 2 Choosing Hash Functions Universal Universality Theorem Constructing a Set of Universal Hash Functions Perfect
More informationMatrix Completion Problems for Pairs of Related Classes of Matrices
Matrix Completion Problems for Pairs of Related Classes of Matrices Leslie Hogben Department of Mathematics Iowa State University Ames, IA 50011 lhogben@iastate.edu Abstract For a class X of real matrices,
More informationUndirected Graphs. V = { 1, 2, 3, 4, 5, 6, 7, 8 } E = { 1-2, 1-3, 2-3, 2-4, 2-5, 3-5, 3-7, 3-8, 4-5, 5-6 } n = 8 m = 11
Undirected Graphs Undirected graph. G = (V, E) V = nodes. E = edges between pairs of nodes. Captures pairwise relationship between objects. Graph size parameters: n = V, m = E. V = {, 2, 3,,,, 7, 8 } E
More informationk-symmetry Model: A General Framework To Achieve Identity Anonymization In Social Networks
k-symmetry Model: A General Framework To Achieve Identity Anonymization In Social Networks Wentao Wu School of Computer Science and Technology, Fudan University, Shanghai, China 1 Introduction Social networks
More informationOn Asynchronous Node Coloring in the SINR Model
On Asynchronous Node Coloring in the SINR Model Fabian Fuchs Institute of Theoretical Informatics Karlsruhe Institute of Technology Karlsruhe, Germany fabian.fuchs@kit.edu Abstract In this work we extend
More informationChain Independence and Common Information
1 Chain Independence and Common Information Konstantin Makarychev and Yury Makarychev Abstract We present a new proof of a celebrated result of Gács and Körner that the common information is far less than
More informationTOPOLOGICAL ASPECTS OF YAO S ROUGH SET
Chapter 5 TOPOLOGICAL ASPECTS OF YAO S ROUGH SET In this chapter, we introduce the concept of transmissing right neighborhood via transmissing expression of a relation R on domain U, and then we study
More informationMinimum Repair Bandwidth for Exact Regeneration in Distributed Storage
1 Minimum Repair andwidth for Exact Regeneration in Distributed Storage Vivec R Cadambe, Syed A Jafar, Hamed Malei Electrical Engineering and Computer Science University of California Irvine, Irvine, California,
More informationMin/Max-Poly Weighting Schemes and the NL vs UL Problem
Min/Max-Poly Weighting Schemes and the NL vs UL Problem Anant Dhayal Jayalal Sarma Saurabh Sawlani May 3, 2016 Abstract For a graph G(V, E) ( V = n) and a vertex s V, a weighting scheme (w : E N) is called
More informationAcyclic subgraphs with high chromatic number
Acyclic subgraphs with high chromatic number Safwat Nassar Raphael Yuster Abstract For an oriented graph G, let f(g) denote the maximum chromatic number of an acyclic subgraph of G. Let f(n) be the smallest
More informationLaplace s Equation. Chapter Mean Value Formulas
Chapter 1 Laplace s Equation Let be an open set in R n. A function u C 2 () is called harmonic in if it satisfies Laplace s equation n (1.1) u := D ii u = 0 in. i=1 A function u C 2 () is called subharmonic
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
More informationAsymptotic Analysis. Slides by Carl Kingsford. Jan. 27, AD Chapter 2
Asymptotic Analysis Slides by Carl Kingsford Jan. 27, 2014 AD Chapter 2 Independent Set Definition (Independent Set). Given a graph G = (V, E) an independent set is a set S V if no two nodes in S are joined
More informationEfficient communication in an ad-hoc network
Journal of Algorithms 52 (2004) 1 7 www.elsevier.com/locate/jalgor Efficient communication in an ad-hoc network Abraham Flaxman, a,1 Alan Frieze, a,,2 and Eli Upfal b,3 a Department of Mathematical Sciences,
More informationRobust Network Codes for Unicast Connections: A Case Study
Robust Network Codes for Unicast Connections: A Case Study Salim Y. El Rouayheb, Alex Sprintson, and Costas Georghiades Department of Electrical and Computer Engineering Texas A&M University College Station,
More informationSets, Functions and Relations
Chapter 2 Sets, Functions and Relations A set is any collection of distinct objects. Here is some notation for some special sets of numbers: Z denotes the set of integers (whole numbers), that is, Z =
More informationOn Outer Bounds to the Capacity Region of Wireless Networks
On Outer Bounds to the Capacity Region of Wireless Networks Sahand Haji Ali Ahmad Aleksandar Jovičić and Pramod Viswanath August 03 005 Abstract We study the capacity region of a general wireless network
More informationLecture 7: Dynamic Programming I: Optimal BSTs
5-750: Graduate Algorithms February, 06 Lecture 7: Dynamic Programming I: Optimal BSTs Lecturer: David Witmer Scribes: Ellango Jothimurugesan, Ziqiang Feng Overview The basic idea of dynamic programming
More informationLecture 20 : Markov Chains
CSCI 3560 Probability and Computing Instructor: Bogdan Chlebus Lecture 0 : Markov Chains We consider stochastic processes. A process represents a system that evolves through incremental changes called
More informationProgress on High-rate MSR Codes: Enabling Arbitrary Number of Helper Nodes
Progress on High-rate MSR Codes: Enabling Arbitrary Number of Helper Nodes Ankit Singh Rawat CS Department Carnegie Mellon University Pittsburgh, PA 523 Email: asrawat@andrewcmuedu O Ozan Koyluoglu Department
More informationNetwork Coding for Computing
Networ Coding for Computing Rathinaumar Appuswamy, Massimo Franceschetti, Nihil Karamchandani, and Kenneth Zeger Abstract The following networ computation problem is considered A set of source nodes in
More informationE-Companion to The Evolution of Beliefs over Signed Social Networks
OPERATIONS RESEARCH INFORMS E-Companion to The Evolution of Beliefs over Signed Social Networks Guodong Shi Research School of Engineering, CECS, The Australian National University, Canberra ACT 000, Australia
More informationSecure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel
Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Pritam Mukherjee Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 074 pritamm@umd.edu
More informationDesign and Analysis of Algorithms
CSE 101, Winter 2018 Design and Analysis of Algorithms Lecture 4: Divide and Conquer (I) Class URL: http://vlsicad.ucsd.edu/courses/cse101-w18/ Divide and Conquer ( DQ ) First paradigm or framework DQ(S)
More informationNotes 6 : First and second moment methods
Notes 6 : First and second moment methods Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Roc, Sections 2.1-2.3]. Recall: THM 6.1 (Markov s inequality) Let X be a non-negative
More information