dc.contributor.author | Rahman, Shifatur | |
dc.contributor.author | Hasan, Sakib | |
dc.date.accessioned | 2021-10-06T06:53:11Z | |
dc.date.available | 2021-10-06T06:53:11Z | |
dc.date.issued | 2017-11-15 | |
dc.identifier.citation | 1) S. Khuller, B. Raghavachari, and N. Young, “Balancing minimum spanning trees and shortest-path trees,” Algorithmica, vol. 14, no. 4, pp. 305–321, 1995 2) M. Parsa, Q. Zhu, and J. J. Garcia-Luna-Aceves, “An iterative algorithm for delayconstrained minimum-cost multicasting,” IEEE/ACM Trans. Netw., vol. 6, no. 4, pp. 461–474, Aug. 1998 3) G. Xue, “Minimum-cost QoS multicast and unicast routing in communication networks,” IEEE Trans. Commun.,vol. 51, no. 5, pp. 817–824, May 2003. 4) J. Huang, Y. Tanaka, and Y. Ma, “On approximating a multicast routing tree with multiple quality-of-service constraints,” IEICE Trans. Commun., vol. E95-B, no. 6, pp. 2005–2012, Jun. 2012 5) “Multicast Routing for Multimedia Communications in the Internet of Thing” – Jun Huang, Senior Member, IEEE, Qiang Duan,Member, IEEE, Yanxiao Zhao, Member, IEEE, Zhong Zheng, Member, IEEE, and Wei Wang, Senior Member, IEEE; IEEE INTERNET OF THINGS JOURNAL,VOL. 4, NO. 1, FEBRUARY 2017 | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/1109 | |
dc.description | Supervised by Dr. Muhammad Mahbub Alam Professor, Department of Computer Science and Engineering (CSE), Islamic University of Technology (IUT), Board Bazar, Gazipur-1704, Bangladesh. | en_US |
dc.description.abstract | Multicast routing that meets multiple quality of service constraints is important for supporting multimedia communications in the Internet of Things (IoT). Existing multicast routing technologies for IoT mainly focus on ad hoc sensor networking scenarios; thus, are not responsive and robust enough for supporting multimedia applications in an IoT environment. In order to tackle the challenging problem of multicast routing for multimedia communications in IoT, in this book, we analysed two algorithms for the establishing multicast routing tree for multimedia data transmissions. The proposed algorithms leverage an entropy-based process to aggregate all weights into a comprehensive metric, and then uses it to search a multicast tree on the basis of the spanning tree and shortest path tree algorithms. We went through the evolution of the problem from wired networks to wireless netoworks.The book shows the theoretical analysis and extensive simulations for evaluating the proposed algorithms. Both analytical and experimental results demonstrate that one of the proposed algorithms is more efficient than a representative multiconstrained multicast routing algorithm in terms of both speed and accuracy; thus, is able to support multimedia communications in an IoT environment. We believe that the results shown at the end of the algorithm description are able to provide in-depth insight into the multicast routing algorithm design for multimedia communications in IoT and also will speak for themselves of ensuring a better Multicast Routing for Multimedia networks in Internet Of Things based on multiple constraints. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Department of Computer Science and Engineering (CSE), Islamic University of Technology (IUT), Board Bazar, Gazipur-1704, Bangladesh | en_US |
dc.title | Constraint Based Multicast Routing In Internet of Things | en_US |
dc.type | Thesis | en_US |