Sciweavers

2863 search results - page 334 / 573
» Constructing minimum-interference networks
Sort
View
120
Voted
ICC
2009
IEEE
120views Communications» more  ICC 2009»
15 years 10 months ago
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks
— This paper presents a simple method for computing throughputs of links in a CSMA network. We call our method back-of-the-envelop (BoE) computation, because for many network con...
Soung Chang Liew, Caihong Kai, Jason Leung, Bill W...
DIS
2009
Springer
15 years 10 months ago
CHRONICLE: A Two-Stage Density-Based Clustering Algorithm for Dynamic Networks
Abstract. Information networks, such as social networks and that extracted from bibliographic data, are changing dynamically over time. It is crucial to discover time-evolving comm...
Min-Soo Kim 0002, Jiawei Han
INTERSENSE
2006
ACM
15 years 10 months ago
Programming wireless sensor networks with logical neighborhoods
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
Luca Mottola, Gian Pietro Picco
MOBICOM
2003
ACM
15 years 9 months ago
Towards realistic mobility models for mobile ad hoc networks
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin...
140
Voted
USITS
2003
15 years 5 months ago
Using Random Subsets to Build Scalable Network Services
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...