메뉴 건너뛰기




Volumn 33, Issue 3, 2007, Pages 734-742

A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm

Author keywords

Ad hoc networks; Multicast; Multimedia communication genetic algorithms

Indexed keywords

AD HOC NETWORKS; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; MULTIMEDIA SERVICES; OPTIMIZATION; TELECOMMUNICATION LINKS; TREES (MATHEMATICS);

EID: 33847636705     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2006.06.020     Document Type: Article
Times cited : (51)

References (24)
  • 1
    • 0034238689 scopus 로고    scopus 로고
    • Key management for restricted multicast using broadcast encryption
    • Abdalla M., Shavitt Y., and Wool A. Key management for restricted multicast using broadcast encryption. IEEE/ACM Transactions on Networking 8 4 (2000) 443-454
    • (2000) IEEE/ACM Transactions on Networking , vol.8 , Issue.4 , pp. 443-454
    • Abdalla, M.1    Shavitt, Y.2    Wool, A.3
  • 2
    • 0001096735 scopus 로고
    • Genetic algorithms and random keys for sequencing and optimization
    • Bean J. Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing 6 (1994) 154-160
    • (1994) ORSA Journal on Computing , vol.6 , pp. 154-160
    • Bean, J.1
  • 3
    • 56449107505 scopus 로고
    • OR-Library: Distributing test problems by electronic mail
    • Beasley J.E. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41 (1990) 1069-1072
    • (1990) Journal of the Operational Research Society , vol.41 , pp. 1069-1072
    • Beasley, J.E.1
  • 4
    • 0029755346 scopus 로고    scopus 로고
    • A media synchronization survey: Reference model, specification, and case studies
    • Blakowski G., and Steinmetz R. A media synchronization survey: Reference model, specification, and case studies. IEEE Journal on Selected Areas in Communications 14 1 (1996) 5-35
    • (1996) IEEE Journal on Selected Areas in Communications , vol.14 , Issue.1 , pp. 5-35
    • Blakowski, G.1    Steinmetz, R.2
  • 6
    • 0012574730 scopus 로고    scopus 로고
    • A minimum spanning tree algorithm with inverse Ackermann type complexity
    • Chazelle B. A minimum spanning tree algorithm with inverse Ackermann type complexity. Journal of ACM 47 6 (2000) 1028-1047
    • (2000) Journal of ACM , vol.47 , Issue.6 , pp. 1028-1047
    • Chazelle, B.1
  • 7
    • 0035364338 scopus 로고    scopus 로고
    • Genetic algorithms for communications network design - an empirical study of the factors that influence performance
    • Chou H., Premkumar G., and Chu C.-H. Genetic algorithms for communications network design - an empirical study of the factors that influence performance. IEEE Transactions on Evolutionary Computation 5 3 (2001) 236-249
    • (2001) IEEE Transactions on Evolutionary Computation , vol.5 , Issue.3 , pp. 236-249
    • Chou, H.1    Premkumar, G.2    Chu, C.-H.3
  • 9
    • 33847669047 scopus 로고    scopus 로고
    • Deering, S., Estrin, D., Farinacci, D., Jacobson, V., Helmy, A., Meyer, D., et al. (1999). Protocol independent multicast version 2 dense mode specification. Draft-IETF-PIM-V2-DM-03.txt.
  • 10
    • 33847633679 scopus 로고    scopus 로고
    • Estrin, D., Farinacci, D., Helmy, A., Thaler, D., Deering, S., & Handley, M. (1998). Protocol independent multicast-sparse mode (PIM-SM): Protocol specification, RFC 2362.
  • 14
    • 12844273482 scopus 로고    scopus 로고
    • An efficient encoding tree for location-aware multicast routing protocol in wireless ad hoc networks
    • Huang Y.-M., Chiang T.-C., and Hou T.-W. An efficient encoding tree for location-aware multicast routing protocol in wireless ad hoc networks. Journal of Internet Technology 6 1 (2005)
    • (2005) Journal of Internet Technology , vol.6 , Issue.1
    • Huang, Y.-M.1    Chiang, T.-C.2    Hou, T.-W.3
  • 15
    • 18944383427 scopus 로고    scopus 로고
    • Genetic algorithm for solving bicriteria network topology design problem
    • Kim J.R., and Gen M. Genetic algorithm for solving bicriteria network topology design problem. Proceedings of the Evolutionary Computation 3 (1999) 2279
    • (1999) Proceedings of the Evolutionary Computation , vol.3 , pp. 2279
    • Kim, J.R.1    Gen, M.2
  • 16
    • 0025260292 scopus 로고
    • Computational efficiency of parallel combinatorial OR-tree searches
    • Li G.-J., and Wah B.W. Computational efficiency of parallel combinatorial OR-tree searches. IEEE Transactions on Software Engineering 16 1 (1990) 13-31
    • (1990) IEEE Transactions on Software Engineering , vol.16 , Issue.1 , pp. 13-31
    • Li, G.-J.1    Wah, B.W.2
  • 17
    • 33847687927 scopus 로고    scopus 로고
    • Palmer, C. (1994). An approach to a problem in network design using genetic algorithms, Ph.D. thesis, Polytechnic University.
  • 18
    • 0028563759 scopus 로고    scopus 로고
    • Palmer, C., & Kershenbaum, A. (1994). Representing trees in genetic algorithms, In Proceedings of the First IEEE Conference on Evolutionary Computation pp. 379-384.
  • 19
    • 0002621234 scopus 로고    scopus 로고
    • An optimal minimum spanning tree algorithm
    • Pettie S., and Ramachandran V. An optimal minimum spanning tree algorithm. Journal of ACM 49 1 (2002) 16-34
    • (2002) Journal of ACM , vol.49 , Issue.1 , pp. 16-34
    • Pettie, S.1    Ramachandran, V.2
  • 20
    • 33847613061 scopus 로고    scopus 로고
    • Pusateri, T. (1997). Distance Vector Multicast Routing Protocol. RFC 1075.
  • 21
    • 0031124754 scopus 로고    scopus 로고
    • Evaluation of multicast routing algorithms for real-time communication on high-speed networks
    • Salama H.F., Reeves D.S., and Viniotis Y. Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE Journal on Selected Areas in Communications 15 3 (1997) 332-345
    • (1997) IEEE Journal on Selected Areas in Communications , vol.15 , Issue.3 , pp. 332-345
    • Salama, H.F.1    Reeves, D.S.2    Viniotis, Y.3
  • 23
    • 0032678509 scopus 로고    scopus 로고
    • Internet QoS a big picture
    • Xiao X., and Ni L.M. Internet QoS a big picture. IEEE Network 13 2 (1999) 8-18
    • (1999) IEEE Network , vol.13 , Issue.2 , pp. 8-18
    • Xiao, X.1    Ni, L.M.2
  • 24
    • 0039054277 scopus 로고    scopus 로고
    • A note on genetic algorithms for degree-constrained spanning tree problems
    • Zhou G., and Gen M. A note on genetic algorithms for degree-constrained spanning tree problems. Networks 30 (1997) 91-95
    • (1997) Networks , vol.30 , pp. 91-95
    • Zhou, G.1    Gen, M.2


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