A distributed multicast routing algorithm based on the position for the Internet of objects using the Frog mutation optimization algorithm

A distributed multicast routing algorithm based on the position for the Internet of objects using the Frog mutation optimization algorithm

Meysam Shirmohamdi1 Kazem Hasanzadeh2

1) Master of Computer Software Trend, Islamic Azad University, Ilam, Iran
2) Master of Computer Software Trend, Islamic Azad University, Borojerd, Iran

IOI Code : XBHB-EACKG
Publication : International Congress of Science and Engineering - TOKYO UNIVERSITY - JAPAN(tuicet.com)
Abstract :
    The Internet of Things is an emerging and growing phenomenon in the area of ​​the network that attracted the attention of many scholars in recent years. One of the main issues in a network with these dimensions and the speed of growth is data routing. In many Internet applications of objects, data packets may need to be sent to multiple objects or nodes via multicast. This mode of data sending is called multicast routing. Multidisciplinary routing requires higher processing power due to the nature of processing multiple paths instead of a path. In this research, a routing algorithm is proposed to improve multicast routing operations in the Internet of Things. In the proposed method, a fast algorithm for multicast routing for networks based on the Internet structure of objects is presented. This algorithm consists of three steps: In the first step, the middle nodes are selected for forwarding and destination access. Selecting nodes and forming the initial paths for multicasting data using node energy metrics and buffer memory levels. In the second step, the selected paths are edited in the first step so that there are no further or additional steps in the paths. In the proposed method, the path edit operation is performed using the Frozen Leap Optimization (SFL) algorithm. This algorithm determines the optimal state for each path using an energy-based fitting function and end-to-end delay function. After editing the path, it is finally examined whether the paths formed can be merged together and, if possible, the operation of the integration of the paths is performed. The effectiveness of the proposed method in various simulated scenarios was studied and the results were compared with the previous work. The results of this research show that the proposed method can deliver multicast packets more successfully to destination nodes.

Keywords : internet objects multicast routing optimize frog leap