Multimedia Internet of Things: A Comprehensive Survey <s> 1) MULTICAST ROUTING <s> 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. <s> BIB001 </s> Multimedia Internet of Things: A Comprehensive Survey <s> 1) MULTICAST ROUTING <s> Modern applications of Wireless Multimedia Sensor Network (WMSN) demands stringent Quality of Service (QoS) requirements. Multipath routing is a promising solution to accomplish the required level of QoS. Typically, wireless links in WMSN are highly unreliable and unpredictable. The unreliable nature of these links substantially affects the performance of the network. Link quality estimation has been an active area of research in sensor networks for the last few years. This paper presents Energy and ETX aware Multipath Geographic Routing (EEMGR) scheme that reinforces routes with high-quality links. It incorporates adaptive cost function which selects the next hop based on ETX, remaining energy, and distance of the neighboring 1-hop node to the sink. Several node-disjoint routing paths are discovered by EEMGR connecting the source node and the sink node. NetTopo algorithm level simulation results reveal that proposed EEMGR scheme chooses good quality links and improves network lifetime as compared to state-of-the-art Two-phase geographical Greedy Forwarding (TPGF) routing scheme. <s> BIB002
Multimedia real-time critical applications require the network to guarantee multiple QoS metrics that are maximum throughput, minimum delay, and minimum PLR. Multimedia communication requires multicast routing with minimum end-to-end latency for delay-sensitive health applications. A Fast Multiconstrained Multicast Routing Algorithm (FAMOUS) is proposed in BIB001 . The proposed routing scheme is based on Shortest Path Algorithm (SPT) and Minimum Steiner Tree (MST) algorithm. Authors exploit entropy-based weight aggregation to reduce multicriteria decision problems into a single criterion problem. The objective of FAMOUS is to determine the shortest path and optimal multicast tree from source to destination for better accuracy and speed. Aswale and Ghorpade in BIB002 presented Energy and ETX Aware Multipath Geographic Routing (EEMGR) protocol. ETX is a link quality metric that estimates the number of transmissions required to deliver a packet from source to destination successfully. EEMGR exploits ETX, node remaining energy and distance between a node to sink to determine the optimal path for reliable and energy-efficient multimedia routing. Performance comparison is made with the Two-Phase Geographic Greedy Forwarding (TPGF) algorithm.