Sciweavers

12301 search results - page 1834 / 2461
» Distributed Computation in Dynamic Networks
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 12 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
MOBIHOC
2000
ACM
15 years 11 months ago
Low power rendezvous in embedded wireless networks
ln the future, wireless networking will be embedded into a wide variety of common, everyday objects [1]. In many embedded networking situations, the communicating nodes will be ver...
Terry Todd, Frazer Bennett, Alan Jones
BROADNETS
2004
IEEE
15 years 10 months ago
Random Asynchronous Wakeup Protocol for Sensor Networks
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...
Vamsi Paruchuri, Shivakumar Basavaraju, Arjan Durr...
NSDI
2007
15 years 9 months ago
An Experimentation Workbench for Replayable Networking Research
The network and distributed systems research communities have an increasing need for “replayable” research, but our current experimentation resources fall short of reaching th...
Eric Eide, Leigh Stoller, Jay Lepreau
BROADNETS
2006
IEEE
15 years 9 months ago
On the Broadcast Storm Problem in Ad hoc Wireless Networks
Routing protocols developed for ad hoc wireless networks use broadcast transmission to either discover a route or disseminate information. More specifically, reactive routing proto...
Ozan K. Tonguz, Nawaporn Wisitpongphan, Jayendra S...
« Prev « First page 1834 / 2461 Last » Next »