廣播(Broadcasting)是一種讓網路節點可以透過無線頻道將封包散布至其鄰居節點的通訊模型。它在行動隨意網路(Mobile Ad Hoc Networks, MANETs)中通常是以氾濫式(Flooding) 的廣播方式來實現，以便於尋找路徑、發送警告訊息或者是呼叫特定的目標。傳統的隨意式網路協定，如Ad hoc On-demand Distance Vector (AODV)便是使用氾濫式廣播確保每個節點都能夠收到必要的資訊。然而使用氾濫式廣播會有冗餘重播、媒介競爭以及封包碰撞之缺點，以上的現象稱為廣播風暴問題(Broadcast Storm Problem)。有鑑於此，以閒話式(Gossiping)為基礎的廣播方式被提出來減輕此問題。它的概念是藉由一個機率值來控制某些節點使其決定是否在接受封包之後再轉送(Forward)出去，藉此達到減少多餘的控制封包(Control packet)。此方法被整合於AODV，於文獻中被稱為AODV+G，並且在模擬結果上有傑出的表現。在本篇論文中，我們透過觀察AODV＋G的行為進行其數學模型之推論，並且將節點剩餘電能的多寡納入AODV＋G的決定封包傳遞機率機制中，稱之為 AODV+GE，來延長無線隨意式行動網路的整體生命和提升封包傳送率。透過數學推論所得到的數學模型跟模擬結果，我們可以得知AODV+GE在整體網路生命週期、節點平均消耗電量和封包抵達率上均比AODV+G來的優異。

Broadcasting is a communication model for a node to emit the packets via wireless channels to its neighbor nodes. In mobile ad hoc networks (MANETs), it is commonly implemented through flooding to find routes, send alarm signals and page a particular host. Conventionally, ad hoc routing protocols, such as AODV, use blind flooding extensively for on-demand route discovery, which could result in a high number of redundant retransmissions, leading to serious contention and collisions referred to as the broadcast storm problem. A gossip-based approach, in which each node forwards a message with some probability, has been proposed in past years to alleviate this problem. The approach combines gossiping with AODV (denoted as AODV+G) and exhibits a significant performance improvement in simulations. In this paper, we make a mathematical inference from observing the behavior of the gossip-based approach, and improve the gossip-based approach by employing the remaining energy of nodes in the gossip mechanism (denoted as AODV+GE) to extend the lifetime of the entire network and improve the packet delivery ratio. Through mathematical inference and simulations we show that AODV+GE outperforms AODV+G in terms of the lifetime of the whole network, average node energy consumption, and packet delivery ratio.

致 謝 iii
摘 要 iv
Abstract v
目 錄 vi
圖 次 ix
表 次 xii
字母縮寫對照表 xiii
第一章 導論 1
1.1 簡介 1
1.1.1 無線網路的通訊模式 3
1.1.2 IEEE 802.11定義的無線網路架構 7
1.2 無線隨意式網路背景與介紹 9
1.2.1 隨意式網路中的路由機制 11
1.3 研究動機 14
1.4 論文架構 15
第二章 背景及相關研究 16
2.1 氾濫式(Flooding)廣播機制 16
2.2 閒話式(Gossiping)廣播機制 17
2.2.1 滲透理論 18
2.2.2 靜態Gossip (Static Gossip) 21
2.2.3 可調式Gossip (Adaptive Gossip) 22
2.2.4 滲透理論中的門檻值(Percolation threshold) 25
2.2.5 使用Gossiping機制改良的相關研究 26
第三章 系統之架構與運作 27
3.1 設計動機及方向 27
3.2 功能及名詞釋義 28
3.3 協定機制 29
3.3.1 網路模型 29
3.3.2 數學模型 29
3.3.3 AODV+GE演算法 35
第四章 模擬結果與討論 37
4.1 模擬環境假設 38
4.2 模擬環境參數設定 38
4.3 模擬工具介紹 39
4.4 數據分析與討論 43
4.4.1 Mathematical Model versus Simulation Model 44
4.4.2 Network Lifetime 46
4.4.3 Normalized Routing Load 48
4.4.4 Packet Delivery Ratio 49
4.4.5 Variance of Node Remaining Energy 50
4.4.6 Average Power Consumption 51
第五章 結論 52
參考文獻 53

[1] J. D. Abdulai, M. Ould-Khaoua, L. M. Mackenzie, and A. Mohammed, "Neighbour coverage: a dynamic probabilistic route discovery for mobile ad hoc networks," in Proc. Int. Symp. on Performance Evaluation of Computer and Telecommunication Systems, Edinburgh, UK, Jun. 2008, pp. 165-172.
[2] R. Beraldi, "A directional gossip protocol for path discovery in MANETs," in Proc. 26th IEEE Int. Conf. on Distributed Computing Systems Workshops, Lisboa, Portugal, Jul. 2006, pp. 82-82.
[3] 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," in Proc. 4th Annu. ACM/IEEE Int. Conf. on Mobile Computing and Networking, Dallas, TX, USA, Oct. 1998, pp. 85-97.
[4] L. Chen and W. B. Heinzelman, “QoS-aware routing based on bandwidth estimation for mobile ad hoc networks,” IEEE J. Sel. Areas Commun., vol. 23, no. 3, pp. 561-572, Mar. 2005.
[5] S. Choi and K. G. Shin, “A unified wireless LAN architecture for real-time and non-real-time communication services,” IEEE/ACM Trans. on Networking, vol. 8, no. 1, pp. 44-59, Feb. 2000.
[6] G. Grimmett, Percolation. New York: Springer-Verlag, 1989.
[7] Donald Gross, Carl M. Harris, Fundamentals of Queueing Theory. New York: John Wiley & Sons, Inc.,2008.
[8] Z. Haas, J. Halpern, and L. Li, “Gossip-based ad hoc routing,” in Proc. IEEE 21th Annu. Joint Conf. on IEEE Computer and Commun. Soc. vol. 3, 2002, pp. 1707-1716,.
[9] Z. J. Haas, M. R. Pearlman, and P. Samar, “The zone routing protocol for ad hoc networks,” Published Online, IETF MANET Working Group, INTERNET-DRAFT, July 2002, expiration: Jan. 2003.
[10] Z. J. Haas, J. Y. Halpern, and L. Li, “Gossip-based ad hoc routing,” IEEE/ACM Trans. on Networking, vol. 14, pp. 479-491, June 2006.
[11] M. Hamdaoui and P. Ramanathan, “Deferring real-time traffic for improved non-real-time communication in FDDI networks,” IEEE Trans. on Computers, vol. 44, pp. 1420-1428, Dec. 1995.
[12] S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, "A survey of gossiping and broadcasting in communication networks," Networks, vol. 18, pp. 319-349, 1988.
[13] V. Huang and W. Zhuang, “Optimal resource management in packet-switching TDD CDMA systems,” IEEE Pers. Commun., pp. 26-31, Dec. 2000.
[14] Teerawat Issariyakul and Ekram Hossain, Introduction to Network Simulator NS2, Springer Publishing Company, Incorporated, 2010.
[15] D. B. Johnson and D. A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks. Boston, MA: Kluwer Academic, 1996.
[16] D. B. Johnson, D. A. Maltz, and Y. C. Hu, “The dynamic source routing for mobile ad hoc networks,” IETF Internet Draft, Jul. 2004.
[17] M. Joa and I. T. Lu, “A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks,” IEEE J. Sel. Areas Commun., vol. 17, no. 8, pp. 1415-1425, Aug. 1999.
[18] Y. B. Ko and N. H. Vaidya, "Location-aided routing (LAR) in mobile ad hoc networks," in Proc. 4th Annu. ACM/IEEE Int. Conf. on Mobile Computing and Networking, Dallas, TX, USA, 1998, pp. 66-75.
[19] B. Krishnamachari, S. B. Wicker, R. Bejar, and M. Pearlman, "Critical density thresholds in distributed wireless networks," in Communications, Information and Network Security, H. Bhargava, H. V. Poor, V. Tarokh, and S. Yoon, Eds., Kluwer Press, 2002, pp. 1-15.
[20] R. Meester and R.Roy, Continuum Percolation. Cambridge, U.K.:Cambridge Univ., 1996.
[21] S. Murphy and J. J. Garcia-Luna-Aceves, “An efficient routing protocol for wireless networks,” ACM J. Mobile Networks Applicat., Special Issue on Routing in Mobile Communication Networks, vol. 1, no. 2, pp. 183-197, Oct. 1996.
[22] A. Nasipuri, J. Mandava, H. Manchala, and R. E. Hiromoto, "On-demand routing using directional antennas in mobile ad hoc networks," in Proc. 9th Int. Conf. on Comput. Commun. and Networks, 2000, pp. 535-541.
[23] S. Y. Ni, Y. C. Tseng, Y. S. Chen, and J. P. Sheu, "The broadcast storm problem in a mobile ad hoc network," in Proc. 5th Annu. ACM/IEEE Int. Conf. on Mobile Computing and Networking, Seattle, WA, USA, Aug. 1999, pp. 151-162.
[24] D. Nitnaware and A. Verma, "Energy based gossip routing algorithm for MANETs," in Proc. 2010 Int. Conf. on Recent Trends in Information, Telecommunication and Computing, 2010, pp. 23-27.
[25] V. D. Park and M. S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” in Proc. IEEE INFOCOM, Apr. 1997, pp. 1405-1413.
[26] C. E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” in Proc. ACM SIGCOMM, Sep. 1994, pp. 234-244.
[27] C. E. Perkins and E. M. Royer, "Ad-hoc on-demand distance vector (AODV) routing," in Proc. 2nd IEEE Workshop on Mobile Computing Syst. and Applicat., Feb. 1999, pp. 90-100.
[28] C. E. Perkins and E. M. Royer, “RFC3561: Ad hoc on-demand distance vector (AODV) routing,” Internet RFCs, Jul. 2003.
[29] K. Pradeep, C. Romit Roy, and G. Indranil, "Smart gossip: an adaptive gossip-based broadcasting service for sensor networks," in IEEE Int. Conf. on Mobile Adhoc and Sensor Systems, 2006, pp. 91-100.
[30] E. T. Robert V. Hogg, Probability and Statistical Inference. Canada: Pearson Education, 2009.
[31] Sheldon M. Ross, Introduction to Probability Models, Ninth Edition. Orlando:Academic Press, Inc., 2006..
[32] D. Stauffer and A. Aharony, Introduction to Percolation Theory, London: Taylor & Francis, 1992.
[33] Y. C. Tseng, S. Y. Ni, Y. S. Chen, and J. P. Sheu, "The broadcast storm problem in a mobile ad hoc network," Wireless Networks, vol. 8, pp. 153-167, 2002.
[34] B. Williams and T. Camp, "Comparison of broadcasting techniques for mobile ad hoc networks," in Proc. 3rd ACM Int. Symp. on Mobile Ad Hoc Networking and Computing, Lausanne, Switzerland, 2002, pp. 194-205.
[35] S. Yang, J. Wu, and J. Cao, “Connected k-hop clustering in ad hoc networks,” in Proc. Int. Conf. on Parallel Process., Norway, Jun. 2005, pp. 373-380.
[36] The UCB/LBNL/VINT Network Simulator-ns (Version 2). VINT Project. Available: http://www.isi.edu/nsnam/ns/