Abstract
Pervasive computing systems require large amounts of information to be available to devices in order to support context-aware applications. Information must be routed from the sensors that provide it to the applications that consume it in a timely fashion. However, the potential size and ad hoc nature of these environments makes the management of communications a non-trivial task. One proposed solution to this problem uses gossiping, a class of probabilistic routing protocol, to disseminate context information throughout the environment. Gossiping algorithms require far less in the way of guarantees about network structure, reliability, and latency than alternative approaches, but are unproven in real world scenarios. We describe the on-going development of a framework for evaluating the performance of these algorithms within the context of pervasive environments.
Original language | English |
---|---|
Title of host publication | Unknown Host Publication |
Publisher | Association for Computing Machinery |
Pages | 7-12 |
Number of pages | 6 |
ISBN (Print) | 1595934219 |
DOIs | |
Publication status | Published (in print/issue) - 2006 |
Event | Proceedings of the 4th International workshop on Middleware for Pervasive and Ad-Hoc Computing (MPAC 06) - Melbourne, Australia Duration: 1 Jan 2006 → … |
Workshop
Workshop | Proceedings of the 4th International workshop on Middleware for Pervasive and Ad-Hoc Computing (MPAC 06) |
---|---|
Period | 1/01/06 → … |
Keywords
- n/a