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 条
  • [31] A nondominated sorting genetic algorithm solution for shortest path routing problem in computer networks
    Chitra, C.
    Subbaraj, P.
    EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (01) : 1518 - 1525
  • [32] Solving fuzzy shortest path problem by genetic algorithm
    Syarif, A.
    Muludi, K.
    Adrian, R.
    Gen, M.
    INDONESIAN OPERATIONS RESEARCH ASSOCIATION - INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH 2017, 2018, 332
  • [33] A Multi-Population Memetic Algorithm for Dynamic Shortest Path Routing in Mobile Ad-hoc Networks
    Turky, Ayad
    Sabar, Nasser R.
    Song, Andy
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 4119 - 4126
  • [34] On the routing problem in disconnected vehicular ad hoc networks
    Wisitpongphan, Nawaporn
    Bai, Fan
    Mudalige, Priyantha
    Tonguz, Ozan K.
    INFOCOM 2007, VOLS 1-5, 2007, : 2291 - +
  • [35] A Location-Based Multi-path Routing Approach in Ad Hoc Networks
    Wang, Qinghui
    Lu, Yongjie
    2010 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-5, 2010, : 2294 - 2296
  • [36] A genetic algorithm for shortest path routing problem and the sizing of populations
    Ahn, CW
    Ramakrishna, RS
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (06) : 566 - 579
  • [37] Adaptive mutation in genetic algorithms for shortest path routing problem
    Rares, Maniu
    PROCEEDINGS OF THE 2015 7TH INTERNATIONAL CONFERENCE ON ELECTRONICS, COMPUTERS AND ARTIFICIAL INTELLIGENCE (ECAI), 2015, : S69 - S73
  • [38] Single path flooding chain routing in ad hoc networks
    Ma, M
    Ma, C
    Yang, YY
    2005 International Conference on Parallel Processsing, Proceedings, 2005, : 303 - 310
  • [39] A Straightforward Path Routing in Wireless Ad Hoc Sensor Networks
    Jiang, Zhen
    Ma, Junchao
    Lou, Wei
    Wu, Jie
    ICDCS: 2009 INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS, 2009, : 103 - +
  • [40] Robust path routing protocol in mobile ad hoc networks
    Wu, Shih-Lin
    Chiou, Chung-Ching
    Chen, Jenhui
    Chen, Tai-Jiun
    Recent Advances in Communications and Computer Science, 2003, : 344 - 349