Zonglin Fu¹, Pei Hu¹, Wei Li², Jeng-Shyang Pan^1,*, Shuchuan Chu¹

Intelligent Automation & Soft Computing, Vol.27, No.1, pp. 233-247, 2021, DOI:10.32604/iasc.2021.014192 - 07 January 2021

Abstract The Equilibrium Optimizer (EO) algorithm is a novel meta-heuristic algorithm based on the strength of physics. To achieve better global search capability, a Parallel Equilibrium Optimizer algorithm, named PEO, is proposed in this paper. PEO is inspired by the idea of parallelism and adopts two different communication strategies between groups to improve EO. The first strategy is used to speed up the convergence rate and the second strategy promotes the algorithm to search for a better solution. These two kinds of communication strategies are used in the early and later iterations of PEO respectively. To More >

Khairol Amali bin Ahmad¹, Mohammad Nazmul Hasan², Md. Sharif Hossen^2,*, Khaleel Ahmad³

CMC-Computers, Materials & Continua, Vol.66, No.3, pp. 3075-3087, 2021, DOI:10.32604/cmc.2021.014436 - 28 December 2020

Abstract Pocket Switched Networks (PSN) represent a particular remittent network for direct communication between the handheld mobile devices. Compared to traditional networks, there is no stable topology structure for PSN where the nodes observe the mobility model of human society. It is a kind of Delay Tolerant Networks (DTNs) that gives a description to circulate information among the network nodes by the way of taking the benefit of transferring nodes from one area to another. Considering its inception, there are several schemes for message routing in the infrastructure-less environment in which human mobility is only the… More >

Ahmad F. Subahi^1,*, Youseef Alotaibi², Osamah Ibrahim Khalaf³, F. Ajesh⁴

CMC-Computers, Materials & Continua, Vol.66, No.2, pp. 2077-2086, 2021, DOI:10.32604/cmc.2020.014094 - 26 November 2020

Abstract Network security and energy consumption are deemed to be two important components of wireless and mobile ad hoc networks (WMANets). There are various routing attacks which harm Ad Hoc networks. This is because of the unsecure wireless communication, resource constrained capabilities and dynamic topology. In order to cope with these issues, Ad Hoc On-Demand Distance Vector (AODV) routing protocol can be used to remain the normal networks functionality and to adjust data transmission by defending the networks against black hole attacks. The proposed system, in this work, identifies the optimal route from sender to collector, prioritizing the number… More >

Haijun Geng^1,2,*, Han Zhang³, Yangyang Zhang⁴

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 >

Mohammed Kaddi^1,*, Abdallah Banana², Mohammed Omari¹

CMC-Computers, Materials & Continua, Vol.66, No.2, pp. 1497-1510, 2021, DOI:10.32604/cmc.2020.012116 - 26 November 2020

Abstract Wireless sensor network (WSN) has been widely used due to its vast range of applications. The energy problem is one of the important problems influencing the complete application. Sensor nodes use very small batteries as a power source and replacing them is not an easy task. With this restriction, the sensor nodes must conserve their energy and extend the network lifetime as long as possible. Also, these limits motivate much of the research to suggest solutions in all layers of the protocol stack to save energy. So, energy management efficiency becomes a key requirement in… More >

Ahmed Y. Hamed¹, Monagi H. Alkinani², M. R. Hassan^3,*

Intelligent Automation & Soft Computing, Vol.26, No.6, pp. 1201-1216, 2020, DOI:10.32604/iasc.2020.012663 - 24 December 2020

Abstract Many applications require to send information from a source node to multiple destinations nodes. To support these applications, the paper presents a multi-objective based genetic algorithm, which is used in the construction of the multicast tree for data transmission in a computer network. The proposed algorithm simultaneously optimizes total weights (cost, delay, and hop) of the multicast tree. Experimental results prove that the proposed algorithm outperforms a recently published Multi-objective Multicast Algorithm specially designed for solving the multicast routing problem. Also, the proposed approach has been applied to ten-node and twenty-node network to illustrate its More >

Ru Jin^*, Xinlian Zhou, Yue Wang

Journal of Information Hiding and Privacy Protection, Vol.2, No.3, pp. 115-123, 2020, DOI:10.32604/jihpp.2020.010180 - 18 December 2020

Abstract In a wireless sensor network [1], the operation of a node depends on the battery power it carries. Because of the environmental reasons, the node cannot replace the battery. In order to improve the life cycle of the network, energy becomes one of the key problems in the design of the wireless sensor network (WSN) routing protocol [2]. This paper proposes a routing protocol ERGD based on the method of gradient descent that can minimizes the consumption of energy. Within the communication radius of the current node, the distance between the current node and the More >

Mohammad Behrouzian Nejad^∗

Computer Systems Science and Engineering, Vol.35, No.5, pp. 367-375, 2020, DOI:10.32604/csse.2020.35.367

Abstract Considering that routing algorithms for the Network on Chip (NoC) architecture is one of the key issues that determine its ultimate performance, several things have to be considered for developing new routing algorithms. This includes examining the strengths, capabilities, and weaknesses of the commonly proposed algorithms as a starting point for developing new ones.
Because most of the algorithms presented are based on the well-known algorithms that are studied and evaluated in this research. Finally, according to the results produced under different conditions, better decisions can be made when using the aforementioned algorithms as well as… More >

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 >

Yi-Chih Hsieh¹, Peng-Sheng You^2,*

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 >