IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 65, NO. 10, OCTOBER 2016 8739
Fig. 3. MDR against different numbers of destinations in RWP and Infocom’05 scenarios with buffer size = 50 and 200 KB. (a) RWP (10 source nodes).
(b) Infocom’05 (1 source node).
in terms of message delivery rate against the number of source nodes,
the number of destination nodes, and buffer size. Comparatively,
E-GBSD outperforms others in pursuit of a global optimal metric
of MDR, thereby achieving the satisfactory outcome for message
multicasting in DTNs.
R
EFERENCES
[1] T. Spyropoulos, R. N. B. Rais, T. Turletti, K. Obraczka, and A. Vasilakos,
“Routing for disruption tolerant networks: Taxonomy and design,”
Wireless Netw., vol. 16, no. 8, pp. 2349–2370, Nov. 2010.
[2] Y. Cao and Z. Sun, “Routing in delay/disruption tolerant networks:
A taxonomy, survey and challenges,” IEEE Commun. Surveys Tuts.,
vol. 15, no. 2, pp. 654–677, 2nd Quart. 2013.
[3] K. Fall, “A delay-tolerant network architecture for challenged internets,”
in Proc. ACM SIGCOMM Conf. Appl., Technol., Architect., Protocols
Comput. C ommun., Karlsruhe, Germany, Aug. 25–29, 2003, pp. 27–34.
[4] J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, “MaxProp:
Routing for vehicle-based disruption-tolerant networks,” in Proc. 25th
IEEE INFOCOM, Barcelona, Spain, Apr. 23–29, 2006, pp. 1–11.
[5] K. Shin and S. Kim, “Enhanced buffer management policy that utilises
message properties for delay-tolerant networks,” IET Commun.,vol.5,
no. 6, pp. 753–759, Apr. 2011.
[6] Y. Liu, J. Wang, S. Zhang, and H. Zhou, “A buffer management scheme
based on message transmission status in delay tolerant networks,” in Proc.
IEEE GLOBECOM , Houston, TX, USA, Dec. 5–9, 2011, pp. 1–5.
[7] D. Wu, J. Zhou, P. Zhang, and R. Wang, “Intelligent dynamical buffer
scheduling mechanism for intermittently connected mobile network,”
Wireless Pers. Commun., vol. 73, no. 3, pp. 1269–1288, Dec. 2013.
[8] K. Wei, S. Guo, D. Zeng, and K. Xu, “A multi-attribute decision making
approach to congestion control in delay tolerant networks,” in Proc. IEEE
ICC, Syndey, NSW, Australla, Jun. 10–14, 2014, pp. 2742–2747.
[9] A. Balasubramanian, B. N. Levine, and A. Venkataramani, “DTN rout-
ing as a resource allocation problem,” in Proc. ACM SIGCOMM Conf.
Appl., Technol., Architect., Protocols Comput. Commun., Kyoto, Japan,
Aug. 27–31, 2007, pp. 373–384.
[10] A. Krifa, C. Barakat, and T. Spyropoulos, “Optimal buffer management
policies for delay tolerant networks,” in Proc. 5th Annu. IEEE SECON,
San Francisco, CA, USA, Jun. 16–20, 2008, pp. 260–268.
[11] A. Krifa, C. Barakat, and T. Spyropoulos, “Message drop and scheduling
in DTNs: Theory and practice,” IEEE Trans. Mobile Comput., vol. 11,
no. 9, pp. 1470–1483, Sep. 2012.
[12] A. Elwhishi, P.-H. Ho, K. Naik, and B. Shihada, “A novel message
scheduling framework for delay tolerant networks routing,” IEEE Trans.
Parallel Distrib. Syst., vol. 24, no. 5, pp. 871–880, May 2013.
[13] A. Vahdat and D. Becker, “Epidemic routing for partially connected
ad hoc networks,” Duke Univ., Durham, NC, USA, Tech. Rep. CS-200006,
2000.
[14] A. Keränen, J. Ott, and T. Kärkkäinen, “The ONE simulator for DTN
protocol evaluation,” in Proc. 2nd Int. Conf. SIMUTools Tech.,Rome,
Italy, Mar. 2–6, 2009, p. 55.
[15] J. Scott et al., CRAWDAD Data Set Cambridge/Haggle (v. 2006-01-31),
Jan. 2006. [Online]. Available: http://crawdad.org/cambridge/haggle/
Adaptive Random Network Coding for Multicasting
Hard-Deadline-Constrained Prioritized Data
Bin Li, Member, IEEE, Hongxiang Li, Senior Member, IEEE,
and Ruonan Zhang, Member, IEEE
Abstract—Random network coding (RNC) is a promising solution for
multicast services over wireless networks. In this paper, we consider
the problem of deadline-constrained multimedia multicast from a single
transmitter to multiple users over wireless erasure channels. A novel
transmission scheduling strategy based on adaptive RNC is developed to
maximize the throughput of multicast sessions under a deterministic delay
constraint. Particularly, we optimize the number of multimedia data layers
under different assumptions on users’ feedback. Simulation results show
the effectiveness of the proposed methods.
Index Terms—Adaptive random network coding (ARNC), hard dead-
line, prioritized data, quality of service (QoS), wireless video multicast.
Manuscript received December 31, 2014; revised November 3, 2015;
accepted December 8, 2015. Date of publication December 17, 2015; date
of current version October 13, 2016. This work was supported in part by the
National Natural Science Foundation of China under Grant 61202394, Grant
61571370, and Grant 61203233; by the Natural Science Basic Research Plan
in Shaanxi Province under Grant 2015JM6349; by the Fundamental Research
Funds for the Central Universities under Grant 3102014KYJD033 and Grant
3102015ZY093; and by the US National Science Foundation under Grant
ECCS-1509047. The review of this paper was coordinated by Dr. C. Yuen.
B. Li and R. Zhang are with the Department of Communication Engineering,
Northwestern Polytechnical University, Xi’an 710072, China (e-mail: libin@
nwpu.edu.cn; rzhang@nwpu.edu.cn).
H. Li is with the Department of Electrical and Computer Engineering,
University of Louisville, Louisville, KY 40292 USA (e-mail: h.li@louisville.
edu).
Color versions of one or more of the figures in this paper are available online
at http://ieeexplore.ieee.org.
Digital Object Identifier 10.1109/TVT.2015.2509503
0018-9545 © 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.