Masters Theses
Abstract
"In mobile networks, due to limitation of resources in mobile handheld devices it is important to manage the data content and traffic to improve the network throughput. We are considering a hierarchical peer-to-peer (P2P) network. The efficient distribution of images in wireless networks is based on many parameters like the quality of service, bandwidth available, restricted memory and diverse user profiles. Our objective is to optimize the replication of images in such a network architecture based on the resource limitations of the requesting peers as well as of wireless constraints in Mobile Ad-hoc Network (MANET).
We exploit the fact that digital images can be segregated or combined to form higher or lower resolutions copies. We have implemented two search strategies on our network model. We devised a new formula for efficient replica allocation based upon device constraints which proved to be better then the previously proposed uniform replication schemes without considering optimal replication node"--Abstract, page iv.
Advisor(s)
Madria, Sanjay Kumar
Committee Member(s)
Cheng, Maggie Xiaoyan
Sarangapani, Jagannathan, 1965-
Department(s)
Computer Science
Degree Name
M.S. in Computer Science
Publisher
University of Missouri--Rolla
Publication Date
Spring 2007
Pagination
ix, 42 pages
Note about bibliography
Includes bibliographical references (pages 39-41).
Rights
© 2007 Kumar Abhinay Rathore, All rights reserved.
Document Type
Thesis - Restricted Access
File Type
text
Language
English
Subject Headings
Computer network architecturesMobile communication systemsPeer-to-peer architecture (Computer networks)Wireless communication systems
Thesis Number
T 9131
Print OCLC #
173316089
Recommended Citation
Rathore, Kumar Abhinay, "ADA-REP: Adaptive searching and replication of images in mobile hierarchical peer-to-peer networks" (2007). Masters Theses. 4450.
https://scholarsmine.mst.edu/masters_theses/4450
Share My Thesis If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.