메뉴 건너뛰기




Volumn , Issue , 2012, Pages 85-89

A preliminary approach to near-optimal multi-hop capacitated network design using grouping-dandelion encoded heuristics

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE PROCEDURES; CAPACITATED MINIMUM SPANNING TREES; CAPACITATED NETWORK DESIGN; CAPACITY CONSTRAINTS; CLUSTER-HEADS; DISTRIBUTED NODES; FIXED NUMBERS; HEURISTIC SCHEMES; MINIMUM SPANNING TREES; MULTIHOP; P-MEDIAN; PRELIMINARY APPROACH; RESOURCE-CONSTRAINED; SEQUENTIAL TREATMENTS; SINK NODES; STOCHASTIC OPTIMIZATION TECHNIQUES; WIRELESS COMMUNICATIONS;

EID: 84870352342     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CAMAD.2012.6335385     Document Type: Conference Paper
Times cited : (5)

References (18)
  • 4
    • 33845703221 scopus 로고    scopus 로고
    • Adaptive Design Optimization of Wireless Sensor Networks using Genetic Algorithms
    • P. F. Konstantinos, A. T. Theodore, "Adaptive Design Optimization of Wireless Sensor Networks using Genetic Algorithms", Computer Networks, Vol. 51, N. 4, pp. 1031-1051, 2007.
    • (2007) Computer Networks , vol.51 , Issue.4 , pp. 1031-1051
    • Konstantinos, P.F.1    Theodore, A.T.2
  • 5
    • 72249107550 scopus 로고    scopus 로고
    • A Memetic Algorithm for Optimal Dynamic Design of Wireless Sensor Networks
    • P. F. Konstantinos, A. T. Theodore, "A Memetic Algorithm for Optimal Dynamic Design of Wireless Sensor Networks", Computer Communications, Vol. 33, N. 2, pp. 250-258, 2010.
    • (2010) Computer Communications , vol.33 , Issue.2 , pp. 250-258
    • Konstantinos, P.F.1    Theodore, A.T.2
  • 6
    • 15344347891 scopus 로고    scopus 로고
    • Layout Optimization for a Wireless Sensor Network using a Multi-Objective Genetic Algorithm
    • D. Jourdan, O. Weck, "Layout Optimization for a Wireless Sensor Network using a Multi-Objective Genetic Algorithm", in IEEE Vehicular Technology Conference, 2004.
    • IEEE Vehicular Technology Conference, 2004
    • Jourdan, D.1    Weck, O.2
  • 7
    • 77953664853 scopus 로고    scopus 로고
    • CoCMA: Energy-efficient Coverage Control in Cluster-based Wireless Sensor Networks using a Memetic Algorithm
    • J. A. Jiang, C. P. Chen, C. L. Chuang, C. L. Tseng, C. Yang, T. S. Wang, "CoCMA: Energy-efficient Coverage Control in Cluster-based Wireless Sensor Networks using a Memetic Algorithm", Sensors, Vol. 9, pp. 4218-4940, 2009.
    • (2009) Sensors , vol.9 , pp. 4218-4940
    • Jiang, J.A.1    Chen, C.P.2    Chuang, C.L.3    Tseng, C.L.4    Yang, C.5    Wang, T.S.6
  • 9
    • 79959828517 scopus 로고    scopus 로고
    • Probabilistic Dynamic Deployment of Wireless Sensor Networks by Artificial Bee Colony Algorithm
    • C. Ozturk, D. Karaboga, B. Gorkemli, "Probabilistic Dynamic Deployment of Wireless Sensor Networks by Artificial Bee Colony Algorithm", Sensors, Vol. 11, pp. 6057-6065, 2011.
    • (2011) Sensors , vol.11 , pp. 6057-6065
    • Ozturk, C.1    Karaboga, D.2    Gorkemli, B.3
  • 12
    • 0034974417 scopus 로고    scopus 로고
    • A New Heuristic Optimization Algorithm: Harmony Search
    • Z. W. Geem, J. Hoon Kim, G. V. Loganathan, "A New Heuristic Optimization Algorithm: Harmony Search", Simulation, vol. 76, N. 2, pp. 60-68, 2001.
    • (2001) Simulation , vol.76 , Issue.2 , pp. 60-68
    • Geem, Z.W.1    Hoon Kim, J.2    Loganathan, G.V.3
  • 14
    • 0000016367 scopus 로고
    • A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems
    • MIT Press, Massachusetts
    • E. Falkernauer, "A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems", Evolutionary Computation, MIT Press, Massachusetts, pp. 123-144, 1994.
    • (1994) Evolutionary Computation , pp. 123-144
    • Falkernauer, E.1
  • 16
    • 33645579529 scopus 로고    scopus 로고
    • From the Dandelion Code to the Rainbow Code: A Class of Bijective Spanning Tree Representations with Linear Complexity and Bounded Locality
    • T.Paulen, D. K. Smith, "From the Dandelion Code to the Rainbow Code: A Class of Bijective Spanning Tree Representations with Linear Complexity and Bounded Locality", IEEE Transactions on Evolutionary Computation, Vol. 10, N. 2, pp. 108-123, 2006.
    • (2006) IEEE Transactions on Evolutionary Computation , vol.10 , Issue.2 , pp. 108-123
    • Paulen, T.1    Smith, D.K.2
  • 17
    • 84870312581 scopus 로고    scopus 로고
    • Ph.D. dissertation, Univ. California
    • S. Piccoto, "How to Decode a Tree", Ph.D. dissertation, Univ. California, 1999.
    • (1999) How to Decode a Tree
    • Piccoto, S.1
  • 18
    • 33947240405 scopus 로고    scopus 로고
    • The Dandelion Code: A New Coding of Spanning Trees for Genetic Algorithms
    • E. Thomson, T. Paulden, D. K. Smith, "The Dandelion Code: A New Coding of Spanning Trees for Genetic Algorithms", IEEE Transactions on Evolutionary Computation, Vol. 11, N. 1, pp. 91-100, 2007.
    • (2007) IEEE Transactions on Evolutionary Computation , vol.11 , Issue.1 , pp. 91-100
    • Thomson, E.1    Paulden, T.2    Smith, D.K.3


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