A Novel Routing Algorithm Based on Ant Colony Optimization for Hierarchical Wireless Sensor Networks
暂无分享,去创建一个
In order to utilize the limited energy of nodes efficiently and reduce the routing overhead in wireless sensor networks (WSN), this chapter proposes and describes an improved intercluster routing algorithm based on ant colony optimization. Firstly, we define three types of nodes in a cluster to meet the demand of large-scale WSN. Secondly, the weight parameter is defined and mapped to variables of ant colony algorithm based on the characteristics of WSN. Then the new algorithm is proposed, utilizing the ant colony to get the optimum route among cluster heads. Moreover, multipaths are built to enhance the validity of data transmission. The simulation results show that the new algorithm is effective for improving the optimization probability and balance the network load.
[1] Tao Jiang,et al. Clustering algorithm in initialization of multi-hop wireless sensor networks , 2009, IEEE Transactions on Wireless Communications.
[2] Ossama Younis,et al. HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.
[3] Xiaoyan Hong,et al. An ad hoc network with mobile backbones , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).