Resource discovery is one of the key issues in mobile P2P studies. Nonetheless, in existing schemes thereare still some deficiencies, such as the lake of flexibility, proportionality and adaptability. In this paper, we present a resource discovery model Mobile-Tapestry (M-Tapestry) for mobile P2P networks based on the P2P Tapestry strategy. The philosophy of this model is to make the network architecture layered, and only a small number of super nodes are chosen instead of all nodes to access the Tapestry system. This measure may reduce the cost of ordinary nodes and solve the reliability problems caused, when the routing table is updated frequently. Additionally, we partition the nodes according to their geographical location, this may avoid the problem that the distance between the nodes having adjacent IDs is actually large due to the Hash operation. Finally, our simulation results and analysis shows that the M-Tapestry strategy has an improved lookup efficiency for mobile P2P networks compared to the Tapestry strategy.
展开▼
