Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (2)
  • Open Access

    ARTICLE

    Efficient Optimal Routing Algorithm Based on Reward and Penalty for Mobile Adhoc Networks

    Anubha1, Ravneet Preet Singh Bedi2, Arfat Ahmad Khan3,*, Mohd Anul Haq4, Ahmad Alhussen5, Zamil S. Alzamil4

    CMC-Computers, Materials & Continua, Vol.75, No.1, pp. 1331-1351, 2023, DOI:10.32604/cmc.2023.033181 - 06 February 2023

    Abstract Mobile adhoc networks have grown in prominence in recent years, and they are now utilized in a broader range of applications. The main challenges are related to routing techniques that are generally employed in them. Mobile Adhoc system management, on the other hand, requires further testing and improvements in terms of security. Traditional routing protocols, such as Adhoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), employ the hop count to calculate the distance between two nodes. The main aim of this research work is to determine the optimum method for sending packets while… More >

  • Open Access

    ARTICLE

    Ant-based Energy Efficient Routing Algorithm for Mobile Ad hoc Networks

    P. E. Irin Dorathy1,*, M. Chandrasekaran2

    Intelligent Automation & Soft Computing, Vol.33, No.3, pp. 1423-1438, 2022, DOI:10.32604/iasc.2022.024815 - 24 March 2022

    Abstract In this paper, an Ant Colony Optimization (ACO) based Energy Efficient Shortest Path Routing (AESR) algorithm is developed for Mobile Ad hoc Network (MANET). The Mobile Ad hoc Network consists of a group of mobile nodes that can communicate with each other without any predefined infrastructure. The routing process is critical for this type of network due to its dynamic topology, limited resources and wireless channel. The technique incorporated in this paper for optimizing the routing in a Mobile ad hoc network is Ant Colony Optimization. The ACO algorithm is used to solve network problems… More >

Displaying 1-10 on page 1 of 2. Per Page