Optimizing cell-size in grid-based DDM
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Exploiting Reality with Multicast Groups
IEEE Computer Graphics and Applications
Piazza: data management infrastructure for semantic web applications
WWW '03 Proceedings of the 12th international conference on World Wide Web
A Hybrid Approach to Data Distribution Management
DS-RT '00 Proceedings of the Fourth IEEE International Workshop on Distributed Simulation and Real-Time Applications
A sort-based DDM matching algorithm for HLA
ACM Transactions on Modeling and Computer Simulation (TOMACS)
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
An Efficient Sort-Based DDM Matching Algorithm for HLA Applications with a Large Spatial Environment
Proceedings of the 21st International Workshop on Principles of Advanced and Distributed Simulation
An Approach for Parallel Interest Matching in Distributed Virtual Environments
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
VON: a scalable peer-to-peer network for virtual environments
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Interest management is essential for reducing communication overhead by filtering irrelevant messages in mobile distributed systems. Interest management schemes developed for distributed simulation systems such as those based on HLA can be applied to mobile systems. Sort-based schemes have been proposed and shown to yield good performance. When using sort-based schemes in mobile peer-to-peer systems, questions such as the design of the sorting mechanism and where to perform the sorting process must be addressed. This paper proposes an interest management mechanism for mobile peer-to-peer systems, that divides the entire space into cells and uses a bucket sort to sort the regions in each cell. A mobile land-marking scheme is presented to implement this scheme in mobile peer-to-peer systems. The new mechanism is expected to have better computational efficiency for both static and dynamic matching. Experimental results indicate that this approach yields better performance than several alternate interest management schemes.