Tuple Searching in a Mobile P2P environment that exhibits Small World Properties

Abstract

This study shows the effect of small world properties in a mobile P2P environment in multiple tuple searching and writing. Many works of literature have found using structured P2P, but not many on mobile P2P. There is some literature found on P2P networks with small world properties, but they have not used the small world properties efficiently for the searching/sharing mechanism. We have explained a theoretical framework for searching mechanism in a clustering environment involve two step protocol, searching inner cluster and outer cluster. We have evaluated the small world property with Small World in Motion(SWIM) model and Random way point model and two routing strategies, flooding and Cluster Based Routing Protocol(CBRP) like. Flooding is the basic network routing strategy where every node will broadcast a message packet if it is not the destination, hence increase the number of messages generated in the network. But flooding always guarantees the delivery of a packet to its destination. There are many routing protocols, like Adhoc on-demand Distance Vector(AODV), Destination Sequenced Distance Vector (DSDV) which has been implemented for wireless networks which can reduce the unnecessary broadcast of flooding. But when the network exhibits Small World properties, DSDV nor AODV use the small world property for efficient routing. CBRP protocol somewhat uses the small world property in routing and we are trying to maximize the usage of small world property in routing strategies. Results show that CBRP-like strategy works well than flooding in average time delay, average path length and number of messages per query but flooding work better in successful ratio.