Mobile Data Offloading through Opportunistic Communications and Social Participation

University of Maryland, College Park
IEEE Transactions on Mobile Computing (Impact Factor: 2.4). 06/2012; DOI: 10.1109/TMC.2011.101
Source: IEEE Xplore

ABSTRACT HASH(0x31ffadc)

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The recent boost up of mobile data consumption is straining cellular networks in metropolitan areas and is the main reason for the ending of unlimited data plans by many providers. To address this problem, we propose the use of opportunistic delegation as a data traffic offload solution by investigating two main questions: (i) “Can we characterize a given social mobile scenario by observing only a small portion of it?”, (ii) “How to exploit this characterization so to design solutions that alleviate overloaded cellular networks?”. In our solution we build a social-graph of the given scenario by observing it for a period as short as 1-week, and then leverage a few, socially important users in the social-graph—the VIPs—to offload the network. The proposed VIP selection strategies are based on social network properties and are compared to the optimal (offline) solution. Through extensive evaluations with real and synthetic traces we show the effectiveness of VIP delegation both in terms of coverage and required number of VIPs – down to 7% in average of VIPs are needed in campus-like scenarios to offload about 90% of the traffic.
    Ad Hoc Networks. 01/2014;
  • [Show abstract] [Hide abstract]
    ABSTRACT: We present our work on MOCA, a lightweight Mobile Cloud Offloading Architecture, which uses an in-network cloud platform to provide offloading resources. MOCA integrates with existing mobile network architectures without requiring significant changes, and utilizes software defined networking techniques in the data plane to redirect appropriate traffic to and from the cloud platform. We show the feasibility of MOCA by a prototype implementation using a LTE/EPC mobile testbed.
    Proceedings of the eighth ACM international workshop on Mobility in the evolving internet architecture; 10/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: Due to the uncertainty of the connections in delay tolerant networks, the source may need help from other nodes and make these nodes serve as relays to forward the messages to the destination. To further improve the performance, the source may also make these nodes serve as agents, which can help the source to make other nodes serve as relays. However, nodes may not be willing to help the source without any reward because of the selfish nature. This means that the source has to pay certain reward to the nodes that provide help. Furthermore, such fees may be varying with time. For example, if the nodes guess that the source is eager to transmit the message to the destination, they may ask for more reward. In addition, the reward that the source obtains from the destination may be varying with time, too. For example, the sooner the destination gets the message, the more reward may be. In such complex case, it may not be good for the source to request help all the time. This paper proposes a unifying theoretical framework based on Ordinary Differential Equations to evaluate the total reward that the source can obtain. Then, based on the framework, we study the optimal control problem by Pontryagin's Maximum Principle and prove that the optimal policy confirms to the threshold form in some cases. Simulations based on both synthetic and real motion traces show the accuracy of the framework. Furthermore, we demonstrate that the performance of the optimal policy is the best through extensive numerical results.
    Wireless Personal Communications 03/2014; 75(1):687-705. · 0.43 Impact Factor

Full-text (2 Sources)

Available from
May 21, 2014