A new way of routing, traffic-conscious and energy consumption on the Internet of Things
The Internet of Things, or IoT, is a system of interconnected computer equipment, mechanical and digital machines, objects, animals, or individuals, identified by unique identities, and with the abilit y to transfer data over a network without the need for human-to-human or computer-to-human inter...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
ICI Publishing House
2020-09-01
|
Series: | Revista Română de Informatică și Automatică |
Subjects: | |
Online Access: | https://rria.ici.ro/wp-content/uploads/2020/09/art._Naderloo_Shafiabadi.pdf |
Summary: | The Internet of Things, or IoT, is a system of interconnected computer equipment, mechanical
and digital machines, objects, animals, or individuals, identified by unique identities, and with the abilit y
to transfer data over a network without the need for human-to-human or computer-to-human interaction.
One of the most important technologies in this field is the use of sensors in the context of this type of
network. A wireless sensor network includes sensor nodes located in geographical areas and their job is to
monitor phenomena such as humidity, temperature, vibration and earthquake. These wireless sensor nodes
are actually located at the edge of the IoT networks and the information is sent to the IoT network through
these nodes.One of the challenges in the field of devices used in IoT is the energy consumption of the
network edge device. It is very important to manage energy and reduce energy consumption in this area,
because most of these devices are wireless, therefore, in this study, a solution based on ant algorithms has
been proposed. In order to do the best clustering in this type of network, to reduce the energy consumption
of devices at the edges of the network, the results of the proposed algorithm show the efficiency of the
proposed method and the energy improvement in the ant algorithm is between fifteen and twenty percent
less than the compared algorithm. |
---|---|
ISSN: | 1220-1758 1841-4303 |