The location of wireless sensor nodes located in the center is necessary for applications
where information about the site is important information such as security, protection,
object tracking and other applications.
localization algorithms are c
lassified into two types: Range-based and Range-free. The
study focused on Range-free localization algorithms because they are less expensive in
terms of hardware requirements.
The MATLAB was used to simulate the algorithms, whose performance was evaluated by
changing the number of network nodes, the number of Anchor nodes, and the contract area
of communication in order to illustrate performance differences in terms of localization
error.
The results showed the superiority of the amorphous algorithm, achieving high localization
accuracy and lower cost for the number of Anchor nodes needed to achieve a small error.
