The Optimal Design of Tree Structure Based on Ant Colony of Wireless Sensor Networks Routing

In wireless sensor networks, proposed an energy efficient routing strategy based on ant colony algorithm. The algorithm combined residual energy of nodes, and accorded to transition probability to choose the next node. When ants passed a node, updated the path list and node information table .Through the node information table, nodes in the network are divided into ordinary nodes and aggregation nodes, formed a tree network looking ordinary nodes as leaves, aggregation nodes as tree branches, sink nodes as tree roots. In the aggregation nodes, data fusion is processed. So traffic is reduced and the energy is saved. The simulation proved that this algorithm improved the load balancing problem and extended the network life cycle.

[1]  Guillermo A. Francia A Wireless Sensor Network , 2003, International Conference on Wireless Networks.

[2]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[3]  Wang Chun-xia,et al.  The Wireless Sensor Network Technology , 2010 .

[4]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[5]  Imed Bouazizi,et al.  ARA-the ant-colony based routing algorithm for MANETs , 2002, Proceedings. International Conference on Parallel Processing Workshop.

[6]  Hu Yan-jun Wireless Sensor Network Technology , 2006 .

[7]  Sun Li Routing Mechanism in Sensor Networks , 2004 .

[8]  Torsten Braun,et al.  Ants-Based Routing in Large Scale Mobile Ad-Hoc Networks , 2003, KiVS Kurzbeiträge.

[9]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[10]  Léon J. M. Rothkrantz,et al.  Ant-Based Load Balancing in Telecommunications Networks , 1996, Adapt. Behav..

[11]  A. Manjeshwar,et al.  TEEN: a routing protocol for enhanced efficiency in wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.