An IoT Ant Colony Foraging Routing Algorithm Based on Markov Decision Model
暂无分享,去创建一个
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. Keywords-IoT; Markov decision model; Ant colony algorithm; Energy balance; optimal path
[1] De-gan Zhang,et al. A New Service-Aware Computing Approach for Mobile Application with Uncertainty , 2011 .
[2] Wang Jian. TrANTHOCNET:Confidence Ant Colony Routing Algorithm in MANET , 2012 .
[3] Kung Yao,et al. Energetic trade-off between computing and communication resource in multimedia surveillance sensor network , 2002, 4th International Workshop on Mobile and Wireless Communications Network.
[4] Wang Yijun,et al. IoT Technology and Application , 2012 .