Distributed algorithms for systems of autonomous mobile robots | p. 1 |
Real-time issues in mobile wireless networks | p. 2 |
A lazy concurrent list-based set algorithm | p. 3 |
Efficiently implementing a large number of LL/SC objects | p. 17 |
Can memory be used adaptively by uniform algorithms? | p. 32 |
Randomized wait-free consensus using an atomicity assumption | p. 47 |
Optimal randomized fair exchange with secret shared coins | p. 61 |
Two abstractions for implementing atomic objects in dynamic systems | p. 73 |
Parsimonious asynchronous Byzantine-fault-tolerant atomic broadcast | p. 88 |
Self-stabilizing population protocols | p. 103 |
A self-stabilizing link-coloring protocol resilient to unbounded Byzantine faults in arbitrary networks | p. 118 |
Timed virtual stationary automata for mobile networks | p. 130 |
Asynchronous and fully self-stabilizing time-adaptive majority consensus | p. 146 |
Stable predicate detection in dynamic systems | p. 161 |
MTcast : robust and efficient P2P-based video delivery for heterogeneous users | p. 176 |
Towards a theory of self-organization | p. 191 |
Node discovery in networks | p. 206 |
Optimal clock synchronization under energy constraints in wireless ad-hoc networks | p. 221 |
Half-space proximal : a new local test for extracting a bounded dilation spanner of a unit disk graph | p. 235 |
A state-based model of sensor protocols | p. 246 |
Approximation bounds for black hole search problems Ralf Klasing Euripides Markou | p. 261 |
Revising UNITY programs : possibilities and limitations | p. 275 |
The partitioned, static-priority scheduling of sporadic real-time tasks with constrained deadlines on multiprocessor platforms | p. 291 |
New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors | p. 306 |
Static-priority scheduling of sporadic messages on a wireless channel | p. 322 |
Implementing reliable distributed real-time systems with the [theta]-model | p. 334 |
Reconfigurable distributed storage for dynamic networks | p. 351 |
Skip B-trees | p. 366 |
Bounding communication cost in dynamic load balancing of distributed hash tables | p. 381 |
On the power of anonymous one-way communication | p. 396 |
Quality-aware resource management for wireless sensor networks | p. 412 |
Topology control with limited geometric information | p. 427 |
Table of Contents provided by Blackwell. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.