메뉴 건너뛰기




Volumn 16, Issue 2, 2008, Pages 450-463

Efficient broadcasting using network coding

Author keywords

Network coding; Wireless broadcast

Indexed keywords

AD HOC NETWORKS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PARALLEL ALGORITHMS;

EID: 42549100336     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.901080     Document Type: Article
Times cited : (175)

References (34)
  • 3
    • 25644448947 scopus 로고    scopus 로고
    • Network coding forlarge scale content distribution
    • Mianti, FL, Mar
    • C. Gkantsidis and P. Rodriguez, "Network coding forlarge scale content distribution," in IEEE INFOCOM, Mianti, FL, Mar. 2005.
    • (2005) IEEE INFOCOM
    • Gkantsidis, C.1    Rodriguez, P.2
  • 4
    • 39049161712 scopus 로고    scopus 로고
    • The Haggle architecture
    • Intel Research Cambridge, Tech. Rep. IRC-TR-04-016
    • C. Diot, J. Scott, E. Upton, and M. Liberatore, "The Haggle architecture," Intel Research Cambridge, Tech. Rep. IRC-TR-04-016, 2004.
    • (2004)
    • Diot, C.1    Scott, J.2    Upton, E.3    Liberatore, M.4
  • 5
    • 4444288136 scopus 로고    scopus 로고
    • A delay-tolerant network architecture for challenged internets
    • Karlsruhe, Germany, Aug
    • K. Fall, "A delay-tolerant network architecture for challenged internets," in ACM SIGCOMM, Karlsruhe, Germany, Aug. 2003.
    • (2003) ACM SIGCOMM
    • Fall, K.1
  • 7
    • 18544362207 scopus 로고    scopus 로고
    • Algebraic gossip: A network coding approach to optimal multiple rumor mongering
    • Univ. of Illinois at Urbana-Champaign, Oct
    • S. Deb and M. Medard, "Algebraic gossip: A network coding approach to optimal multiple rumor mongering," in Annu. Allerton Conf. Communication, Control, and Computing, Univ. of Illinois at Urbana-Champaign, Oct. 2004.
    • (2004) Annu. Allerton Conf. Communication, Control, and Computing
    • Deb, S.1    Medard, M.2
  • 10
    • 39049112434 scopus 로고    scopus 로고
    • Information dissemination via network coding
    • Jul
    • D. Mosk-Aoyama and D. Shah, "Information dissemination via network coding," in Proc. ISIT, Jul. 2006, pp. 1748-1752.
    • (2006) Proc. ISIT , pp. 1748-1752
    • Mosk-Aoyama, D.1    Shah, D.2
  • 11
    • 33746093582 scopus 로고    scopus 로고
    • Logarithmic inapproximability of the radio broadcast problem
    • Jul
    • M. Elkin and G. Kortsarzk, "Logarithmic inapproximability of the radio broadcast problem," J. Algorithms, vol. 52, pp. 8-25, Jul. 2004.
    • (2004) J. Algorithms , vol.52 , pp. 8-25
    • Elkin, M.1    Kortsarzk, G.2
  • 13
    • 33749629890 scopus 로고    scopus 로고
    • A lower bound for broadcasting in mobile ad hoe networks
    • Tech. Rep, IC/ /, Jun
    • R. Prakash, A. Schiper, M. Mohsin, D. Cavin, and Y. Sasson, "A lower bound for broadcasting in mobile ad hoe networks," Tech. Rep. (IC/ 2004/37), Jun. 2004.
    • (2004) , pp. 2004
    • Prakash, R.1    Schiper, A.2    Mohsin, M.3    Cavin, D.4    Sasson, Y.5
  • 14
    • 84962054018 scopus 로고    scopus 로고
    • On the power saving of network coding
    • Allerton, IL, Oct
    • K. Jain and K. Talwar, "On the power saving of network coding," in Proc. Allerton Conf., Allerton, IL, Oct. 2005.
    • (2005) Proc. Allerton Conf
    • Jain, K.1    Talwar, K.2
  • 15
    • 0000664248 scopus 로고    scopus 로고
    • The broadcast storm problem in a mobil and hoc network
    • Seattle, WA, Aug
    • Y.-C. Tseng, S.-Y. Ni, Y.-S. Chen, and J.-P. Sheu, "The broadcast storm problem in a mobil and hoc network," in ACM/IEEE MobiCom, Seattle, WA, Aug. 1999.
    • (1999) ACM/IEEE MobiCom
    • Tseng, Y.-C.1    Ni, S.-Y.2    Chen, Y.-S.3    Sheu, J.-P.4
  • 16
    • 84907706252 scopus 로고    scopus 로고
    • Probabilistic broadcast for flooding in wireless mobile ad hoc networks
    • New Orleans, LA, Mar
    • Y. Sasson, D. Cavin, and A. Schiper, "Probabilistic broadcast for flooding in wireless mobile ad hoc networks," in IEEE WCNC, New Orleans, LA, Mar. 2003.
    • (2003) IEEE WCNC
    • Sasson, Y.1    Cavin, D.2    Schiper, A.3
  • 17
    • 0036343305 scopus 로고    scopus 로고
    • Gossip-based ad hoc routing
    • New York, NY, Jun
    • Z. J. Haas, J. Y. Halpern, and L. Li, "Gossip-based ad hoc routing," in IEEE INFOCOM, New York, NY, Jun, 2002.
    • (2002) IEEE INFOCOM
    • Haas, Z.J.1    Halpern, J.Y.2    Li, L.3
  • 18
    • 0034781549 scopus 로고    scopus 로고
    • Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks
    • Sep
    • B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, "Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks," ACM Wireless Networks J., pp. 85-96, Sep. 2002.
    • (2002) ACM Wireless Networks J , pp. 85-96
    • Chen, B.1    Jamieson, K.2    Balakrishnan, H.3    Morris, R.4
  • 19
    • 8744220393 scopus 로고    scopus 로고
    • Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks
    • Jan
    • I. Stojmenovic, M. Seddigh, and J. Zunic, "Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks," IEEE. Trans. Parallel Distrib. Syst., vol. 15, no. 11, pp. 1054-1055, Jan. 2002.
    • (2002) IEEE. Trans. Parallel Distrib. Syst , vol.15 , Issue.11 , pp. 1054-1055
    • Stojmenovic, I.1    Seddigh, M.2    Zunic, J.3
  • 20
    • 11944253975 scopus 로고    scopus 로고
    • A generic distributed broadcast scheme in ad hoc wireless networks
    • Oct
    • J. Wu and F. Dai, "A generic distributed broadcast scheme in ad hoc wireless networks," IEEE Trans. Computers, vol. 53, no. 10, pp. 1343-1354, Oct. 2004.
    • (2004) IEEE Trans. Computers , vol.53 , Issue.10 , pp. 1343-1354
    • Wu, J.1    Dai, F.2
  • 21
    • 5044243408 scopus 로고    scopus 로고
    • A comparison of network coding and tree packing
    • Chicago, IL
    • Y. Wu, P.A. Chou, and K. Jain, "A comparison of network coding and tree packing," in ISIT 2004, Chicago, IL, 2004.
    • (2004) ISIT 2004
    • Wu, Y.1    Chou, P.A.2    Jain, K.3
  • 22
    • 25844504259 scopus 로고    scopus 로고
    • Achieving minimum-cost multicast: A decentralized approach based on network coding
    • Miami FL, Mar
    • D. S. Lun, N. Ratnakar, R. Koetter, M. Medard, E. Ahmed, and H. Lee, "Achieving minimum-cost multicast: A decentralized approach based on network coding," in IEEE INFOCOM, Miami FL, Mar. 2005.
    • (2005) IEEE INFOCOM
    • Lun, D.S.1    Ratnakar, N.2    Koetter, R.3    Medard, M.4    Ahmed, E.5    Lee, H.6
  • 23
    • 19544372232 scopus 로고    scopus 로고
    • Minimum-energy multicast in mobile ad hoc networks using network coding
    • San Antonio, TX, Oct
    • Y. Wu, P. A. Chou, and S.-Y. Kung, "Minimum-energy multicast in mobile ad hoc networks using network coding," in IEEE Information Theory Workshop, San Antonio, TX, Oct. 2004.
    • (2004) IEEE Information Theory Workshop
    • Wu, Y.1    Chou, P.A.2    Kung, S.-Y.3
  • 24
    • 19544380335 scopus 로고    scopus 로고
    • Network coding with a cost criterion
    • Parma, Italy, Oct
    • D. Lun, M. Medard, T. Ho, and R. Koetter, "Network coding with a cost criterion," in ISITA, Parma, Italy, Oct. 2004.
    • (2004) ISITA
    • Lun, D.1    Medard, M.2    Ho, T.3    Koetter, R.4
  • 25
  • 26
    • 0036352734 scopus 로고    scopus 로고
    • Beyond routing: An algebraic approach to network coding
    • Jun
    • R. Koetter and M. Medard, "Beyond routing: An algebraic approach to network coding." in Proc. IEEE INFOCOM, Jun. 2002, vol. 1, pp. 122-130.
    • (2002) Proc. IEEE INFOCOM , vol.1 , pp. 122-130
    • Koetter, R.1    Medard, M.2
  • 27
    • 84976779342 scopus 로고
    • Fast probabilistic algorithms for verification of polynomial identities
    • J. T. Schwartz, "Fast probabilistic algorithms for verification of polynomial identities," J. ACM, vol. 27, pp. 701-717, 1980.
    • (1980) J. ACM , vol.27 , pp. 701-717
    • Schwartz, J.T.1
  • 28
    • 0141973572 scopus 로고    scopus 로고
    • Low complexity algebraic multicast network codes
    • S. Jaggi, P. Chou, and K. Jain, "Low complexity algebraic multicast network codes," in Proc. ISIT, 2003, p. 368.
    • (2003) Proc. ISIT , pp. 368
    • Jaggi, S.1    Chou, P.2    Jain, K.3
  • 30
    • 34548367677 scopus 로고    scopus 로고
    • A network coding approach to energy efficient broadcasting: From theory to practice
    • Barcelona, Spain, Apr
    • C. Fragouli, J. Widmer, and J.-Y.L. Boudec, "A network coding approach to energy efficient broadcasting: From theory to practice," in IEEE INFOCOM, Barcelona, Spain, Apr. 2006.
    • (2006) IEEE INFOCOM
    • Fragouli, C.1    Widmer, J.2    Boudec, J.-Y.L.3
  • 33
    • 0040517363 scopus 로고    scopus 로고
    • The rank of sparse random matrices over finite fields
    • J. Blömer, R. Karp, and E. Welzl, "The rank of sparse random matrices over finite fields," Random Structures Algorithms, vol. 10,pp.407-419, 1997.
    • (1997) Random Structures Algorithms , vol.10 , pp. 407-419
    • Blömer, J.1    Karp, R.2    Welzl, E.3
  • 34
    • 33745166587 scopus 로고    scopus 로고
    • Raptor codes
    • A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-1567, 2004.
    • (2004) IEEE Trans. Inf. Theory , vol.52 , Issue.6 , pp. 2551-1567
    • Shokrollahi, A.1


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