scispace - formally typeset
Search or ask a question
Topic

Communication complexity

About: Communication complexity is a research topic. Over the lifetime, 3870 publications have been published within this topic receiving 105832 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: It is proved that the problem of finding a broadcast tree such that the energy cost of the broadcast tree is minimized, and three heuristic algorithms are proposed, namely, shortest path tree heuristic, greedyHeuristic, and node weighted Steiner tree-based heuristic which are centralized algorithms.
Abstract: In this paper, we discuss energy efficient broadcast in ad hoc wireless networks. The problem of our concern is: given an ad hoc wireless network, find a broadcast tree such that the energy cost of the broadcast tree is minimized. Each node in the network is assumed to have a fixed level of transmission power. We first prove that the problem is NP-hard and propose three heuristic algorithms, namely, shortest path tree heuristic, greedy heuristic, and node weighted Steiner tree-based heuristic, which are centralized algorithms. The approximation ratio of the node weighted Steiner tree-based heuristic is proven to be (1 + 2 ln(n - 1)). Extensive simulations have been conducted and the results have demonstrated the efficiency of the proposed algorithms.

132 citations

Proceedings ArticleDOI
21 Oct 2007
TL;DR: There is an obvious connection between IRSS schemes and the fact that there exist functions with an exponential gap in their communication complexity for k and k-1 rounds, and the scheme implies such a separation which is in several aspects stronger than the previously known ones.
Abstract: We introduce a new primitive called intrusion-resilient secret sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed interactively using low communication complexity in k, but not in k-1 rounds. IRSS is a means of sharing a secret message amongst a set of players which comes with a very strong security guarantee. The shares in an IRSS are made artificially large so that it is hard to retrieve them completely, and the reconstruction procedure is interactive requiring the players to exchange k short messages. The adversaries considered can attack the scheme in rounds, where in each round the adversary chooses some player to corrupt and some function, and retrieves the output of that function applied to the share of the corrupted player. This model captures for example computers connected to a network which can occasionally he infected by malicious software like viruses, which can compute any function on the infected machine, but cannot sent out a huge amount of data. Using methods from the bounded-retrieval model, we construct an IRSS scheme which is secure against any computationally unbounded adversary as long as the total amount of information retrieved by the adversary is somewhat less than the length of the shares, and the adversary makes at most k-1 corruption rounds (as described above, where k rounds are necessary for reconstruction). We extend our basic scheme in several ways in order to allow the shares sent by the dealer to be short (the players then blow them up locally) and to handle even stronger adversaries who can learn some of the shares completely. As mentioned, there is an obvious connection between IRSS schemes and the fact that there exist functions with an exponential gap in their communication complexity for k and k-1 rounds. Our scheme implies such a separation which is in several aspects stronger than the previously known ones.

132 citations

Journal ArticleDOI
TL;DR: In this paper, a cross-layer view for roles of signal processing in random access network and vice versa is presented, and two cases where cross layer design has a quantifiable impact on system performance are discussed.
Abstract: In this paper, a cross-layer view for roles of signal processing in random access network and vice versa is presented. The two cases where cross-layer design has a quantifiable impact on system performance are discussed. The first case is a small network (such as wireless LAN) where a few nodes with bursty arrivals communicate with an access point. The design objective is to achieve the highest throughput among users with variable rate and delay constraints. The impact of PHY layer design on MAC protocol is examined and illustrates a tradeoff between allocating resources to the PHY layer and to MAC layer. The second case, in contrast, deals with large-scale sensor networks where each node carries little information but is severely constrained by its computation and communication complexity and most importantly, battery power. This paper emphasizes that the design of signal processing algorithms must take into account the role of MAC and the nature of random arrivals and bursty transmissions.

131 citations

Proceedings ArticleDOI
19 May 2002
TL;DR: An optimal approximation-space tradeoff of approximating the distance of two vectors is proved using a combination of information theory and Fourier analysis and the lower bound follows from a lower bound on the two-party one-round communication complexity of this problem.
Abstract: (MATH) We consider the problem of approximating the distance of two d-dimensional vectors x and y in the data stream model In this model, the 2d coordinates are presented as a "stream" of data in some arbitrary order, where each data item includes the index and value of some coordinate and a bit that identifies the vector (x or y) to which it belongs The goal is to minimize the amount of memory needed to approximate the distance For the case of Lp-distance with p e [1,2], there are good approximation algorithms that run in polylogarithmic space in d (here we assume that each coordinate is an integer with O(log d) bits) Here we prove that they do not exist for pL∞ distance of two vectors We show that any randomized algorithm that approximates L∞ distance of two length d vectors within factor of dδ requires ω(d1—4δ) space As a consequence we show that for pLp distance of two length d vectors within a factor dδ requires ω(d 1— 2p—4δ) spaceThe lower bound follows from a lower bound on the two-party one-round communication complexity of this problem This lower bound is proved using a combination of information theory and Fourier analysis

131 citations

Proceedings ArticleDOI
01 May 2003
TL;DR: This work uses a robust algorithm to dynamically tune the clustered architecture and demonstrates that reconfiguration provides an effective solution to the communication and parallelism trade-off inherent in the communication-bound processors of the future.
Abstract: Clustered microarchitectures are an attractive alternative to large monolithic superscalar designs due to their potential for higher clock rates in the face of increasingly wire-delay-constrained process technologies. As increasing transistor counts allow an increase in the number of clusters, thereby allowing more aggressive use of instruction-level parallelism (ILP), the inter-cluster communication increases as data values get spread across a wider area. As a result of the emergence of this trade-off between communication and parallelism, a subset of the total on-chip clusters is optimal for performance. To match the hardware to the application's needs, we use a robust algorithm to dynamically tune the clustered architecture. The algorithm, which is based on program metrics gathered at periodic intervals, achieves an 11% performance improvement on average over the best statically defined architecture. We also show that the use of additional hardware and reconfiguration at basic block boundaries can achieve average improvements of 15%. Our results demonstrate that reconfiguration provides an effective solution to the communication and parallelism trade-off inherent in the communication-bound processors of the future.

130 citations


Network Information
Related Topics (5)
Upper and lower bounds
56.9K papers, 1.1M citations
84% related
Encryption
98.3K papers, 1.4M citations
82% related
Network packet
159.7K papers, 2.2M citations
81% related
Server
79.5K papers, 1.4M citations
81% related
Wireless network
122.5K papers, 2.1M citations
80% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202319
202256
2021161
2020165
2019149
2018141