메뉴 건너뛰기




Volumn 1, Issue , 2005, Pages 740-750

Multipath routing for multiple description video in wireless ad hoc networks

Author keywords

[No Author keywords available]

Indexed keywords

MULTIMEDIA COMMUNICATION; MULTIPATH ROUTING; MULTIPLE DESCRIPTION (MD); WIRELESS AD HOC NETWORKS;

EID: 25844459050     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2005.1497939     Document Type: Conference Paper
Times cited : (74)

References (33)
  • 1
    • 85032771112 scopus 로고    scopus 로고
    • Multiple description coding: Compression meets the network
    • Sept.
    • V. Goyal, "Multiple description coding: compression meets the network," IEEE Signal Processing Mag., vol. 18, pp. 74-93, Sept. 2001.
    • (2001) IEEE Signal Processing Mag. , vol.18 , pp. 74-93
    • Goyal, V.1
  • 2
    • 0346076706 scopus 로고    scopus 로고
    • Video transport over ad hoc networks: Multistream coding with multipath transport
    • Dec.
    • S. Mao, S. Lin, S. Panwar, Y. Wang, and E. Celebi, "Video transport over ad hoc networks: Multistream coding with multipath transport," IEEE J. Select. Areas Commun., vol. 12, no. 10, pp. 1721-1737, Dec. 2003.
    • (2003) IEEE J. Select. Areas Commun. , vol.12 , Issue.10 , pp. 1721-1737
    • Mao, S.1    Lin, S.2    Panwar, S.3    Wang, Y.4    Celebi, E.5
  • 3
    • 0036733305 scopus 로고    scopus 로고
    • Supporting image/video applications in a multihop radio environment using route diversity and multiple description coding
    • Sept.
    • N. Gogate, D. Chung, S. Panwar, and Y. Wang, "Supporting image/video applications in a multihop radio environment using route diversity and multiple description coding," IEEE Trans. Circuits Syst. Video Technol., vol. 12, no. 9, pp. 777-792, Sept. 2002.
    • (2002) IEEE Trans. Circuits Syst. Video Technol. , vol.12 , Issue.9 , pp. 777-792
    • Gogate, N.1    Chung, D.2    Panwar, S.3    Wang, Y.4
  • 4
    • 0035171694 scopus 로고    scopus 로고
    • Unbalanced multiple description video communication using path diversity
    • Thessaloniki, Greece, Oct.
    • J. Apostolopoulos and S. Wee, "Unbalanced multiple description video communication using path diversity," in Proc. IEEE ICIP. pp. 966-969, Thessaloniki, Greece, Oct. 2001.
    • (2001) Proc. IEEE ICIP , pp. 966-969
    • Apostolopoulos, J.1    Wee, S.2
  • 5
    • 0036346222 scopus 로고    scopus 로고
    • On multiple description streaming in content delivery networks
    • New York, NY, June
    • J. Apostolopoulos, T. Wong, W. Tan, and S. Wee, "On multiple description streaming in content delivery networks," in Proc. IEEE INFOCOM, pp. 1736-1745, New York, NY, June 2002.
    • (2002) Proc. IEEE INFOCOM , pp. 1736-1745
    • Apostolopoulos, J.1    Wong, T.2    Tan, W.3    Wee, S.4
  • 6
    • 2342633151 scopus 로고    scopus 로고
    • Layered coding vs. multiple descriptions for video streaming over multiple paths
    • Berkeley, CA, Nov.
    • J. Chakareski, S. Han, and B. Girod, "Layered coding vs. multiple descriptions for video streaming over multiple paths," in Proc. ACM Multimedia, pp. 422-431, Berkeley, CA, Nov. 2003.
    • (2003) Proc. ACM Multimedia , pp. 422-431
    • Chakareski, J.1    Han, S.2    Girod, B.3
  • 8
    • 25844477724 scopus 로고    scopus 로고
    • Fast heuristics for multi-path selection for multiple description encoded video streaming
    • Baltimore, Maryland, July
    • _, "Fast heuristics for multi-path selection for multiple description encoded video streaming," in Proc. IEEE ICME, pp. 517-520, Baltimore, Maryland, July 2003.
    • (2003) Proc. IEEE ICME , pp. 517-520
  • 10
    • 0344236266 scopus 로고    scopus 로고
    • Metaheuristics in combinatorial optimization: Overview and conceptual comparison
    • Sept.
    • C. Blum and A. Roli, "Metaheuristics in combinatorial optimization: overview and conceptual comparison," ACM Comput. Surveys, vol. 35, no. 3, pp. 268-308. Sept. 2003.
    • (2003) ACM Comput. Surveys , vol.35 , Issue.3 , pp. 268-308
    • Blum, C.1    Roli, A.2
  • 11
    • 3042645880 scopus 로고    scopus 로고
    • Optimized link state routing protocol
    • Oct.
    • T. Clausen and P. Jacquet, "Optimized Link State Routing Protocol," IETF RFC 3626, Oct. 2003.
    • (2003) IETF RFC , vol.3626
    • Clausen, T.1    Jacquet, P.2
  • 12
    • 4444282195 scopus 로고    scopus 로고
    • Topology dissemination based on reverse-path forwarding (TBRPF)
    • Feb.
    • R. Ogier, F. Templin, and M. Lewis, "Topology dissemination based on reverse-path forwarding (TBRPF)," IETF RFC 3684, Feb. 2004.
    • (2004) IETF RFC , vol.3684
    • Ogier, R.1    Templin, F.2    Lewis, M.3
  • 13
    • 0042975429 scopus 로고    scopus 로고
    • Chaotic maps as parsimonious bit error models of wireless channels
    • San Francisco, CA, Mar.
    • A. Kopke, A. Willig, and H. Karl, "Chaotic maps as parsimonious bit error models of wireless channels," in Proc. IEEE INFOCOM, pp. 513-523. San Francisco, CA, Mar. 2003.
    • (2003) Proc. IEEE INFOCOM , pp. 513-523
    • Kopke, A.1    Willig, A.2    Karl, H.3
  • 14
    • 24344447273 scopus 로고    scopus 로고
    • Optimal routing for multiple concurrent video sessions in wireless ad hoc networks
    • to appear in Seoul, Korea, May
    • S. Mao, S. Kompella, Y. Hou, H. Sherali, and S. Midkiff, "Optimal routing for multiple concurrent video sessions in wireless ad hoc networks," to appear in Proc. IEEE ICC, Seoul, Korea, May 2005.
    • (2005) Proc. IEEE ICC
    • Mao, S.1    Kompella, S.2    Hou, Y.3    Sherali, H.4    Midkiff, S.5
  • 15
    • 33646719930 scopus 로고    scopus 로고
    • Adaptive multiple description video streaming over multiple channels with active probing
    • Baltimore. MD. July
    • E. Setton, Y. Liang, and B. Girod, "Adaptive multiple description video streaming over multiple channels with active probing," in Proc. IEEE ICME, pp. I-509-I-512, Baltimore. MD. July 2003.
    • (2003) Proc. IEEE ICME
    • Setton, E.1    Liang, Y.2    Girod, B.3
  • 16
    • 0019178773 scopus 로고
    • On a source coding problem with two channels and three receivers
    • Dec.
    • L. Ozarow, "On a source coding problem with two channels and three receivers." Bell Syst. Tech. J., vol. 59. no. 10, pp. 84-91, Dec. 1980.
    • (1980) Bell Syst. Tech. J. , vol.59 , Issue.10 , pp. 84-91
    • Ozarow, L.1
  • 18
    • 0040757671 scopus 로고    scopus 로고
    • The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
    • Dec.
    • H. Sherali, K. Ozbay, and S. Subramanian, "The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms," Networks, vol. 31, no. 4, pp. 259-272, Dec. 1998.
    • (1998) Networks , vol.31 , Issue.4 , pp. 259-272
    • Sherali, H.1    Ozbay, K.2    Subramanian, S.3
  • 19
    • 19544361810 scopus 로고    scopus 로고
    • Multi-path routing for multiple description video over wireless ad hoc networks
    • Virginia Tech, Blacksburg, VA, Apr.
    • S. Mao, X. Lin, Y. Hou, H. Sherali, and S. Midkifff, "Multi-path routing for multiple description video over wireless ad hoc networks." Tech. Rep. The Bradley Dept. of ECE, Virginia Tech, Blacksburg, VA, Apr. 2004.
    • (2004) Tech. Rep. the Bradley Dept. of ECE
    • Mao, S.1    Lin, X.2    Hou, Y.3    Sherali, H.4    Midkifff, S.5
  • 20
    • 0037119062 scopus 로고    scopus 로고
    • A note on practical construction of maximum bandwidth paths
    • Aug.
    • N. Malpani and J. Chen. "A note on practical construction of maximum bandwidth paths," Inform. Processing Letters, vol. 83, no. 3, pp. 175-180, Aug. 2002.
    • (2002) Inform. Processing Letters , vol.83 , Issue.3 , pp. 175-180
    • Malpani, N.1    Chen, J.2
  • 21
    • 0036950712 scopus 로고    scopus 로고
    • A genetic algorithm for shortest path routing problem and the sizing of populations
    • Dec.
    • C. Ahn and R. Ramakrishna, "A genetic algorithm for shortest path routing problem and the sizing of populations," IEEE Trans. Evol. Comput.. vol. 6, no. 6, pp. 566-579, Dec. 2002.
    • (2002) IEEE Trans. Evol. Comput. , vol.6 , Issue.6 , pp. 566-579
    • Ahn, C.1    Ramakrishna, R.2
  • 22
    • 0032108018 scopus 로고    scopus 로고
    • Finding the k shortest paths
    • Aug.
    • D. Eppstein, "Finding the k shortest paths." SIAM J. on Comput., vol. 28, no. 2, pp. 652-673, Aug. 1999.
    • (1999) SIAM J. on Comput. , vol.28 , Issue.2 , pp. 652-673
    • Eppstein, D.1
  • 23
    • 0242527360 scopus 로고    scopus 로고
    • Path set selection in mobile ad hoc networks
    • Lausanne, Switzerland, June
    • P. Papadimitratos, Z. Haas, and E. Sirer, "Path set selection in mobile ad hoc networks." in Proc. ACM Mobihoc, pp. 1-11, Lausanne, Switzerland, June 2002.
    • (2002) Proc. ACM Mobihoc , pp. 1-11
    • Papadimitratos, P.1    Haas, Z.2    Sirer, E.3
  • 24
    • 0029734750 scopus 로고    scopus 로고
    • Congestion-oriented shortest multipath routing
    • San Francisco, CA, May
    • S. Murthy and J. Garcia-Luna-Aceves, "Congestion-oriented shortest multipath routing," in Proc. IEEE INFOCOM, pp. 1038-1036, San Francisco, CA, May 1996.
    • (1996) Proc. IEEE INFOCOM , pp. 1038-11036
    • Murthy, S.1    Garcia-Luna-Aceves, J.2
  • 25
    • 0031096030 scopus 로고    scopus 로고
    • A literature survey on traffic dispersion
    • Mar.
    • E. Gustafsson and G. Karlsson, "A literature survey on traffic dispersion," IEEE Network, vol. 11, no. 2, pp. 28-36, Mar. 1997.
    • (1997) IEEE Network , vol.11 , Issue.2 , pp. 28-36
    • Gustafsson, E.1    Karlsson, G.2
  • 26
    • 0141561061 scopus 로고    scopus 로고
    • Self organized terminode routing
    • Apr.
    • L. Blazevic, S. Giordano, and J. L. Boudec, "Self organized terminode routing," J. of Cluster Comput., vol. 5, no. 2, pp. 205-218, Apr. 2002.
    • (2002) J. of Cluster Comput. , vol.5 , Issue.2 , pp. 205-218
    • Blazevic, L.1    Giordano, S.2    Boudec, J.L.3
  • 27
    • 0034857163 scopus 로고    scopus 로고
    • Fast determination of QoS-based multicast routes in wireless networks using genetic algorithm
    • June
    • N. Banerjee and S. Das, "Fast determination of QoS-based multicast routes in wireless networks using genetic algorithm," in Proc. IEEE ICC, pp. 2588-2592, June 2001.
    • (2001) Proc. IEEE ICC , pp. 2588-2592
    • Banerjee, N.1    Das, S.2
  • 28
    • 0032666586 scopus 로고    scopus 로고
    • Minimum cost wavelength-path routing and wavelength allocation using a genetic-algorithm/heuristic hybrid approach
    • Feb.
    • M. Sinclair, "Minimum cost wavelength-path routing and wavelength allocation using a genetic-algorithm/heuristic hybrid approach," IEE Proc. Commun., vol. 46, no. 1, pp. 1-7, Feb. 1999.
    • (1999) IEE Proc. Commun. , vol.46 , Issue.1 , pp. 1-7
    • Sinclair, M.1
  • 29
    • 0031078390 scopus 로고    scopus 로고
    • Genetic algorithms applied to cellular call admission: Local policies
    • Feb.
    • A. Yener and C. Rose, "Genetic algorithms applied to cellular call admission: Local policies," IEEE Trans. Veh. Technol., vol. 46, no. 1, pp. 72-79, Feb. 1997.
    • (1997) IEEE Trans. Veh. Technol. , vol.46 , Issue.1 , pp. 72-79
    • Yener, A.1    Rose, C.2
  • 30
    • 0041409821 scopus 로고    scopus 로고
    • Channel assignment using genetic algorithm based on geometric symmetry
    • July
    • S. Ghosh, B. Sinha, and N. Das, "Channel assignment using genetic algorithm based on geometric symmetry," IEEE Trans. Veh. Technol., vol. 52, no. 4, pp. 860-875, July 2003.
    • (2003) IEEE Trans. Veh. Technol. , vol.52 , Issue.4 , pp. 860-875
    • Ghosh, S.1    Sinha, B.2    Das, N.3
  • 31
    • 0030264825 scopus 로고    scopus 로고
    • Topological design of local-area networks using genetic algorithms
    • Oct.
    • R. Elbaum and M. Sidi, "Topological design of local-area networks using genetic algorithms." IEEE/ACM Trans. Networking, vol. 4, no. 5, pp. 766-778, Oct. 1996.
    • (1996) IEEE/ACM Trans. Networking , vol.4 , Issue.5 , pp. 766-778
    • Elbaum, R.1    Sidi, M.2
  • 32
    • 0141885956 scopus 로고    scopus 로고
    • Centralized broadcast scheduling in packet radio networks via genetic-fix algorithms
    • Sept.
    • C. Ngo and V. Li, "Centralized broadcast scheduling in packet radio networks via genetic-fix algorithms," IEEE Trans. Commun., vol. 51, no. 9, pp. 1439-1441, Sept. 2003.
    • (2003) IEEE Trans. Commun. , vol.51 , Issue.9 , pp. 1439-1441
    • Ngo, C.1    Li, V.2
  • 33
    • 0242302629 scopus 로고    scopus 로고
    • A genetic algorithm for the design of a fuzzy controller for active queue management
    • Aug.
    • G. Fatta, F. Hoffmann, G. Re, and A. Urso, "A genetic algorithm for the design of a fuzzy controller for active queue management," IEEE Trans. Syst., Man, Cybern. C, vol. 33, no. 3, pp. 313-324, Aug. 2003.
    • (2003) IEEE Trans. Syst., Man, Cybern. C , vol.33 , Issue.3 , pp. 313-324
    • Fatta, G.1    Hoffmann, F.2    Re, G.3    Urso, A.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.