Replication schemes for peer‐to‐peer content in wireless mesh networks with infrastructure support. Issue 4 (25th April 2013)

• Record Type: Journal Article
• Authors: Alasaad, Amr; Gopalakrishnan, Sathish; Leung, Victor C.M.
• Is Part Of: Wireless communications and mobile computing. Volume 15:Issue 4(2015)
• Page Start: 699
• Page End: 715
• Publication Date: 2013-04-25
• Subjects: Wireless communication systems -- Periodicals; Mobile communication systems -- Periodicals; 621.38205
• DOI: 10.1002/wcm.2376
• Languages: English
• ISSNs: 1530-8669

Abstract

<abstract abstract-type="main" id="wcm2376-abs-0001"> <title>Abstract</title> <p id="wcm2376-para-0004">Many mobile devices (e.g., smart phones, PDAs, portable computers) and wireless routers (e.g., WiFi access points) nowadays are equipped with <italic>ad hoc</italic> transmission mode. In a dense environment such as a college/office campus, this creates the possibility of forming a wireless mesh network (WMN) in which mobile users communicate with each other through multiple wireless hops. This allows mobile users to exchange (share) files over the free access WMN rather than a carrier frequency such as 3G and WiMax. We consider a peer‐to‐peer (P2P) content sharing setting in a WMN, wherein the mesh network operator over‐provision a number of mesh routers in the network with additional storage capacity and P2P‐aware devices that are programmed to cache and store P2P content. Those mesh routers act as caches and participants in P2P content sharing. The aim of this setting is to both reduce the cost of communications between peers within the WMN (i.e., reduce bandwidth and energy that P2P traffic consumes in the network), and enhance the performance of P2P content sharing (i.e., reduce the average P2P content download delay). Our main contribution in this paper is an optimum P2P content replication strategy at the participating mesh routers. In particular, we determine the optimum number of replicas for every P2P file such that the average access cost of all files in the network is minimized. We propose a centralized algorithm that enables the participating mesh routers to implement the optimal strategy. We further propose a distributed (low cost) algorithm for P2P content replication at the participating mesh routers, and show that the distributed algorithm mimics the optimal strategy very well. The analytical and simulation results show that our replication strategy significantly reduces the average overall cost of accessing P2P files in the WMN as compared with other commonly used replication strategies. Copyright © 2013 John Wiley & Sons, Ltd.</p> </abstract>