Title :
On file sharing over a wireless social network
Author :
Chen, Yi-Ting ; Caramanis, Constantine ; Shakkottai, Sanjay
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA
fDate :
July 31 2011-Aug. 5 2011
Abstract :
We consider the problem of broadcasting a large file over a wireless network (e.g., students in a campus). If each user who wants the file must download it from the carrier´s WAN, dissemination time scales linearly. Two often-occurring facts suggest we can do better: (a) the demand for the file often spreads via a social network (e.g., Facebook); and (b) the devices predominantly used are GPS enabled, and equipped with a peer-to-peer (ad hoc) transmission mode. The premise of this paper is that (a) and (b) are often the case. Starting from here, we consider this coupled-network problem (demand on the social network; bandwidth on the wireless network) and taking advantage of the fact that the two networks have different topologies, we propose a file dissemination algorithm. In our scheme, users query their social network to find geographically nearby friends that have the desired file, and utilize the underlying ad hoc network to route the data via multi-hop transmissions. We show that for many popular models for social networks, the file dissemination time scales sublinearly with the number of users.
Keywords :
ad hoc networks; peer-to-peer computing; social networking (online); wide area networks; GPS enabled; WAN; ad hoc network; coupled-network problem; file dissemination algorithm; file sharing; multihop transmissions; peer-to-peer transmission mode; wireless social network; Ad hoc networks; Peer to peer computing; Routing; Social network services; Transmitters; Wide area networks; Wireless networks;
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2011.6034017