Using Ant Colony Routing Algorithm in Cluster-based Wireless Sensor Networks

機構典藏 > College of Global Entrepreneurial Development > Department of Innovative Information and Technology > Proceeding > Item 987654321/116631

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/116631

Title:	Using Ant Colony Routing Algorithm in Cluster-based Wireless Sensor Networks
Authors:	Wu, Shih-Jung, et al.
Keywords:	Wireless Sensor Networks;LEACH;Ant-Colony Optimization
Date:	2018-10-24
Issue Date:	2019-05-14 12:10:23 (UTC+8)
Abstract:	In recent years, the development of micro-manufacture, communication and battery technologies has reduced the size of that, we can compose the sensor, wireless communication, and date processing units into a sensor node which is the basis of Wireless Sensor Networks(WSNs). WSNs contains a large number of sensor nodes. Since the energy of nodes is limited, and environment is not easy to get energy, the energy efficiency is a key design that needs to be enhanced in order to improve the life-time of the network. 　We use different cluster cutting strategies were proposed to deal with the large geographical differences, balance the energy load in the cluster and avoid the long-distance transmission between internal cluster nodes. In addition, in the cluster first transmission to the base station path selection, we use the Ant-Colony Optimization (Aco) finds the shortest path from the cluster-heads to the base station, that can be avoided long-distance intra-cluster data delivery. Simulation results demonstrate our strategy are efficient.
Appears in Collections:	[Department of Innovative Information and Technology] Proceeding

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	314	View/Open