PeopleNet
Published 28 August 2005Open access
Mehul Motani, Vikram Srinivasan, Pavan Nuggehalli
Citations291
SJR quartileQ4
SJR score0.11
SNIP0.06
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Overall the results demonstrate that PeopleNet, with its bazaar concept and peer-to-peer query propagation, can provide a simple and efficient mechanism for seeking information.
Abstract
10.1145/1080829.1080855
Keywords
Computer Science
Chord
9,645 Citations2001Ion Stoica, Robert Morris +3 more
Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
IEEE/ACM Transactions on NetworkingMobility increases the capacity of ad hoc wireless networks
2,867 Citations2002Matthias Grossglauser, David Tse
Routing in a delay tolerant network
1,759 Citations2004Sushant Jain, Kevin Fall +1 more
This work forms the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance, and proposes a framework for evaluating routing algorithms in such environments.
Mobile Networks and ApplicationsStimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks
1,057 Citations2003Levente Buttyán, Jean‐Pierre Hubaux
This paper proposes a simple mechanism based on a counter in each node to stimulate the nodes for packet forwarding and studies the behavior of the proposed mechanism analytically and by means of simulations, and detail the way in which it could be protected against misuse.
Improving search in peer-to-peer networks
740 Citations2003Bin‐Miao Yang, Héctor García-Molina
Three techniques for efficient search in P2P systems are presented, and it is shown that while these techniques maintain the same quality of results as currently used techniques, they use up to 5 times fewer resources.
Throughput-delay trade-off in wireless networks
593 Citations2004Abbas El Gamal, J. Mammen +2 more
The focus of this paper is on characterizing the delay and determining the throughput-delay trade-off in such fixed and mobile ad hoc networks, and describing a scheme that achieves the optimal order of delay for any given throughput.
Cooperation in wireless ad hoc networks
586 Citations2003Vikram Srinivasan, Pavan Nuggehalli +2 more
This paper proposes a distributed and scalable acceptance algorithm called generous tit-for-tat (GTFT), which is used by the nodes to decide whether to accept or reject a relay request, and shows that GTFT results in a Nash equilibrium and proves that the system converges to the rational and optimal operating point.
The shared wireless infostation model
532 Citations2003Tara Small, Zygmunt J. Haas
This work derives an analytical formula for the distribution of end-to-end delays and calculates the storage requirements of the Shared Wireless Infostation Model (SWIM), a networking model that allows additional improvement in the capacity-delay tradeoff through a moderate increase in thestorage requirements.
IEEE Transactions on Information TheoryCapacity and Delay Tradeoffs for Ad Hoc Mobile Networks
523 Citations2005Michael J. Neely, Eytan Modiano
Efficient search in peer to peer networks
264 Citations2004Beverly Yang, Héctor García-Molina +1 more
This paper presents three techniques for efficient search in P2P systems, and presents the design of these techniques, and evaluates them using a combination of experiments over Gnutella, the largest open P1P system in operation, and analysis.
Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices
259 Citations2001Maria Papadopouli, Henning Schulzrinne
This paper presents 7DS, a novel peer-to-peer data sharing system enabling the exchange of data among peers that are not necessarily connected to the Internet, and evaluates via extensive simulations the effectiveness of the system for data dissemination among mobile devices.
User mobility for opportunistic ad-hoc networking
144 Citations2004Jing Su, Alvin Chin +3 more
This work evaluates its work by providing empirical data that suggests that it is possible to make intelligent routing decisions based on only pair-wise contact, without previous knowledge of the mobility model or location information.
Intel Press eBooksPeer-to-Peer Computing: Technologies for Sharing and Collaborating on the Net
121 Citations2001D. Barkai
ComputingYet another application of a binomial recurrence order statistics
59 Citations1990Wojciech Szpankowski, V. Rego
The moments of the maximum of a set of i.i.d geometric random variables are investigated and a recursive expression for the moments is shown to be superior.
Asymptotics of query strategies over a sensor network
55 Citations2004Sanjay Shakkottai
This work shows that the appropriate strategy for querying over large sensor networks would be to use multiple queries and advertisements using the "sticky" search strategy, and can match the decay rates of the source and the destination driven search with that of a spatial caching strategy by using an appropriate number of queries.
Purdue e-Pubs (Purdue University)Yet Another Application of a Binomial Recurrence
33 Citations1988Wojciech Szpankowski, Vernon Rego