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. / Thesis (Ph.D, Computing) -- Queen's University, 2010-01-27 12:16:25.352

With the rapid development of the Internet connected technologies and applications, people are keen on embracing the convenience and practi-­‐‑ calities they brings. As all kinds of technologies improve, the Internet of Things matures and is able to provide more advanced services to people, which connects a variety of devices, systems and applications beyond traditional machine-­‐‑to-­‐‑machine. However, it covers a variety of devices, protocols and applications, which makes it much more complex than a normal network. Nevertheless, equipped with appropriate security solutions, the Internet of Things is promising to bring us more conven-­‐‑ iences and be widely applied in our daily life. And like the main appli-­‐‑ cation areas, wireless sensor networks with a frequent but short com-­‐‑ munication character, it requires an efficient and flexible protocol to protect the information. To protect the traffic of the Internet of Things is the focal point of this research work. Although many protocols for the Internet have been put forward, it is still not enough to meet the increas-­‐‑ ingly complex requirements from applications. Many of them are not efficient enough to adapt the device diversity and timely communica-­‐‑ tion environment. This research work is trying to address this problem, by proposing a peer-­‐‑to-­‐‑peer security protocol to satisfy this varied environment. Secure communication is implemented on an open sourced platform for the Internet of Things. The philosophy of the platform it implemented on is also inherited to this protocol and the implementation. It avoids unnecessary handshakes between entities, which makes it more efficient in a wireless sensor network. Modulariza-­‐‑ tion and unit test are adapted in implementation to enhance the robust of the system. Its dynamic security level adjustment feature satisfies the realistic demand on one platform this protocol is implemented on. Finally, with a comparison test and an analysis using the BAN logic, the result shows that the proposed protocol is efficient to meet the specific goals and applicable for the platform. / SensibleThings Platform

Peer-to-peer streaming has emerged as a killer application in today's Internet, delivering a large variety of live multimedia content to millions of users at any given time with low server cost. Though successfully deployed, the efficiency and optimality of the current peer-to-peer streaming protocols are still less than satisfactory. In this thesis, we investigate optimizing solutions to enhance the performance of the state-of-the-art mesh-based peer-to-peer streaming systems, utilizing both theoretical performance modeling and extensive real-world measurements. First, we model peer-to-peer streaming applications in both the single-overlay and multi-overlay scenarios, based on the solid foundation of optimization and game theories. Using these models, we design efficient and fully decentralized solutions to achieve performance optimization in peer-to-peer streaming. Then, based on a large volume of live measurements from a commercial large-scale peer-to-peer streaming application, we extensively study the real-world performance of peer-to-peer streaming over a long period of time. Highlights of our measurement study include the topological characterization of large-scale streaming meshes, the statistical characterization of inter-peer bandwidth availability, and the investigation of server capacity utilization in peer-to-peer streaming. Utilizing in-depth insights from our measurements, we design practical algorithms that advance the performance of key protocols in peer-to-peer live streaming. We show that our optimizing solutions fulfill their design objectives in various realistic scenarios, using extensive simulations and experiments.

A fundamental problem in building large scale Grid resource sharing system is the need for efficient and scalable techniques for discovery and provisioning of resources for delivering expected Quality of Service (QoS) to users’ applications. The current approaches to Grid resource sharing based on resource brokers are non-coordinated since these brokers make scheduling related decisions independent of the others in the system. Clearly, this worsens the load-sharing and utilisation problems of distributed Grid resources as sub-optimal schedules are likely to occur. Further, existing brokering systems rely on centralised information services for resource discovery. Centralised or hierarchical resource discovery systems are prone to single-point failure, lack scalability and fault-tolerance ability. In the centralised model, the network links leading to the server are very critical to the overall functionality of the system, as their failure might halt the entire distributed system operation.

Zugl.: Hannover, Univ., Diss., 2007

Techn. University, Diss., 2007--Darmstadt.

Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2008. / Vita. Includes bibliographical references (leaves 113-120). Also available in electronic version.

Thesis (M. Phil.)--University of Hong Kong, 2008. / Includes bibliographical references (leaf 70-72) Also available in print.

Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2008. / Includes bibliographical references (leaves 91-96). Also available in electronic version.

Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2008. / Includes bibliographical references (leaves 70-75). Also available in electronic version.