Research On Mobile P2P Data Dissemination Techniques

Recently, mobile P2P dissemination techniques apply P2P model to mobile networks, for the purpose of improving the performance of system in terms of reliability, transmission speed, and scalability through cooperation between the nodes. It has become an important research area in wireless networks. Nevertheless, due to the intrinsic limitations of mobile networks, including topology stability, interference, and device capability, there are still many problems in current research in this area when it is applied to practical scenarios.This paper summarizes and analyzes Gossip algorithms, and then it presents a dominating-set-based gossip protocol for mobile ad hoc networks. It is the first multicast protocol for mobile ad hoc networks, which utilizes the concept of dominating-set. The protocol doesn't need any routing support and needs not maintaining membership, resulting in the decrease of overhead to maintain routing table and member list. In order to apply the concept of dominating-set to gossip algorithm, this protocol introduces join-session and connect-session to dynamically construct and reconnect dominating-set. Moreover, by introducing the concept of serving-time, the optimization process only includes gateways, resulting in the decrease of computation complexity. Simulation results indicate it can achieve better performance in terms of reliability, transmission delay, and scalability.Then, this paper summarizes and analyzes mobility-assisted dissemination techniques and then presents a peer-to-peer file-sharing protocol for mobile ad hoc networks based on dynamic-clusters. In a cluster, a node named provider disseminates data packets to other nodes in the same cluster and is prompted to continue its dissemination by a node named request-agent in the same cluster. With data packets and requests localized within a cluster, it can greatly improve the power-efficiency of the system. This protocol consists of two stages, namely the cluster-construction stage and the data-chunk-dissemination stage. In the first stage, a cluster is dynamically constructed through request-contention process, request-contention process, and cluster-formation process. Meanwhile, in order to reduce the amount of request, it employs such techniques as request-suppression techniques and request-interval. Simulation results indicate that the protocol can achieve good performance in terms of power-efficiency and scalability.Finally, it presents some of the promising areas in future.