The Internet of Things (IoT) has emerged as a promising paradigm which facilitates the seamless integration of physical devices and digital systems, thereby transforming multiple sectors such as healthcare, transportation, and urban planning. This paradigm is also known as ad-hoc networks. IoT is characterized by several pieces of equipment called objects. These objects have different and limited capacities such as battery, memory, and computing power. These limited capabilities make it difficult to design routing protocols for IoT networks because of the high number of objects in a network. In IoT, objects often have data which does not belong to them and which should be sent to other objects, then leading to a problem known as permutation routing problems. The solution to that problem is found when each object receives its items. In this paper, we propose a new approach to addressing the permutation routing problem in single-hop IoT networks. To this end, we start by representing an IoT network as an oriented graph, and then, based on a reservation channel protocol, we first define a permutation routing protocol for an IoT in a single channel. Secondly, we generalize the previous protocol to make it work in multiple channels. Routing is done using graph theory approaches. The obtained results show that the wake-up times and activities of IoT objects are greatly reduced, thus optimizing network lifetime. This is an effective solution for the permutation routing problem in IoT networks. The proposed approach considerably reduces energy consumption and computation time. It saves 5.2 to 32.04% residual energy depending on the number of items and channels used. Low energy and low computational cost demonstrate that the performance of circuit-based and oriented graph theory is better than the state-of-the-art protocol and therefore is a better candidate for the resolution of the permutation routing problem in single-hop environment.

中文翻译：

---

CIBORG：用于单跳物联网网络的基于电路和面向图论排列路由协议


物联网 (IoT) 已成为一种有前途的范式，它促进物理设备和数字系统的无缝集成，从而改变医疗保健、交通和城市规划等多个领域。这种范例也称为自组织网络。物联网的特点是由多个称为对象的设备组成。这些物体具有不同且有限的容量，例如电池、内存和计算能力。由于网络中的对象数量众多，这些有限的功能使得设计物联网网络的路由协议变得困难。在物联网中，对象通常具有不属于它们的数据，这些数据应该发送到其他对象，然后导致称为排列路由问题的问题。当每个对象收到它的项目时，就会找到该问题的解决方案。在本文中，我们提出了一种解决单跳物联网网络中排列路由问题的新方法。为此，我们首先将物联网网络表示为有向图，然后基于预留通道协议，我们首先为单通道中的物联网定义排列路由协议。其次，我们概括了之前的协议，使其能够在多个通道中工作。路由是使用图论方法完成的。获得的结果表明，物联网对象的唤醒时间和活动大大减少，从而优化了网络生命周期。这是物联网网络中排列路由问题的有效解决方案。所提出的方法大大减少了能耗和计算时间。根据使用的物品和通道的数量，它可以节省 5.2% 至 32.04% 的剩余能量。 低能量和低计算成本表明基于电路和面向图论的性能优于最先进的协议，因此是解决单跳环境中排列路由问题的更好候选者。