Scholars' Mine
Missouri S&T
Research Repository
Curtis Laws Wilson Library
400 W. 14th Street
Rolla, MO 65409-0060
scholarsmine@mst.edu
| Title: | Adaptive searching and replication of images in mobile hierarchical peer-to-peer networks |
| Author (s): | Rathore, Kumar Abhinay Madria, Sanjay Hara, Takahiro |
| Department/Lab Affiliations: | Computer Science |
| Keywords: | Adaptive Mobile peer-to-peer Replication Searching |
| Issue Date: | 2007-12 |
| Publisher: | Elsevier |
| Citation: | Rathore, K.A., Madria, S., and Hara, T., "Adaptive Searching and Replication of Images in Mobile Hierarchical Peer-to-Peer Networks." Data and Knowledge Engineering Journal, vol. 63, no. 3, (2007). |
| Abstract: | Due to the limitation of resources in mobile handheld devices and bandwidth constraints in wireless networks, it is important to efficiently manage image content and traffic to improve network throughput and response time. The efficient distribution of images in wireless networks is based on many parameters like the quality of service requirement, available bandwidth, restricted memory and diverse user profiles. We consider digital images as data objects accessed in a hierarchical mobile ad-hoc peer-to-peer network, referred as M-P2P. Our objective is to optimize the number of replicas of images in such a network architecture based on the resource limitations of the requesting peers equipped with miniature mobile devices as well as of wireless constraints in mobile ad-hoc networks (MANET). While replicating images, fragments of different resolution and their residues are used to optimize the traffic in the network and to decrease the search turnaround time. We call this replication algorithm as Ada-Rep. Performance evaluation is done by simulating Ada-Rep, base replication and uniform replication methods to evaluate parameters such as response time, failure rate, memory usage, traffic etc. Our results prove the efficiency and better performance of Ada-Rep. |
| Type: | Article - Journal text |
| In Title: | Data and Knowledge Engineering Journal |
| Copyright Notice: | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. FULL COPYRIGHT INFORMATION: |
| Publisher URL: | |
| Link to this page: |
| title | Adaptive searching and replication of images in mobile hierarchical peer-to-peer networks |
| contributor.author | Rathore, Kumar Abhinay |
| contributor.author | Madria, Sanjay |
| contributor.author | Hara, Takahiro |
| contributor.deptlab | Computer Science |
| subject | Adaptive |
| subject | Mobile peer-to-peer |
| subject | Replication |
| subject | Searching |
| date.issued | 2007-12 |
| publisher | Elsevier |
| identifier.citation | Rathore, K.A., Madria, S., and Hara, T., "Adaptive Searching and Replication of Images in Mobile Hierarchical Peer-to-Peer Networks." Data and Knowledge Engineering Journal, vol. 63, no. 3, (2007). |
| identifier.pub.URI | |
| description.abstract | Due to the limitation of resources in mobile handheld devices and bandwidth constraints in wireless networks, it is important to efficiently manage image content and traffic to improve network throughput and response time. The efficient distribution of images in wireless networks is based on many parameters like the quality of service requirement, available bandwidth, restricted memory and diverse user profiles. We consider digital images as data objects accessed in a hierarchical mobile ad-hoc peer-to-peer network, referred as M-P2P. Our objective is to optimize the number of replicas of images in such a network architecture based on the resource limitations of the requesting peers equipped with miniature mobile devices as well as of wireless constraints in mobile ad-hoc networks (MANET). While replicating images, fragments of different resolution and their residues are used to optimize the traffic in the network and to decrease the search turnaround time. We call this replication algorithm as Ada-Rep. Performance evaluation is done by simulating Ada-Rep, base replication and uniform replication methods to evaluate parameters such as response time, failure rate, memory usage, traffic etc. Our results prove the efficiency and better performance of Ada-Rep. |
| type | Article - Journal |
| type.DCMIType | text |
| type.status | Final version |
| rights | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. |
| rights.URI | |
| relation.isPartOf | Data and Knowledge Engineering Journal |
| date.accessioned | 2007-04-11T17:00:48Z |
| date.available | 2008-04-30T18:36:15Z |
| identifier.persist.URI |