Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Centrally Controlled Mass Data Offloading Using Vehicular Traffic

Published: 01 June 2017 Publication History

Abstract

With over 300 billion vehicle trips made in the United States and 64 billion in France per year, network operators have the opportunity to utilize the existing road and highway network as an alternative data network to offload large amounts of delay-tolerant traffic. To enable the road network as a large-capacity transmission system, we exploit the existing mobility of vehicles equipped with wireless and storage capacities together with a collection of <italic>offloading spots</italic>. An offloading spot is a data storage equipment located where vehicles usually park. Data is transloaded from a conventional data network to the closest offloading spot and then shipped by vehicles along their line of travel. The subsequent offloading spots act as data relay boxes where vehicles can drop off data for later pick-up by other vehicles, depending on their direction of travel. The main challenges of this offloading system are how to compute the road path matching the performance requirements of a data transfer and how to configure the sequence of offloading spots involved in the transfer. We propose a scalable and adaptive centralized architecture built on software-defined networking that maximizes the utilization of the flow of vehicles connecting consecutive offloading spots. We simulate the performance of our system using real roads traffic counts for France. Results show that the centralized controlled offloading architecture can achieve an efficient and fair allocation of concurrent data transfers between major cities in France.

References

[1]
B. Baron, P. Spathis, H. Rivano, M. D. De Amorim, “Vehicles as big data carriers: Road map space reduction and efficient data assignment,” in Proc. IEEE VTC Fall, Vancouver, BC, Canada, Sep. 2014, pp. 1–5.
[2]
B. Baron, P. Spathis, H. Rivano, and M. D. de Amorim, “Offloading massive data onto passenger vehicles: Topology simplification and traffic assignment,” IEEE/ACM Trans. Netw., vol. 24, no. 6, pp. 3248–3261, Dec. 2016.
[3]
Forecast and Methodology 2015–2020, Cisco Vis. Netw. Index (VNI), San Jose, CA, USA, Jun. 2016.
[4]
J. Hecht, “The bandwidth bottleneck that is throttling the Internet,” Nature, vol. 536, no. 7615, pp. 139–142, Aug. 2016.
[5]
E. Nygren, R. K. Sitaraman, and J. Sun, “The Akamai network: A platform for high-performance Internet applications,” ACM SIGOPS Oper. Syst. Rev., vol. 44, no. 3, pp. 2–19, 2010.
[6]
N. Laoutaris, G. Smaragdakis, R. Stanojevic, P. Rodriguez, and R. Sundaram, “Delay-tolerant bulk data transfers on the Internet,” IEEE/ACM Trans. Netw., vol. 21, no. 6, pp. 1852–1865, Dec. 2013.
[7]
N. McKeown et al., “Openflow: Enabling innovation in campus networks,” ACM SIGCOMM Comput. Commun. Rev., vol. 38, no. 2, pp. 69–74, Mar. 2008.
[8]
M. Anteur, V. Deslandes, N. Thomas, and A.-L. Beylot, “Ultra narrow band technique for low power wide area communications,” in Proc. IEEE GLOBECOM, San Diego, CA, USA, Dec. 2015, pp. 1–6.
[9]
I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck, “Alternative routes in road networks,” ACM J. Exp. Algorithmics, vol. 18, Apr. 2013, Art. no.
[10]
E. Cascetta, A. Nuzzolo, F. Russo, and A. Vitetta, “A modified logit route choice model overcoming path overlapping problems: Specification and some calibration results for interurban networks,” in Proc. Int. Symp. Transp. Traffic Theory, Lyon, France, Jul. 1996, pp. 697–711.
[11]
H. J. Van Zuylen and L. G. Willumsen, “The most likely trip matrix estimated from traffic counts,” Elsevier Transp. Res. B Methodol., vol. 14, no. 3, pp. 281–293, Sep. 1980.
[12]
P. M. Chen, E. K. Lee, G. A. Gibson, R. H. Katz, and D. A. Patterson, “RAID: High-performance, reliable secondary storage,” ACM Comput., vol. 26, no. 2, pp. 145–185, 1994.
[13]
S. Lin and D. J. Costello, Error Control Coding. Englewood Cliffs, NJ, USA: Prentice-Hall, 2004.
[14]
M. Pióro, P. Nilsson, E. Kubilinskas, and G. Fodor, “On efficient max-min fair routing algorithms,” in Proc. IEEE ISCC, Kemer, Turkey, Jun. 2003, pp. 365–372.
[15]
M. H. Ammar and J. W. Wong, “The design of teletext broadcast cycles,” Elsevier Perform. Eval., vol. 5, no. 4, pp. 235–242, 1985.
[16]
M. Shreedhar and G. Varghese, “Efficient fair queuing using deficit round-robin,” IEEE/ACM Trans. Netw., vol. 4, no. 3, pp. 375–385, Jun. 1996.
[17]
R. Van Nee, “Breaking the gigabit-per-second barrier with 802.11AC,” IEEE Wireless Commun., vol. 18, no. 2, p. 4, Apr. 2011.
[18]
C. Toregas, R. Swain, C. ReVelle, and L. Bergman, “The location of emergency service facilities,” INFORMS Oper. Res., vol. 19, no. 6, pp. 1363–1373, 1971.
[19]
M. Behrisch, L. Bieker, J. Erdmann, and D. Krajzewicz, “Sumo-simulation of urban mobility-an overview,” in Proc. SIMUL, Barcelona, Spain, Oct. 2011, pp. 55–60.
[20]
A. Pentland, R. Fletcher, and A. Hasson, “DakNet: Rethinking connectivity in developing nations,” IEEE Comput., vol. 37, no. 1, pp. 78–83, Jan. 2004.
[21]
J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, “MaxProp: Routing for vehicle-based disruption-tolerant networks,” in Proc. IEEE INFOCOM, Barcelona, Spain, Apr. 2006, pp. 1–11.
[22]
R. C. Shah, S. Roy, S. Jain, and W. Brunette, “Data MULEs: Modeling and analysis of a three-tier architecture for sparse sensor networks,” Elsevier Ad Hoc Netw., vol. 1, nos. 2–3, pp. 215–233, Sep. 2003.
[23]
W. Zhao et al., “Capacity enhancement using throwboxes in DTNs,” in Proc. IEEE MASS, Vancouver, BC, Canada, Oct. 2006, pp. 31–40.
[24]
W. Zhao, M. Ammar, and E. Zegura, “A message ferrying approach for data delivery in sparse mobile ad hoc networks,” in Proc. ACM MobiHoc, Tokyo, Japan, May 2004, pp. 187–198.
[25]
F. Rebecchi et al., “Data offloading techniques in cellular networks: A survey,” IEEE Commun. Surveys Tuts., vol. 17, no. 2, pp. 580–603, 2nd Quart., 2015.
[26]
J. Research, “Data offload connecting intelligently,” White Paper, 2013.
[27]
A. Balasubramanian, R. Mahajan, and A. Venkataramani, “Augmenting mobile 3g using WiFi,” in Proc. ACM Mobisys, San Francisco, CA, USA, Jun. 2010, pp. 209–222.
[28]
Y. Li et al., “Multiple mobile data offloading through delay tolerant networks,” in Proc. ACM Int. Workshop Challenged Netw. (CHANTS), Las Vegas, NV, USA, Sep. 2011, pp. 43–48.
[29]
F. Rebecchi, M. D. de Amorim, and V. Conan, “DROid: Adapting to individual mobility pays off in mobile data offloading,” in Proc. IEEE/IFIP Netw. Conf., Trondheim, Norway, Jun. 2014, pp. 1–9.
[30]
A. Keränen and J. Ott, “DTN over aerial carriers,” in Proc. ACM CHANTS, Beijing, China, 2009, pp. 67–76.
[31]
R. Y. Wang et al., “Turning the postal system into a generic digital communication mechanism,” in Proc. ACM SIGCOMM Comput. Commun. Rev., vol. 34, no. 4, pp. 159–166, 2004.
[32]
J. Munkres, “Algorithms for the assignment and transportation problems,” J. Soc. Ind. Appl. Math., vol. 5, no. 1, pp. 32–38, Mar. 1957.
[33]
B. Hoppe and Ó. Tardos, “The quickest transshipment problem,” INFORMS Math. Oper. Res., vol. 25, no. 1, pp. 36–62, Feb. 2000.
[34]
R. Simmons, B. Browning, Y. Zhang, and V. Sadekar, “Learning to predict driver route and destination intent,” in Proc. IEEE ITSC, Toronto, ON, Canada, Sep. 2006, pp. 127–132.
[35]
B. D. Ziebart, A. L. Maas, J. A. Bagnell, and A. K. Dey, “Maximum entropy inverse reinforcement learning,” in Proc. AAAI, Chicago, IL, USA, Jul. 2008, pp. 1433–1438.
[36]
L. Liao, D. J. Patterson, D. Fox, and H. Kautz, “Learning and inferring transportation routines,” Elsevier Artif. Intell., vol. 171, nos. 5–6, pp. 311–331, 2007.
[37]
J. Krumm and E. Horvitz, “Predestination: Inferring destinations from partial trajectories,” in UbiComp 2006: Ubiquitous Computing. Heidelberg, Germany: Springer, Sep. 2006.
[38]
G. Xue, Z. Li, H. Zhu, and Y. Liu, “Traffic-known urban vehicular route prediction based on partial mobility patterns,” in Proc. IEEE ICPADS, Shenzhen, China, Dec. 2009, pp. 369–375.

Cited By

View all
  • (2023)Vehicular Communication Network Enabled CAV Data Offloading: A ReviewIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2023.326364324:8(7869-7897)Online publication date: 1-Aug-2023
  • (2023)Offloading Using Traditional Optimization and Machine Learning in Federated Cloud–Edge–Fog Systems: A SurveyIEEE Communications Surveys & Tutorials10.1109/COMST.2023.323957925:2(1199-1226)Online publication date: 1-Apr-2023
  • (2022)Distributed Game-Theoretical D2D-Enabled Task Offloading in Mobile Edge ComputingJournal of Computer Science and Technology10.1007/s11390-022-2063-337:4(919-941)Online publication date: 1-Jul-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management  Volume 14, Issue 2
June 2017
252 pages

Publisher

IEEE Press

Publication History

Published: 01 June 2017

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 06 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Vehicular Communication Network Enabled CAV Data Offloading: A ReviewIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2023.326364324:8(7869-7897)Online publication date: 1-Aug-2023
  • (2023)Offloading Using Traditional Optimization and Machine Learning in Federated Cloud–Edge–Fog Systems: A SurveyIEEE Communications Surveys & Tutorials10.1109/COMST.2023.323957925:2(1199-1226)Online publication date: 1-Apr-2023
  • (2022)Distributed Game-Theoretical D2D-Enabled Task Offloading in Mobile Edge ComputingJournal of Computer Science and Technology10.1007/s11390-022-2063-337:4(919-941)Online publication date: 1-Jul-2022
  • (2021)Mobility Model for Contact-Aware Data Offloading Through Train-to-Train Communications in Rail NetworksIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2020.301458823:1(597-609)Online publication date: 27-Dec-2021
  • (2020)Computation Offloading and Retrieval for Vehicular Edge ComputingACM Computing Surveys10.1145/339206453:4(1-35)Online publication date: 20-Aug-2020
  • (2020)On the Economic Value of Mobile CachingIEEE INFOCOM 2020 - IEEE Conference on Computer Communications10.1109/INFOCOM41043.2020.9155336(984-993)Online publication date: 6-Jul-2020
  • (2020)Adaptive Task Scheduling via End-Edge-Cloud Cooperation in Vehicular NetworksWireless Algorithms, Systems, and Applications10.1007/978-3-030-59016-1_34(407-419)Online publication date: 13-Sep-2020

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media