6480 search results - page 1133 / 1296 » Proximity Communication and Time |
193
Voted
PEWASUN
2006
ACM
16 years 1 months ago
2006
ACM
Many previous papers have pointed out that TCP performance in multi-hop ad hoc networks is not optimal. This is due to several TCP design principles that reflect the characteristi...
208
Voted
PODC
2006
ACM
16 years 1 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
261
Voted
SASN
2006
ACM
16 years 1 months ago
2006
ACM
A great challenge in securing sensor networks is that sensor nodes can be physically compromised. Once a node is compromised, attackers can retrieve secret information (e.g. keys)...
194
Voted
SENSYS
2006
ACM
16 years 1 months ago
2006
ACM
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
233
Voted
SIGCOMM
2006
ACM
16 years 1 months ago
2006
ACM
The success of Skype has inspired a generation of peer-topeer-based solutions for satisfactory real-time multimedia services over the Internet. However, fundamental questions, suc...