Sciweavers

3247 search results - page 381 / 650
» Randomized smoothing networks
Sort
View
NCA
2006
IEEE
16 years 20 days ago
JetStream: Achieving Predictable Gossip Dissemination by Leveraging Social Network Principles
Gossip protocols provide probabilistic reliability and scalability, but their inherent randomness may lead to high variation in number of messages that are received at different n...
Jay A. Patel, Indranil Gupta, Noshir S. Contractor
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
16 years 18 days ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
ICDCIT
2005
Springer
16 years 5 days ago
Self-stabilizing Deterministic TDMA for Sensor Networks
An algorithm for time division multiple access (TDMA) is desirable in sensor networks for energy management, as it allows a sensor to reduce the amount of idle listening. Also, TD...
Mahesh Arumugam, Sandeep S. Kulkarni
IWDC
2005
Springer
210views Communications» more  IWDC 2005»
16 years 4 days ago
Mobile Agent Based Message Communication in Large Ad Hoc Networks Through Co-operative Routing Using Inter-agent Negotiation at
:- The wide availability of mobile devices equipped with wireless communication capabilities together with the technical possibility to form ad hoc networks paves the way for build...
Parama Bhaumik, Somprakash Bandyopadhyay
ARCS
2004
Springer
16 years 1 days ago
Latent Semantic Indexing in Peer-to-Peer Networks
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...
Xuezheng Liu, Ming Chen, Guangwen Yang