Combined Genetic and Fuzzy Approach for Shortest Path Routing Problem in Ad hoc Networks

被引:1
|
作者
Kumar, K. Senthil [1 ]
Ramkumar, D. [2 ]
机构
[1] Bharath Niketan Engn Coll, Dept Comp Sci & Engn, Aundipatty, India
[2] Bharath Niketan Engn Coll, Dept Elect & Commun Engn, Aundipatty, India
关键词
Wireless multi-hop network; Search techniques; Dynamic optimization problem; LOW-COMPLEXITY; WIRELESS; ALGORITHMS; THROUGHPUT; STABILITY; FAIRNESS;
D O I
10.1007/s11277-015-3130-7
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Shortest path (SP) routing problem for static network has been addressed well in the recent past using different intelligent optimization techniques such as artificial neural network, ant colony optimization, particle swarm optimization, genetic algorithms (GA) etc. However, advancements in the wireless communication result in more and more wireless mobile networks such as mobile ad hoc network, wireless mesh network, etc. for which static path routing algorithms will not work well due to the dynamic nature of the mobile networks whose environmental conditions change over time. In this paper, we present a new method to address the SP routing problem for dynamic wireless sensor networks using well known optimization technique called GA. In this method, different paths which are formed randomly by the nodes between source and destination are modeled as chromosomes in the GA. Then, these chromosomes are undergone various genetic process such as selection, crossover and mutation to get new chromosomes. Every time the topology changes, network parameters such as sent packets, received packets, transmission time and dropped packets are estimated for each path and the optimized route is selected using fuzzy based fitness function applied to each chromosomes.
引用
收藏
页码:609 / 623
页数:15
相关论文
共 50 条
  • [1] Combined Genetic and Fuzzy Approach for Shortest Path Routing Problem in Ad hoc Networks
    K. Senthil Kumar
    D. Ramkumar
    Wireless Personal Communications, 2016, 90 : 609 - 623
  • [3] On shortest path routing schemes for wireless ad hoc networks
    Dhar, S
    Rieck, MQ
    Pai, S
    HIGH PERFORMANCE COMPUTING - HIPC 2003, 2003, 2913 : 130 - 141
  • [4] Genetic Algorithm for Shortest Path in Ad Hoc Networks
    Khankhour, Hala
    Abouchabaka, Jaafar
    Abdoun, Otman
    ADVANCED INTELLIGENT SYSTEMS FOR SUSTAINABLE DEVELOPMENT, AI2SD'2019, VOL 6: ADVANCED INTELLIGENT SYSTEMS FOR NETWORKS AND SYSTEMS, 2020, 92 : 145 - 154
  • [5] Shortest path routing in partially connected ad hoc networks
    Tan, K
    Zhang, Q
    Zhu, WW
    GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, : 1038 - 1042
  • [6] Topology, shortest path routing and lifetime of ad hoc networks
    Dhillon, S. S.
    Zhou, Y.
    2007 14TH IEEE SYMPOSIUM ON COMMUNICATIONS AND VEHICULAR TECHNOLOGY IN THE BENELUX, 2007, : 151 - 155
  • [7] A cost matrix agent for shortest path routing in ad hoc networks
    Wu, Mary
    Kim, ChongGun
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2010, 35 (06) : 646 - 652
  • [8] A comparison of Load-Distributive Path Routing and Shortest path Routing in Wireless Ad Hoc Networks
    Habib, Iffat
    Badruddin, Nasreen
    Drieberg, Micheal
    2014 5TH INTERNATIONAL CONFERENCE ON INTELLIGENT AND ADVANCED SYSTEMS (ICIAS 2014), 2014,
  • [9] Various distributed shortest path routing strategies for wireless ad hoc networks
    Dhar, S
    Rieck, MQ
    Pai, S
    Kim, EJ
    DISTRIBUTED COMPUTING: IWDC 2003, 2003, 2918 : 255 - 264
  • [10] Energy efficient dynamic shortest path routing in Wireless Ad hoc Sensor Networks using Genetic Algorithm
    Nallusamy, R.
    Duraiswamy, K.
    Muthukumar, D. Ayya
    Sathiyakumar, C.
    2010 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATION AND SENSOR COMPUTING, 2010, : 206 - 210