一种无线传感器网络蚁群优化路由算法.pdfVIP

第20 卷 第11 期 传 感 技 术 学 报 V ol. 20 No. 11 2007 年11 月 CHINESE JOURNAL OF SENSORS AND A CTUAT ORS NOV . 2007 ACO-Based Routing Algorithm for Wireless Sensor Networks( ARAWSN) * 1, 2, 3* 1, 2 1, 2 1 1, 3 L IAN G H ua-wei , CH EN Wan-ming , L I S huai , MEI Tao , MEN G Qing-hu 1. I nstitute of Intellig ent Mach ines, Chinese Aca emy of Sciences, H ef ei 230031, China; 2. Dep ar tment of A utomation, University of Science an Technology of China, H ef ei 230027, Ch ina; 3. Dep ar tment of Electr onic Eng ineering, The Chinese University of H ong K ong , Sha T ian, H ong K ong Abstract How to get high efficient data routing for the limited energy resource networks is an important problem in the study of the wireless sensor networks. Appling the Ant Colony ptimization Algorithm (AC ) on the routing of wireless sensor networks, we proposed an AC -based routing algorithm for wire- less sensor networks called ARAWSN. T he algorithm utilized the self-organization, self-adaptability and dynamic optimization capabilities of the Ant Colony to build and maintain the optimal network path. It a- dopted the conception of Stigmergy to minimize the flow number of the control information and achieve high efficient data transitions for the network. In our experiment, the average time delay using the AC - based routing algorithm is comparative to that of Directed Diffusion (DD) algorithm but has notable effect intheenergy costof routing comparedtoDDalgorithm. Inaddition, thisalgorithm alsohasgooddependability and high adaptability. And it can also achieve congestion control and energy balance for wireless sensor networks if needed. Key words wireless sensor network;network route; ant colony optimization;routing algorithm EEACC 6150P *