The context toolkit: aiding the development of context-enabled applications
Proceedings of the SIGCHI conference on Human Factors in Computing Systems
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
IEEE/ACM Transactions on Networking (TON)
Efficient Minimal Perfect Hashing in Nearly Minimal Space
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
PERCOM '04 Proceedings of the Second IEEE International Conference on Pervasive Computing and Communications (PerCom'04)
The Bloomier filter: an efficient data structure for static support lookup tables
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Context awareness for group interaction support
Proceedings of the second international workshop on Mobility management & wireless access protocols
Informed content delivery across adaptive overlay networks
IEEE/ACM Transactions on Networking (TON)
An optimal Bloom filter replacement
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Improving collection selection with overlap awareness in P2P search engines
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Self-organization in peer-to-peer systems
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Measuring and Analyzing Emerging Properties for Autonomic Collaboration Service Adaptation
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
Bloomier Filters: A Second Look
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
An Optimal Bloom Filter Replacement Based on Matrix Solving
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Analyzing the optimal use of Bloom filters in wireless sensor networks storing replicas
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Supporting generalized context interactions
SEM'04 Proceedings of the 4th international conference on Software Engineering and Middleware
Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement
IEEE Journal on Selected Areas in Communications
MADServer: a server architecture for mobile advanced delivery
Proceedings of the seventh ACM international workshop on Challenged networks
| Hi-index | 0.00 |
Context-awareness in dynamic and unpredictable environments is a well-studied problem, and many approaches handle sensing, understanding, and acting upon context information. Entities in these environments are not in isolation, and oftentimes the manner in which entities coordinate depends on some (implicit) notion of their shared context. In this paper, we are motivated by the need to explicitly construct notions of the context of a group that can support better coordination within the group. First we identify an efficient representation of context (both of an individual and of a group) that can be shared across wireless connections without incurring a significant communication overhead. Second we provide precise semantics for different types of groups, each with compelling use cases in these dynamic computing environments. Finally, we define and demonstrate protocols for efficiently computing groups and their context in a distributed manner.