Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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


    A Mutual Authentication and Cross Verification Protocol for Securing Internet-of-Drones (IoD)

    Saeed Ullah Jan1, Irshad Ahmed Abbasi2,*, Fahad Algarni3

    CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 5845-5869, 2022, DOI:10.32604/cmc.2022.026179

    Abstract With the rapid miniaturization in sensor technology, Internet-of-Drones (IoD) has delighted researchers towards information transmission security among drones with the control station server (CSS). In IoD, the drone is different in shapes, sizes, characteristics, and configurations. It can be classified on the purpose of its deployment, either in the civilian or military domain. Drone’s manufacturing, equipment installation, power supply, multi-rotor system, and embedded sensors are not issues for researchers. The main thing is to utilize a drone for a complex and sensitive task using an infrastructure-less/self-organization/resource-less network type called Flying Ad Hoc Network (FANET). Monitoring… More >

  • Open Access


    Enabling Reachability Across Multiple Domains Without Controller Synchronization in SDN

    Nauman Khan1,2, Rosli Bin Salleh1,*, Ihsan Ali1, Zahid Khan3, Noman Mazhar1, Roobaea Alroobaea4, Fahad Almansour5, Usman Ali1

    CMC-Computers, Materials & Continua, Vol.69, No.1, pp. 945-965, 2021, DOI:10.32604/cmc.2021.017394

    Abstract Software-defined networking (SDN) makes network agile and flexible due to its programmable approach. An extensive network has multiple domains in SDN for the scalability and performance of the network. However, the inter-domain link is also crucial for the stability of the entire network on the data plane layer. More than one inter-domain connection enhances the scalability of the data plane layer. However, it faces a reachability problem with the principal root, which causes forwarding loops and packet drops in the network, thereby degrading network performance. The proposed solution is a multiple controller architecture; however, this More >

  • Open Access


    A Network Security Risk Assessment Method Based on a B_NAG Model

    Hui Wang1, Chuanhan Zhu1, Zihao Shen1,*, Dengwei Lin2, Kun Liu1, MengYao Zhao3

    Computer Systems Science and Engineering, Vol.38, No.1, pp. 103-117, 2021, DOI:10.32604/csse.2021.014680

    Abstract Computer networks face a variety of cyberattacks. Most network attacks are contagious and destructive, and these types of attacks can be harmful to society and computer network security. Security evaluation is an effective method to solve network security problems. For accurate assessment of the vulnerabilities of computer networks, this paper proposes a network security risk assessment method based on a Bayesian network attack graph (B_NAG) model. First, a new resource attack graph (RAG) and the algorithm E-Loop, which is applied to eliminate loops in the B_NAG, are proposed. Second, to distinguish the confusing relationships between… More >

  • Open Access


    The Optimization Reachability Query of Large Scale Multi-Attribute Constraints Directed Graph

    Kehong Zhang, Keqiu Li

    Computer Systems Science and Engineering, Vol.33, No.2, pp. 71-85, 2018, DOI:10.32604/csse.2018.33.071

    Abstract Today, many applications such as social network and biological network develop rapidly,the graph data will be expanded constantly on a large scale. Some classic methods can not effectively solve this scale of the graph data. In the reachability query, many technologies such as N-Hop, tree, interval labels, uncertain graph processing are emerging, they also solve a lot of questions about reachability query of graph. But, these methods have not put forward the effective solution for the new issues of the multiattribute constraints reachability on directed graph. In this paper, TCRQDG algorithm effectively solves this new More >

  • Open Access


    An Optimized Labeling Scheme for Reachability Queries

    Xian Tang1,*, Ziyang Chen2, Haiyan Zhang3, Xiang Liu1, Yunyu Shi1, Asad Shahzadi4

    CMC-Computers, Materials & Continua, Vol.55, No.2, pp. 267-283, 2018, DOI:10.3970/cmc.2018.01839

    Abstract Answering reachability queries is one of the fundamental graph operations. Existing approaches either accelerate index construction by constructing an index that covers only partial reachability relationship, which may result in performing cost traversing operation when answering a query; or accelerate query answering by constructing an index covering the complete reachability relationship, which may be inefficient due to comparing the complete node labels. We propose a novel labeling scheme, which covers the complete reachability relationship, to accelerate reachability queries processing. The idea is to decompose the given directed acyclic graph (DAG) G into two subgraphs, G1… More >

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