Skip to main content
SpringerLink
Log in

Leveraging node gatherings to save cellular resources

  • Published:
Annals of Telecommunications Aims and scope Submit manuscript

Abstract

Cellular resources are expensive and should be saved whenever possible. In this paper, we propose Scheduled Content Delivery (SCoD), a resource-saving strategy that draws on the mobility of users to reduce the number of cellular transmissions. The idea is to postpone a transmission in order to maximize its benefits in terms of users located in the same cell. We exploit the delay tolerance of certain types of content combined with the natural tendency of users to get together in the same locations. By relying on multicast communications, we can then reduce the number of transmissions required to satisfy all requesting users. SCoD relies on previous observations to determine, in an adaptive way, the number of users that should trigger a multicast transmission in a cell. We evaluate SCoD and compare it against other strategies by running trace-driven simulations based on real-world mobility datasets. We also compare SCoD with an Oracle, which gives the best case but is unfeasible as it relies on the knowledge of future displacements of nodes. The results show that SCoD covers 100% of the users while consuming almost as few resources as the Oracle.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Notes

  1. This paper is a significant extension version of the conference paper titled “SCoD: Saving Cellular Resources by Delaying Transmissions of Popular Content”, presented at IEEE International Symposium on Wireless Communication Systems, Brussels, Belgium, August 2015 [7].

  2. In fact, we derive a lower bound on the gains that we can obtain with SCoD, as multiple content would benefit from the same user gatherings, leading to additive gains. Dealing with multiple content in the system at the same time will be subject of future work.

  3. In fact, we encounter this type of situation in several scenarios of real life, like traffic on a highway and public transportation during rush hours.

References

  1. Cisco (2016) Cisco visual networking index: global mobile data traffic forecast update 2015–2020 white paper

  2. Lo K (2015) Mobile internet: how many gigabytes do you need?

  3. Wyatt E (2014) AT&T accused of deceiving smartphone customers with unlimited data plans

  4. Dimatteo S, Hui P, Bo H, Li VOK (2011) Cellular traffic offloading through WiFi networks. In: Proceedings of the 8th international conference on mobile ad-hoc and sensor systems (MASS). IEEE, pp 192–201

  5. Rebecchi F, De Amorim MD, Conan V, Passarella A, Bruno R, Conti M (2015) Data offloading techniques in cellular networks: a survey. IEEE Commun Surv Tutorials 17(2):580–603

    Article  Google Scholar 

  6. Asadi A, Wang Q, Mancuso V (2014) A survey on device-to-device communication in cellular networks. IEEE Commun Surv Tutorials 16(4):1801–1819

    Article  Google Scholar 

  7. Belouanas S-E, Thai K-L, De Amorim MD et al (2015) Scod: saving cellular resources by delaying transmissions of popular content. In: Proceedings of the 12th International Symposium on Wireless Communication Systems (ISWCS). IEEE, pp 111–115

  8. Checko A, Christiansen HL, Yan Y, Scolari L, Kardaras G, Berger MS, Dittmann L (2015) Cloud RAN for mobile networks — a technology overview. IEEE Commun Surv Tutorials 17(1):405–426

    Article  Google Scholar 

  9. Kumar V, Lin L, Krajzewicz D, Hrizi F, Martinez O, Gozalvez J, Bauza R (2010) itetris: Adaptation of its technologies for large scale integrated simulation. In: Proceedings of the 71st vehicular technology conference (VTC 2010-Spring). IEEE , pp 1–5

  10. Codeca L, Frank R, Engel T (2015) Luxembourg SUMO traffic (LuST) scenario: 24 hours of mobility for vehicular networking research. In: 2015 IEEE vehicular networking conference (VNC). IEEE, pp 1–8

  11. Kim DK, Sung DK (1999) Characterization of soft handoff in cdma systems. IEEE Trans Veh Technol 48 (4):1195–1202

    Article  Google Scholar 

  12. Karp RM (1972) Reducibility among combinatorial problems. In: Complexity of computer computations. Springer, pp 85–103

  13. Chvatal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4(3):233–235

    Article  MathSciNet  MATH  Google Scholar 

  14. Slavík P (1996) A tight analysis of the greedy algorithm for set cover. In: Proceedings of the 28th ACM symposium on theory of computing (STOC). ACM, pp 435–441

  15. Krajzewicz D, Rossel C (2007) Simulation of urban mobility (sumo). In: Centre for applied informatics (ZAIK) and the institute of transport research at the german aerospace centre

  16. Luxembourg national institute of statistic and economic studies

  17. Whitbeck J, Lopez Y, Leguay J, Conan V, De MD (2012) Amorim. Push-and-track: saving infrastructure bandwidth through opportunistic forwarding. Pervasive Mob Comput 8(5):682–697

    Article  Google Scholar 

  18. Aurenhammer F (1991) Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Comput Surv (CSUR) 23(3):345–405

    Article  Google Scholar 

  19. Frenkiel RH, Badrinath B R, Borras J, Yates RD (2000) The infostations challenge: balancing cost and ubiquity in delivering wireless data. IEEE Pers Commun 7(2):66–71

    Article  Google Scholar 

  20. Xiong Y, Tian R, Ma J, Liu Y, Sun L (2010) Optimal infostation deployment for spatio-temporal information dissemination. In: 2010 IEEE symposium on computers and communications (ISCC). IEEE, p 2010

  21. Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Annals Math 162(1):439–485

  22. Wang JC-P, ElGindy H, Lipman J (2006) On cache prefetching strategies for integrated infostation-cellular network. In: Proceedings. 2006 31st IEEE Conference on Local Computer Networks. IEEE, pp 185–192

  23. Sollazzo G, Musolesi M, Mascolo C (2007) TACO-DTN A time-aware content-based dissemination system for delay tolerant networks. In: Proceedings of the 1st International MobiSys Workshop on Mobile Opportunistic Networking, pp 83–90

    Chapter  Google Scholar 

  24. Eugster PTh, Felber PA, Guerraoui R, Kermarrec A-M (2003) The many faces of publish/subscribe. ACM Comput Surv (CSUR) 35(2):114–131

    Article  Google Scholar 

  25. Martinez FJ, Toh CK, Cano J-C, Calafate CT, Manzoni P (2011) A survey and comparative study of simulators for vehicular ad hoc networks (vanets). Wirel Commun Mob Comput 11(7):813–828

    Article  Google Scholar 

  26. Luan TH, Cai LX, Chen J, Shen X, Bai F (2014) Engineering a distributed infrastructure for large-scale cost-effective content dissemination over urban vehicular networks. IEEE Trans Veh Technol 63(3):1419–1435

    Article  Google Scholar 

  27. Trullols O, Fiore M, Casetti C, Chiasserini C-F, Barcelo Ordinas JM (2010) Planning roadside infrastructure for information dissemination in intelligent transportation systems. Comput Commun 33(4):432–442

    Article  Google Scholar 

  28. Ahn J, Sathiamoorthy M, Krishnamachari B, Bai F, Zhang L (2014) Optimizing content dissemination in vehicular networks with radio heterogeneity. IEEE Trans Mob Comput 13(6):1312–1325

    Article  Google Scholar 

  29. Balasubramanian A, Mahajan R, Venkataramani A (2010) Augmenting mobile 3G using WiFi. In: Proceedings of the 8th international conference on mobile systems, Applications, and Services (MobiSys). ACM, pp 209–222

  30. Lee K, Lee J, Yi Y, Rhee I, Chong S (2013) Mobile data offloading: how much can WiFi deliver? IEEE/ACM Trans Netw 21(2):536–550

    Article  Google Scholar 

  31. Siris VA, Kalyvas D (2013) Enhancing mobile data offloading with mobility prediction and prefetching. ACM SIGMOBILE Mob Comput Commun Rev 17(1):22–29

    Article  Google Scholar 

  32. Yoon S, Ha DT, Ngo HQ, Qiao C (2009) Mopads: A mobility profile aided file downloading service in vehicular networks. IEEE Trans Veh Technol 58(9):5235–5246

    Article  Google Scholar 

  33. Mehmeti F, Spyropoulos T (2014) Is it worth to be patient? Analysis and optimization of delayed mobile data offloading. In: Proceedings of the 33rd international conference on computer communications (INFOCOM). IEEE, pp 2364–2372

  34. Wang N, Wu J (2016) Opportunistic wifi offloading in a vehicular environment Waiting or downloading now? In: Proceedings of the 35th IEEE International Conference on Computer Communications (IEEE INFOCOM 2016)

    Google Scholar 

  35. Malandrino F, Casetti C, Chiasserini C-F, Fiore M (2012) Offloading cellular networks through its content download. In: 2012 9th annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks (SECON). IEEE, pp 263–271

  36. Rebecchi F, De Amorim MD, Conan V (2014) Droid: adapting to individual mobility pays off in mobile data offloading. In: Proceedings of the IFIP networking 2014 conference. IFIP, pp 1–9

  37. Whitbeck J, Amorim M, Lopez Y, Leguay J, Conan V (2011) Relieving the wireless infrastructure when opportunistic networks meet guaranteed delays. In: Proceedings of the 12th International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM). IEEE, pp 1–10

  38. Bo H, Hui P, Kumar VS, Marathe MV, Pei G, Srinivasan A (2010) Cellular traffic offloading through opportunistic communications: a case study. In: Proceedings of the 5th workshop on challenged networks. ACM, pp 31–38

  39. Lungaro P, Segall Z, Zander J (2010) Context-aware rrm for opportunistic content delivery in cellular networks. In: Proceedings of the 3rd international conference on communication theory, reliability, and quality of service (CTRQ). IEEE, pp 175–180

Download references

Acknowledgments

This work was partially funded by the French National Research Agency (ANR) under project ANR DataTweet (ANR-13-INFR-0008).

Author information

Authors and Affiliations

  1. LIP6/CNRS - UPMC Sorbonne Universités, Paris, France

    Salah-Eddine Belouanas, Mehdi Bezahaf, Kim-Loan Thai, Prométhée Spathis & Marcelo Dias de Amorim

Authors
  1. Salah-Eddine Belouanas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mehdi Bezahaf
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kim-Loan Thai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Prométhée Spathis
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Marcelo Dias de Amorim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Salah-Eddine Belouanas.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Belouanas, SE., Bezahaf, M., Thai, KL. et al. Leveraging node gatherings to save cellular resources. Ann. Telecommun. 72, 717–730 (2017). https://doi.org/10.1007/s12243-017-0600-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12243-017-0600-9

Keywords

Search

Navigation