Fast track article: Peer-to-peer overlay topology control for mobile ad hoc networks

Authors:
Afzal Mawji;Hossam Hassanein;Xiangyang Zhang
Affiliations:
Telecommunications Research Lab, School of Computing, Queen's University, Kingston, Ontario, Canada, K7L 3N6;Telecommunications Research Lab, School of Computing, Queen's University, Kingston, Ontario, Canada, K7L 3N6 and Department of Computer Science, King Saud University, Saudi Arabia;Telecommunications Research Lab, School of Computing, Queen's University, Kingston, Ontario, Canada, K7L 3N6
Venue:
Pervasive and Mobile Computing
Year:
2011

Citing 6
Cited 1

An energy consumption model for performance analysis of routing protocols for mobile ad hoc networks

Mobile Networks and Applications
On a network creation game

Proceedings of the twenty-second annual symposium on Principles of distributed computing
A survey of peer-to-peer content distribution technologies

ACM Computing Surveys (CSUR)
On the topologies formed by selfish peers

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A Two-Hop Solution to Solving Topology Mismatch

IEEE Transactions on Parallel and Distributed Systems
Enhancing peer-to-peer content discovery techniques over mobile ad hoc networks

Computer Communications

Ego network models for Future Internet social networking environments

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The enormous popularity of peer-to-peer (P2P) applications and the increased use of mobile devices make running P2P applications on mobile ad hoc networks (MANETs) natural. However, simply applying existing P2P overlay techniques, which are designed for wired networks, to MANETs is undesirable due to the differences between the two types of networks. In P2P systems, peers are often selfish rather than cooperative (which is expected of MANET nodes). In this paper, we study the construction of P2P overlays by selfish peers in the context of MANETs, and propose a computationally feasible game-theoretic heuristic algorithm. In our P2P-MANET creation game, peers seek to maintain as few neighbors as possible while minimizing their distances to all destinations, in an effort to reduce energy consumption and to improve response time. We find that Nash equilibria are difficult to find at best, and may not even exist in most cases. Our heuristic is fairly stable relative to the minimum cost algorithm, and when the degree-constraint is relaxed, it approximates the minimum cost. The lack of global knowledge of the overlay and underlying network at individual peers does not allow each peer to fully exploit such information for its own best interest, and actually may reduce the total cost network-wide.