K-Tree: A Multiple Tree Video Multicast Protocol for Ad Hoc Wireless Networks

In this paper, we address the problem of video multicast over ad hoc wireless networks. Video multicasting demands high quality of service with a continuous reachability to receivers. However, the existing multicast solutions do not guarantee this because they are not resilient to mobility of the nodes. Uninterrupted video transmission requires continuous reachability to receivers which emphasizes the usage of path-diversity. Hence, we propose a multiple tree multicast protocol (K-Tree) which maintains maximally node-disjoint multicast trees in the network to attain robustness against path breaks. We further enhance the robustness by using the error resilient Multiple Description Coding (MDC) for video encoding. Through simulations we show how the protocol improves the video quality as we use two or three trees instead of a single tree.

[1]  Peter P. Pham,et al.  Performance analysis of reactive shortest path and multipath routing mechanism with load balance , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  J. J. Garcia-Luna-Aceves,et al.  The core-assisted mesh protocol , 1999, IEEE J. Sel. Areas Commun..

[3]  Sung-Ju Lee,et al.  Split multipath routing with maximally disjoint paths in ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[4]  Avideh Zakhor,et al.  Multiple Tree Video Multicast Over Wireless Ad Hoc Networks , 2007, IEEE Transactions on Circuits and Systems for Video Technology.

[5]  Shivendra S. Panwar,et al.  Video transport over ad-hoc networks using multiple paths , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[6]  Richard J. Anderson,et al.  On the parallel implementation of Goldberg's maximum flow algorithm , 1992, SPAA '92.

[7]  Samir R. Das,et al.  On-demand multipath routing for mobile ad hoc networks , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[8]  Zygmunt J. Haas,et al.  Independent-Tree Ad hoc MulticAst Routing (ITAMAR) , 2003, Mob. Networks Appl..

[9]  Ying Zhu,et al.  Multicast with network coding in application-layer overlay networks , 2004, IEEE J. Sel. Areas Commun..

[10]  Mohammad R. Salavatipour,et al.  Packing element-disjoint steiner trees , 2005, APPROX-RANDOM.

[11]  Yuval Rabani,et al.  Improved bounds for all optical routing , 1995, SODA '95.

[12]  John G. Apostolopoulos,et al.  Reliable video communication over lossy packet networks using multiple state encoding and path diversity , 2000, IS&T/SPIE Electronic Imaging.

[13]  Fabio Somenzi,et al.  A Symbolic Algorithms for Maximum Flow in 0-1 Networks , 1997, Formal Methods Syst. Des..

[14]  Shivendra S. Panwar,et al.  Reliable transmission of video over ad-hoc networks using automatic repeat request and multipath transport , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[15]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.

[16]  Shivendra S. Panwar,et al.  Video transport over ad hoc networks: multistream coding with multipath transport , 2003, IEEE J. Sel. Areas Commun..

[17]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[18]  Avideh Zakhor,et al.  Multipath unicast and multicast video communication over wireless ad hoc networks , 2004, First International Conference on Broadband Networks.

[19]  Shixin Cheng,et al.  Multicasting along energy-efficient meshes in mobile ad hoc networks , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[20]  Patrick Th. Eugster,et al.  Route driven gossip: probabilistic reliable multicast in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[21]  C. Siva Ram Murthy,et al.  Quality of service provisioning in ad hoc wireless networks: a survey of issues and solutions , 2006, Ad Hoc Networks.

[22]  T. Anthony Marsland,et al.  A parallel algorithm for finding a maximum flow in 0-1 networks , 1987, CSC '87.

[23]  Charles E. Perkins,et al.  Multicast operation of the ad-hoc on-demand distance vector routing protocol , 1999, MobiCom.

[24]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[25]  R. N. Uma,et al.  MDC and path diversity in video streaming , 2004, 2004 International Conference on Image Processing, 2004. ICIP '04..

[26]  Sudipta Sengupta,et al.  An Analysis of Wireless Network Coding for Unicast Sessions: The Case for Coding-Aware Routing , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[27]  Meng-Yen Hsieh,et al.  Transmission of layered video streaming via multi-path on ad hoc networks , 2007, Multimedia Tools and Applications.

[28]  Yuan Chen,et al.  Video Transmission over Ad Hoc Networks Using Multiple Description Coding and Clustering-based Multiple Paths , 2007 .

[29]  Bernd Girod,et al.  Layered coding vs. multiple descriptions for video streaming over multiple paths , 2003, ACM Multimedia.

[30]  Srdjan Capkun,et al.  Self-Organized Public-Key Management for Mobile Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[31]  Aravind Srinivasan,et al.  Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems , 2000, Math. Oper. Res..

[32]  L. Kleinrock,et al.  Packet Switching in Radio Channels : Part Il-The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution , 2022 .

[33]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[34]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[35]  Sanjeev Khanna,et al.  Edge disjoint paths revisited , 2003, SODA '03.

[36]  Lisa Zhang,et al.  Hardness of the undirected edge-disjoint paths problem with congestion , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[37]  Vaduvur Bharghavan,et al.  MCEDAR: multicast core-extraction distributed ad hoc routing , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[38]  Myung J. Lee,et al.  Improving interactive video in ad-hoc networks using path diversity , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).