Sciweavers

3116 search results - page 225 / 624
» Design and implementation of network puzzles
Sort
View
WMCSA
2009
IEEE
16 years 1 months ago
A case for application aware channel access in wireless networks
The increasing reliance of users on wireless networks for Internet connectivity has posed two significant challenges for mobile networking research. The first challenge is to pr...
Ashish Sharma, Elizabeth M. Belding
ICDCS
2008
IEEE
16 years 1 months ago
On Cooperative Caching in Wireless P2P Networks
Some recent studies have shown that cooperative cache can improve the system performance in wireless P2P networks such as ad hoc networks and mesh networks. However, all these stu...
Jing Zhao, Ping Zhang, Guohong Cao
SENSYS
2003
ACM
15 years 12 months ago
CODA: congestion detection and avoidance in sensor networks
Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is l...
Chieh-Yih Wan, Shane B. Eisenman, Andrew T. Campbe...
CANPC
2000
Springer
15 years 11 months ago
Transparent Network Connectivity in Dynamic Cluster Environments
Improvements in microprocessor and networking performance have made networks of workstations a very attractive platform for high-end parallel and distributed computing. However, t...
Xiaodong Fu, Hua Wang, Vijay Karamcheti
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong