跳到主要內容

臺灣博碩士論文加值系統

(3.238.98.39) 您好!臺灣時間:2022/09/26 12:27
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:蕭家典
研究生(外文):Chia-Tien Hsiao
論文名稱:一個在無線隨意網路上穩定的隨選路由協定
論文名稱(外文):A Stable On-Demand Routing Protocol Using GPS forWireless Ad Hoc Networks
指導教授:張瑞雄張瑞雄引用關係
指導教授(外文):Ruay-Shiung Chang
學位類別:碩士
校院名稱:國立東華大學
系所名稱:資訊工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:英文
論文頁數:47
中文關鍵詞:穩定的路徑路徑選擇演算法無線隨意網路
外文關鍵詞:stable routerouting protocolad hoc networks
相關次數:
  • 被引用被引用:0
  • 點閱點閱:186
  • 評分評分:
  • 下載下載:32
  • 收藏至我的研究室書目清單書目收藏:0
大部份的無線隨意行動網路幾乎著眼於如何找出一條最短路徑,這些協定的路徑選擇演算法,並沒有考慮網路穩定性,然而由於無線行動網路機動的特性,如果選擇的路徑包含某個機動性高的節點,就容易出現因節點移出彼此傳輸範圍,而造成連線斷裂頻繁的問題存在。當連線斷裂,需花費更多的負擔去維護,整個網路的品質也因此大大下降。 如果我們考慮網路穩定性,在一開始就選擇一條較穩定的路徑,那就可以降低發生連線斷裂機會。
現在,也有一些研究網路穩定性的協定,這些現有協定主要是根據節點移動行為及信號強弱來預估相互各節點連線可能存活時間,並從中選擇一條連線時間最長的路徑為穩定路徑。 我們知道信號強度會隨所在地理位置及其它外在因素不同而受影響。因此,我們的路徑選擇演算法,是採用彼此相對距離遠近及彼此相對移動方向來做判斷,選擇一條較穩定的路徑。
為了知道所需的相關資料(如:位置、速度…),我們先假設每一個節點都有全球定位系統 (GPS) ,藉由GPS的幫助,我們可以計算預估每條路徑的存活時間,並從中選擇一條較穩定的路徑,達成建立一個更加信賴穩定的無線網路傳輸。
Almost all routing protocols for ad hoc networks are aimed at how to find a shortest path. However, due to the node’s mobility in ad hoc networks, a shortest path isn’t necessarily the better path. It doesn’t consider the stability factor such as broken links. An on-demand routing needs to spend much more overhead when link breaks due to mobility. The quality of network routing depends on the selected routes. The link breaks will be reduced if we use a more stable route. This can enhance the networks stability.
Right now, some stability based on-demand routing algorithms are based on a host’s behavior to do mobility prediction and select a route which has the longest lifetime. Almost all of them use a threshold parameter of the signal strength and the “affinity” parameter which characterizes the power strength and the stability of the link. They calculate the signal strength variation to estimate a link lifetime as affinity and select the better route which has minimum-maximum affinity. We know the signal strength was affected by the terrain easily. Therefore, it may not be good to judge the stability by the signal strength. So we consider the stability that is related to the distance between the two hosts.
In order to reduce the link failure, we will modify the original routing protocols to establish a more reliable one with stable routes. In doing this, we employ the help of Global Position Systems (GPS). We assume each node is equipped with GPS receiver. Then we can calculate and select a stable route through these information (e.g.: position, velocity) with GPS. This proposal provides two mechanisms: the realizable zone and the stability affinity to help in a stable routing selection.
Table of Contents
Acknowledgements................................1
List of Figures.................................4
Abstract........................................5
1.Introduction..................................8
2.Motivation...................................16
3.Overview for Some Existing On-Demand Routing
Protocols....................................18
3.1 Ad Hoc On-Demand Distance Vector Routing.18
3.1.1 Path Discovery.......................19
3.1.1.1 Reverse Path Setup...............20
3.1.1.2 Forward Path Setup...............21
3.1.2 Route Table Management...............22
3.1.3 Path Maintenance.....................22
3.1.4 Local Connectivity Management........23
3.2 Dynamic Source Routing...................23
3.2.1 Route Discovery ...................24
3.2.2 Route Maintenance....................25
4.A Stable On-Demand Routing Protocol..........26
4.1 Description of Concepts..................26
4.1.1 A Reliable Zone......................26
4.1.2 Affinity.............................28
4.2 Our Protocol Description.................29
4.2.1 Route Discovery......................30
4.2.2 Route Selection......................31
4.2.2.1 Route Reply......................31
4.2.2.2 Alternative Path Selection.......32
4.2.3 Route Maintenance....................32
5.Simulation Results...........................34
5.1Simulation Environmen.......................34
5.2 Results and Analysis.......................35
6. Conclusion and Future Work..................42
References.....................................43
REFERENCES

[1] S. Agarwal, Ahuja, J. P. Singh and R. Shorey, “Route-Lifetime Assessment Based Routing (RABR) Protocol for Mobile Ad-Hoc Networks”, IEEE International Conference on Communications (ICC 2000), pp. 1697-1701, 2000.
[2] A. Boukerche, “A Performance Comparison of Routing Protocols for Ad Hoc Networks”, Proceedings 15th IEEE International Conference, pp. 1940 -1946, 2001.
[3] Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu and Jorjeta 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 , pp. 85-97, October 1998.
[4] C.M Chung, Ying-Hong Wang, and Chih-Chieh Chuang, “Ad Hoc On-Demand Backup Node Setup Routing Protocol”, Proceedings of the 15th IEEE International Information Networking Conference, pp. 933-937 , 2001.
[5] S. Chakrabarti and A. Mishra, “Qos Issues in Ad Hoc Wireless Networks”, IEEE Communication Magazine, pp. 142-148, Feb. 2001.
[6] S. Corson, J. Macker, “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations”, IETF RFC 2501, January 1999.
[7] S.R. Das., C.E. Perkins, and E.M. Royer,”Performance comparison of two on-demand routing protocols for ad-hoc networks. ”, Proceedings of the INFOCOM 2000, pp. 3-12, March 2000.
[8] 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, pp. 36-45, February 1997.
[9] Haas, Z.J.; Tabrizi, S.,”On some challenges and design choices in ad-hoc communications”, Proceedings on IEEE Military Communications Conference (MILCOM’98.), Volume: 1, pp. 187 -192, 1998.
[10] Y. C. Hu and David B. Johnson, “Caching Strategies in On-Demand Routing Protocols for Wireless Ad Hoc Networks”, Proceeding of the Sixth ACM Annual International Conference on Mobile Computing and Networking (MobiCom 2000), pp. 231-242, 2000.
[11] M. H. Jiang and R. H. Jan, “An Efficient Multiple Paths Routing Protocol for Ad-hoc Networks”, Proceedings the 15th IEEE International Information Networking Conference, pp. 544-549, 2001.
[12] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad-Hoc Wireless Networks”, Mobile Computing, T. lmielinski and H. Korth, Eds., Kluwe, pp. 153-181, 1996.
[13] David B. Johnson , David A. Maltz, Yih-Chun Hu, and Jorjeta G. Jetcheva, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR)”, IETF Internet Draft, February 2002.
[14] W.-IK. Kim, D.-H. Kwon, Y.-J. Suh, “A Reliable Route Selection Algorithm Using Global Positioning Systems in Mobile Ad-hoc Networks”, IEEE International Conference on Communications (ICC 2001), pp. 3191 -3195, 2001.
[15] Y. Ko and N. Vaidya.,”Location-Aided Routing (LAR) in Mobile Ad Hoc Networks. ”, Proceedings of Fourth Annual ACM/IEEE International Conference on Mobile ( MobiCom '98), pp. 66-75, Oct. 1998.
[16] 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 Network, pp. 48-53, July/August 1999.
[17] S. J. Lee and M. Gerla, “AODV-BR: Backup Routing in Ad hoc Networks”, Wireless Communications and Networking Conference, pp. 1311-1316, 2000.
[18] Hwa-Chun Lin and Yung-Hua Chu, “A Clustering Technique for Large Multihop Mobile Wireless Networks”, Vehicular Technology Conference Proceedings, VTC 2000-Spring Tokyo, pp. 1545-1549, 2000.
[19] David A. Maltz, Josh Broch, Jorjeta Jetcheva, and David B. Johnson,, “The Effects of On-Demand Behavior in Routing Protocols for Multihop Wireless Ad Hoc Networks”, IEEE Journal on Selected Area in Commutations, pp. 1439-1453, Aug. 1999.
[20] Seung-Chul M. Woo and Suresh Singh, “Longest Life Routing Protocol (LLRP) for Ad Hoc Networks with Highly Mobile Nodes”, Wireless communication and Networking Conference ( WCNC 2000), volume: 3, pp. 1306-1310, 2000.
[21] K. Paul, S. Bandyopadhyay, A. Mukherjee and D. Saha, “Communication Aware Mobile hosts in Ad-Hoc Wireless Network”, IEEE International Conference on Personal Wireless Communications (ICPWC), pp. 83-87, Feb. 1999.
[22] C. E. Perkins and P. Bhagwet, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”, ACM SIGCOMM’94,pp. 234-244, 1994.
[23] C. E. Perkins, E.M. Royer and S. R. Das, ”Ad hoc on-demand Distance Vector Routing”, IETF Internet Draft, Jan 2002.
[24] K. Paul, S. Bandyopadhyay, A. Mukherjee, D. Saha, “A stability-based distributed routing mechanism to support unicast and multicast routing in ad hoc wireless network”, Elsevier Science Computer Communications, Volume: 24 Issue: 18, pp. 1828-1845, Dec. 2001.
[25] E. M. Royer and C. –K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks”, IEEE Personal Communication, pp. 46-54, Apr. 1999.
[26] Sivakumar, R.; Sinha, P.; Bharghavan, V., “CEDAR: a core-extraction distributed ad hoc routing algorithm”, IEEE Journal on Selected Areas in Communications, Volume: 17 Issue: 8, pp. 1454 -1465, Aug. 1999.
[27] W. Su and M. Gerla, “IPv6 Flow Handoff in Ad-Hoc Wireless Networks Using Mobility Prediction”, Proceedings of IEEE GLOBECOM’99, Rio de Janeiro, Brazil, pp. 271-275, Dec. 1999.
[28] W. Su, Sung-Ju Lee and Mario Gerla, ”Mobility Prediction in Wireless Networks”, Proceedings of the IEEE Military Communications Conference (MILCOM 2000) , Los Angles, CA, pp. 491-495, October 2000.
[29] University of California Los Angeles Computer Science Department Parallel Computing Laboratory and Wireless Adaptive Mobility Laboratory, Glomosim: A Scalable Simulation Environment for Wireless and Wired Network Systems, http://pcl.cs.ucla.edu/projects/glomosim/
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top