4781 search results - page 529 / 957 » Online algorithms for network design |
185
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
226
click to vote
ICPADS
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract— Content replication and distribution is an effective technology to reduce the response time for web accesses and has been proven quite popular among large Internet cont...
198
click to vote
MOBIHOC
2005
ACM
16 years 6 months ago
2005
ACM
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...
217
click to vote
CCR
2002
15 years 6 months ago
2002
Most network protocols are uni-modal: they employ a single set of algorithms that allows them to cope well only within a narrow range of operating conditions. This rigid design re...
184
click to vote
DCOSS
2011
Springer
14 years 6 months ago
2011
Springer
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...