메뉴 건너뛰기




Volumn , Issue , 2009, Pages

Dynamic network coding problem: An evolutionary approach

Author keywords

Dynamic problem; Genetic algorithm; Network coding; Network throughput; Resource minimization

Indexed keywords

DYNAMIC NATURE; DYNAMIC NETWORK; DYNAMIC PROBLEM; EVOLUTIONARY APPROACH; EVOLUTIONARY OPERATIONS; FEASIBILITY PROBLEM; HEURISTIC RULES; NETWORK CODING; NETWORK THROUGHPUT; NODES AND LINKS; OPTIMIZATION OF NETWORK; PERMUTATION REPRESENTATION; PROBLEM FORMULATION; REAL-WORLD NETWORKS; RESEARCH AREAS; STATIC NETWORKS;

EID: 73149092110     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WICOM.2009.5302943     Document Type: Conference Paper
Times cited : (4)

References (24)
  • 2
    • 28844481518 scopus 로고    scopus 로고
    • Minimum-energy multicast in mobile ad hoc networks using network coding
    • Y. Wu, P. A. Chou, and S.-Y. Kung, "Minimum-energy multicast in mobile ad hoc networks using network coding". IEEE Transactions on Communications,vol.53, no.11, pp. 1906-1918, 2005.
    • (2005) IEEE Transactions on Communications , vol.53 , Issue.11 , pp. 1906-1918
    • Wu, Y.1    Chou, P.A.2    Kung, S.-Y.3
  • 4
    • 84885724190 scopus 로고    scopus 로고
    • Network coding for efficient communication in extreme networks
    • Widmer, J. and J.-Y. L. Boudec, "Network coding for efficient communication in extreme networks", ACM SIGCOMM Workshop on DTNs, 2005.
    • (2005) ACM SIGCOMM Workshop on DTNs
    • Widmer, J.1    Boudec, J.-Y.L.2
  • 8
    • 73149122230 scopus 로고    scopus 로고
    • Security Vulnerabilities for Network Coding in Wireless Networks
    • available online
    • R. Sethi, "Security Vulnerabilities for Network Coding in Wireless Networks", available online, 2009.
    • (2009)
    • Sethi, R.1
  • 9
    • 34548087410 scopus 로고    scopus 로고
    • On minimizing network coding resources: An evolutionary approach
    • Boston, 7 April
    • M. Kim, C.W. Ahn, M. Medard and M. Effros, "On minimizing network coding resources: An evolutionary approach", NetCod 2006, Boston, 7 April 2006.
    • (2006) NetCod 2006
    • Kim, M.1    Ahn, C.W.2    Medard, M.3    Effros, M.4
  • 10
    • 0022948837 scopus 로고
    • On multiple steiner subgraph problems
    • M.B. Richey and R.G. Parker, "On multiple steiner subgraph problems", Networks, vol.16, no.4, pp. 423-438, 1986.
    • (1986) Networks , vol.16 , Issue.4 , pp. 423-438
    • Richey, M.B.1    Parker, R.G.2
  • 11
    • 33947377921 scopus 로고    scopus 로고
    • Information flow decomposition for network coding
    • C. Fragouli and R.G. Parker, "Information flow decomposition for network coding", IEEE Trans, Inform. Theory, vol.52, no.3, pp. 829-848, 2006.
    • (2006) IEEE Trans, Inform. Theory , vol.52 , Issue.3 , pp. 829-848
    • Fragouli, C.1    Parker, R.G.2
  • 20
    • 0242334165 scopus 로고    scopus 로고
    • An algebraic approach to network coding
    • R. Koetter and M. Médard, "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    Médard, M.2


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