使用螞蟻聚集演算法解決無線感測網路資料結合的問題

AN ANT COLONY ALGORITHM FOR DATA AGGREGATION IN WIRELESS SENSOR NETWORKS

范建銘(Chien-ming Fan)

指導教授 ： 廖文華

大同大學/經營設計學院/資訊經營學系所/碩士(2007年)

摘要

在無線感測網路中，資料結合是用來降低傳送資料的能源消耗。而螞蟻演算法
是人工智慧技術之一，它是利用螞蟻本身自然的特性，去探尋可能的路徑和維護原
本已經存在的路徑。在本論文中，我們提出一個螞蟻演算法來解決在無線感測網路
中資料結合的問題。每一隻螞蟻將會找尋從來源點至目的點的路徑，並且在路徑中
遺留費洛蒙，利用費洛蒙的殘留量來尋找較佳的資料結合點。從實驗中可驗證我們
的方法可以大大的降低傳輸成本。

關鍵字

無線感測網路 ； 螞蟻演算法 ； 資料集合

並列摘要

Data aggregation has been put forward as an essential paradigm for energy efficient routing in energy constraint wireless sensor network. Ant colony is a population-based algorithm. It applies ant’s natural and intrinsic character to explore the undeveloped space and to maintain developed path. In this paper, we propose an ant colony algorithm for data aggregation in wireless sensor networks. Every ant will explore some paths from source node to sink node. The data aggregation will occur by the remaining pheromone. The simulations have shown that out algorithm will deduce significant energy cost.

並列關鍵字

wireless sensor networks ； ant colony algorithm ； data aggregation

參考文獻

[1] Subhasis Bhattacharjee and Nabanita Das, “Distributed Data Gathering Scheduling in Multihop Wireless Sensor Networks for Improved Lifetime,” Proceedings of the International Conference on Computing: Theory and Applications, Mar. 2007.

[2] Marco Dorigo and Luca Maria Gambardella, “Ant colony system: A cooperative

learning approach to the traveling salesman problem,” IEEE Transactions on

Evolutionary Computation, Volume 1, Issue 1, Apr. 1997.

[3] Frederick Ducatelle, Gianni Di Caro, and Luca Maria Gambardella, “Using ant agents to combine reactive and proactive strategies for routing in mobile ad hoc networks,” International Journal of Computational Intelligence and Applications, Vol. 5, No. 2, Mar. 2005.