Abstract

In this paper, a new algorithm is proposed for computing the node-disjoint optimal transmission energy consumption route for coded cooperative mobile IoT networks. Inspired by the potential benefits user cooperation can provide, we incorporate user cooperation to the mobile ad-hoc multi-hop IoT networks. Our results include a novel ant colony system-based node-disjoint energy-efficient routing algorithm. Ant colony system can approximate the optimal route by local information and is thus very suitable for mobile IoT network environment. In particular, ant algorithm makes history-sensitive choice and thus can significantly outperform the greedy algorithm. In addition, it can efficiently handle the case of multiple sources and multiple destinations. For a large IoT network, we investigate the multi-scale ant colony system and when compared to Dijkstra algorithm, such an algorithm usually shortens the runtime by a factor of several hundred.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call