跳到主要內容

臺灣博碩士論文加值系統

(100.28.132.102) 您好!臺灣時間:2024/06/23 07:48
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:郭丁仁
研究生(外文):Ding-Ren Guo
論文名稱:一個在隨意網路上以功率強度為基礎之高效率路徑繞送通訊協定
論文名稱(外文):An High Performance Routing Protocol based on Power Strength in Ad-hoc Networks
指導教授:許丕榮許丕榮引用關係
指導教授(外文):Pi-Rong Sheu
學位類別:碩士
校院名稱:國立雲林科技大學
系所名稱:電機工程系碩士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2001
畢業學年度:89
語文別:中文
論文頁數:67
中文關鍵詞:功率強度路徑繞送通訊協定隨意網路
外文關鍵詞:power strengthrouting protocolad-hoc networks
相關次數:
  • 被引用被引用:1
  • 點閱點閱:125
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:1
隨意網路是一個由節點(mobile hosts,MH)在不使用任何網路基礎架構或集中式管理系統所組成的無線網路。由於節點傳輸範圍受到限制,資料的傳送通常會經由鄰近的節點中繼傳送到達目的節點。於是在隨意網路拓樸中如何找到適當的傳輸路徑便成為一個重要的主題,DSR、SSA、AODV、ZRP便是被提出的幾個主流路徑繞送通訊協定。但是它們只適用傳輸路徑正常運作(傳輸不中斷)的情況下,一旦節點移動,傳輸路徑可能會產生路徑中斷的問題,路徑的傳輸效率以及資料吞吐量也會受到影響而下降。
在本篇論文中,我們提出一個以接收功率為基礎而且架構在來源端起始型路徑繞送通訊協定上的路徑繞送通訊協定,我們稱它為適當功率強度路徑繞送通訊協定(adaptive power strength routing protocol,APSR)。適當功率強度路徑繞送協定不僅能夠適應隨時變動的隨意網路拓樸,更能克服路徑hop數過多以及路徑中斷的問題。
在適當功率強度路徑繞送協定中,我們將接收功率分割為K個不均等的區域,並且根據夫瑞斯自由空間方程式將節點間相對距離對應分割成K個均等區域。適當功率強度路徑繞送協定在路徑搜尋中採用特定區域(如果採用特定區域的方式無法找到傳輸路徑,我們將改用其它的特定區域或者降低K值來增加找到傳輸路徑的機率)的接收功率來選擇路徑節點,這樣的作法不僅可以找到路徑hop數最少或路徑中斷率最低的路徑,更可找到兼顧路徑hop數和路徑中斷率的路徑。
最後,我們將適當功率強度路徑繞送協定將與高接收功率路徑繞送技巧、SSA以及AODV路徑繞送協定進行路徑hop數以及路徑中斷率的分析比較。經由電腦模擬的結果證實了我們提出的適當功率強度路徑繞送協定找到的傳輸路徑具有較少的hop數以及較低中斷率的傳輸,而且路徑的hop數以及路徑中斷率都優於SSA與AODV。除此之外,我們發現K的最佳值為5。因為K=5時,被選擇之傳輸路徑的hop數及中斷率都比其餘的K(1,2,3,4,6,….)值好。

目 錄
中文摘要i
英文摘要………………………………………………………………...iii
目錄……………………………………………………………………...vi
圖表目錄vii
誌謝……………………………………………………………………...ix
第一章 導論1
第二章 相關文獻8
2.1 SSA8
2.1.1 SSA概論8
2.1.2路徑搜尋9
2.1.3路徑維護10
2.1.4路徑最佳化11
2.2 AODV13
2.2.1 AODV概論13
2.2.2路徑搜尋14
2.2.3路徑維護16
2.2.4路徑最佳化16
2.3適當功率強度路徑繞送協定結合之路徑繞送技巧與觀念…17
第三章 適當功率強度路徑繞送協定21
3.1適當功率強度路徑繞送協定的原理及目的21
3.2適當功率強度路徑繞送協定概論25
3.3假設32
3.4適當功率路徑強度繞送協定之路徑搜尋32
3.5適當功率強度路徑繞送協定之路徑維護38
第四章 模擬環境與結果39
4.1模擬環境39
4.2模擬結果40
4.2.1路徑長度40
4.2.2路徑中斷率(percentage of disconnection)45
第五章 結論與未來研究方向52
5.1 結論..…….……………………………………………………52
5.2未來研究方向52
參考文獻54

[1]S. Agarwal, A. Ahuja, J.P. Singh, R. Shorey, "Route-lifetime assessment based routing (RABR) protocol for mobile ad-hoc networks Communications," ICC 2000. 2000 IEEE International Conference on , vol.3, pp.1697 —1701.
[2]R. E. Bellman, Dynamic Programming, Princeton: Princeton Univ. Press, 1957.
[3]J. Broch, D.B. Johnson, and D.A. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,” Internet-Draft, draft-ietf-manet-dsr-01.txt, Dec. 1998.
[4]R. Castaneda and S.R. Das, “Query Localization Techniques for On-Demand Routing Protocols in Ad Hoc Networks,” ACM/IEEE International Conference On Mobile Computing and Networking, Aug. 1999, pp. 186-194.
[5]S. Corson and J. Macker, “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations,” RFC2501, Jan. 1999.
[6]R. Dube, C.D. Rais, K.-Y. Wang, and S.K. Tripathi, “Signal Stability-Based Adaptive Routing (SSA) for Ad Hoc Mobile Networks,” IEEE Personal Communications Magazine, vol. 4, no. 1, Feb. 1997, pp. 36-45.
[7]T.A. ElBatt, S.V. Krishnamurthy, D. Connors, S. Dao, “Power management for throughput enhancement in wireless ad-hoc networks,” Communications, 2000. ICC 2000. 2000 IEEE International Conference on , Volume: 3 ,2000 Page(s): 1506 -1513, vol.3
[8]L. R. Ford and D. R. Fulkerson, Flow in Networks, Princeton: Princeton Univ. Press, 1962.
[9]D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” in Mobile Computing, T. Imielinski and H. Korth, Eds. Norwell, MA: Kluwer, ch. 5, pp. 153-181, 1996.
[10]J. Jubin and J.D. Tornow, “The DARPA Packet Radio Network Protocols,” Proceedings of the IEEE, 75(1): 21-32, Jan. 1987.
[11]S.-J. Lee, M. Gerla, and C.-K. Toh, “A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks,” IEEE Networks, July-Aug. 1999, pp. 48-54.
[12]S. -J. Lee, W. Su, M.Gerla, “Ad hoc Wireless Multicast with Mobility Prediction”, Proceedings of IEEE ICCCN'99, Boston, MA, Oct. 1999, pp.4-9.
[13]J. Macker and S. Corson, “Mobile Ad Hoc Networks (MANET),” http://www.iietf.org/html.charters/manet-charter.html, 1997, IETF Working Group Charter.
[14]G. Malkin, “RIP Version 2 - Carrying Additional Information,” RFC 1388, Jan. 1993.
[15]J. M. McQuillan, I. Richer and E. C. Rosen, “The New Routing Algorithm for the ARPANET,” IEEE Trans. Commun., vol. COM-28, no. 5, MAY 1980, pp. 711-19
[16]J. Moy, “OSPF Version 2,” RFC 1247, July 1991.
[17]S. Murthy and J.J. Gracia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” ACM Mobile Networks and App. J., Special Issue on Routing in Mobile Communication Networks, Oct. 1996, pp. 183-197.
[18]V.D. Parh and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” proc. INFOCOM’97, Kobe, Japan, Apr. 1997.
[19]V.D. Parh and M.S. Corson, “Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification,” Internet-Draft, draft-ietf-manet-tora-spec- 03.txt, Nov. 2000.
[20]K. Paul, S. Bandyopadhyay, A. Mukherjee, D. Saha, “Communication-aware mobile hosts in ad-hoc wireless network,” Personal Wireless Communication, 1999 IEEE International Conference on, 1999 Page(s): 83 -87.
[21]C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” In Proceedings of ACM SIGCOMM’94, London, UK, Sep. 1994, pp. 234-244.
[22]C.E. Perkins and E.M. Royer, “Ad-Hoc On Demand Distance Vector Routing,” In Proceedings of IEEE WMCSA’99, New Orleans, LA, Feb. 1999, pp. 90-100.
[23]C.E. Perkins, E.M. Royer, and S.R. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” Internet-Draft, draft-ietf-manet-aodv-06.txt, July 2000.
[24]T. S. Rappaport, Wireless Communication: Principles and Practice. Englewood Cliffs, NJ: Prentice-Hall, 1996, pp. 69-122, 139-196.
[25]V. Rodoplu, T. H. Meng, “Minimum energy mobile wireless networks,”
IEEE Journal on Selected Areas in Communications, Volume: 17 Issue: 8 , pp. 1333-1344, Aug. 1999.
[26]N. Schacham and J. Westcott, “Future Directions in Packet Radio Architectures and Protocols,” Proceedings of the IEEE, 75(1):83-99, Jan. 1987.
[27]Tien-Chung Tien, S. J. Upadhyaya, “A local/global strategy based on signal strength for message routing in wireless mobile ad-hoc networks,” Research Challenges, 2000. Proceedings. Academia/Industry Working Conference On page(s): 227 — 232, 27-29. April. 2000.
[28]C.-K. Toh, “Associativity-Based Routing for Ad Hoc Mobile Networks,” Wireless Personal Communication Journal, Special Issue on Mobile Networking and Computing Systems, Kluwer Academic Publishers, vol. 4, no. 2, Mar. 1997, pp. 103-139.
[29]J.E. Wieselthier, G.D. Nguyen, A. Ephremides, “On the construction of energy-efficient broadcast and multicast trees in wireless networks,” INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Volume: 2 , 2000 Page(s): 585 -594, vol.2.
[30]S.-L. Wu, T.-K. Lin, Y.-C. Tseng, and J.-P. Sheu, “Route Optimization On Wireless Mobile Ad-hoc Networks,” The 5th Mobile Computing Workshop, 1999, Taiwan, pp. 143-150.
[31]S.-L. Wu, T.-K. Lin, Y.-C. Tseng, and J.-P. Sheu, “Route Maintenance in a Wireless Mobile Ad Hoc Network,” Telecommunication Systems, (to appear).
[32]黃能富,”區域網路與高速網路,”維科出版社,1998年6月.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top