QSpace at Queen's University >
Theses, Dissertations & Graduate Projects >
Queen's Theses & Dissertations >
Please use this identifier to cite or link to this item:
|Title: ||A Framework for Peer-to-Peer Computing in Mobile Ad Hoc Networks|
|Authors: ||Mawji, Afzal|
|Keywords: ||peer-to-peer computing|
mobile ad hoc networks
|Issue Date: ||2010|
|Series/Report no.: ||Canadian theses|
|Abstract: ||Peer-to-peer (P2P) applications are enormously popular on the Internet. Their uses vary from file sharing to Voice-over-IP to gaming and more. Increasingly, users are moving toward wireless networked devices and wish to continue using P2P applications in these new environments. A mobile ad hoc network (MANET) is an infrastructureless network which allows users to dynamically form a mobile, wireless network. Though P2P and MANETs share some similarities, such as self-organization, dynamism, and resilience to failure, it is necessary to create new P2P algorithms that take advantage of the realities of MANETs. These algorithms must account for the numerous challenges found in these networks, including node mobility, resource constrained nodes, and the necessity of fully distributed algorithms.
In this thesis, we propose a framework for mobile P2P computing in MANETs (P2P-MANETs). Our proposal includes the following components. First, nodes must be able to locate and join the P2P overlay. We therefore propose a fully distributed bootstrapping algorithm in which nodes multicast join requests and cache responses. Next, the overlay peers must form a topology of connections between themselves. We propose a fully distributed topology control heuristic which supports the dynamic nature of the P2P-MANET. It is important that peers contribute to the network by sharing their resources and forwarding traffic for others. We therefore propose a dynamically priced incentive scheme which rewards users for contributing to the network. We also propose a path selection algorithm to allow peers to select how many parts of a file to download from which servers and which paths to satisfy the user's preference for download time and cost. Finally, we propose a content distribution system that allows users to download large files through the use of network coding and multicasting. Each of these components is the first proposed for its respective place in a P2P-MANET architecture. Simulation results show that each of the proposed components achieves the goals set out for it and outperforms the comparison schemes. The results also show that the overlay topology and path selection heuristics provide good approximations compared to the optimal solutions.|
|Description: ||Thesis (Ph.D, Computing) -- Queen's University, 2010-01-27 12:16:25.352|
|Appears in Collections:||Queen's Theses & Dissertations|
Computing Graduate Theses
Items in QSpace are protected by copyright, with all rights reserved, unless otherwise indicated.