Maritime Wideband Communication Networks pp 15-31

Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER) | Cite as

Video Transmission Scheduling in Maritime Wideband Communication Networks

Chapter

Abstract

In this chapter, we develop a benchmark network model for vessel surveillance video uploading via a maritime wideband communication network. A broadband wireless network utilizing Time Division Multiple Access (TDMA) based media access control (MAC) protocol is exploited to provide a shore-side network framework, while the store-carry-and-forward routing scheme is adopted to mitigate the intermittent network connectivity in maritime communication scenarios. We are concerned about transmitting more important video packets to the administrative authority (i.e., TMP), based on the interpretation of throughput as the summation of weights of delivered video packets. Two offline scheduling algorithms are proposed, based on time-capacity mapping approach to convert the original time-based non-continuous resource allocation problem to a capacity-based continuous problem.

As a retreat when optimal algorithm is out of reach, it is mathematically proved that the IGTJRS algorithm has an approximation ratio of 2, and a time complexity of \(O({n^2})\). Simulation results validate the proposed algorithms, by obtaining the real ship route traces from navigation software BLM-Shipping.

References

  1. 1.
    W. Zhao, Y. Chen, M. Ammar, M. Corner, B. Levine, and E. Zegura, “Capacity enhancement using throwboxes in DTNs,” in Proc. IEEE MASS, 2006, pp. 31–40.Google Scholar
  2. 2.
    H. Liang, and W. Zhuang, “Efficient on-demand data service delivery to high-speed trains in cellular/infostation integrated networks,” IEEE Journal on Selected Areas in Communications, vol. 30, no. 4, pp. 780–791, May 2012.CrossRefGoogle Scholar
  3. 3.
    P. Berman, and B. DasGupta, “Multi-phase algorithms for throughput maximization for real-time scheduling,” Journal of Combinatorial Optimization, vol. 4, no. 3, pp. 307–323, Sept. 2000.CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    J. Y. Hsiao, C. Y. Tang, and R. S. Chang, “An efficient algorithm for finding a maximum weight 2-independent set on interval graphs,” Information Processing Letters, vol. 43, no. 5, pp. 229–235, Oct. 1992.CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    D. R. Fulkerson and O. A. Gross, “Incidence matrices and interval graphs,” Pacific J. Math, vol. 15, no. 3, pp. 835–855, Nov. 1965.Google Scholar
  6. 6.
    B. I. G. Ltd, “User manual,” http://www.boloomo.com/shippingMain.
  7. 7.
    Y. Li, A. C. Landsburg, R. A. Barr, and S. Calisal, “Improving ship maneuverability standards as a means for increasing ship controllability and safety,” in Proc. MTS/IEEE OCEANS, 2005, pp. 1972–1981.Google Scholar
  8. 8.
    J. Shankar Pathmasuntharam, P.-Y. Kong, M.-T. Zhou, Y. Ge, H. Wang, C.-W. Ang, W. Su, and H. Harada, “TRITON: High speed maritime mesh networks,” in Proc. IEEE PIMRC, 2008, pp. 1–5.Google Scholar
  9. 9.
    P. Kolios and L. Lambrinos, “Optimising file delivery in a maritime environment through inter-vessel connectivity predictions,” in Proc. IEEE WiMob, 2012, pp. 777–783.Google Scholar

Copyright information

© The Author(s) 2014

Authors and Affiliations

  1. 1.Navigation CollegeDalian Maritime UniversityDalianChina
  2. 2.Department of Electronic and Computer EngineeringUniversity of WaterlooWaterlooCanada

Personalised recommendations