Internet of Things (IoT) consists of a variety of heterogeneous interconnected devices called objects or things. These objects are generally equipped with sensing, processing and wireless communication capabilities. Unfortunately, these capabilities are not enough compared to those of devices in traditional networks. For example, objects have low battery power, limited memory storage, and less processing power. There are some cases where objects have to communicate with each other. In an Autonomous Vehicular Network for example, when a vehicle needs to change its direction, it has to alert other vehicles in the same network. This is known as the permutation routing problem. More precisely, the permutation routing problem in IoT occurs when some things of the network possess items that belong to others. The goal is to send items to their respective owners. A number of solutions to the problem have been proposed in literature which focus mainly on Wireless Sensor Networks (where the memory size of objects are the same). In this paper, we propose an efficient permutation routing scheme for a single-hop IoT network (the memory size differs from one object to another). The proposed NESEPRIN protocol consists of two phases: In the first phase, we solve the permutation routing problem in a single-hop environment with a single channel, and secondly we generalize the previous solution to a network with multiple channels. Our solution makes use of the wake and sleep technique to improve the energy conservation of objects. The simulation results show that our protocol outperforms the existing protocols designed to solve the permutation routing problem in terms of energy saving when the volume of data to route is large. NESEPRIN is the better candidate to solve the permutation routing problem in a single-hop multi-channels IoT environment where the volume of data to route is huge.