Sciweavers

2149 search results - page 209 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
15 years 1 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
JPDC
2007
191views more  JPDC 2007»
15 years 1 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
GLOBECOM
2008
IEEE
15 years 8 months ago
Congestion Avoidance and Fairness in Wireless Sensor Networks
—Designing a sensor network congestion avoidance algorithm is a challenging task due to the application specific nature of these networks. The frequency of event sensing is a de...
Mohammad Z. Ahmad, Damla Turgut
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
15 years 1 months ago
Noncooperative power control and transmission scheduling in wireless collision channels
We consider a wireless collision channel, shared by a finite number of mobile users who transmit to a common base station using a random access protocol. Mobiles are selfoptimizin...
Ishai Menache, Nahum Shimkin
INTERNET
2006
157views more  INTERNET 2006»
15 years 1 months ago
Distributed Data Mining in Peer-to-Peer Networks
Distributed data mining deals with the problem of data analysis in environments with distributed data, computing nodes, and users. Peer-to-peer computing is emerging as a new dist...
Souptik Datta, Kanishka Bhaduri, Chris Giannella, ...