@article {17673,
	title = {Mobile Data Offloading through Opportunistic Communications and Social Participation},
	journal = {Mobile Computing, IEEE Transactions on},
	volume = {11},
	year = {2012},
	month = {2012/05//},
	pages = {821 - 834},
	abstract = {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 percent 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.},
	keywords = {3G mobile communication, 3G networks, Bluetooth interface, cellular networks, cellular radio, content transfer, device/service discovery, graph theory, greedy algorithm, heuristic algorithm, information delivery, information dissemination, mobile data offloading, mobile data traffic, mobile phones, mobile social networks, MoSoNets, Nokia N900 smartphones, Opp-off, opportunistic communications, random algorithm, real-world mobility traces, smart phones, social networking (online), social participation, target-set selection problem, telecommunication network routing, Telecommunication traffic, trace-driven simulation study},
	isbn = {1536-1233},
	doi = {10.1109/TMC.2011.101},
	author = {Han,Bo and Hui,Pan and Kumar,V. S.A and Marathe,M. V and Shao,Jianhua and Srinivasan, Aravind}
}
@conference {12222,
	title = {The effect of packet loss on redundancy elimination in cellular wireless networks},
	booktitle = {Proceedings of the 10th annual conference on Internet measurement},
	series = {IMC {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {294 - 300},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Network-level redundancy elimination (RE) algorithms reduce traffic volume on bandwidth-constrained network paths by avoiding the transmission of repeated byte sequences. Previous work shows that RE can suppress the transmission of 20-50\% bytes when deployed at ISP access links or between routers. In this paper, we focus on the challenges of deploying RE in cellular networks. The potential benefifit is substantial, since cellular networks have a growing subscriber base and network links, including wired backhaul, are often oversubscribed. Using three large traces captured at two North American and one European wireless network providers, we show that RE can reduce the bandwidth consumption of the majority of mobile users by at least 10\%. However, cellular links have much higher packet loss rates than their wired counterparts, which makes applying RE much more difficult. Our experiments also show that the loss of only a few packets can disrupt RE and eliminate the bandwidth savings. We propose informed marking, a lightweight scheme that detects lost packets and prevents RE algorithms from using them for future encodings. We implement RE with informed marking and deploy it in a real-world cellular network. Our results show that with informed marking, more than 60\% of the bandwidth savings of RE are preserved, even when packet loss rates are high.},
	keywords = {cellular networks, loss, redundancy elimination},
	isbn = {978-1-4503-0483-2},
	doi = {10.1145/1879141.1879179},
	url = {http://doi.acm.org/10.1145/1879141.1879179},
	author = {Lumezanu,Cristian and Guo,Katherine and Spring, Neil and Bhattacharjee, Bobby}
}
