Open AccessA Comparision of Node Detection Algorithms Over Wireless Sensor Network
Author(s) -
Hussain Falih Mahdi,
Mohammed Hasan Alwan,
Baidaa AL-Bander,
Aws Zuhair
Publication year - 2022
Publication title -
international journal of interactive mobile technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.316
H-Index - 16
ISSN - 1865-7923
DOI - 10.3991/ijim.v16i07.24609
Subject(s) - computer science , computer network , weighted round robin , queue , network packet , mobile ad hoc network , scheduling (production processes) , quality of service , end to end delay , queueing theory , algorithm , throughput , real time computing , wireless , round robin scheduling , telecommunications , mathematics , mathematical optimization , fair share scheduling
MANET is standing for Network as Mobile Ad-hoc which is a self-directed mobile handlers group which communicates over relatively bandwidth constrained wireless channels. Many services with different classes of Quality of Services (QoS) could be provided through the MANET such as data, voice, and video streaming. Thus, efficient packets routing is an essential issue especially over this kind of burst channel. To settle this issue, many scheduling techniques are proposed to reduce the packets dropping and channel collision when a huge demand of data is transferred from a sender to a receiver. In this paper, four MANET scheduling algorithms are selected and investigated in mobile ad hoc network which are Strict Preference (SP), Round Robin (RR), Weighted Round Robin (WRR), and Weighted Fair (WF). The network simulator EXata 2.0.1 is used to build the scenario which is consist of 50 nodes and performed the simulation. The results showed the performance metrics difference of the network such as the throughput and the end-end delay as well as queuing metrics like peak queue size, average queue length, in queue average time, and droppe of whole packets. Regrading throughput, the SP algorithm has a greater throughput than WF, RR, and WRR by 4.5%, 2.4%, and 1.42%, but WRR has outperformed others regarding the end-end delay. Moreover, WRR represents the best scheduling algorithm regarding both peak queue size since its greater than RP, WF, and WRR by 10.13%, 9.6%, and 5.32%, in order, and average output queue length in contrast, WRR worsts more time in queuing but it is the best in preventing the packets from dropping.