AN INTEREST MANAGEMENT SCHEME FOR MOBILE PEER-TO-PEER SYSTEMS

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 landmarking 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.