메뉴 건너뛰기




Volumn 2015, Issue 1, 2015, Pages 1-17

Performance characterization and transmission schemes for instantly decodable network coding in wireless broadcast

Author keywords

Feedback; Network coding; Packet decoding delay; Throughput; Wireless broadcast

Indexed keywords

BROADCASTING; CODES (SYMBOLS); DECODING; FEEDBACK; SIGNAL RECEIVERS; THROUGHPUT;

EID: 84947416894     PISSN: 16876172     EISSN: 16876180     Source Type: Journal    
DOI: 10.1186/s13634-015-0279-x     Document Type: Article
Times cited : (11)

References (43)
  • 1
    • 84947473559 scopus 로고    scopus 로고
    • Médard, in Proc. IEEE Int. Symp. Information Theory (ISIT)
    • JK Sundararajan, D Shah, M Médard, in Proc. IEEE Int. Symp. Information Theory (ISIT). ARQ for network coding, (2008).
    • (2008) ARQ for network coding
    • JK Sundararajan, D.1    Shah, M.2
  • 4
  • 6
    • 57349116924 scopus 로고    scopus 로고
    • On the delay and throughput gains of coding in unreliable networks
    • A Eryilmaz, A Ozdaglar, M Médard, Ahmed E, On the delay and throughput gains of coding in unreliable networks. IEEE Trans. Inf. Theory. 54(12), 5511–5524 (2008).
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.12 , pp. 5511-5524
    • Eryilmaz, A.1    Ozdaglar, A.2    Médard, M.3    Ahmed, E.4
  • 11
    • 84947473564 scopus 로고    scopus 로고
    • FHP Fitzek: T Larsen, in Proc. IEEE Int. Conf. Communications (ICC) workshop. Network coding for mobile devices—systematic binary random rateless codes
    • J Heide, MV Pedersen, FHP Fitzek, T Larsen, in Proc. IEEE Int. Conf. Communications (ICC) workshop. Network coding for mobile devices—systematic binary random rateless codes, (2009).
    • (2009) MV Pedersen
    • Heide, J.1
  • 15
    • 77954490203 scopus 로고    scopus 로고
    • An optimal adaptive network coding scheme for minimizing decoding delay in broadcast erasure channels
    • P Sadeghi, R Shams, D Traskov, An optimal adaptive network coding scheme for minimizing decoding delay in broadcast erasure channels. EURASIP J. Wireless Commun. Netw. 2010, 1–14 (2010).
    • (2010) EURASIP J. Wireless Commun. Netw , vol.2010 , pp. 1-14
    • Sadeghi, P.1    Shams, R.2    Traskov, D.3
  • 17
    • 84912531129 scopus 로고    scopus 로고
    • From instantly decodable to random linear network coding
    • M Yu, P Sadeghi, N Aboutorab, From instantly decodable to random linear network coding. IEEE Trans Commun. 62(11), 3943–3955 (2014).
    • (2014) IEEE Trans Commun. , vol.62 , Issue.11 , pp. 3943-3955
    • Yu, M.1    Sadeghi, P.2    Aboutorab, N.3
  • 20
    • 84055217764 scopus 로고    scopus 로고
    • On the capacity of immediately-decodable coding schemes for wireless stored-video broadcast with hard deadline constraints
    • X Li, C-C Wang, Lin X, On the capacity of immediately-decodable coding schemes for wireless stored-video broadcast with hard deadline constraints. IEEE J. Sel. Areas Commun. 29(5), 1094–1105 (2011).
    • (2011) IEEE J. Sel. Areas Commun , vol.29 , Issue.5 , pp. 1094-1105
    • Li, X.1    Wang, C.-C.2    Lin, X.3
  • 24
    • 84891633799 scopus 로고    scopus 로고
    • Coding opportunity densification strategies for instantly decodable network coding
    • S Sorour, S Valaee, Coding opportunity densification strategies for instantly decodable network coding. IEEE Trans. Commun. 61(12), 5077–5089 (2013).
    • (2013) IEEE Trans. Commun. , vol.61 , Issue.12 , pp. 5077-5089
    • Sorour, S.1    Valaee, S.2
  • 25
    • 84899985281 scopus 로고    scopus 로고
    • Enabling a tradeoff between completion time and decoding delay in instantly decodable network coded systems
    • N Aboutorab, P Sadeghi, S Sorour, Enabling a tradeoff between completion time and decoding delay in instantly decodable network coded systems. IEEE Trans. Commun. 62(4), 1269–1309 (2014).
    • (2014) IEEE Trans. Commun. , vol.62 , Issue.4 , pp. 1269-1309
    • Aboutorab, N.1    Sadeghi, P.2    Sorour, S.3
  • 31
    • 84947473571 scopus 로고    scopus 로고
    • AG Dimakis: A Markopoulou, in Proc. IEEE Int. Symp. Network Coding (NetCod). Instantly decodable network codes for real-time applications
    • A Le, AS Tehrani, AG Dimakis, A Markopoulou, in Proc. IEEE Int. Symp. Network Coding (NetCod). Instantly decodable network codes for real-time applications, (2013).
    • (2013) AS Tehrani
    • Le, A.1
  • 38
    • 84884366310 scopus 로고    scopus 로고
    • Throughput-delay analysis of random linear network coding for wireless broadcasting
    • B Swapna, A Eryilmaz, NB Shroff, Throughput-delay analysis of random linear network coding for wireless broadcasting. IEEE Trans Inf. Theory. 59(10), 6328–6341 (2013).
    • (2013) IEEE Trans Inf. Theory , vol.59 , Issue.10 , pp. 6328-6341
    • Swapna, B.1    Eryilmaz, A.2    Shroff, N.B.3
  • 39
    • 11944253901 scopus 로고    scopus 로고
    • Cambridge University Press, Cambridge, UK
    • B Ballobás, Random Graphs (Cambridge University Press, Cambridge, UK, 2001).
    • (2001) Random Graphs
    • Ballobás, B.1
  • 40
    • 0002909354 scopus 로고
    • The chromatic number of random graphs
    • B Bollobás, The chromatic number of random graphs. Combinatorica. 8(1), 49–55 (1988).
    • (1988) Combinatorica , vol.8 , Issue.1 , pp. 49-55
    • Bollobás, B.1
  • 42
    • 84976668743 scopus 로고
    • Algorithm 457, Finding all cliques of an undirected graph
    • New York
    • C Bron, J Kerbosch, Algorithm 457, Finding all cliques of an undirected graph. Commun. ACM. 16(9), 575–577 (1973). New York.
    • (1973) Commun. ACM , vol.16 , Issue.9 , pp. 575-577
    • Bron, C.1    Kerbosch, J.2


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