臺灣博碩士論文加值系統

隨著行動資訊所帶來的便利性及能即時提供重要資訊的價值性，使得人類對於無線網路的服務需求日益增多，其主要目的就是希望能在任何時間、任何地點都能取得最有用的資訊知識，以協助人類處理或是解決各種困難，例如在面對災害時，能透過無線通訊設備的協助，在第一時間內得到第一手訊息，以做好因應防範處理，讓損失減少到最低。而近年來在無線通訊領域中，最具代表性的網路就是隨意式網路(Mobile Ad-hoc NETwork，MANET)。在隨意式網路中，因為通訊節點能在移動中仍具有高度通訊能力，及當通訊節點消失時，仍可保持網路正常運作的優異特性，因此成為未來行動通訊領域中，發展的主軸之一。
目前在隨意式網路的研究領域中，例如網路拓撲(Topology)、傳輸品質服務(Quality of Services)等研究中，仍可以發現許多因為隨意式網路本身特性而所留下來難以解決的問題，其中最急切需要解決的問題之一，就是網路拓撲的穩定性問題。由於隨意式網路的通訊架構多半被設計在電力資源有限的行動通訊設備上，因此當設備上的電力消耗完畢時，築構網路的通訊節點也將隨之消失。並且為了要讓隨意式網路能夠適應於各種惡劣的通訊環境，隨意式網路也必需允許網路中的通訊節點(Mobile Hosts，MHs)能不受任何限制地在網路中自由移動、組構暫時的連接網路進行通訊，因此經常造成在網路中的通訊節點從網域中突然消失或損壞，嚴重影響到整個隨意式網路的拓撲環境與通訊品質，一再地產生穩定性問題。
除此之外，當隨意式網路在形成整個網路拓撲的階段，也容易因為網路中的通訊節點過多，在同一時間互相發送廣播封包，而造成無線通訊環境的訊號干擾、碰撞甚至消失，並且產生廣播風暴，造成網路的龐大負載。有時也有可能因為網路節點過少，使得隨意式網路可傳送封包的路徑過少，而大量降低網路傳輸的頻寬、造成通訊品質下降，甚至可能因為天災的因素造成網路節點消失或在不同無線網路架構形成難以控管的複雜連結等，導致無線網路的穩定性快速降低，造成網路閒置或壅塞等。
故本研究著重於探討網路拓撲的穩定性以保證網路通訊的品質，透過所提出的支援隨意式網路的穩定性網路拓撲，增加隨意式網路的穩定性，以期隨意式網路能更快速適應無線環境，建構出更穩定、值得信賴的無線網路環境。

In recent years, people are more inclined to depend on wireless network services so that they may obtain latest information at any time anywhere. Of wireless networks, a stable topology is an important research topic that provides good environment for transmission data in Mobile Ad hoc NETwork (MANET). Especially, it can provide more convenient and valuable information for us these services with wireless network increasingly. However, the stable problem has drawn more and more of the researchers’ attention as the broadcast problems occurs frequently on MANET.
MANET is one type of non-fixed infrastructure mobile networks and consists of many Mobile Hosts in which these can be cellular phones. According to the limited bandwidth and battery on handheld devices, the communication of MANET will break and loss information that is more important of the instability environment. This study presents a stable protocol; the purposed protocol can improve the MANET to reach a more stable and reliable environment.

Abstract I
中文摘要 II
誌謝 IV
目錄 VI
圖目錄 XI
表目錄 XV
第一章、緒論 1
1.1　研究背景 1
1.2　研究動機 3
1.3　研究目的 4
1.4　研究架構 5
第二章、文獻探討 6
2.1　隨意式網路 6
2.1.1　隨意式網路的機制 7
2.1.2　隨意式網路的六大特性 10
2.1.3 隨意式網路拓撲圖形 12
2.1.4　網路拓撲的基本需求 15
2.2 　相關網路拓撲的研究 17
2.2.1　網路拓撲的分類 19
2.2.2　網路拓撲的優缺點比較 20
2.2.2.1.　主動式網路拓撲導向 21
2.2.2.2.　被動式網路拓撲導向 21
2.2.2.3.　混合式網路拓撲導向 22
2.2.3 常用的網路拓撲研究 25
2.2.3.1.　繞徑表導向 25
2.2.3.2.　需求導向 28
2.2.3.3.　混合導向 29
2.2.4　穩定性網路拓撲的問題 32
第三章、研究架構與方法 41
3.1 第一階段：評估 44
3.1.1 辨別網路架構尋找網路邊界 45
3.1.2 網路邊界尋找方法 46
3.1.2.1 收集通訊節點的封包訊息 47
3.1.2.2 轉換成關係矩陣 47
3.1.2.3 篩選網域區隔邊界 48
3.1.3 實例說明 49
3.2 第二階段：預防 57
3.2.1 網路通訊範圍劃分 57
3.2.2 保證傳輸的通訊範圍 59
3.2.3 同步化廣播方式的限制 61
3.2.4 Poisson分配模型 62
3.2.5 網路繞徑的廣播風暴預防 64
3.3 第三階段：維護 67
第四章、實驗結果 75
4.1實驗假設 76
4.1.1實驗的假設 77
4.1.2實驗環境 77
4.2實驗模擬 79
4.2.1評估項目說明 80
4.2.2模擬過程說明 82
4.3實驗結果 86
4.3.1主動式網路拓撲比較 86
4.3.1.1主動式封包傳輸遺失率評估 86
4.3.1.2主動式拓撲網路流量穩定度評估 88
4.3.1.3主動式拓撲封包傳遞抖動率評估 90
4.3.1.4主動式拓撲電力損耗程度評估 92
4.3.2被動式網路拓撲比較 93
4.3.2.1被動式封包傳輸遺失率評估 93
4.3.2.2被動式拓撲網路流量穩定度評估 95
4.3.2.3被動式拓撲封包傳遞抖動率評估 96
4.3.2.3被動式拓撲電力損耗程度評估 97
4.3.3混合式網路拓撲比較 99
4.3.3.1混合式封包傳輸遺失率評估 99
4.3.3.2混合式拓撲網路流量穩定度評估 100
4.3.3.3混合式拓撲封包傳遞抖動率評估 101
4.3.3.4混合式拓撲電力損耗程度評估 102
第五章、結論 104
參考文獻 108

[1] M. Abolhasan, T. Wysocki, E. Dutkiewicz and M. Abolhasan (2004), “A Review of Routing Protocols for Mobile Ad hoc Networks,” Mobile Ad hoc Networks Conference, Vol. 2, No.03, pp 122-126.
[2] P. Basu, N. Khan and T.D. Chen (2001), “A Mobility Based Metric for Clustering in Mobile Ad hoc Networks,” Proceedings of the 21st IEEE International Conference on Distributed Computing Systems Workshops, pp. 413-418.
[3] A. Beongku, S. Papavassiliou (2002), “An Entropy-Based Model for Supporting and Evaluating Route Stability in Mobile Ad hoc Wireless Networks,” IEEE Communications Letters, Vol.6, pp. 328-330.
[4] C. Bonnet, N. Nikaein and H. Labiod (2000), “DDR-Distributed Dynamic Routing Algorithm for Mobile Ad hoc Networks,” Proceedings of the IEEE International Conference on Mobile and Ad hoc Networking and Computing Workshop, pp. 19-27.
[5] A. Boukerche (2001), “Performance Comparison and Analysis of Ad hoc Routing Algorithms,” Proceedings of IEEE International Conference on Performance, Computing, and Communications, pp. 171-178.
[6] J. Broch, D.A. Laltz, B.B. Johnson and J. Jetcheva (1998), “A Performance Comparison of Multihop Wireless Ad hoc Routing Protocol,” Proceedings of the fourth annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 25-30.
[7] S. Capkun, M. Hamdi and J. Hubaux (2002), “GPS-Free Positioning in Mobile Ad hoc Networks,” Proceedings of Hawaii Internal Conference, pp. 3481-3490.
[8] C.Y. Chang and C.T. Chang (2001), “Hierarchical Cellular-Based Management for Mobile Hosts in Ad hoc Wireless Networks,” Proceedings of Hawaii Internal Computer Communications, pp. 1554-1567.
[9] J.H. Chang and L. Tassiulas (1999), “Routing for Maximum System Lifetime in Wireless Ad hoc Networks,” the 37th Annual Allerton Conference on Communication Control and Computing, pp. 413-419.
[10] B. Das and S. Raghupathy (1998), “Routing in Ad hoc Networks Using a Spine,” Proceedings of the IEEE International Conference on Mobile and Ad hoc Networking and Computing Workshop, Vol.7, pp. 100-113.
[11] B. Das, R. Sivakumar, and V. Bhargavan (1997), “Routing in Ad hoc Networks Using a Spine,” IEEE International Conference on Computers and Communications Networks''97, Vol. 13, pp. 1002-1005.
[12] B. Das, E. Sivakumar, and V. Bhargavan (1997), “Routing in Ad hoc Networks Using A Virtual Backbone,” Proceedings of the 6th International Conference on Computer Communications and Networks, Vol. 4, pp. 3-20.
[13] B. Das and V. Bhargavan (1997), “Routing in Ad hoc Networks Using Minimum Connected Dominating Sets,” IEEE International Conference on Communications, Vol. 4, No. 3, pp.12-21.
[14] I. Gerasimov and R. Simon (2002), “Performance Analysis for Ad hoc QoS Routing Protocols,” Proceedings of the International Mobility and Wireless Access Workshop, pp. 212-219.
[15] A. Goldsmith, S. Wicker (2002), “Design Challenges for Energy-Constrained Ad hoc Wireless Networks,” IEEE Wireless Communications, Vol.9, No. 3, pp. 8-27.
[16] J. Hass and R. Pearlman (1999), “The Performance of Query Control Schemes for the Zone Routing Protocol,” IEEE Personal Communications Magazine, Vol25, pp 46-55.
[17] Y. Hwang and P. Varshney (2003), “An Adaptive QoS Routing Protocol with Disparity for Ad hoc Networks,” IEEE Computer Society Press, Vol. 01, pp. 12-35.
[18] D.B. Johnson, D.A. Maltz, Y.C. Hu, and J. G. Jetcheva (2001), “The Dynamic Source Routing Protocol for Mobile Ad hoc Networks,” IETF Internet Draft draft-ietf-manet-dsr-05.txt, January.
[19] Y.V. Ko and N.H. Vaidya (2003), “Location-Aided Routing in Mobile Ad hoc Network,” Proceedings of the Second Wireless Networks Workshop, Vol.6, Issue. 3, pp. 423-433.
[20] P. Krishna, M. Chatterjee, N.H. Vaidya, and D.K. Pradhan (1995), “A Cluster-Based Approach for Routing in Ad hoc Networks,” Proceedings of the Second USENIX Symposium on Mobile and Location-Independent Computing, Vol.12, pp. 1-10.
[21] W.H. Liao, Y.C. Tseng, J.P. Sheu (2001), “A Fully Location-Aware Routing Protocol for Mobile Ad hoc Networks,” Telecommunication System, Vol.18, pp. 37-60.
[22] D.A. Maltz, J. Broch and J. Jetcheva (1999), “The Effects of On-Demand Behavior in Routing Protocols for Multihop Wireless Ad hoc Networks,” IEEE Journal on Selected Areas in Communications, Vol.17, pp. 1439-1453.
[23] A.B. Mcdonalds, T.F. Znaki (2001), “Design and Performance of A Distributed Dynamic Clustering Algorithm for Ad-hoc Networks,” Proceedings of the 34th annual ACM/IEEE Simulation Symposium, pp. 27-35.
[24] S. Murthy and J.J. Garcia (1995), “A Routing Protocol for Packet Radio Networks,” Proceedings of ACM International Conference on Mobile Computing and Networking, pp. 86-95.
[25] S. Murthy, J.J. Garcia (1996), “An Efficient Routing Protocol for Wireless Networks,” ACM Baltzer Mobile Networks and Applications special issue on Routing in Mobile Communications Networks, Vol.1, No.2, pp. 183-197.
[26] T. Nilsson, Wireless Ad hoc Networks, http://www.cs.umu.se/kurser/ TDBD16/VT04 /lecture7-8_3spp.pdf, January 2004.
[27] V.D. Park and M.S. Corson (2001), “Temporally-Ordered Routing Algorithm (TORA),” IETF Draft, draft-ietf-manet-tora-spec-04.txt.
[28] K. Paul, S. Bandyopadhyay,A. Mukherjee and D. Saha (2001), “A Stability-Based Distributed Routing Mechanism to Support Unicast and Multicast Routing in Ad hoc Wireless Network,” Mobile Networks and Applications Computer Communications, Vol.8 No.9, pp. 128-135.
[29] C.E. Perkins, Elizabeth M. Royer (1999), “Ad-hoc On-Demand Distance Vector Routing,” Second IEEE Workshop on Mobile Computing Systems and Applications, Vol. 3, No. 2, pp. 90-100.
[30] C.E. Perkins and P.B. Hagwat (1994), “Highly Dynamic Destination-Sequenced Distance-Vector Routing for Mobile Computers,” Proceedings of the ACM conference on Communications Architectures, Vol.24 Issue 4, pp. 234-244.
[31] R. Sivakumar, B. Das, and V. Bharghavan (1998), “An Improved Spine-Based Infrastructure for Routing in Ad hoc Networks,” Proceedings of the International Symposium on Computers and Communications, Vol.03 Issue 3, pp. 125-132.
[32] M. Takai, L. Bajaj, R. Ahuja, R. Bagrodia, Mario Gerla (1999), “A Scalable Network Simulation Environment,” Technical Report 990027, UCLA, Computer Science Department, Vol.22, pp. 127-132.
[33] Y. Xiong, F.Y. Miao and X.P. Wang (2003), “A Link State-Based Cluster Routing Protocol of Mobile Ad hoc Network,” Acta Electronica Sinica, Vol. 31 No. 02, pp. 645-648.
[34] W.Y. Zang, M. Yu, L. Xie and Z.X. Sun (2002), “A Survey of On-Demand Routing Protocols for Ad hoc Mobile Networks,” Chinese Journal of Computers, pp. 309-317.
[35] 嚴國慶、王淑卿、周雨韻 (2004)，「以電力能源為基礎的蜂巢式階層管理」，第15屆國際資訊管理學術研討會，第4－17頁。
[36] 王淑卿, 嚴國慶, 黃禹翔 (2004)，「支援隨意式網路穩定性的網拓協定. 第十屆資訊管理暨實務研討會」，台中技術學院。
[37] 王淑卿, 嚴國慶, 黃禹翔 (2005)，「A Stable Localizable Boundary of Ad hoc Mobile Network, Mobile Computing」，「第六屆網際網路應用與發展學術研討會」，長庚大學。
[38] The Cisco Systems Inc, Routing Information Protocol (RIP), http://www.cisco.com/ univercd/cc/td /doc/cisintwk/ito_doc/rip.htm, 2005.
[39] T. Tutumi, Secure TCP Protocols: Extension of Three-Way Handshake, http://www.isoc.org/HMP/PAPER/144/html/node5.html, 2005.
[40] The VINT Project, NS Manual, http://www.isi.edu/nsnam/ns/, 2005.