An efficient way to track peers in mobile P2P network

  • Authors:

  • Saumay Pushp;Tae Hun Cho;Jongwon Han;Dongman Lee;Junehwa Song;Sunghee Choi

  • Affiliations:

  • Korea Advanced Institute of Science and Technology, Daejeon, South Korea;Korea Advanced Institute of Science and Technology, Daejeon, South Korea;Korea Advanced Institute of Science and Technology, Daejeon, South Korea;Korea Advanced Institute of Science and Technology, Daejeon, South Korea;Korea Advanced Institute of Science and Technology, Daejeon, South Korea;Korea Advanced Institute of Science and Technology, Daejeon, South Korea

  • Venue:
  • Proceedings of the 18th annual international conference on Mobile computing and networking
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a new class of message routing scheme for a distributed network which can scale up to the needs of a very large number of mobile users. We leverage the work in the GeoKad paper which uses the Distributed Geographic Table, allowing node retrieval from resources that are close to any given region. The paper addresses the problem regarding efficient message passing and peer misses. We propose a new routing scheme that addresses this kind of limitation. In fact, the problem can be solved in two ways, either by preserving the state of peer and further use a prediction algorithm or by better message routing. The proposed scheme is based on swarm intelligence (SI) and its attribute of exploit and explore. We leverage the statistical properties of time-varying network connectivity for opportunistic message forwarding. Considering the present 3G or Wi-Fi environment this approach can also help in optimizing energy as it can prevent query over flooding which is mostly encountered in such network scenarios.