A New Routing Algorithm based on Devices Cooperation for better QoS within IoT

Fairly and efficiently energy utilization among the devices and the delay spent by sending their data are a majors constraints within Internet of Things (IoT) environment. We focus the applicability of coalition game theory to stimulate cooperation among devices and analysing the performance of multipath routing to meet the quality of service (QoS). In this paper, we present a new routing algorithm, called RACD (Routing Algorithm based on Cooperation between Devices) in order to optimize the energy consumption and the link delay during the routing process. The principles that have been exploited by RACD are the multi-metrics routing and the coalitional game theory. RACD allow to selects a route with lower delay and minimum energy consumption among multiple coalitions. Others principles have been exploited too by our proposed algorithm, such as the payoff function of coalition, the core of the game and the Shapely. The performances of our proposed routing algorithm have been evaluated by simulations according to important metrics and the results obtained have been compared to two others routing solutions that are ELDR and MAODV.