메뉴 건너뛰기




Volumn 19, Issue 2, 2017, Pages 1201-1224

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications

Author keywords

completion time; cooperative data exchange; decoding delay; device to device; distributed optimization; game theory; graph theory; maximum weight clique problem; Strict and generalized instantly decodable network coding

Indexed keywords

CODES (SYMBOLS); COMPLEX NETWORKS; COMPUTER SYSTEM RECOVERY; DECODING; DISTRIBUTED COMPUTER SYSTEMS; ELECTRONIC DATA INTERCHANGE; GAME THEORY; GRAPH THEORY; MOBILE TELECOMMUNICATION SYSTEMS;

EID: 85020479730     PISSN: None     EISSN: 1553877X     Source Type: Journal    
DOI: 10.1109/COMST.2017.2665587     Document Type: Article
Times cited : (61)

References (213)
  • 3
    • 70449463316 scopus 로고    scopus 로고
    • Online network coding for optimal throughput and delay-The three-receiver case
    • Auckland, New Zealand, Dec.
    • J. K. Sundararajan, D. Shah, and M. Medard, "Online network coding for optimal throughput and delay-The three-receiver case, " in Proc. IEEE Int. Symp. Inf. Theory Appl. (ISITA), Auckland, New Zealand, Dec. 2008, pp. 1-6.
    • (2008) Proc. IEEE Int. Symp. Inf. Theory Appl. (ISITA) , pp. 1-6
    • Sundararajan, J.K.1    Shah, D.2    Medard, M.3
  • 4
    • 48649103341 scopus 로고    scopus 로고
    • Multimedia wireless transmission with network coding
    • Lausanne, Switzerland, Nov.
    • D. Nguyen, T. Nguyen, and X. Yang, "Multimedia wireless transmission with network coding, " in Proc. Int. Packet Video Workshop (PV), Lausanne, Switzerland, Nov. 2007, pp. 326-335.
    • (2007) Proc. Int. Packet Video Workshop (PV) , pp. 326-335
    • Nguyen, D.1    Nguyen, T.2    Yang, X.3
  • 5
    • 70350383265 scopus 로고    scopus 로고
    • Network coding-based wireless media transmission using POMDP
    • Seattle, WA, USA, May
    • D. Nguyen and T. Nguyen, "Network coding-based wireless media transmission using POMDP, " in Proc. Int. Packet Video Workshop (PV), Seattle, WA, USA, May 2009, pp. 1-9.
    • (2009) Proc. Int. Packet Video Workshop (PV) , pp. 1-9
    • Nguyen, D.1    Nguyen, T.2
  • 6
    • 79951675585 scopus 로고    scopus 로고
    • Network coding with multi-generation mixing: A generalized framework for practical network coding
    • Feb.
    • M. Halloush and H. Radha, "Network coding with multi-generation mixing: A generalized framework for practical network coding, " IEEE Trans. Wireless Commun., vol. 10, no. 2, pp. 466-473, Feb. 2011.
    • (2011) IEEE Trans. Wireless Commun. , vol.10 , Issue.2 , pp. 466-473
    • Halloush, M.1    Radha, H.2
  • 7
    • 77955032349 scopus 로고    scopus 로고
    • Efficient network coding for wireless broadcasting
    • Sydney, NSW, Australia, Apr.
    • L. Lu et al., "Efficient network coding for wireless broadcasting, " in Proc. IEEE Wireless Commun. Netw. Conf. (WCNC), Sydney, NSW, Australia, Apr. 2010, pp. 1-6.
    • (2010) Proc. IEEE Wireless Commun. Netw. Conf. (WCNC) , pp. 1-6
    • Lu, L.1
  • 9
    • 39049160619 scopus 로고    scopus 로고
    • Network coding for multiple unicasts: An approach based on linear optimization
    • Seattle, WA, USA, Jul.
    • D. Traskov, N. Ratnakar, D. S. Lun, R. Koetter, and M. Medard, "Network coding for multiple unicasts: An approach based on linear optimization, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Seattle, WA, USA, Jul. 2006, pp. 1758-1762.
    • (2006) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 1758-1762
    • Traskov, D.1    Ratnakar, N.2    Lun, D.S.3    Koetter, R.4    Medard, M.5
  • 10
    • 51649105182 scopus 로고    scopus 로고
    • Beyond the butterfly-A graph-theoretic characterization of the feasibility of network coding with two simple unicast sessions
    • Nice, France, Jun.
    • C.-C. Wang and N. B. Shroff, "Beyond the butterfly-A graph-theoretic characterization of the feasibility of network coding with two simple unicast sessions, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Nice, France, Jun. 2007, pp. 121-125.
    • (2007) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 121-125
    • Wang, C.-C.1    Shroff, N.B.2
  • 11
    • 0034844491 scopus 로고    scopus 로고
    • An algebraic approach to network coding
    • Washington, DC, USA
    • R. Koetter and M. Medard, "An algebraic approach to network coding, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Washington, DC, USA, 2001, pp. 104-110.
    • (2001) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 104-110
    • Koetter, R.1    Medard, M.2
  • 12
    • 0242334165 scopus 로고    scopus 로고
    • An algebraic approach to network coding
    • Oct.
    • R. Koetter and M. Medard, "An algebraic approach to network coding, " IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
    • (2003) IEEE/ACM Trans. Netw. , vol.11 , Issue.5 , pp. 782-795
    • Koetter, R.1    Medard, M.2
  • 13
    • 80053219965 scopus 로고    scopus 로고
    • Optimal sub-graph selection over coded networks with delay and limited-size buffering
    • Jul.
    • H. Ghasvari, M. Raayatpanah, B. Khalaj, and H. Bakhshi, "Optimal sub-graph selection over coded networks with delay and limited-size buffering, " IET Commun., vol. 5, no. 11, pp. 1497-1505, Jul. 2011.
    • (2011) IET Commun. , vol.5 , Issue.11 , pp. 1497-1505
    • Ghasvari, H.1    Raayatpanah, M.2    Khalaj, B.3    Bakhshi, H.4
  • 14
    • 84858959039 scopus 로고    scopus 로고
    • On coding for delay-Network coding for time-division duplexing
    • Apr.
    • D. E. Lucani, M. Medard, and M. Stojanovic, "On coding for delay-Network coding for time-division duplexing, " IEEE Trans. Inf. Theory, vol. 58, no. 4, pp. 2330-2348, Apr. 2012.
    • (2012) IEEE Trans. Inf. Theory , vol.58 , Issue.4 , pp. 2330-2348
    • Lucani, D.E.1    Medard, M.2    Stojanovic, M.3
  • 15
    • 34548362100 scopus 로고    scopus 로고
    • An analysis of wireless network coding for unicast sessions: The case for coding-aware routing
    • Anchorage, AK, USA, May
    • S. Sengupta, S. Rayanchu, and S. Banerjee, "An analysis of wireless network coding for unicast sessions: The case for coding-aware routing, " in Proc. IEEE 26th Annu. Joint Conf. Comput. Commun. (INFOCOM), Anchorage, AK, USA, May 2007, pp. 1028-1036.
    • (2007) Proc. IEEE 26th Annu. Joint Conf. Comput. Commun. (INFOCOM) , pp. 1028-1036
    • Sengupta, S.1    Rayanchu, S.2    Banerjee, S.3
  • 17
    • 77953735305 scopus 로고    scopus 로고
    • On the index coding problem and its relation to network coding and matroid theory
    • Jul.
    • S. El Rouayheb, A. Sprintson, and C. Georghiades, "On the index coding problem and its relation to network coding and matroid theory, " IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3187-3195, Jul. 2010.
    • (2010) IEEE Trans. Inf. Theory , vol.56 , Issue.7 , pp. 3187-3195
    • El Rouayheb, S.1    Sprintson, A.2    Georghiades, C.3
  • 20
    • 33947412645 scopus 로고    scopus 로고
    • Broadcast channels with cooperating decoders
    • Dec.
    • R. Dabora and S. D. Servetto, "Broadcast channels with cooperating decoders, " IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5438-5454, Dec. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.12 , pp. 5438-5454
    • Dabora, R.1    Servetto, S.D.2
  • 21
  • 22
    • 57349187594 scopus 로고    scopus 로고
    • Loss-aware network coding for unicast wireless sessions: Design, implementation, and performance evaluation
    • S. Rayanchu, S. Sen, J. Wu, S. Banerjee, and S. Sengupta, "Loss-aware network coding for unicast wireless sessions: Design, implementation, and performance evaluation, " SIGMETRICS Perform. Eval. Rev., vol. 36, no. 1, pp. 85-96, 2008.
    • (2008) SIGMETRICS Perform. Eval. Rev. , vol.36 , Issue.1 , pp. 85-96
    • Rayanchu, S.1    Sen, S.2    Wu, J.3    Banerjee, S.4    Sengupta, S.5
  • 27
    • 57349116924 scopus 로고    scopus 로고
    • On the delay and throughput gains of coding in unreliable networks
    • Dec.
    • A. Eryilmaz, A. Ozdaglar, M. Medard, and E. Ahmed, "On the delay and throughput gains of coding in unreliable networks, " IEEE Trans. Inf. Theory, vol. 54, no. 12, pp. 5511-5524, Dec. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.12 , pp. 5511-5524
    • Eryilmaz, A.1    Ozdaglar, A.2    Medard, M.3    Ahmed, E.4
  • 29
    • 33947399169 scopus 로고    scopus 로고
    • A random linear network coding approach to multicast
    • Oct.
    • T. Ho et al., "A random linear network coding approach to multicast, " IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.10 , pp. 4413-4430
    • Ho, T.1
  • 30
    • 77949587413 scopus 로고    scopus 로고
    • Broadcasting in timedivision duplexing: A random linear network coding approach
    • Lausanne, Switzerland, Jun.
    • D. E. Lucani, M. Medard, and M. Stojanovic, "Broadcasting in timedivision duplexing: A random linear network coding approach, " in Proc. Workshop Netw. Coding Theory Appl. (NetCod), Lausanne, Switzerland, Jun. 2009, pp. 62-67.
    • (2009) Proc. Workshop Netw. Coding Theory Appl. (NetCod) , pp. 62-67
    • Lucani, D.E.1    Medard, M.2    Stojanovic, M.3
  • 32
  • 34
    • 33745166587 scopus 로고    scopus 로고
    • Raptor codes
    • Jun.
    • A. Shokrollahi, "Raptor codes, " IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, Jun. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.6 , pp. 2551-2567
    • Shokrollahi, A.1
  • 38
    • 33845586442 scopus 로고    scopus 로고
    • Codecast: A network-coding-based ad hoc multicast protocol
    • Oct.
    • J.-S. Park, M. Gerla, D. S. Lun, Y. Yi, and M. Medard, "Codecast: A network-coding-based ad hoc multicast protocol, " IEEE Wireless Commun., vol. 13, no. 5, pp. 76-81, Oct. 2006.
    • (2006) IEEE Wireless Commun. , vol.13 , Issue.5 , pp. 76-81
    • Park, J.-S.1    Gerla, M.2    Lun, D.S.3    Yi, Y.4    Medard, M.5
  • 39
    • 70349661617 scopus 로고    scopus 로고
    • Random linear network coding for time division duplexing: When to stop talking and start listening
    • Rio de Janeiro, Brazil, Apr.
    • D. E. Lucani, M. Stojanovic, and M. Medard, "Random linear network coding for time division duplexing: When to stop talking and start listening, " in Proc. IEEE 28th Annu. Joint Conf. Comput. Commun. (INFOCOM), Rio de Janeiro, Brazil, Apr. 2009, pp. 1800-1808.
    • (2009) Proc. IEEE 28th Annu. Joint Conf. Comput. Commun. (INFOCOM) , pp. 1800-1808
    • Lucani, D.E.1    Stojanovic, M.2    Medard, M.3
  • 40
    • 77951612022 scopus 로고    scopus 로고
    • Random linear network coding for time-division duplexing: Field size considerations
    • Honolulu, HI, USA, Nov.
    • D. E. Lucani, M. Medard, and M. Stojanovic, "Random linear network coding for time-division duplexing: Field size considerations, " in Proc. IEEE Glob. Telecommun. Conf. (GLOBECOM), Honolulu, HI, USA, Nov. 2009, pp. 1-6.
    • (2009) Proc. IEEE Glob. Telecommun. Conf. (GLOBECOM) , pp. 1-6
    • Lucani, D.E.1    Medard, M.2    Stojanovic, M.3
  • 41
    • 70449473378 scopus 로고    scopus 로고
    • Random linear network coding for time-division duplexing: Queueing analysis
    • Seoul, South Korea, Jun.
    • D. E. Lucani, M. Medard, and M. Stojanovic, "Random linear network coding for time-division duplexing: Queueing analysis, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Seoul, South Korea, Jun. 2009, pp. 1423-1427.
    • (2009) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 1423-1427
    • Lucani, D.E.1    Medard, M.2    Stojanovic, M.3
  • 44
    • 79958793819 scopus 로고    scopus 로고
    • An adaptive network coded retransmission scheme for single-hop wireless multicast broadcast services
    • Jun.
    • S. Sorour and S. Valaee, "An adaptive network coded retransmission scheme for single-hop wireless multicast broadcast services, " IEEE/ACM Trans. Netw., vol. 19, no. 3, pp. 869-878, Jun. 2011.
    • (2011) IEEE/ACM Trans. Netw. , vol.19 , Issue.3 , pp. 869-878
    • Sorour, S.1    Valaee, S.2
  • 46
    • 79952847450 scopus 로고    scopus 로고
    • Achievable rates for multiple descriptions with feed-forward
    • Apr.
    • R. Venkataramanan and S. S. Pradhan, "Achievable rates for multiple descriptions with feed-forward, " IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 2270-2277, Apr. 2011.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , Issue.4 , pp. 2270-2277
    • Venkataramanan, R.1    Pradhan, S.S.2
  • 47
    • 84863167985 scopus 로고    scopus 로고
    • On the capacity of wireless 1-hop intersession network coding-A broadcast packet erasure channel approach
    • Feb.
    • C.-C. Wang, "On the capacity of wireless 1-hop intersession network coding-A broadcast packet erasure channel approach, " IEEE Trans. Inf. Theory, vol. 58, no. 2, pp. 957-988, Feb. 2012.
    • (2012) IEEE Trans. Inf. Theory , vol.58 , Issue.2 , pp. 957-988
    • Wang, C.-C.1
  • 48
    • 84863115974 scopus 로고    scopus 로고
    • On the capacity of 1-to-K broadcast packet erasure channels with channel output feedback
    • Feb.
    • C.-C. Wang, "On the capacity of 1-to-K broadcast packet erasure channels with channel output feedback, " IEEE Trans. Inf. Theory, vol. 58, no. 2, pp. 931-956, Feb. 2012.
    • (2012) IEEE Trans. Inf. Theory , vol.58 , Issue.2 , pp. 931-956
    • Wang, C.-C.1
  • 49
    • 80053381657 scopus 로고    scopus 로고
    • FEC-based AP downlink transmission schemes for multiple flows: Combining the reliability and throughput enhancement of intra-and inter-flow coding
    • Nov.
    • C.-C. Wang, D. Koutsonikolas, Y. C. Hu, and N. Shroff, "FEC-based AP downlink transmission schemes for multiple flows: Combining the reliability and throughput enhancement of intra-and inter-flow coding, " Perform. Eval., vol. 68, no. 11, pp. 1118-1135, Nov. 2011.
    • (2011) Perform. Eval. , vol.68 , Issue.11 , pp. 1118-1135
    • Wang, C.-C.1    Koutsonikolas, D.2    Hu, Y.C.3    Shroff, N.4
  • 51
    • 84876503952 scopus 로고    scopus 로고
    • A survey on MPEG-4 streaming using network coding in wireless networks
    • Ahmedabad, India, Dec.
    • R. Shrimali and Z. Narmawala, "A survey on MPEG-4 streaming using network coding in wireless networks, " in Proc. Nirma Univ. Int. Conf. Eng. (NUiCONE), Ahmedabad, India, Dec. 2012, pp. 1-5.
    • (2012) Proc. Nirma Univ. Int. Conf. Eng. (NUiCONE) , pp. 1-5
    • Shrimali, R.1    Narmawala, Z.2
  • 53
    • 67650624465 scopus 로고    scopus 로고
    • Video-aware opportunistic network coding over wireless networks
    • Jun.
    • H. Seferoglu and A. Markopoulou, "Video-aware opportunistic network coding over wireless networks, " IEEE J. Sel. Areas Commun., vol. 27, no. 5, pp. 713-728, Jun. 2009.
    • (2009) IEEE J. Sel. Areas Commun. , vol.27 , Issue.5 , pp. 713-728
    • Seferoglu, H.1    Markopoulou, A.2
  • 54
    • 61449136820 scopus 로고    scopus 로고
    • Wireless broadcast using network coding
    • Feb.
    • D. Nguyen, T. Tran, T. Nguyen, and B. Bose, "Wireless broadcast using network coding, " IEEE Trans. Veh. Technol., vol. 58, no. 2, pp. 914-925, Feb. 2009.
    • (2009) IEEE Trans. Veh. Technol. , vol.58 , Issue.2 , pp. 914-925
    • Nguyen, D.1    Tran, T.2    Nguyen, T.3    Bose, B.4
  • 56
    • 77955406805 scopus 로고    scopus 로고
    • On minimizing broadcast completion delay for instantly decodable network coding
    • Cape Town, South Africa, May
    • S. Sorour and S. Valaee, "On minimizing broadcast completion delay for instantly decodable network coding, " in Proc. IEEE Int. Conf. Commun. (ICC), Cape Town, South Africa, May 2010, pp. 1-5.
    • (2010) Proc. IEEE Int. Conf. Commun. (ICC) , pp. 1-5
    • Sorour, S.1    Valaee, S.2
  • 57
    • 0036800732 scopus 로고    scopus 로고
    • A digital fountain approach to asynchronous reliable multicast
    • Oct.
    • J. W. Byers, M. Luby, and M. Mitzenmacher, "A digital fountain approach to asynchronous reliable multicast, " IEEE J. Sel. Areas Commun., vol. 20, no. 8, pp. 1528-1540, Oct. 2002.
    • (2002) IEEE J. Sel. Areas Commun. , vol.20 , Issue.8 , pp. 1528-1540
    • Byers, J.W.1    Luby, M.2    Mitzenmacher, M.3
  • 59
    • 84862927136 scopus 로고    scopus 로고
    • Optimal immediately-decodable inter-session network coding (IDNC) schemes for two unicast sessions with hard deadline constraints
    • Monticello, IL, USA, Sep.
    • X. Li, C.-C. Wang, and X. Lin, "Optimal immediately-decodable inter-session network coding (IDNC) schemes for two unicast sessions with hard deadline constraints, " in Proc. 49th Annu. Allerton Conf. Commun. Control Comput. (Allerton), Monticello, IL, USA, Sep. 2011, pp. 784-791.
    • (2011) Proc. 49th Annu. Allerton Conf. Commun. Control Comput. (Allerton) , pp. 784-791
    • Li, X.1    Wang, C.-C.2    Lin, X.3
  • 61
    • 79551642606 scopus 로고    scopus 로고
    • Minimum broadcast decoding delay for generalized instantly decodable network coding
    • Miami, FL, USA, Dec.
    • S. Sorour and S. Valaee, "Minimum broadcast decoding delay for generalized instantly decodable network coding, " in Proc. IEEE Glob. Telecommun. Conf. (GLOBECOM), Miami, FL, USA, Dec. 2010, pp. 1-5.
    • (2010) Proc. IEEE Glob. Telecommun. Conf. (GLOBECOM) , pp. 1-5
    • Sorour, S.1    Valaee, S.2
  • 62
    • 85028203751 scopus 로고    scopus 로고
    • Completion delay minimization for instantly decodable network codes
    • Oct.
    • S. Sorour and S. Valaee, "Completion delay minimization for instantly decodable network codes, " IEEE/ACM Trans. Netw., vol. 23, no. 5, pp. 1553-1567, Oct. 2015.
    • (2015) IEEE/ACM Trans. Netw. , vol.23 , Issue.5 , pp. 1553-1567
    • Sorour, S.1    Valaee, S.2
  • 63
    • 84857618948 scopus 로고    scopus 로고
    • Completion delay reduction in lossy feedback scenarios for instantly decodable network coding
    • Toronto, ON, Canada, Sep.
    • S. Sorour and S. Valaee, "Completion delay reduction in lossy feedback scenarios for instantly decodable network coding, " in Proc. IEEE 22nd Int. Symp. Pers. Indoor Mobile Radio Commun. (PIMRC), Toronto, ON, Canada, Sep. 2011, pp. 2025-2029.
    • (2011) Proc. IEEE 22nd Int. Symp. Pers. Indoor Mobile Radio Commun. (PIMRC) , pp. 2025-2029
    • Sorour, S.1    Valaee, S.2
  • 65
    • 45749150357 scopus 로고    scopus 로고
    • XORs in the air: Practical wireless network coding
    • Jun.
    • S. Katti et al., "XORs in the air: Practical wireless network coding, " IEEE/ACM Trans. Netw., vol. 16, no. 3, pp. 497-510, Jun. 2008.
    • (2008) IEEE/ACM Trans. Netw. , vol.16 , Issue.3 , pp. 497-510
    • Katti, S.1
  • 66
    • 84891674066 scopus 로고    scopus 로고
    • Delay reduction in persistent erasure channels for generalized instantly decodable network coding
    • Dresden, Germany, Jun.
    • S. Sorour et al., "Delay reduction in persistent erasure channels for generalized instantly decodable network coding, " in Proc. IEEE Veh. Technol. Conf. (VTC Fall), Dresden, Germany, Jun. 2013, pp. 1-5.
    • (2013) Proc. IEEE Veh. Technol. Conf. (VTC Fall) , pp. 1-5
    • Sorour, S.1
  • 68
    • 84891362978 scopus 로고    scopus 로고
    • Instantly decodable network coding protocols with unequal error protection
    • Budapest, Hungary, Jun.
    • M. Muhammad, M. Berioli, G. Liva, and G. Giambene, "Instantly decodable network coding protocols with unequal error protection, " in Proc. IEEE Int. Conf. Commun. (ICC), Budapest, Hungary, Jun. 2013, pp. 5120-5125.
    • (2013) Proc. IEEE Int. Conf. Commun. (ICC) , pp. 5120-5125
    • Muhammad, M.1    Berioli, M.2    Liva, G.3    Giambene, G.4
  • 69
  • 71
    • 84899427105 scopus 로고    scopus 로고
    • Instantly decodable network codes for cooperative index coding problem over general topologies
    • Sydney, NSW, Australia, Feb.
    • S. E. Tajbakhsh, P. Sadeghi, and N. Aboutorab, "Instantly decodable network codes for cooperative index coding problem over general topologies, " in Proc. Aust. Commun. Theory Workshop (AusCTW), Sydney, NSW, Australia, Feb. 2014, pp. 84-89.
    • (2014) Proc. Aust. Commun. Theory Workshop (AusCTW) , pp. 84-89
    • Tajbakhsh, S.E.1    Sadeghi, P.2    Aboutorab, N.3
  • 72
    • 33745179498 scopus 로고    scopus 로고
    • Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients
    • Jun.
    • Y. Birk and T. Kol, "Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients, " IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2825-2830, Jun. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.6 , pp. 2825-2830
    • Birk, Y.1    Kol, T.2
  • 73
    • 46749108105 scopus 로고    scopus 로고
    • On the minimum number of transmissions in single-hop wireless coding networks
    • Bergen, Norway, Sep.
    • S. Y. El Rouayheb, M. A. R. Chaudhry, and A. Sprintson, "On the minimum number of transmissions in single-hop wireless coding networks, " in Proc. IEEE Inf. Theory Workshop (ITW), Bergen, Norway, Sep. 2007, pp. 120-125.
    • (2007) Proc. IEEE Inf. Theory Workshop (ITW) , pp. 120-125
    • El Rouayheb, S.Y.1    Chaudhry, M.A.R.2    Sprintson, A.3
  • 74
    • 52349112954 scopus 로고    scopus 로고
    • On the relation between the index coding and the network coding problems
    • Toronto, ON, Canada, Jul.
    • S. El Rouayheb, A. Sprintson, and C. Georghiades, "On the relation between the index coding and the network coding problems, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Toronto, ON, Canada, Jul. 2008, pp. 1823-1827.
    • (2008) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 1823-1827
    • El Rouayheb, S.1    Sprintson, A.2    Georghiades, C.3
  • 78
    • 84890409069 scopus 로고    scopus 로고
    • Pliable index coding: The multiple requests case
    • Istanbul, Turkey, Jul.
    • S. Brahma and C. Fragouli, "Pliable index coding: The multiple requests case, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Istanbul, Turkey, Jul. 2013, pp. 1142-1146.
    • (2013) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 1142-1146
    • Brahma, S.1    Fragouli, C.2
  • 81
    • 84867536071 scopus 로고    scopus 로고
    • Index coding: An interference alignment perspective
    • Cambridge, MA, USA, Jul.
    • H. Maleki, V. Cadambe, and S. Jafar, "Index coding: An interference alignment perspective, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Cambridge, MA, USA, Jul. 2012, pp. 2236-2240.
    • (2012) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 2236-2240
    • Maleki, H.1    Cadambe, V.2    Jafar, S.3
  • 84
    • 79251507985 scopus 로고    scopus 로고
    • On the hardness of approximating the network coding capacity
    • Feb.
    • M. Langberg and A. Sprintson, "On the hardness of approximating the network coding capacity, " IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 1008-1014, Feb. 2011.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , Issue.2 , pp. 1008-1014
    • Langberg, M.1    Sprintson, A.2
  • 85
    • 84882737834 scopus 로고    scopus 로고
    • Broadcasting with side information: Bounding and approximating the broadcast rate
    • Sep.
    • A. Blasiak, R. Kleinberg, and E. Lubetzky, "Broadcasting with side information: Bounding and approximating the broadcast rate, " IEEE Trans. Inf. Theory, vol. 59, no. 9, pp. 5811-5823, Sep. 2013.
    • (2013) IEEE Trans. Inf. Theory , vol.59 , Issue.9 , pp. 5811-5823
    • Blasiak, A.1    Kleinberg, R.2    Lubetzky, E.3
  • 88
    • 47849096955 scopus 로고    scopus 로고
    • On queueing in coded networks-Queue size follows degrees of freedom
    • Bergen, Norway, Jul.
    • J. K. Sundararajan, D. Shah, and M. Medard, "On queueing in coded networks-Queue size follows degrees of freedom, " in Proc. IEEE Inf. Theory Workshop (ITW), Bergen, Norway, Jul. 2007, pp. 1-6.
    • (2007) Proc. IEEE Inf. Theory Workshop (ITW) , pp. 1-6
    • Sundararajan, J.K.1    Shah, D.2    Medard, M.3
  • 89
    • 84867555251 scopus 로고    scopus 로고
    • On densifying coding opportunities in instantly decodable network coding graphs
    • Cambridge, MA, USA, Jul.
    • S. Sorour and S. Valaee, "On densifying coding opportunities in instantly decodable network coding graphs, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Cambridge, MA, USA, Jul. 2012, pp. 2456-2460.
    • (2012) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 2456-2460
    • Sorour, S.1    Valaee, S.2
  • 90
    • 84891633799 scopus 로고    scopus 로고
    • Coding opportunity densification strategies for instantly decodable network coding
    • Dec.
    • S. Sorour and S. Valaee, "Coding opportunity densification strategies for instantly decodable network coding, " IEEE Trans. Commun., vol. 61, no. 12, pp. 5077-5089, Dec. 2013.
    • (2013) IEEE Trans. Commun. , vol.61 , Issue.12 , pp. 5077-5089
    • Sorour, S.1    Valaee, S.2
  • 91
    • 84897404721 scopus 로고    scopus 로고
    • Quality-aware instantly decodable network coding
    • Mar.
    • Y. Liu and C. W. Sung, "Quality-aware instantly decodable network coding, " IEEE Trans. Commun., vol. 13, no. 3, pp. 1604-1615, Mar. 2014.
    • (2014) IEEE Trans. Commun. , vol.13 , Issue.3 , pp. 1604-1615
    • Liu, Y.1    Sung, C.W.2
  • 94
    • 77954490203 scopus 로고    scopus 로고
    • An optimal adaptive network coding scheme for minimizing decoding delay in broadcast erasure channels
    • Jan.
    • P. Sadeghi, R. Shams, and D. Traskov, "An optimal adaptive network coding scheme for minimizing decoding delay in broadcast erasure channels, " EURASIP J. Wireless Commun. Netw., vol. 2010, pp. 1-14, Jan. 2010.
    • (2010) EURASIP J. Wireless Commun. Netw. , vol.2010 , pp. 1-14
    • Sadeghi, P.1    Shams, R.2    Traskov, D.3
  • 95
    • 0001365997 scopus 로고
    • Estimates of error rates for codes on burst-noise channels
    • Sep.
    • E. O. Elliott, "Estimates of error rates for codes on burst-noise channels, " Bell Syst. Tech. J., vol. 42, no. 5, pp. 1977-1997, Sep. 1963.
    • (1963) Bell Syst. Tech. J. , vol.42 , Issue.5 , pp. 1977-1997
    • Elliott, E.O.1
  • 96
    • 0024771807 scopus 로고
    • Capacity and coding for the Gilbert-Elliott channels
    • Nov.
    • M. Mushkin and I. Bar-David, "Capacity and coding for the Gilbert-Elliott channels, " IEEE Trans. Inf. Theory, vol. 35, no. 6, pp. 1277-1290, Nov. 1989.
    • (1989) IEEE Trans. Inf. Theory , vol.35 , Issue.6 , pp. 1277-1290
    • Mushkin, M.1    Bar-David, I.2
  • 97
    • 0028127649 scopus 로고
    • Evaluation of the performance of error-correcting codes on a Gilbert channel
    • New Orleans, LA, USA, May
    • J. R. Yee and E. J. Weldon, "Evaluation of the performance of error-correcting codes on a Gilbert channel, " in Proc. IEEE Int. Conf. Commun. (ICC), vol. 2. New Orleans, LA, USA, May 1994, pp. 655-659.
    • (1994) Proc. IEEE Int. Conf. Commun. (ICC) , vol.2 , pp. 655-659
    • Yee, J.R.1    Weldon, E.J.2
  • 98
    • 0029357792 scopus 로고
    • Evaluation of the performance of errorcorrecting codes on a Gilbert channel
    • Aug.
    • J. R. Yee and E. J. Weldon, "Evaluation of the performance of errorcorrecting codes on a Gilbert channel, " IEEE Trans. Commun., vol. 43, no. 8, pp. 2316-2323, Aug. 1995.
    • (1995) IEEE Trans. Commun. , vol.43 , Issue.8 , pp. 2316-2323
    • Yee, J.R.1    Weldon, E.J.2
  • 99
    • 0031167293 scopus 로고    scopus 로고
    • On the statistics of block errors in bursty channels
    • Jun.
    • M. Zorzi and R. R. Rao, "On the statistics of block errors in bursty channels, " IEEE Trans. Commun., vol. 45, no. 6, pp. 660-667, Jun. 1997.
    • (1997) IEEE Trans. Commun. , vol.45 , Issue.6 , pp. 660-667
    • Zorzi, M.1    Rao, R.R.2
  • 100
    • 85032751957 scopus 로고    scopus 로고
    • Finitestate Markov modeling of fading channels-A survey of principles and applications
    • Sep.
    • P. Sadeghi, R. A. Kennedy, P. B. Rapajic, and R. Shams, "Finitestate Markov modeling of fading channels-A survey of principles and applications, " IEEE Signal Process. Mag., vol. 25, no. 5, pp. 57-80, Sep. 2008.
    • (2008) IEEE Signal Process. Mag. , vol.25 , Issue.5 , pp. 57-80
    • Sadeghi, P.1    Kennedy, R.A.2    Rapajic, P.B.3    Shams, R.4
  • 101
    • 84871993603 scopus 로고    scopus 로고
    • Decoding delay reduction in broadcast erasure channels with memory for network coding
    • Sydney, NSW, Australia, Sep.
    • M. S. Karim and P. Sadeghi, "Decoding delay reduction in broadcast erasure channels with memory for network coding, " in Proc. IEEE 23rd Int. Symp. Pers. Indoor Mobile Radio Commun. (PIMRC), Sydney, NSW, Australia, Sep. 2012, pp. 60-65.
    • (2012) Proc. IEEE 23rd Int. Symp. Pers. Indoor Mobile Radio Commun. (PIMRC) , pp. 60-65
    • Karim, M.S.1    Sadeghi, P.2
  • 103
    • 84872143983 scopus 로고    scopus 로고
    • Optimizing completion delay in network coded systems over TDD erasure channels with memory
    • Gold Coast, QLD, Australia, Oct.
    • M. Esmaeilzadeh and P. Sadeghi, "Optimizing completion delay in network coded systems over TDD erasure channels with memory, " in Proc. IEEE Int. Symp. Commun. Inf. Technol. (ISCIT), Gold Coast, QLD, Australia, Oct. 2012, pp. 883-888.
    • (2012) Proc. IEEE Int. Symp. Commun. Inf. Technol. (ISCIT) , pp. 883-888
    • Esmaeilzadeh, M.1    Sadeghi, P.2
  • 104
    • 4444353884 scopus 로고    scopus 로고
    • Path diversity for enhanced media streaming
    • Aug.
    • J. G. Apostolopoulos and M. D. Trott, "Path diversity for enhanced media streaming, " IEEE Commun. Mag., vol. 42, no. 8, pp. 80-87, Aug. 2004.
    • (2004) IEEE Commun. Mag. , vol.42 , Issue.8 , pp. 80-87
    • Apostolopoulos, J.G.1    Trott, M.D.2
  • 105
    • 48649101127 scopus 로고    scopus 로고
    • Opportunistic network coding for video streaming over wireless
    • Lausanne, Switzerland, Nov.
    • H. Seferoglu and A. Markopoulou, "Opportunistic network coding for video streaming over wireless, " in Proc. Int. Packet Video Workshop (PV), Lausanne, Switzerland, Nov. 2007, pp. 191-200.
    • (2007) Proc. Int. Packet Video Workshop (PV) , pp. 191-200
    • Seferoglu, H.1    Markopoulou, A.2
  • 106
    • 84055217764 scopus 로고    scopus 로고
    • On the capacity of immediatelydecodable coding schemes for wireless stored-video broadcast with hard deadline constraints
    • May
    • X. Li, C.-C. Wang, and X. Lin, "On the capacity of immediatelydecodable coding schemes for wireless stored-video broadcast with hard deadline constraints, " IEEE J. Sel. Areas Commun., vol. 29, no. 5, pp. 1094-1105, May 2011.
    • (2011) IEEE J. Sel. Areas Commun. , vol.29 , Issue.5 , pp. 1094-1105
    • Li, X.1    Wang, C.-C.2    Lin, X.3
  • 107
    • 77953312508 scopus 로고    scopus 로고
    • Throughput and delay analysis on uncoded and coded wireless broadcast with hard deadline constraints
    • San Diego, CA, USA, Mar.
    • X. Li, C.-C. Wang, and X. Lin, "Throughput and delay analysis on uncoded and coded wireless broadcast with hard deadline constraints, " in Proc. IEEE Conf. Comput. Commun. (INFOCOM), San Diego, CA, USA, Mar. 2010, pp. 1-5.
    • (2010) Proc. IEEE Conf. Comput. Commun. (INFOCOM) , pp. 1-5
    • Li, X.1    Wang, C.-C.2    Lin, X.3
  • 108
    • 0018523303 scopus 로고
    • Capacity theorems for the relay channel
    • Sep.
    • T. Cover and A. E. Gamal, "Capacity theorems for the relay channel, " IEEE Trans. Inf. Theory, vol. 25, no. 5, pp. 572-584, Sep. 1979.
    • (1979) IEEE Trans. Inf. Theory , vol.25 , Issue.5 , pp. 572-584
    • Cover, T.1    Gamal, A.E.2
  • 109
  • 110
    • 33947709388 scopus 로고    scopus 로고
    • Cooperative relay broadcast channels
    • Mar.
    • Y. Liang and V. V. Veeravalli, "Cooperative relay broadcast channels, " IEEE Trans. Inf. Theory, vol. 53, no. 3, pp. 900-928, Mar. 2007.
    • (2007) IEEE Trans. Inf. Theory , vol.53 , Issue.3 , pp. 900-928
    • Liang, Y.1    Veeravalli, V.V.2
  • 111
    • 26444619804 scopus 로고    scopus 로고
    • Cooperative strategies and capacity theorems for relay networks
    • Sep.
    • G. Kramer, M. Gastpar, and P. Gupta, "Cooperative strategies and capacity theorems for relay networks, " IEEE Trans. Inf. Theory, vol. 51, no. 9, pp. 3037-3063, Sep. 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.9 , pp. 3037-3063
    • Kramer, G.1    Gastpar, M.2    Gupta, P.3
  • 112
    • 35148893037 scopus 로고    scopus 로고
    • Introduction to the special issue on models, theory, and codes for relaying and cooperation in communication networks
    • Oct.
    • G. K. Kramer, "Introduction to the special issue on models, theory, and codes for relaying and cooperation in communication networks, " IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3297-3301, Oct. 2007.
    • (2007) IEEE Trans. Inf. Theory , vol.53 , Issue.10 , pp. 3297-3301
    • Kramer, G.K.1
  • 113
    • 80053001617 scopus 로고    scopus 로고
    • Relay-aided broadcasting with instantaneously decodable binary network codes
    • Maui, HI, USA, Jul. /Aug.
    • L. Lu, M. Xiao, and L. K. Rasmussen, "Relay-aided broadcasting with instantaneously decodable binary network codes, " in Proc. 20th Int. Conf. Comput. Commun. Netw. (ICCCN), Maui, HI, USA, Jul. /Aug. 2011, pp. 1-5.
    • (2011) Proc. 20th Int. Conf. Comput. Commun. Netw. (ICCCN) , pp. 1-5
    • Lu, L.1    Xiao, M.2    Rasmussen, L.K.3
  • 114
    • 80655142302 scopus 로고    scopus 로고
    • Design and analysis of relayaided broadcast using binary network codes
    • L. Lu, M. Xiao, and L. K. Rasmussen, "Design and analysis of relayaided broadcast using binary network codes, " J. Commun., vol. 6, no. 8, pp. 610-617, 2011.
    • (2011) J. Commun. , vol.6 , Issue.8 , pp. 610-617
    • Lu, L.1    Xiao, M.2    Rasmussen, L.K.3
  • 116
    • 51549111600 scopus 로고    scopus 로고
    • Hybrid ARQ-random network coding for wireless media streaming
    • Las Vegas, NV, USA, Jun.
    • D. Nguyen, T. Tran, T. Nguyen, and B. Bose, "Hybrid ARQ-random network coding for wireless media streaming, " in Proc. 2nd Int. Conf. Commun. Electron. (ICCE), Las Vegas, NV, USA, Jun. 2008, pp. 115-120.
    • (2008) Proc. 2nd Int. Conf. Commun. Electron. (ICCE) , pp. 115-120
    • Nguyen, D.1    Tran, T.2    Nguyen, T.3    Bose, B.4
  • 117
    • 33745132205 scopus 로고    scopus 로고
    • Optimal distributed multicast routing using network coding: Theory and applications
    • Y. Cui, Y. Xue, and K. Nahrstedt, "Optimal distributed multicast routing using network coding: Theory and applications, " SIGMETRICS Perform. Eval. Rev., vol. 32, no. 2, pp. 47-49, 2004.
    • (2004) SIGMETRICS Perform. Eval. Rev. , vol.32 , Issue.2 , pp. 47-49
    • Cui, Y.1    Xue, Y.2    Nahrstedt, K.3
  • 118
    • 20544473127 scopus 로고    scopus 로고
    • Polynomial time algorithms for multicast network code construction
    • Jun.
    • S. Jaggi et al., "Polynomial time algorithms for multicast network code construction, " IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, Jun. 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.6 , pp. 1973-1982
    • Jaggi, S.1
  • 119
    • 84883337798 scopus 로고    scopus 로고
    • Broadcast erasure channel with feedback: The two multicast case-Algorithms and bounds
    • Calgary, AB, Canada, Jun.
    • E. Onaran, M. Gatzianas, and C. Fragouli, "Broadcast erasure channel with feedback: The two multicast case-Algorithms and bounds, " in Proc. Int. Symp. Netw. Coding (NetCod), Calgary, AB, Canada, Jun. 2013, pp. 1-6.
    • (2013) Proc. Int. Symp. Netw. Coding (NetCod) , pp. 1-6
    • Onaran, E.1    Gatzianas, M.2    Fragouli, C.3
  • 120
    • 25844504259 scopus 로고    scopus 로고
    • Achieving minimum-cost multicast: A decentralized approach based on network coding
    • Miami, FL, USA, Mar.
    • D. S. Lun et al., "Achieving minimum-cost multicast: A decentralized approach based on network coding, " in Proc. IEEE 24th Annu. Joint Conf. Comput. Commun. (INFOCOM), vol. 3. Miami, FL, USA, Mar. 2005, pp. 1607-1617.
    • (2005) Proc. IEEE 24th Annu. Joint Conf. Comput. Commun. (INFOCOM) , vol.3 , pp. 1607-1617
    • Lun, D.S.1
  • 121
    • 67650647554 scopus 로고    scopus 로고
    • Reliable relay assisted wireless multicast using network coding
    • Jun.
    • P. Fan, C. Zhi, C. Wei, and K. B. Letaief, "Reliable relay assisted wireless multicast using network coding, " IEEE J. Sel. Areas Commun., vol. 27, no. 5, pp. 749-762, Jun. 2009.
    • (2009) IEEE J. Sel. Areas Commun. , vol.27 , Issue.5 , pp. 749-762
    • Fan, P.1    Zhi, C.2    Wei, C.3    Letaief, K.B.4
  • 122
    • 84890421344 scopus 로고    scopus 로고
    • Rapprochement between instantly decodable and random linear network coding
    • Istanbul, Turkey, Jul.
    • M. Yu, N. Aboutorab, and P. Sadeghi, "Rapprochement between instantly decodable and random linear network coding, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Istanbul, Turkey, Jul. 2013, pp. 3090-3094.
    • (2013) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 3090-3094
    • Yu, M.1    Aboutorab, N.2    Sadeghi, P.3
  • 123
    • 84912531129 scopus 로고    scopus 로고
    • From instantly decodable to random linear network coded broadcast
    • Nov.
    • M. Yu, N. Aboutorab, and P. Sadeghi, "From instantly decodable to random linear network coded broadcast, " IEEE Trans. Commun., vol. 62, no. 11, pp. 3943-3955, Nov. 2014.
    • (2014) IEEE Trans. Commun. , vol.62 , Issue.11 , pp. 3943-3955
    • Yu, M.1    Aboutorab, N.2    Sadeghi, P.3
  • 124
    • 70449512092 scopus 로고    scopus 로고
    • Adaptive network coded retransmission scheme for wireless multicast
    • Seoul, South Korea, Jun. /Jul.
    • S. Sorour and S. Valaee, "Adaptive network coded retransmission scheme for wireless multicast, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Seoul, South Korea, Jun. /Jul. 2009, pp. 2577-2581.
    • (2009) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 2577-2581
    • Sorour, S.1    Valaee, S.2
  • 128
    • 84867997005 scopus 로고    scopus 로고
    • A fast algorithm for the maximum clique problem
    • P. R. J. Östergard, "A fast algorithm for the maximum clique problem, " Discrete Appl. Math., vol. 120, nos. 1-3, pp. 197-207, 2002.
    • (2002) Discrete Appl. Math. , vol.120 , Issue.1-3 , pp. 197-207
    • Östergard, P.R.J.1
  • 130
    • 57749112866 scopus 로고    scopus 로고
    • Efficient algorithms for clique problems
    • V. Vassilevska, "Efficient algorithms for clique problems, " Inf. Process. Lett., vol. 109, no. 4, pp. 254-257, 2009.
    • (2009) Inf. Process. Lett. , vol.109 , Issue.4 , pp. 254-257
    • Vassilevska, V.1
  • 133
    • 84919430150 scopus 로고    scopus 로고
    • On minimizing the maximum broadcast decoding delay for instantly decodable network coding
    • Vancouver, BC, Canada
    • A. Douik, S. Sorour, M.-S. Alouini, and T. Y. Al-Naffouri, "On minimizing the maximum broadcast decoding delay for instantly decodable network coding, " in Proc. IEEE Veh. Technol. Conf. (VTC Fall), Vancouver, BC, Canada, 2014, pp. 1-5.
    • (2014) Proc. IEEE Veh. Technol. Conf. (VTC Fall) , pp. 1-5
    • Douik, A.1    Sorour, S.2    Alouini, M.-S.3    Al-Naffouri, T.Y.4
  • 134
    • 84907195521 scopus 로고    scopus 로고
    • Partially blind instantly decodable network codes for lossy feedback environment
    • Sep.
    • S. Sorour, A. Douik, S. Valaee, T. Y. Al-Naffouri, and M.-S. Alouini, "Partially blind instantly decodable network codes for lossy feedback environment, " IEEE Trans. Wireless Commun., vol. 13, no. 9, pp. 4871-4883, Sep. 2014.
    • (2014) IEEE Trans. Wireless Commun. , vol.13 , Issue.9 , pp. 4871-4883
    • Sorour, S.1    Douik, A.2    Valaee, S.3    Al-Naffouri, T.Y.4    Alouini, M.-S.5
  • 135
    • 84899985281 scopus 로고    scopus 로고
    • Enabling a tradeoff between completion time and decoding delay in instantly decodable network coded systems
    • Apr.
    • N. Aboutorab, P. Sadeghi, and S. Sorour, "Enabling a tradeoff between completion time and decoding delay in instantly decodable network coded systems, " IEEE Trans. Commun., vol. 62, no. 4, pp. 1296-1309, Apr. 2014.
    • (2014) IEEE Trans. Commun. , vol.62 , Issue.4 , pp. 1296-1309
    • Aboutorab, N.1    Sadeghi, P.2    Sorour, S.3
  • 136
    • 84891353320 scopus 로고    scopus 로고
    • Collaborative multi-layer network coding for cellular cognitive radio networks
    • Sydney, NSW, Australia, Jun.
    • S. Sorour, T. Y. Al-Naffouri, and M.-S. Alouini, "Collaborative multi-layer network coding for cellular cognitive radio networks, " in Proc. IEEE Int. Conf. Commun. (ICC), Sydney, NSW, Australia, Jun. 2013, pp. 5986-5990.
    • (2013) Proc. IEEE Int. Conf. Commun. (ICC) , pp. 5986-5990
    • Sorour, S.1    Al-Naffouri, T.Y.2    Alouini, M.-S.3
  • 138
    • 84880154814 scopus 로고    scopus 로고
    • Instantly decodable network coding schemes for in-order progressive retransmission
    • Jun.
    • S. Wang, C. Gong, X. Wang, and M. Liang, "Instantly decodable network coding schemes for in-order progressive retransmission, " IEEE Commun. Lett., vol. 17, no. 6, pp. 1069-1072, Jun. 2013.
    • (2013) IEEE Commun. Lett. , vol.17 , Issue.6 , pp. 1069-1072
    • Wang, S.1    Gong, C.2    Wang, X.3    Liang, M.4
  • 139
    • 80053035107 scopus 로고    scopus 로고
    • A feedback-based adaptive broadcast coding scheme for reducing in-order delivery delay
    • Lausanne, Switzerland, Jun.
    • J. K. Sundararajan, P. Sadeghi, and M. Medard, "A feedback-based adaptive broadcast coding scheme for reducing in-order delivery delay, " in Proc. Workshop Netw. Coding Theory Appl. (NetCod), Lausanne, Switzerland, Jun. 2009, pp. 1-6.
    • (2009) Proc. Workshop Netw. Coding Theory Appl. (NetCod) , pp. 1-6
    • Sundararajan, J.K.1    Sadeghi, P.2    Medard, M.3
  • 140
    • 80052159069 scopus 로고    scopus 로고
    • Completion delay minimization for instantly decodable network coding with limited feedback
    • Kyoto, Japan, Jun.
    • S. Sorour and S. Valaee, "Completion delay minimization for instantly decodable network coding with limited feedback, " in Proc. IEEE Int. Conf. Commun. (ICC), Kyoto, Japan, Jun. 2011, pp. 1-5.
    • (2011) Proc. IEEE Int. Conf. Commun. (ICC) , pp. 1-5
    • Sorour, S.1    Valaee, S.2
  • 142
    • 41749121006 scopus 로고    scopus 로고
    • On coding for reliable communication over packet networks
    • D. S. Lun, M. Médard, R. Koetter, and M. Effros, "On coding for reliable communication over packet networks, " Phys. Commun., vol. 1, no. 1, pp. 3-20, 2008.
    • (2008) Phys. Commun. , vol.1 , Issue.1 , pp. 3-20
    • Lun, D.S.1    Médard, M.2    Koetter, R.3    Effros, M.4
  • 143
    • 84952949628 scopus 로고    scopus 로고
    • Delay reduction for instantly decodable network coding in persistent channels with feedback imperfections
    • Nov.
    • A. Douik, S. Sorour, T. Y. Al-Naffouri, and M.-S. Alouini, "Delay reduction for instantly decodable network coding in persistent channels with feedback imperfections, " IEEE Trans. Wireless Commun., vol. 14, no. 11, pp. 5956-5970, Nov. 2015.
    • (2015) IEEE Trans. Wireless Commun. , vol.14 , Issue.11 , pp. 5956-5970
    • Douik, A.1    Sorour, S.2    Al-Naffouri, T.Y.3    Alouini, M.-S.4
  • 144
    • 84903315735 scopus 로고    scopus 로고
    • A lossy graph model for delay reduction in generalized instantly decodable network coding
    • Jun.
    • A. Douik, S. Sorour, T. Y. Al-Naffouri, and M.-S. Alouini, "A lossy graph model for delay reduction in generalized instantly decodable network coding, " IEEE Wireless Commun. Lett., vol. 3, no. 3, pp. 281-284, Jun. 2014.
    • (2014) IEEE Wireless Commun. Lett. , vol.3 , Issue.3 , pp. 281-284
    • Douik, A.1    Sorour, S.2    Al-Naffouri, T.Y.3    Alouini, M.-S.4
  • 147
    • 85032771112 scopus 로고    scopus 로고
    • Multiple description coding: Compression meets the network
    • Sep.
    • V. K. Goyal, "Multiple description coding: Compression meets the network, " IEEE Signal Process. Mag., vol. 18, no. 5, pp. 74-93, Sep. 2001.
    • (2001) IEEE Signal Process. Mag. , vol.18 , Issue.5 , pp. 74-93
    • Goyal, V.K.1
  • 149
    • 34548309486 scopus 로고    scopus 로고
    • Bounds on the gain of network coding and broadcasting in wireless networks
    • Anchorage, AK, USA, May
    • J. Liu, D. Goeckel, and D. Towsley, "Bounds on the gain of network coding and broadcasting in wireless networks, " in Proc. IEEE 26th Annu. Joint Conf. Comput. Commun. (INFOCOM), Anchorage, AK, USA, May 2007, pp. 724-732.
    • (2007) Proc. IEEE 26th Annu. Joint Conf. Comput. Commun. (INFOCOM) , pp. 724-732
    • Liu, J.1    Goeckel, D.2    Towsley, D.3
  • 150
    • 79956210516 scopus 로고    scopus 로고
    • On transmission efficiency for wireless broadcast using network coding and fountain codes
    • May
    • H. D. T. Nguyen, L.-N. Tran, and E.-K. Hong, "On transmission efficiency for wireless broadcast using network coding and fountain codes, " IEEE Commun. Lett., vol. 15, no. 5, pp. 569-571, May 2011.
    • (2011) IEEE Commun. Lett. , vol.15 , Issue.5 , pp. 569-571
    • Nguyen, H.D.T.1    Tran, L.-N.2    Hong, E.-K.3
  • 151
    • 84988259078 scopus 로고    scopus 로고
    • Completion time reduction in instantly decodable network coding through decoding delay control
    • Austin, TX, USA, Dec.
    • A. Douik, S. Sorour, M.-S. Alouini, and T. Y. Al-Naffouri, "Completion time reduction in instantly decodable network coding through decoding delay control, " in Proc. IEEE Glob. Telecommun. Conf. (GLOBECOM), Austin, TX, USA, Dec. 2014, pp. 5008-5013.
    • (2014) Proc. IEEE Glob. Telecommun. Conf. (GLOBECOM) , pp. 5008-5013
    • Douik, A.1    Sorour, S.2    Alouini, M.-S.3    Al-Naffouri, T.Y.4
  • 152
    • 85014955266 scopus 로고    scopus 로고
    • Decoding delay controlled completion time reduction in instantly decodable network coding
    • to be published
    • A. Douik, S. Sorour, T. Y. Al-Naffouri, and M.-S. Alouini, "Decoding delay controlled completion time reduction in instantly decodable network coding, " IEEE Trans. Veh. Technol., to be published.
    • IEEE Trans. Veh. Technol.
    • Douik, A.1    Sorour, S.2    Al-Naffouri, T.Y.3    Alouini, M.-S.4
  • 155
    • 0031352450 scopus 로고    scopus 로고
    • A discrete binary version of the particle swarm algorithm
    • Aveiro, Portugal, Oct.
    • J. Kennedy and R. C. Eberhart, "A discrete binary version of the particle swarm algorithm, " in Proc. IEEE Int. Conf. Syst. Man Cybern. (ICSMC), vol. 5. Aveiro, Portugal, Oct. 1997, pp. 4104-4108.
    • (1997) Proc. IEEE Int. Conf. Syst. Man Cybern. (ICSMC) , vol.5 , pp. 4104-4108
    • Kennedy, J.1    Eberhart, R.C.2
  • 158
    • 0002338687 scopus 로고
    • A genetic algorithm tutorial
    • D. Whitley, "A genetic algorithm tutorial, " Stat. Comput., vol. 4, no. 2, pp. 65-85, 1994.
    • (1994) Stat. Comput. , vol.4 , Issue.2 , pp. 65-85
    • Whitley, D.1
  • 159
    • 84989923170 scopus 로고    scopus 로고
    • Delivery time reduction for order-constrained applications using binary network codes
    • Doha, Qatar, Apr.
    • A. Douik, M. S. Karim, P. Sadeghi, and S. Sorour, "Delivery time reduction for order-constrained applications using binary network codes, " in Proc. IEEE Wireless Commun. Netw. Conf. (WCNC), Doha, Qatar, Apr. 2016, pp. 1-6.
    • (2016) Proc. IEEE Wireless Commun. Netw. Conf. (WCNC) , pp. 1-6
    • Douik, A.1    Karim, M.S.2    Sadeghi, P.3    Sorour, S.4
  • 160
    • 46449101552 scopus 로고    scopus 로고
    • Cooperative peerto-peer repair for wireless multimedia broadcast
    • Beijing, China, Jul.
    • S. Raza, D. Li, C.-N. Chuah, and G. Cheung, "Cooperative peerto-peer repair for wireless multimedia broadcast, " in Proc. IEEE Int. Conf. Multimedia Expo (ICME), Beijing, China, Jul. 2007, pp. 1075-1078.
    • (2007) Proc. IEEE Int. Conf. Multimedia Expo (ICME) , pp. 1075-1078
    • Raza, S.1    Li, D.2    Chuah, C.-N.3    Cheung, G.4
  • 161
    • 0345258506 scopus 로고    scopus 로고
    • User cooperation diversity. Part I. System description
    • Nov.
    • A. Sendonaris, E. Erkip, and B. Aazhang, "User cooperation diversity. Part I. System description, " IEEE Trans. Commun., vol. 51, no. 11, pp. 1927-1938, Nov. 2003.
    • (2003) IEEE Trans. Commun. , vol.51 , Issue.11 , pp. 1927-1938
    • Sendonaris, A.1    Erkip, E.2    Aazhang, B.3
  • 162
    • 84893224268 scopus 로고    scopus 로고
    • Delay minimization for network coded cooperative data exchange with rate adaptation
    • Dresden, Germany, Sep.
    • X. Wang, C. Yuen, and S. H. Dau, "Delay minimization for network coded cooperative data exchange with rate adaptation, " in Proc. IEEE Veh. Technol. Conf. (VTC Fall), Dresden, Germany, Sep. 2013, pp. 1-5.
    • (2013) Proc. IEEE Veh. Technol. Conf. (VTC Fall) , pp. 1-5
    • Wang, X.1    Yuen, C.2    Dau, S.H.3
  • 163
    • 82455168078 scopus 로고    scopus 로고
    • Generalized adaptive network coded cooperation (GANCC): A unified framework for network coding and channel coding
    • Nov.
    • X. Bao and J. T. Li, "Generalized adaptive network coded cooperation (GANCC): A unified framework for network coding and channel coding, " IEEE Trans. Commun., vol. 59, no. 11, pp. 2934-2938, Nov. 2011.
    • (2011) IEEE Trans. Commun. , vol.59 , Issue.11 , pp. 2934-2938
    • Bao, X.1    Li, J.T.2
  • 164
    • 51249119166 scopus 로고    scopus 로고
    • Network coding based cooperative peer-to-peer repair in wireless ad-hoc networks
    • Beijing, China, May
    • X. Liu, S. Raza, C.-N. Chuah, and G. Cheung, "Network coding based cooperative peer-to-peer repair in wireless ad-hoc networks, " in Proc. IEEE Int. Conf. Commun. (ICC), Beijing, China, May 2008, pp. 2153-2158.
    • (2008) Proc. IEEE Int. Conf. Commun. (ICC) , pp. 2153-2158
    • Liu, X.1    Raza, S.2    Chuah, C.-N.3    Cheung, G.4
  • 166
    • 77955680715 scopus 로고    scopus 로고
    • A randomized algorithm and performance bounds for coded cooperative data exchange
    • Austin, TX, USA, Jun.
    • A. Sprintson, P. Sadeghi, G. Booker, and S. El Rouayheb, "A randomized algorithm and performance bounds for coded cooperative data exchange, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Austin, TX, USA, Jun. 2010, pp. 1888-1892.
    • (2010) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 1888-1892
    • Sprintson, A.1    Sadeghi, P.2    Booker, G.3    El Rouayheb, S.4
  • 167
    • 80053030424 scopus 로고    scopus 로고
    • A generalized model for cost and fairness analysis in coded cooperative data exchange
    • Chengdu, China, Jul.
    • S. E. Tajbakhsh, P. Sadeghi, and R. Shams, "A generalized model for cost and fairness analysis in coded cooperative data exchange, " in Proc. Int. Symp. Netw. Coding (NetCod), Chengdu, China, Jul. 2011, pp. 1-6.
    • (2011) Proc. Int. Symp. Netw. Coding (NetCod) , pp. 1-6
    • Tajbakhsh, S.E.1    Sadeghi, P.2    Shams, R.3
  • 168
    • 79951663246 scopus 로고    scopus 로고
    • Optimal exchange of packets for universal recovery in broadcast networks
    • San Jose, CA, USA, Oct.
    • T. A. Courtade, B. Xie, and R. D. Wesel, "Optimal exchange of packets for universal recovery in broadcast networks, " in Proc. Mil. Commun. Conf. (MILCOM), San Jose, CA, USA, Oct. 2010, pp. 2250-2255.
    • (2010) Proc. Mil. Commun. Conf. (MILCOM) , pp. 2250-2255
    • Courtade, T.A.1    Xie, B.2    Wesel, R.D.3
  • 169
    • 23844535205 scopus 로고    scopus 로고
    • Insufficiency of linear coding in network information flow
    • Adelaide, SA, Australia, Sep.
    • R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Adelaide, SA, Australia, Sep. 2005, pp. 264-267.
    • (2005) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 264-267
    • Dougherty, R.1    Freiling, C.2    Zeger, K.3
  • 170
    • 23844535205 scopus 로고    scopus 로고
    • Insufficiency of linear coding in network information flow
    • Aug.
    • R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow, " IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2745-2759, Aug. 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.8 , pp. 2745-2759
    • Dougherty, R.1    Freiling, C.2    Zeger, K.3
  • 173
    • 84873171001 scopus 로고    scopus 로고
    • Coded cooperative data exchange for multiple unicasts
    • Lausanne, Switzerland, Sep.
    • S. E. Tajbakhsh and P. Sadeghi, "Coded cooperative data exchange for multiple unicasts, " in Proc. IEEE Inf. Theory Workshop (ITW), Lausanne, Switzerland, Sep. 2012, pp. 587-591.
    • (2012) Proc. IEEE Inf. Theory Workshop (ITW) , pp. 587-591
    • Tajbakhsh, S.E.1    Sadeghi, P.2
  • 175
    • 79955779122 scopus 로고    scopus 로고
    • An algorithm for cooperative data exchange with cost criterion
    • San Diego, CA, USA, Feb.
    • D. Ozgul and A. Sprintson, "An algorithm for cooperative data exchange with cost criterion, " in Proc. Inf. Theory Appl. Workshop (ITA), San Diego, CA, USA, Feb. 2011, pp. 1-4.
    • (2011) Proc. Inf. Theory Appl. Workshop (ITA) , pp. 1-4
    • Ozgul, D.1    Sprintson, A.2
  • 177
    • 84893441364 scopus 로고    scopus 로고
    • Coded cooperative data exchange in multihop networks
    • Feb.
    • T. A. Courtade and R. D. Wesel, "Coded cooperative data exchange in multihop networks, " IEEE Trans. Inf. Theory, vol. 60, no. 2, pp. 1136-1158, Feb. 2014.
    • (2014) IEEE Trans. Inf. Theory , vol.60 , Issue.2 , pp. 1136-1158
    • Courtade, T.A.1    Wesel, R.D.2
  • 178
    • 84867506651 scopus 로고    scopus 로고
    • Coded cooperative data exchange problem for general topologies
    • Cambridge, MA, USA, Jul.
    • M. Gonen and M. Langberg, "Coded cooperative data exchange problem for general topologies, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Cambridge, MA, USA, Jul. 2012, pp. 2606-2610.
    • (2012) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 2606-2610
    • Gonen, M.1    Langberg, M.2
  • 179
    • 84890354077 scopus 로고    scopus 로고
    • Instantly decodable network coding for delay reduction in cooperative data exchange systems
    • Istanbul, Turkey, Jul.
    • N. Aboutorab, P. Sadeghi, and S. E. Tajbakhsh, "Instantly decodable network coding for delay reduction in cooperative data exchange systems, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Istanbul, Turkey, Jul. 2013, pp. 3095-3099.
    • (2013) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 3095-3099
    • Aboutorab, N.1    Sadeghi, P.2    Tajbakhsh, S.E.3
  • 182
    • 84961878185 scopus 로고    scopus 로고
    • Delay minimization for relay-based cooperative data exchange with network coding
    • Dec.
    • Z. Dong, S. H. Dau, C. Yuen, Y. Gu, and X. Wang, "Delay minimization for relay-based cooperative data exchange with network coding, " IEEE/ACM Trans. Netw., vol. 23, no. 6, pp. 1890-1902, Dec. 2015.
    • (2015) IEEE/ACM Trans. Netw. , vol.23 , Issue.6 , pp. 1890-1902
    • Dong, Z.1    Dau, S.H.2    Yuen, C.3    Gu, Y.4    Wang, X.5
  • 183
    • 84952936572 scopus 로고    scopus 로고
    • Instantly decodable network coding for real-time device-to-device communications
    • A. Douik, S. Sorour, T. Y. Al-Naffouri, and M.-S. Alouini, "Instantly decodable network coding for real-time device-to-device communications, " EURASIP J. Adv. Signal Process., vol. 2016, no. 1, pp. 1-14, 2016.
    • (2016) EURASIP J. Adv. Signal Process. , vol.2016 , Issue.1 , pp. 1-14
    • Douik, A.1    Sorour, S.2    Al-Naffouri, T.Y.3    Alouini, M.-S.4
  • 190
    • 50649108177 scopus 로고    scopus 로고
    • Network coding games with unicast flows
    • Sep.
    • J. Price and T. Javidi, "Network coding games with unicast flows, " IEEE J. Sel. Areas Commun., vol. 26, no. 7, pp. 1302-1316, Sep. 2008.
    • (2008) IEEE J. Sel. Areas Commun. , vol.26 , Issue.7 , pp. 1302-1316
    • Price, J.1    Javidi, T.2
  • 191
    • 84893433900 scopus 로고    scopus 로고
    • The price of stability for undirected broadcast network design with fair cost allocation is constant
    • Berkeley, CA, USA, Oct.
    • V. Bilo, M. Flammini, and L. Moscardelli, "The price of stability for undirected broadcast network design with fair cost allocation is constant, " in Proc. IEEE 54th Annu. Symp. Found. Comput. Sci. (FOCS), Berkeley, CA, USA, Oct. 2013, pp. 638-647.
    • (2013) Proc. IEEE 54th Annu. Symp. Found. Comput. Sci. (FOCS) , pp. 638-647
    • Bilo, V.1    Flammini, M.2    Moscardelli, L.3
  • 193
  • 194
  • 195
    • 0000579136 scopus 로고
    • Existence and uniqueness of equilibrium points for concave N-person games
    • J. B. Rosen, "Existence and uniqueness of equilibrium points for concave N-person games, " Econometrica, vol. 33, no. 3, pp. 520-534, 1965.
    • (1965) Econometrica , vol.33 , Issue.3 , pp. 520-534
    • Rosen, J.B.1
  • 197
    • 84949922286 scopus 로고    scopus 로고
    • A game theoretic approach to minimize the completion time of network coded cooperative data exchange
    • Austin, TX, USA, Dec.
    • A. Douik, S. Sorour, H. Tembine, M.-S. Alouini, and T. Y. Al-Naffouri, "A game theoretic approach to minimize the completion time of network coded cooperative data exchange, " in Proc. IEEE Glob. Telecommun. Conf. (GLOBECOM), Austin, TX, USA, Dec. 2014, pp. 1583-1589.
    • (2014) Proc. IEEE Glob. Telecommun. Conf. (GLOBECOM) , pp. 1583-1589
    • Douik, A.1    Sorour, S.2    Tembine, H.3    Alouini, M.-S.4    Al-Naffouri, T.Y.5
  • 198
    • 85015743248 scopus 로고    scopus 로고
    • The legacy of Augustin Cournot
    • J. W. Friedman, "The legacy of Augustin Cournot, " Cahiers D'économie Politique, vol. 37, no. 1, pp. 31-46, 2000.
    • (2000) Cahiers d'Économie Politique , vol.37 , Issue.1 , pp. 31-46
    • Friedman, J.W.1
  • 199
    • 0034424039 scopus 로고    scopus 로고
    • Best-response potential games
    • M. Voorneveld, "Best-response potential games, " Econ. Lett., vol. 66, no. 3, pp. 289-295, 2000.
    • (2000) Econ. Lett. , vol.66 , Issue.3 , pp. 289-295
    • Voorneveld, M.1
  • 200
    • 85015754518 scopus 로고    scopus 로고
    • A game-theoretic framework for network coding based device-todevice communications
    • A. Douik, S. Sorour, H. Tembine, T. Y. Al-Naffouri, and M. S. Alouini, "A game-theoretic framework for network coding based device-todevice communications, " IEEE Trans. Mobile Comput., vol. PP, no. 99, p. 1, doi: 10. 1109/TMC. 2016. 2586068.
    • IEEE Trans. Mobile Comput. , vol.PP , Issue.99 , pp. 1
    • Douik, A.1    Sorour, S.2    Tembine, H.3    Al-Naffouri, T.Y.4    Alouini, M.S.5
  • 201
    • 0031281590 scopus 로고    scopus 로고
    • Learning through reinforcement and replicator dynamics
    • T. Börgers and R. Sarin, "Learning through reinforcement and replicator dynamics, " J. Econ. Theory, vol. 77, no. 1, pp. 1-14, 1997.
    • (1997) J. Econ. Theory , vol.77 , Issue.1 , pp. 1-14
    • Börgers, T.1    Sarin, R.2
  • 203
    • 78649738324 scopus 로고    scopus 로고
    • Multi-cell MIMO cooperative networks: A new look at interference
    • Dec.
    • D. Gesbert et al., "Multi-cell MIMO cooperative networks: A new look at interference, " IEEE J. Sel. Areas Commun., vol. 28, no. 9, pp. 1380-1408, Dec. 2010.
    • (2010) IEEE J. Sel. Areas Commun. , vol.28 , Issue.9 , pp. 1380-1408
    • Gesbert, D.1
  • 204
    • 84904997657 scopus 로고    scopus 로고
    • Min flow rate maximization for software defined radio access networks
    • Jun.
    • W.-C. Liao et al., "Min flow rate maximization for software defined radio access networks, " IEEE J. Sel. Areas Commun., vol. 32, no. 6, pp. 1282-1294, Jun. 2014.
    • (2014) IEEE J. Sel. Areas Commun. , vol.32 , Issue.6 , pp. 1282-1294
    • Liao, W.-C.1
  • 205
    • 84875157740 scopus 로고    scopus 로고
    • Seven ways that HetNets are a cellular paradigm shift
    • Mar.
    • J. G. Andrews, "Seven ways that HetNets are a cellular paradigm shift, " IEEE Commun. Mag., vol. 51, no. 3, pp. 136-144, Mar. 2013.
    • (2013) IEEE Commun. Mag. , vol.51 , Issue.3 , pp. 136-144
    • Andrews, J.G.1
  • 206
    • 0042474436 scopus 로고    scopus 로고
    • Optimal routing, link scheduling and power control in multihop wireless networks
    • San Francisco, CA, USA, Mar.
    • R. L. Cruz and A. V. Santhanam, "Optimal routing, link scheduling and power control in multihop wireless networks, " in Proc. IEEE 22nd Annu. Joint Conf. Comput. Commun. (INFOCOM), vol. 1. San Francisco, CA, USA, Mar. 2003, pp. 702-711.
    • (2003) Proc. IEEE 22nd Annu. Joint Conf. Comput. Commun. (INFOCOM) , vol.1 , pp. 702-711
    • Cruz, R.L.1    Santhanam, A.V.2
  • 207
    • 11844249969 scopus 로고    scopus 로고
    • Network planning in wireless ad hoc networks: A cross-layer approach
    • Jan.
    • Y. Wu et al., "Network planning in wireless ad hoc networks: A cross-layer approach, " IEEE J. Sel. Areas Commun., vol. 23, no. 1, pp. 136-150, Jan. 2005.
    • (2005) IEEE J. Sel. Areas Commun. , vol.23 , Issue.1 , pp. 136-150
    • Wu, Y.1
  • 210
    • 85014881027 scopus 로고    scopus 로고
    • Rate aware instantly decodable network codes
    • Feb.
    • A. Douik, S. Sorour, T. Y. Al-Naffouri, and M. S. Alouini, "Rate aware instantly decodable network codes, " IEEE Trans. Wireless Commun., vol. 16, no. 2, pp. 998-1011, Feb. 2017. doi: 10. 1109/TWC. 2016. 2635638
    • (2017) IEEE Trans. Wireless Commun. , vol.16 , Issue.2 , pp. 998-1011
    • Douik, A.1    Sorour, S.2    Al-Naffouri, T.Y.3    Alouini, M.S.4
  • 211
    • 84981352267 scopus 로고    scopus 로고
    • Rate-aware network codes for completion time reduction in device-to-device communications
    • Kuala Lumpur, Malaysia, May
    • M. S. Karim, A. Douik, S. Sorour, and P. Sadeghi, "Rate-aware network codes for completion time reduction in device-to-device communications, " in Proc. IEEE Int. Conf. Commun. (ICC), Kuala Lumpur, Malaysia, May 2016, pp. 1-7.
    • (2016) Proc. IEEE Int. Conf. Commun. (ICC) , pp. 1-7
    • Karim, M.S.1    Douik, A.2    Sorour, S.3    Sadeghi, P.4
  • 212
    • 84904979683 scopus 로고    scopus 로고
    • What will 5G be
    • Jun.
    • J. G. Andrews et al., "What will 5G be" IEEE J. Sel. Areas Commun., vol. 32, no. 6, pp. 1065-1082, Jun. 2014.
    • (2014) IEEE J. Sel. Areas Commun. , vol.32 , Issue.6 , pp. 1065-1082
    • Andrews, J.G.1
  • 213
    • 84981350368 scopus 로고    scopus 로고
    • Rate aware network codes for coordinated multi base-station networks
    • Kuala Lumpur, Malaysia
    • M. Saif, A. Douik, and S. Sorour, "Rate aware network codes for coordinated multi base-station networks, " in Proc. IEEE Int. Conf. Commun. (ICC), Kuala Lumpur, Malaysia, 2016, pp. 1-7. doi: 10. 1109/ICC. 2016. 7511504.
    • (2016) Proc. IEEE Int. Conf. Commun. (ICC) , pp. 1-7
    • Saif, M.1    Douik, A.2    Sorour, S.3


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