Wisam Mahmood Lafta
University of Technology

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Best strategy to control data on internet-of-robotic-things in heterogeneous networks Wisam Mahmood Lafta; Ahmed A. Alkadhmawee; Mohammed A. Altaha
International Journal of Electrical and Computer Engineering (IJECE) Vol 11, No 2: April 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v11i2.pp1830-1838

Abstract

The control and transmission of huge data constitute an immense challenge in various types of networks (wired and wireless). Congestion caused by the high traffic and low throughput of huge data continues to be major problems in a heterogeneous platforms such as internet of things (IoT) technology and internet-of-robotic-things (IoRT). The heterogeneous network requires new models and mechanisms to deal with the increased challenges posed by IoT and IoRT. Accordingly, eliminating the issues that emerge has compelled finding improved solutions as a new strategy. This study proposed a new strategy called routing information and distance vector (RIDV) to create the best improvement of a heterogeneous network. The RIDV strategy activates the routing information protocol (RIPv2) on a router in wire network parallel with the ad-hoc on-demand distance vector (AODV) protocol on the wireless network. The RIDV strategy is used to solve the problems of the diversity of heterogeneous networks as the basis of the infrastructure IoRT technology. Hence, this strategy can reduce or avoid congestion through the use of enhanced and effective best routing protocols. Simulation results using OPNET show that the proposed method improved the quality of service (QoS) compared with other related strategies and AODV and RIPv1 protocols in terms of data drop, traffic drop, queue delay, and throughput.
Unequal clustering algorithm with IDA* multi-hop routing to prevent hot spot problem in WSNs Ahmed A. Alkadhmawee; Mohammed A. Altaha; Wisam Mahmood Lafta
Indonesian Journal of Electrical Engineering and Computer Science Vol 20, No 1: October 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v20.i1.pp445-453

Abstract

Energy conservation techniques are considered as the primary means of lengthening the lifetime of wireless sensor networks (WSNs). Clustering is a useful technique that achieves long-term operation of the network. Cluster heads that are near the base station are expected to die early because they are responsible for collecting data that comes from far away in addition to their own data, thereby leading to problem of hot spot in the WSN.This paper presents a new protocol that uses an unequal clustering algorithm with an IDA* routing method to address the hot spot problem. The base station divides the network into three levels of unequal sizes of clusters. The base station takes into consideration the energy level and the distance from the base station for cluster-head selection in each cluster. The cluster head will be changed based on the energy threshold for each cluster. The proposed method uses an IDA* algorithm for efficient multi-hop routing in the network. The uneven clustering algorithm reduces the energy consumption of the nodes, thereby minimising the hot spot problem. The obtained simulation results prove that our approach increases the load balancing, improves the stability and prolongs the network lifetime compared with other related approaches.