INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
— We use a mathematical model based on Brownian motion to analyze the performance of Last Encounter Routing (LER), a routing protocol for ad hoc networks. Our results show that, ...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
– In contrast to a typical single source of data updates in Internet applications, data files in a networked information system are often distributed, replicated, accessed and up...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
Abstract— The inherent spread spectrum nature in ultrawideband (UWB) communications can support simultaneous transmissions. Two nearby transmissions do not collide, but rather ge...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
