scispace - formally typeset
Topic

Overhead (computing)

About: Overhead (computing) is a(n) research topic. Over the lifetime, 33792 publication(s) have been published within this topic receiving 456227 citation(s).

...read more

Papers
More filters

David B. Johnson1, David A. Maltz1Institutions (1)
01 Jan 1994-
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.

...read more

8,541 citations


Journal ArticleDOI
Marsha Berger1, Phillip Colella2Institutions (2)
TL;DR: An automatic, adaptive mesh refinement strategy for solving hyperbolic conservation laws in two dimensions and how to organize the algorithm to minimize memory and CPU overhead is developed.

...read more

Abstract: The aim of this work is the development of an automatic, adaptive mesh refinement strategy for solving hyperbolic conservation laws in two dimensions. There are two main difficulties in doing this. The first problem is due to the presence of discontinuities in the solution and the effect on them of discontinuities in the mesh. The second problem is how to organize the algorithm to minimize memory and CPU overhead. This is an important consideration and will continue to be important as more sophisticated algorithms that use data structures other than arrays are developed for use on vector and parallel computers.

...read more

2,475 citations


01 Jan 2003-
TL;DR: This paper presents APIT, a novel localization algorithm that is range-free, and shows that the APIT scheme performs best when an irregular radio pattern and random node placement are considered, and low communication overhead is desired.

...read more

Abstract: Sensor Networks have been proposed for a multitude of location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent the use of range-based localization schemes that depend on absolute point- to-point distance estimates. Because coarse accuracy is sufficient for most sensor network applications, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches. In this paper, we present APIT, a novel localization algorithm that is range-free. We show that our APIT scheme performs best when an irregular radio pattern and random node placement are considered, and low communication overhead is desired. We compare our work via extensive simulation, with three state-of-the-art range-free localization schemes to identify the preferable system configurations of each. In addition, we study the effect of location error on routing and tracking performance. We show that routing performance and tracking accuracy are not significantly affected by localization error when the error is less than 0.4 times the communication radio radius.

...read more

2,470 citations


Proceedings ArticleDOI
Tian He1, Chengdu Huang1, Brian M. Blum1, John A. Stankovic1  +1 moreInstitutions (1)
14 Sep 2003-
Abstract: Wireless Sensor Networks have been proposed for a multitude of location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent the use of range-based localization schemes that depend on absolute point-to-point distance estimates. Because coarse accuracy is sufficient for most sensor network applications, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches. In this paper, we present APIT, a novel localization algorithm that is range-free. We show that our APIT scheme performs best when an irregular radio pattern and random node placement are considered, and low communication overhead is desired. We compare our work via extensive simulation, with three state-of-the-art range-free localization schemes to identify the preferable system configurations of each. In addition, we study the effect of location error on routing and tracking performance. We show that routing performance and tracking accuracy are not significantly affected by localization error when the error is less than 0.4 times the communication radio radius.

...read more

2,425 citations


Posted Content
Abstract: We introduce a model for provable data possession (PDP) that allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it. The model generates probabilistic proofs of possession by sampling random sets of blocks from the server, which drastically reduces I/O costs. The client maintains a constant amount of metadata to verify the proof. The challenge/response protocol transmits a small, constant amount of data, which minimizes network communication. Thus, the PDP model for remote data checking supports large data sets in widely-distributed storage systems. We present two provably-secure PDP schemes that are more efficient than previous solutions, even when compared with schemes that achieve weaker guarantees. In particular, the overhead at the server is low (or even constant), as opposed to linear in the size of the data. Experiments using our implementation verify the practicality of PDP and reveal that the performance of PDP is bounded by disk I/O and not by cryptographic computation.

...read more

2,127 citations


Network Information
Related Topics (5)
Anomaly detection

24.2K papers, 407.8K citations

92% related
Scalability

50.9K papers, 931.6K citations

92% related
Speedup

23.6K papers, 390K citations

89% related
Server

79.5K papers, 1.4M citations

89% related
Feature vector

48.8K papers, 954.4K citations

89% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202236
20212,383
20202,321
20192,089
20182,024
20171,768

Top Attributes

Show by:

Topic's top 5 most impactful authors

Hideo Fujiwara

20 papers, 178 citations

Hai Jin

18 papers, 219 citations

Nicolo Michelusi

15 papers, 74 citations

Zhaocheng Wang

15 papers, 505 citations

Jun Zhang

13 papers, 257 citations