메뉴 건너뛰기




Volumn 27, Issue 5, 2009, Pages 635-646

Is Rate Adaptation Beneficial for Inter-Session Network Coding?

Author keywords

ad hoc network; clique partitioning; combinatorial optimization; mesh network; network coding; rate adaptation; relay

Indexed keywords


EID: 85008029116     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2009.090606     Document Type: Article
Times cited : (43)

References (19)
  • 3
    • 0242334165 scopus 로고    scopus 로고
    • An algebraic approach to network coding
    • R. Koetter and M. Medard, “An algebraic approach to network coding,” IEEE/ACM Trans. Networking., vol. 11, no. 5, pp. 782–795, 2003.
    • (2003) IEEE/ACM Trans. Networking , vol.11 , Issue.5 , pp. 782-795
    • Koetter, R.1    Medard, M.2
  • 4
    • 47749143034 scopus 로고    scopus 로고
    • Efficient operation of wireless packet networks using network coding
    • D. S. Lun, M. Medard, and R. Koetter, “Efficient operation of wireless packet networks using network coding,” IWCT, 2005.
    • (2005) IWCT
    • Lun, D.S.1    Medard, M.2    Koetter, R.3
  • 8
    • 34548309486 scopus 로고    scopus 로고
    • Bounds on the gain of network coding and broadcasting in wireless networks
    • J. Liu, D. Goeckel, and D. Towsley, “Bounds on the gain of network coding and broadcasting in wireless networks,” Proc. IEEE INFOCOM, 2007.
    • (2007) Proc. IEEE INFOCOM
    • Liu, J.1    Goeckel, D.2    Towsley, D.3
  • 9
    • 51349134180 scopus 로고    scopus 로고
    • How many packets can we encode? — an analysis of practical wireless network coding
    • J. Le, J.C.S. Lui, and D.M. Chiu, “How many packets can we encode? — an analysis of practical wireless network coding,” Proc. IEEE INFOCOM, 2008.
    • (2008) Proc. IEEE INFOCOM
    • Le, J.1    Lui, J.C.S.2    Chiu, D.M.3
  • 10
    • 51349159332 scopus 로고    scopus 로고
    • Bounds on the benefit of network coding: throughput and energy saving in wireless networks
    • A. K. Haddad and R. Riedi, “Bounds on the benefit of network coding: throughput and energy saving in wireless networks,” Proc. IEEE INFOCOM, 2008.
    • (2008) Proc. IEEE INFOCOM
    • Haddad, A.K.1    Riedi, R.2
  • 11
    • 57349187594 scopus 로고    scopus 로고
    • Loss-aware network coding for unicast wireless sessions: Design, implementation, and performance evaluation
    • Shravan Rayanchu, Sayandeep Sen, Jianming Wu, Suman Banerjee, and Sudipta Sengupta, “Loss-aware network coding for unicast wireless sessions: Design, implementation, and performance evaluation,” Proc. ACM Sigmetrics, 2008.
    • (2008) Proc. ACM Sigmetrics
    • Rayanchu, S.1    Sen, S.2    Wu, J.3    Banerjee, S.4    Sengupta, S.5
  • 14
    • 84940650572 scopus 로고    scopus 로고
    • Mac-layer and phy-layer network coding for two-way relaying: achievable regions and opportunistic scheduling
    • Feng. Xue, Chun-Hung Liu, and Summet Sandhu, “Mac-layer and phy-layer network coding for two-way relaying: achievable regions and opportunistic scheduling,” Proc. Allerton Conf. on Comm. Control and Comp., 2007.
    • (2007) Proc. Allerton Conf. on Comm. Control and Comp.
    • Xue, F.1    Liu, C.-H.2    Sandhu, S.3
  • 15
    • 84874420945 scopus 로고    scopus 로고
    • Ieee 802.11a, part 11: Wireless lan medium access control (mac) and physical layer (phy) specifications: High speed physical layer in the 5ghz band, supplement to ieee 802.11 standard
    • Sep
    • “Ieee 802.11a, part 11: Wireless lan medium access control (mac) and physical layer (phy) specifications: High speed physical layer in the 5ghz band, supplement to ieee 802.11 standard,” Sep 1999.
    • (1999)
  • 16
    • 85008057649 scopus 로고    scopus 로고
    • Clique partitioning of interval graphs with submodular costs on the cliques
    • Egervary Research Group, Budapest, www.cs.elte.hu/egres
    • Dion Gijswijt, Vincent Jost, and Maurice Queyranne, “Clique partitioning of interval graphs with submodular costs on the cliques,” Tech. Rep. TR-2006-14, Egervary Research Group, Budapest, 2006, www.cs.elte.hu/egres.
    • (2006) Tech. Rep. TR-2006-14
    • Gijswijt, D.1    Jost, V.2    Queyranne, M.3
  • 17
    • 0041532309 scopus 로고
    • Clustering and clique partitioning: Simulated annealing and tabu search approaches
    • Saul G. de Amorim, Jean-Pierre Barthelemy, and Celso C. Ribeiro, “Clustering and clique partitioning: Simulated annealing and tabu search approaches,” Journal of Classification, 1992.
    • (1992) Journal of Classification
    • de Amorim, S.G.1    Barthelemy, J.-P.2    Ribeiro, C.C.3
  • 19
    • 0036011371 scopus 로고    scopus 로고
    • New efficient clique partitioning algorithms for register-transfer synthesis of data paths
    • April
    • Jong Tae Kim and Dong Ryeol Shin, “New efficient clique partitioning algorithms for register-transfer synthesis of data paths,” Journal of the Korean Physical Society, vol. 40, no. 4, pp. 754–758, April 2002.
    • (2002) Journal of the Korean Physical Society , vol.40 , Issue.4 , pp. 754-758
    • Kim, J.T.1    Shin, D.R.2


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