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 paper, we propose 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 conduct 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 our results are able to provide in-depth insight into the multicast routing algorithm design for multimedia communications in IoT.
Original language | English |
---|---|
Article number | 7792164 |
Pages (from-to) | 215-224 |
Number of pages | 10 |
Journal | IEEE Internet of Things Journal |
Volume | 4 |
Issue number | 1 |
DOIs | |
Publication status | Published - Feb 2017 |
Externally published | Yes |
Keywords
- Entropy
- Internet of Things (IoT)
- Shortest path tree (SPT)
- multicast routing
- multimedia communications