An IoT Ant Colony Foraging Routing Algorithm Based on Markov Decision Model
Chao Cheng, Zhi-hong Qian, Guang Ji
Available Online May 2014.
- https://doi.org/10.2991/scict-14.2014.31How to use a DOI?
- IoT; Markov decision model; Ant colony algorithm; Energy balance; optimal path
- This paper proposes a Markov decision ant colony routing selection algorithm based on the multi-parameter equilibrium. In this routing algorithm, five unit group Markov routing decision model based on IoT is build, network link quality, node residual energy and neighbor node number three aspects is considered, the node next-hop route set is gained by the value iteration process, ant colony algorithm is used to calculate the transition probability of nodes in allow decision set, and the optimal path selection of IoT routing is completed. Simulation results show that in the algorithm the overhead generated by messages is reduced effectively, the network energy consumption is balanced, and the network life cycle is prolonged.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Chao Cheng AU - Zhi-hong Qian AU - Guang Ji PY - 2014/05 DA - 2014/05 TI - An IoT Ant Colony Foraging Routing Algorithm Based on Markov Decision Model BT - Proceedings of the 2nd International Conference on Soft Computing in Information Communication Technology PB - Atlantis Press SP - 131 EP - 134 SN - 1951-6851 UR - https://doi.org/10.2991/scict-14.2014.31 DO - https://doi.org/10.2991/scict-14.2014.31 ID - Cheng2014/05 ER -