Results 1 - 10 of 15,007

Capacity of Ad Hoc Wireless Networks

by Jinyang Li, Charles Blake, Douglas S. J. De Couto, Hu Imm Lee, Robert Morris
"... Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others’ packets. The achievable capacity depends on network size, traffic patterns, and detailed local radio interactions. This paper examine ..."
Abstract - Cited by 636 (14 self) - Add to MetaCart
small as the network grows. Non-local traffic patterns in which this average distance grows with the network size result in a rapid decrease of per node capacity. Thus the question “Are large ad hoc networks feasible?” reduces to a question about the likely locality of communication in such networks.

Range-Free Localization Schemes for Large Scale Sensor Networks

by Tian He, Chengdu Huang, Brain M. Blum, John A. Stankovic, Tarek Abdelzaher , 2003
"... Wireless Sensor Networks have been proposed for a multitude of location-dependent applications. For such systems, the cost and limitations of hardware on sensing nodes prevent the use of range-based localization schemes that depend on absolute point-to-point distance estimates. Because coarse accura ..."
Abstract - Cited by 525 (8 self) - Add to MetaCart
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

Design of capacity-approaching irregular low-density parity-check codes

by Thomas J. Richardson, M. Amin Shokrollahi, Rüdiger L. Urbanke - IEEE TRANS. INFORM. THEORY , 2001
"... We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming that the unde ..."
Abstract - Cited by 588 (6 self) - Add to MetaCart
We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks”, in Ad Hoc Networking, edited by Charles E.

by David B Johnson , David A Maltz , Josh Broch - Perkins, Chapter , 2001
"... Abstract The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network ..."
Abstract - Cited by 764 (8 self) - Add to MetaCart
-demand, allowing the routing packet overhead of DSR to scale automatically to only that needed to react to changes in the routes currently in use. We have evaluated the operation of DSR through detailed simulation on a variety of movement and communication patterns, and through implementation and significant

The faculty of language: what is it, who has it, and how did it evolve?

by Marc D Hauser , Noam Chomsky , W Tecumseh Fitch - Science, , 2002
"... We argue that an understanding of the faculty of language requires substantial interdisciplinary cooperation. We suggest how current developments in linguistics can be profitably wedded to work in evolutionary biology, anthropology, psychology, and neuroscience. We submit that a distinction should ..."
Abstract - Cited by 472 (7 self) - Add to MetaCart
, after they proved to have utility in communication, were altered because of constraints imposed at both the periphery (e.g., what we can hear and say or see and sign, the rapidity with which the auditory cortex can process rapid temporal and spec-

PCA versus LDA

by Aleix M. Martinez, Avinash C. Kak - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 2001
"... In the context of the appearance-based paradigm for object recognition, it is generally believed that algorithms based on LDA (Linear Discriminant Analysis) are superior to those based on PCA (Principal Components Analysis) . In this communication we show that this is not always the case. We present ..."
Abstract - Cited by 472 (16 self) - Add to MetaCart
In the context of the appearance-based paradigm for object recognition, it is generally believed that algorithms based on LDA (Linear Discriminant Analysis) are superior to those based on PCA (Principal Components Analysis) . In this communication we show that this is not always the case. We

Interaction and Outeraction: Instant Messaging in Action

by Bonnie A. Nardi, Steve Whittaker , 2000
"... We discuss findings from an ethnographic study of instant messaging (IM) in the workplace and its implications for media theory. We describe how instant messaging supports a variety of informal communication tasks. We document the affordances of IM that support flexible, expressive communication. We ..."
Abstract - Cited by 414 (12 self) - Add to MetaCart
;outeraction." We discuss how outeractional aspects of communication affect media choice and patterns of media use. Keywords Instant messaging, media theory, informal communication, computer-mediated communication, outeraction. INTRODUCTION Recent empirical work has shown the importance of informal workplace

An Introduction to Software Agents

by Jeffrey M. Bradshaw , 1997
"... ion and delegation: Agents can be made extensible and composable in ways that common iconic interface objects cannot. Because we can "communicate" with them, they can share our goals, rather than simply process our commands. They can show us how to do things and tell us what went wrong (Mi ..."
Abstract - Cited by 361 (9 self) - Add to MetaCart
ion and delegation: Agents can be made extensible and composable in ways that common iconic interface objects cannot. Because we can "communicate" with them, they can share our goals, rather than simply process our commands. They can show us how to do things and tell us what went wrong

Autograph: Toward automated, distributed worm signature detection

by Hyang-ah Kim - In Proceedings of the 13th Usenix Security Symposium , 2004
"... Today’s Internet intrusion detection systems (IDSes) monitor edge networks ’ DMZs to identify and/or filter malicious flows. While an IDS helps protect the hosts on its local edge network from compromise and denial of service, it cannot alone effectively intervene to halt and reverse the spreading o ..."
Abstract - Cited by 362 (3 self) - Add to MetaCart
of novel Internet worms. Generation of the worm signatures required by an IDS—the byte patterns sought in monitored traffic to identify worms—today entails non-trivial human labor, and thus significant delay: as network operators detect anomalous behavior, they communicate with one another and manually

pathChirp: Efficient Available Bandwidth Estimation for Network Paths

by Vinay J. Ribeiro, Rudolf H. Riedi, Richard G. Baraniuk, Jiri Navratil, Les Cottrell - In Passive and Active Measurement Workshop , 2003
"... This paper presents pathChirp, a new active probing tool for estimating the available bandwidth on a communication network path. Based on the concept of "self-induced congestion," pathChirp features an exponential flight pattern of probes we call a chirp. Packet chips offer several signifi ..."
Abstract - Cited by 317 (4 self) - Add to MetaCart
This paper presents pathChirp, a new active probing tool for estimating the available bandwidth on a communication network path. Based on the concept of "self-induced congestion," pathChirp features an exponential flight pattern of probes we call a chirp. Packet chips offer several
Results 1 - 10 of 15,007