Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    Duty Cycling Centralized Hierarchical Routing Protocol With Content Analysis Duty Cycling Mechanism for Wireless Sensor Networks

    Anar A. Hady

    Computer Systems Science and Engineering, Vol.35, No.5, pp. 347-355, 2020, DOI:10.32604/csse.2020.35.347

    Abstract In this paper, a Duty Cycling Centralized Hierarchical Protocol (DCCHP) has been proposed for wireless sensor networks. DCCHP is an energy efficient protocol that prolongs the lifetime of the network by applying a duty cycling mechanism named DCM that chooses the nodes that send unimportant data in a certain epoch to be candidates to be put to sleep. But if the proposed equations for choosing the cluster head nodes put any of them in a high priority it works in the active mode. When comparing DCCHP to the previously proposed LEACH-CS, LEACH-C protocols, using a More >

  • Open Access

    ARTICLE

    A Generalized Museum Visitor Routing Problem Considering the Preferences and Congestion for Multiple Groups: An Example in Taiwan

    Yi-Chih Hsieh1, Peng-Sheng You2,*

    Intelligent Automation & Soft Computing, Vol.26, No.4, pp. 703-713, 2020, DOI:10.32604/iasc.2020.010104

    Abstract In this study we present a generalized museum visitor routing problem considering the preferences and congestion of multiple groups with each group having its own must-see and select-see exhibition rooms based on their preferences in exhibits. The problem aims to minimize the makespan of all groups. An effective encoding scheme is proposed to simultaneously determine the scheduling of exhibition rooms for all groups and an immune-based algorithm (IBA) is developed. Numerical results, compared with those of a genetic algorithm and particle swarm optimization, on a museum in Taiwan are reported and discussed to show the More >

  • Open Access

    ARTICLE

    Brain MRI Patient Identification Based on Capsule Network

    Shuqiao Liu, Junliang Li, Xiaojie Li*

    Journal on Internet of Things, Vol.2, No.4, pp. 135-144, 2020, DOI:10.32604/jiot.2020.09797 - 22 September 2020

    Abstract In the deep learning field, “Capsule” structure aims to overcome the shortcomings of traditional Convolutional Neural Networks (CNN) which are difficult to mine the relationship between sibling features. Capsule Net (CapsNet) is a new type of classification network structure with “Capsule” as network elements. It uses the “Squashing” algorithm as an activation function and Dynamic Routing as a network optimization method to achieve better classification performance. The main problem of the Brain Magnetic Resonance Imaging (Brain MRI) recognition algorithm is that the difference between Alzheimer’s disease (AD) image, the Mild Cognitive Impairment (MCI) image, and… More >

  • Open Access

    ARTICLE

    A Novel Method for Node Connectivity with Adaptive Dragonfly Algorithm and Graph-Based m-Connection Establishment in MANET

    S. B. Manoojkumaar1, *, C. Poongodi2

    CMC-Computers, Materials & Continua, Vol.65, No.2, pp. 1649-1670, 2020, DOI:10.32604/cmc.2020.010781 - 20 August 2020

    Abstract Maximizing network lifetime is measured as the primary issue in Mobile Adhoc Networks (MANETs). In geographically routing based models, packet transmission seems to be more appropriate in dense circumstances. The involvement of the Heuristic model directly is not appropriate to offer an effectual solution as it becomes NP-hard issues; therefore investigators concentrate on using Meta-heuristic approaches. Dragonfly Optimization (DFO) is an effective meta-heuristic approach to resolve these problems by providing optimal solutions. Moreover, Meta-heuristic approaches (DFO) turn to be slower in convergence problems and need proper computational time while expanding network size. Thus, DFO is More >

  • Open Access

    ARTICLE

    Research on Vehicle Routing Problem with Soft Time Windows Based on Hybrid Tabu Search and Scatter Search Algorithm

    Jinhui Ge1, Xiaoliang Liu2, *, Guo Liang3

    CMC-Computers, Materials & Continua, Vol.64, No.3, pp. 1945-1958, 2020, DOI:10.32604/cmc.2020.010977 - 30 June 2020

    Abstract With the expansion of the application scope of social computing problems, many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various social attributes, cultures, and the emotional needs of customers. The actual soft time window vehicle routing problem, speeding up the response of customer needs, improving distribution efficiency, and reducing operating costs is the focus of current social computing problems. Therefore, designing fast and effective algorithms to solve this problem has certain theoretical and practical significance. In this paper, considering the time delay… More >

  • Open Access

    ARTICLE

    Prophet_TD Routing Algorithm Based on Historical Throughput and Encounter Duration

    Jingjian Chen1, Gang Xu1, *, Fengqi Wei1, Liqiang He2

    CMC-Computers, Materials & Continua, Vol.64, No.3, pp. 1845-1858, 2020, DOI:10.32604/cmc.2020.010010 - 30 June 2020

    Abstract Opportunistic networks are self-organizing networks that do not require a complete path between the source node and the destination node as it uses encounter opportunities brought by nodes movement to achieve network communication. Opportunistic networks routing algorithms are numerous and can be roughly divided into four categories based on different forwarding strategies. The Prophet routing algorithm is an important routing algorithm in opportunistic networks. It forwards messages based on the encounter probability between nodes, and has good innovation significance and optimization potential. However, the Prophet routing algorithm does not consider the impact of the historical… More >

  • Open Access

    ARTICLE

    A Nonuniform Clustering Routing Algorithm Based on an Improved K-Means Algorithm

    Xinliang Tang1, Man Zhang1, Pingping Yu1, Wei Liu2, Ning Cao3, *, Yunfeng Xu4

    CMC-Computers, Materials & Continua, Vol.64, No.3, pp. 1725-1739, 2020, DOI:10.32604/cmc.2020.010272 - 30 June 2020

    Abstract In a large-scale wireless sensor network (WSN), densely distributed sensor nodes process a large amount of data. The aggregation of data in a network can consume a great amount of energy. To balance and reduce the energy consumption of nodes in a WSN and extend the network life, this paper proposes a nonuniform clustering routing algorithm based on the improved K-means algorithm. The algorithm uses a clustering method to form and optimize clusters, and it selects appropriate cluster heads to balance network energy consumption and extend the life cycle of the WSN. To ensure that More >

  • Open Access

    ARTICLE

    GACNet: A Generative Adversarial Capsule Network for Regional Epitaxial Traffic Flow Prediction

    Jinyuan Li1, Hao Li1, Guorong Cui1, Yan Kang1, *, Yang Hu1, Yingnan Zhou2

    CMC-Computers, Materials & Continua, Vol.64, No.2, pp. 925-940, 2020, DOI:10.32604/cmc.2020.09903 - 10 June 2020

    Abstract With continuous urbanization, cities are undergoing a sharp expansion within the regional space. Due to the high cost, the prediction of regional traffic flow is more difficult to extend to entire urban areas. To address this challenging problem, we present a new deep learning architecture for regional epitaxial traffic flow prediction called GACNet, which predicts traffic flow of surrounding areas based on inflow and outflow information in central area. The method is data-driven, and the spatial relationship of traffic flow is characterized by dynamically transforming traffic information into images through a two-dimensional matrix. We introduce… More >

  • Open Access

    ARTICLE

    Single Failure Routing Protection Algorithm in the Hybrid SDN Network

    Haijun Geng1, Jiangyuan Yao2, *, Yangyang Zhang3

    CMC-Computers, Materials & Continua, Vol.64, No.1, pp. 665-679, 2020, DOI:10.32604/cmc.2020.09912 - 20 May 2020

    Abstract Loop free alternate (LFA) is a routing protection scheme that is currently deployed in commercial routers. However, LFA cannot handle all single network component failure scenarios in traditional networks. As Internet service providers have begun to deploy software defined network (SDN) technology, the Internet will be in a hybrid SDN network where traditional and SDN devices coexist for a long time. Therefore, this study aims to deploy the LFA scheme in hybrid SDN network architecture to handle all possible single network component failure scenarios. First, the deployment of LFA scheme in a hybrid SDN network More >

  • Open Access

    ARTICLE

    A Safe and Reliable Routing Mechanism of LEO Satellite Based on SDN

    Chao Guo1, *, Juan Guo2, Chanjuan Yu1, Zhaobin Li1, Cheng Gong3, Abdul Waheed4

    CMC-Computers, Materials & Continua, Vol.64, No.1, pp. 439-454, 2020, DOI:10.32604/cmc.2020.09792 - 20 May 2020

    Abstract Satellite networks have high requirements for security and data processing speed. In order to improve the reliability of the network, software-defined network (SDN) technology is introduced and a central controller is set in the network. Due to the characteristics of global perspective, control data separation, and centralized control of SDN, the idea of SDN is introduced to the design of the satellite network model. As a result, satellite nodes are only responsible for data transmission, while the maintenance of the links and the calculation of routes are implemented by the controller. For the massive LEO… More >

Displaying 231-240 on page 24 of 253. Per Page