• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 59,819
Next 10 →

CORE: A Collaborative Reputation mechanism to enforce node cooperation

by Pietro Michiardi, Refik Molva - in Mobile Ad Hoc Networks. Communication and Multimedia Security , 2002
"... hoc Networks. ..."
Abstract - Cited by 509 (11 self) - Add to MetaCart
hoc Networks.

A generalized processor sharing approach to flow control in integrated services networks: The single-node case

by Abhay K. Parekh, Robert G. Gallager - IEEE/ACM TRANSACTIONS ON NETWORKING , 1993
"... The problem of allocating network resources to the users of an integrated services network is investigated in the context of rate-based flow control. The network is assumed to be a virtual circuit, connection-based packet network. We show that the use of Generalized processor Sharing (GPS), when co ..."
Abstract - Cited by 2010 (5 self) - Add to MetaCart
networks with multiple nodes.

The capacity of wireless networks

by Piyush Gupta, P. R. Kumar - IEEE TRANSACTIONS ON INFORMATION THEORY , 2000
"... When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally p ..."
Abstract - Cited by 3243 (42 self) - Add to MetaCart
When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally

Adaptive clustering for mobile wireless networks

by Chunhung Richard Lin, Mario Gerla - IEEE Journal on Selected Areas in Communications , 1997
"... This paper describes a self-organizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically reconfig ..."
Abstract - Cited by 561 (11 self) - Add to MetaCart
This paper describes a self-organizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically

Timing-Sync Protocol for Sensor Networks

by Saurabh Ganeriwal, Ram Kumar, Mani B. Srivastava - The First ACM Conference on Embedded Networked Sensor System (SenSys , 2003
"... Wireless ad-hoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. This is realized by exchanging messages that are ..."
Abstract - Cited by 515 (8 self) - Add to MetaCart
Wireless ad-hoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. This is realized by exchanging messages

Overcast: Reliable Multicasting with an Overlay Network

by John Jannotti, David K. Gifford, Kirk L. Johnson, M. Frans Kaashoek, James W. O'Toole, Jr. , 2000
"... Overcast is an application-level multicasting system that can be incrementally deployed using today's Internet infrastructure. These properties stem from Overcast's implementation as an overlay network. An overlay network consists of a collection of nodes placed at strategic locations in a ..."
Abstract - Cited by 561 (10 self) - Add to MetaCart
Overcast is an application-level multicasting system that can be incrementally deployed using today's Internet infrastructure. These properties stem from Overcast's implementation as an overlay network. An overlay network consists of a collection of nodes placed at strategic locations

Resilient Overlay Networks

by David Andersen, Hari Balakrishnan, Frans Kaashoek, Robert Morris , 2001
"... A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today’s wide-area routing protocols that take at least several minutes to recover. A R ..."
Abstract - Cited by 1160 (31 self) - Add to MetaCart
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today’s wide-area routing protocols that take at least several minutes to recover. A

The link-prediction problem for social networks

by David Liben-nowell, Jon Kleinberg - J. AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY , 2007
"... Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future? We formalize this question as the link-prediction problem, and we develop approaches to link prediction based on measures for analyzing the “proximity” of nodes in a ne ..."
Abstract - Cited by 906 (6 self) - Add to MetaCart
Given a snapshot of a social network, can we infer which new interactions among its members are likely to occur in the near future? We formalize this question as the link-prediction problem, and we develop approaches to link prediction based on measures for analyzing the “proximity” of nodes in a

Mobility increases the capacity of ad-hoc wireless networks

by Matthias Grossglauser, David Tse - IEEE/ACM TRANSACTIONS ON NETWORKING , 2002
"... The capacity of ad-hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad-hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per-session throughpu ..."
Abstract - Cited by 1220 (5 self) - Add to MetaCart
The capacity of ad-hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad-hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per

Directed Diffusion for Wireless Sensor Networking

by Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin, John Heidemann, Fabio Silva - IEEE/ACM Transactions on Networking , 2003
"... Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed diffusion paradigm for such ..."
Abstract - Cited by 675 (9 self) - Add to MetaCart
Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed diffusion paradigm
Next 10 →
Results 1 - 10 of 59,819
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University