Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    Optimizing Connections: Applied Shortest Path Algorithms for MANETs

    Ibrahim Alameri1,*, Jitka Komarkova2, Tawfik Al-Hadhrami3, Abdulsamad Ebrahim Yahya4, Atef Gharbi5

    CMES-Computer Modeling in Engineering & Sciences, Vol.141, No.1, pp. 787-807, 2024, DOI:10.32604/cmes.2024.052107 - 20 August 2024

    Abstract This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks (MANETs) from dynamic topologies that pose great challenges because of the mobility of nodes. The main objective was to delve into and refine the application of the Dijkstra's algorithm in this context, a method conventionally esteemed for its efficiency in static networks. Thus, this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm, considering adaptation to the dynamic network conditions that are typical for MANETs. This paper has shown through detailed algorithmic analysis that Dijkstra’s… More >

  • Open Access

    ARTICLE

    Floyd-Warshall Algorithm Based on Picture Fuzzy Information

    Shaista Habib1, Aqsa Majeed1, Muhammad Akram2,*, Mohammed M. Ali Al-Shamiri3,4

    CMES-Computer Modeling in Engineering & Sciences, Vol.136, No.3, pp. 2873-2894, 2023, DOI:10.32604/cmes.2023.026294 - 09 March 2023

    Abstract The Floyd-Warshall algorithm is frequently used to determine the shortest path between any pair of nodes. It works well for crisp weights, but the problem arises when weights are vague and uncertain. Let us take an example of computer networks, where the chosen path might no longer be appropriate due to rapid changes in network conditions. The optimal path from among all possible courses is chosen in computer networks based on a variety of parameters. In this paper, we design a new variant of the Floyd-Warshall algorithm that identifies an All-Pair Shortest Path (APSP) in More > Graphic Abstract

    Floyd-Warshall Algorithm Based on Picture Fuzzy Information

  • Open Access

    ARTICLE

    Efficient Routing Protection Algorithm Based on Optimized Network Topology

    Haijun Geng1,2, Zikun Jin1, Jiangyuan Yao3,*, Han Zhang4, Zhiguo Hu6, Bo Yang5, Yingije Guo7, Wei Wang1, Qidong Zhang1, Guoao Duan8

    CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 4525-4540, 2022, DOI:10.32604/cmc.2022.027725 - 21 April 2022

    Abstract Network failures are unavoidable and occur frequently. When the network fails, intra-domain routing protocols deploying on the Internet need to undergo a long convergence process. During this period, a large number of messages are discarded, which results in a decline in the user experience and severely affects the quality of service of Internet Service Providers (ISP). Therefore, improving the availability of intra-domain routing is a trending research question to be solved. Industry usually employs routing protection algorithms to improve intra-domain routing availability. However, existing routing protection schemes compute as many backup paths as possible to… More >

  • Open Access

    ARTICLE

    Multi-Path Service Function Chaining for Mobile Surveillance of Animal Husbandry

    Xi Chen1,3, Tao Wu2,*, Mehtab Afzal4

    CMC-Computers, Materials & Continua, Vol.71, No.1, pp. 1959-1971, 2022, DOI:10.32604/cmc.2022.022344 - 03 November 2021

    Abstract Animal husbandry is the pillar industry in some ethnic areas of China. However, the communication/networking infrastructure in these areas is often underdeveloped, thus the difficulty in centralized management, and challenges for the effective monitoring. Considering the dynamics of the field monitoring environment, as well as the diversity and mobility of monitoring targets, traditional WSN (Wireless Sensor Networks) or IoT (Internet of Things) is difficult to meet the surveillance needs. Mobile surveillance that features the collaboration of various functions (camera, sensing, image recognition, etc.) deployed on mobile devices is desirable in a volatile wireless environment. This… More >

  • Open Access

    ARTICLE

    Efficient Routing Protection Algorithm in Large-Scale Networks

    Haijun Geng1,2,*, Han Zhang3, Yangyang Zhang4

    CMC-Computers, Materials & Continua, Vol.66, No.2, pp. 1733-1744, 2021, DOI:10.32604/cmc.2020.013355 - 26 November 2020

    Abstract With an increasing urgent demand for fast recovery routing mechanisms in large-scale networks, minimizing network disruption caused by network failure has become critical. However, a large number of relevant studies have shown that network failures occur on the Internet inevitably and frequently. The current routing protocols deployed on the Internet adopt the reconvergence mechanism to cope with network failures. During the reconvergence process, the packets may be lost because of inconsistent routing information, which reduces the network’s availability greatly and affects the Internet service provider’s (ISP’s) service quality and reputation seriously. Therefore, improving network availability… More >

  • Open Access

    ARTICLE

    Applying Probabilistic Model Checking to Path Planning in an Intelligent Transportation System Using Mobility Trajectories and Their Statistical Data

    Honghao Gao1, 2, 5, Wanqiu Huang1, 4, Xiaoxian Yang3

    Intelligent Automation & Soft Computing, Vol.25, No.3, pp. 547-559, 2019, DOI:10.31209/2019.100000110

    Abstract Path planning is an important topic of research in modern intelligent traffic systems (ITSs). Traditional path planning methods aim to identify the shortest path and recommend this path to the user. However, the shortest path is not always optimal, especially in emergency rescue scenarios. Thus, complex and changeable factors, such as traffic congestion, road construction and traffic accidents, should be considered when planning paths. To address this consideration, the maximum passing probability of a road is considered the optimal condition for path recommendation. In this paper, the traffic network is abstracted as a directed graph.… More >

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