5.1 結論
本研究所提出的路由演算法(ATBRA)不僅在高度動態網路拓樸環境下有很 高的效能，並且可同時解決多點跳躍傳輸方式所產生自私節點與惡意節點的問 題，相較於其它路由演算法(DSR)，ATBRA 可以解決更多無基礎環境下所產生 的問題，同時所產生的 RO 又較少，以下提出三點有關本研究對既有演算法(DSR 與 ARA)改良的部份做說明：
(1) ATBRA 結合了 DSR 與 ARA 的路徑節點選擇方式，以廣播與費洛蒙並行 的方式，能有效提升網路效能並降低 RO。
(2) ATBRA 的路由封包中紀錄完整路由路徑，能比 ARA 累積較多費洛蒙而 更速尋找到路由路徑。
(3) ATBRA 將禁忌名單的觀念結合螞蟻演算法做為選擇路徑的機制，能解決 多點跳躍傳輸方式所產生的問題。
為了驗證 ATBRA 的效能，本研究在 NS2 模擬平台上實做出此路由演算法，
並且參考其他學者的驗證方式與模擬環境，將 ATBRA 與其它常見的路由演算法 (DSR 與 DSDV)以 SDR 與 RO 作效能評比項目，並探討動態拓樸、自私節點、
封包大小、封包數目與傳送間距對於路由演算法的影響。
實驗結果發現，ATBRA 在高度動態的網路拓樸環境下能有著與 DSR 一樣高 的 SDR，但是所需要的 RO 卻較少，而在有自私節點的環境下，雖然 ATBRA 與 DSR 的效能都因此而降低，但是 ATBRA 的效能還是比 DSR 好。
5.2 未來研究方向
以下針對本研究所提出來的路由演算法(ATBRA)在未來可能改進的地方加 以說明：
(1) ATBRA 藉由本研究的實驗證明能在高度動態網路拓樸環境下有良好的 效能，同時 ATBRA 有著所產生的 RO 較少的優點，可利用此優點發展 出一適合應用在大型無基礎行動網路環境下的路由演算法。
(2) ATBRA 利用螞蟻內建的禁忌名單來降低將自私節點與惡意節點的納入 路由路徑的可能性，以達到尋找穩定或安全路徑的目的，未來可將相同 的概念應用於其它目的的路由路徑上，例如省電路由的尋找。
參考文獻
[1] C. Siva Ram Murthy, B.S. Manoj, “Ad Hoc Wireless Networks: Architectures and Protocols”, Prentice Hall PTR, 2004.
[2] C. E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proceedings of ACM SIGCOMM 1994, pp. 234-244, August 1994.
[3] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, Kluwer Academic Publishers, vol. 353, pp.
153-181, 1996.
[4] Dorigo M. and Gambardella L.M., “Ant Colonies for the Traveling Salesman Problem”, 1996.
[5] Daniel Camara and Antonio Alfredo F.Loureiro, ”A GPS/Ant-Like Routing Algorithm for Ad Hoc Networks,” Proceedings of the IEEE Wireless Communications and Networking Conference(WCNC’00), September 2000.
[6] G. Rote, “Path Problems in Graphs,” Computing Supplementum, 1990.
[7] Glover, F. and M. Laguna, “Tabu Search,” KluwerAcademic Publishers, 1997.
[8] Hongmei Deng, Wei Li, Dharma P. Agrawal, “Routing Security in Wireless Ad Hoc Network”, IEEE Communications Magazine, 2002.
[9] Horst F. Wedde, Muddassar Farooq, Thorsten Pannenbaecker, Bjoern Vogel, Christian Mueller, Johannes Meth and Rene Jeruschkat, “BeeAdHoc: An Energy Efficient Routing Algorithm for Mobile Ad Hoc Networks Inspired by Bee Behavior,” Proceedings of the 2005 conference on Genetic and evolutionary computation, June 25-29, 2005.
[10] J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,”
Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’98), pages 85–97, 1998.
[11] K. Fall and K. Varadhan, “The ns Manual,” 2000.
[12] Lumer E.D. and Faieta B., “Diversity and Adaptation in Populations of Clustering Ants”, MIT-Press, 1994.
[13] Laurent Eschenauer, Virgil D. Gligor, John S. Baras, “On Trust Establishment in
Mobile Ad-Hoc Networks,” Security Protocols Workshop, 2002.
[14] M. Abolhasan, T. Wysocki, and E. Dutkiewicz, “A Review of Routing Protocols for Mobile Ad Hoc Networks,” Ad Hoc Networks, vol. 2, pp. 1–22, 2004.
[15] Monmarché N., Slimane M. and Venturini G., “AntClass: Discovery of Clusters in Numeric Data by An Hybridization of An Ant Colony with The Kmeans algorithm”, Internal Repport, 1999.
[16] Michael W. Carter, Camille C. Price, “Operations Research: A Practical Introduction”, CRC Press, 2001.
[17] M. Gunes, U. Sorges, and I. Bouazizi, “ARA – The Ant-Colony Based Routing Algorithm for MANETs,” International Conference on Parallel Processing Workshops (ICPPW’02), Vancouver, B.C., Canada, August 18–21, 2001.
[18] M.Heissenbuttel and T.Braun, “Ants-based Routing in Large Scale Mobile Ad-Hoc Networks”, KiVs03, March 2003.
[19] Srisathapornphat, C., Shen, C.-C., “Ant-Based Energy Conservation for Ad hoc Networks,” 12th International Conference on Computer Communications and Networks (ICCCN), 2003.
[20] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Communication & Mobile Computing (WCMC):
Special Issue on Mobile Ad Hoc Networking Research, Trends and Applications, Vol. 2, No. 5, pp. 483-502, 2002.
[21] Tao Jiang, John S. Baras, “Ant-Based Adaptive Trust Evidence Distribution in MANET,” ICDCS Workshops, 2004.
[22] Taichi Kaji, “Approach by Ant Tabu Agents for Traveling Salesman Problem,”
IEEE, 2001.
[23] Z. J. Haas, “The Routing Algorithm for the Reconfigurable Wireless Networks,”
Proceedings of ICUPC 1997, vol. 2, pp. 562-566, October 1997.
[24] Zeng Yuan-yuan and He Yan-xiang, “Ant Routing Algorithm for Mobile Ad-Hoc Networks Based on Adaptive Improvement,” Wireless Communications, Networking and Mobile Computing, 2005.
[25] http://www.tracegraph.com/conference.html [26] http://en.wikipedia.org/wiki/Random_graph