Results 1 - 10
of
78
A.: Cellular Traffic Offloading through Opportunistic Communications : A Case Study. System
- DOI 10.1145/1859934.1859943. URL http://dl.acm.org/citation.cfm?id=1859943
, 2010
"... Due to the increasing popularity of various applications for smartphones, 3G networks are currently overloaded by mobile data traffic. Offloading cellular traffic through opportunistic communications is a promising solution to partially solve this problem, because there is no monetary cost for it. A ..."
Abstract
-
Cited by 46 (3 self)
- Add to MetaCart
(Show Context)
Due to the increasing popularity of various applications for smartphones, 3G networks are currently overloaded by mobile data traffic. Offloading cellular traffic through opportunistic communications is a promising solution to partially solve this problem, because there is no monetary cost for it. As a case study, we investigate the target-set selection problem for information delivery in the emerging Mobile Social Networks (MoSoNets). We propose to exploit opportunistic communications to facilitate the information dissemination and thus reduce the amount of cellular traffic. In particular, we study how to select the target set with only k users, such that we can minimize the cellular data traffic. In this scenario, initially the content service providers deliver information over cellular networks to only users in the
Mobile Data Offloading through Opportunistic Communications and Social Participation 1
"... 3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communications is a promising solution to partially solve this problem, because there is almost no monetary cost for it. We propose to ..."
Abstract
-
Cited by 41 (4 self)
- Add to MetaCart
(Show Context)
3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communications is a promising solution to partially solve this problem, because there is almost no monetary cost for it. We propose to exploit opportunistic communications to facilitate information dissemination in the emerging Mobile Social Networks (MoSoNets) and thus reduce the amount of mobile data traffic. As a case study, we investigate the target-set selection problem for information delivery. In particular, we study how to select the target set with only k users, such that we can minimize the mobile data traffic over cellular networks. We propose three algorithms, called Greedy, Heuristic, and Random, for this problem and evaluate their performance through an extensive trace-driven simulation study. Our simulation results verify the efficiency of these algorithms for both synthetic and real-world mobility traces. For example, the Heuristic algorithm can offload mobile data traffic by up to 73.66 % for a real-world mobility trace. Moreover, to investigate the feasibility of opportunistic communications for mobile phones, we implement a proof-of-concept prototype, called Opp-Off, on Nokia N900 smartphones, which utilizes their Bluetooth interface for device/service discovery and content transfer. Index Terms Mobile data offloading, target-set selection, opportunistic communications, mobile social networks, implementation, trace-driven simulation. 2 I.
User-Centric Data Dissemination in Disruption Tolerant Networks
"... Abstract—Data dissemination is useful for many applications ..."
Abstract
-
Cited by 41 (14 self)
- Add to MetaCart
Abstract—Data dissemination is useful for many applications
Incentivizing Peer-Assisted Services: A Fluid Shapley Value
- ISP sim(Tup, Pup) sim(Tdown, Pdown) HEANET 0.988 0.965 SANET 0.996 0.991
"... A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating cost. In contrast with previous uncoordinated peer-to-peer schemes, users opt-in to dedicate part of the resources they own ..."
Abstract
-
Cited by 35 (3 self)
- Add to MetaCart
(Show Context)
A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating cost. In contrast with previous uncoordinated peer-to-peer schemes, users opt-in to dedicate part of the resources they own to help the content delivery, in exchange for receiving the same service at a reduced price. Such incentive mechanisms are appealing, as they simplify coordination and accounting. However, they also increase a user’s expectation that she will receive a fair price for the resources she provides. Addressing this issue carefully is critical in ensuring that all interested parties—including the provider—are willing to participate in such a system, thereby guaranteeing its stability. In this paper, we take a cooperative game theory approach to identify the ideal incentive structure that follows the axioms formulated by Lloyd Shapley. This ensures that each player, be it the provider or a peer, receives an amount proportional to its contribution and bargaining power when entering the game. In general, the drawback of this ideal incentive structure is its computational complexity. However, we prove that as the number of peers receiving the service becomes large, the Shapley value received by each player approaches a fluid limit. This limit follows a simple closed form expression and can be computed in several scenarios of interest: by applying our technique, we show that several peer-assisted services, deployed on both wired and wireless networks, can benefit from important cost and energy savings with a proper incentive structure that follows simple compensation rules. This work was performed while the author was visiting
Cooperative video streaming on smartphones
- In Proceedings of the 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton
, 2011
"... Video streaming is one of the increasingly popular, as well as demanding, applications on smartphones today. In this paper, we consider a group of smartphone users, within proximity of each other, who are interested in watching the same video from the Internet at the same time. The common practice t ..."
Abstract
-
Cited by 24 (5 self)
- Add to MetaCart
(Show Context)
Video streaming is one of the increasingly popular, as well as demanding, applications on smartphones today. In this paper, we consider a group of smartphone users, within proximity of each other, who are interested in watching the same video from the Internet at the same time. The common practice today is that each user downloads the video independently using her own cellular connection, which often leads to poor quality. We design, implement, and evaluate a novel system, MicroCast, that uses the resources on all smartphones of the group in a cooperative way so as to improve the streaming experience. Each phone uses simultaneously two network interfaces: the cellular to connect to the video server and the WiFi to connect to the rest of the group. Key ingredients of our design include the following. First, we propose a scheduling algorithm, MicroDownload, that decides which parts of the video each phone should download from the server, based on the phones ’ download rate. Second, we propose a novel all-to-all local dissemination scheme, MicroNC-P2, for sharing content among group members, which outperforms state-of-the-art peer-to-peer schemes in our setting. MicroNC-P2 is designed to exploit WiFi overhearing and network coding, based on a local packet broadcast framework, MicroBroadcast, which we developed specifically for Android phones. We evaluate MicroCast on a testbed consisting of seven Android phones, and we show that it brings significant performance benefits without battery penalty.
Multiple Mobile Data Offloading Through Delay Tolerant Networks
- 6th ACM International Workshop on Challenged Networks (CHANTS 2011), Las Vegas
, 2011
"... To cope with the explosive traffic demands and limited capacity provided by the current cellular networks, Delay Tolerant Networking (DTN) is used to migrate traffic from the cellular networks to the free and high capacity device-todevice networks. The current DTN-based mobile data offloading models ..."
Abstract
-
Cited by 19 (2 self)
- Add to MetaCart
(Show Context)
To cope with the explosive traffic demands and limited capacity provided by the current cellular networks, Delay Tolerant Networking (DTN) is used to migrate traffic from the cellular networks to the free and high capacity device-todevice networks. The current DTN-based mobile data offloading models do not address the heterogeneity of mobile traffic and are based on simple network assumptions. In this paper, we establish a mathematical framework to study the problem of multiple mobile data offloading under realistic network assumptions, where 1) mobile data is heterogeneous in terms of size and lifetime, 2) mobile users have different data subscribing interests, and 3) the storage of offloading helpers is limited. We formulate the maximum mobile data offloading as a Submodular Function Maximization problem with multiple linear constraints of limited storage and propose greedy, approximated and optimal algorithms for different offloading scenarios. We show that our algorithms can effectively offload data to DTNs by extensive simulations which employ real traces of both humans and vehicles.
Relieving the wireless infrastructure: When opportunistic networks meet guaranteed delays
- in Proc. IEEE WoWMoM
, 2011
"... Abstract—Major wireless operators are nowadays facing net-work capacity issues in striving to meet the growing demands of mobile users. At the same time, 3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g., Wi-Fi). In this context of hybrid connectivity, we propose Push-and- ..."
Abstract
-
Cited by 19 (2 self)
- Add to MetaCart
(Show Context)
Abstract—Major wireless operators are nowadays facing net-work capacity issues in striving to meet the growing demands of mobile users. At the same time, 3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g., Wi-Fi). In this context of hybrid connectivity, we propose Push-and-track, a content dissemination framework that harnesses ad hoc communication opportunities to minimize the load on the wireless infrastructure while guaranteeing tight delivery delays. It achieves this through a control loop that collects user-sent acknowledgements to deter-mine if new copies need to be reinjected into the network through the 3G interface. Push-and-Track includes multiple strategies to determine how many copies of the content should be injected, when, and to whom. The short delay-tolerance of common content, such as news or road traffic updates, make them suitable for such a system. Based on a realistic large-scale vehicular dataset from the city of Bologna composed of more than 10,000 vehicles, we demonstrate that Push-and-Track consistently meets its delivery objectives while reducing the use of the 3G network by over 90%. I.
Distributed caching over heterogeneous mobile networks
- In Proceedings of the ACM SIGMETRICS
, 2010
"... Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a local cache and share it with other users they meet, e.g., via Bluetooth or WiFi. The storage capacity of mobile devices is ..."
Abstract
-
Cited by 17 (1 self)
- Add to MetaCart
(Show Context)
Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a local cache and share it with other users they meet, e.g., via Bluetooth or WiFi. The storage capacity of mobile devices is typically limited; therefore, identifying which content a user should store in her cache is a fundamental problem in the operation of any such content distribution system. In this work, we propose Psephos, a novel mechanism for determining the caching policy of each mobile user. Psephos is fully distributed: users compute their own policies individually, in the absence of a central authority. Moreover, it is designed for a heterogeneous environment, in which demand for content, access to resources, and mobility characteristics may vary across different users. Most importantly, the caching policies computed by our mechanism are optimal: we rigorously show that Psephos maximizes the system’s social welfare. Our results are derived formally using techniques from stochastic approximation and convex optimization; to the best of our knowledge, our work is the first to address caching with heterogeneity in a fully distributed manner. Categories andSubject Descriptors
Social-aware stateless forwarding in pocket switched networks
- In 30th IEEE INFOCOM
, 2011
"... Abstract—In this paper we describe SANE, the first forwarding mechanism that combines the advantages of both social-aware and stateless approaches in pocket switched network routing. SANE is based on the observation—that we validate on real-world traces—that individuals with similar interests tend t ..."
Abstract
-
Cited by 15 (4 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper we describe SANE, the first forwarding mechanism that combines the advantages of both social-aware and stateless approaches in pocket switched network routing. SANE is based on the observation—that we validate on real-world traces—that individuals with similar interests tend to meet more often. In our approach, individuals (network members) are characterized by their interest profile, a compact representation of their interests. Through extensive experiments, we show the superiority of social-aware, stateless forwarding over existing stateful, social-aware and stateless, social-oblivious forwarding. An important byproduct of our interest-based approach is that it easily enables innovative routing primitives, such as interest-casting. An interest-casting protocol is also described, and exten-sively evaluated through experiments based on both real-world and synthetic mobility traces. I.
