跳到主要內容

臺灣博碩士論文加值系統

(216.73.216.213) 您好!臺灣時間:2025/11/09 08:04
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:張守文
研究生(外文):Shou-Wen Chang
論文名稱:在行動隨意網路中具行動預測能力之可靠度需求繞路協定之研究
論文名稱(外文):A Reliable On-Demand Routing Protocol for Mobile Ad Hoc Networks with Mobility Prediction
指導教授:王能中王能中引用關係
指導教授(外文):Neng-Chung Wang
學位類別:碩士
校院名稱:朝陽科技大學
系所名稱:資訊工程系碩士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2004
畢業學年度:92
語文別:英文
論文頁數:67
中文關鍵詞:行動隨意網路行動預測需求繞路全球定位系統
外文關鍵詞:Global positioning systemmobile ad hoc networkson-demand routingmobility prediction
相關次數:
  • 被引用被引用:0
  • 點閱點閱:145
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:1
行動隨意網路(Mobile Ad Hoc Network, MANET)是一不需透過基礎架構且動態配置網路的無線網路架構。
在本論文中,我們在行動隨意網路中提出一種具行動預測(Mobility Prediction)能力之可靠度繞路協定(Reliable On-Demand Routing Protocol)。此方法主要是藉由全球定位系統(Global Positioning System)做輔助來決定任二個連結行動節點之維持時間(Duration of Time)以及在來源節點及目的節點之間找出一需求範圍來做路徑搜尋(Route Discovery)。在路徑搜尋後,我們可以在一需求範圍中找出從來源節點到目的節點的多條路徑,然後再由這些路徑中選擇一條具有最長維持時間的路徑來做繞路以增加繞路的可靠度。由於行動隨意網路下網路拓樸變動頻繁的特性,使得資料傳送路徑可能會有斷裂的情況。因此我們也提出一全球定位系統輔助(GPS-Aided)的部份重建程序(Partial Reconstruction Process)以找到一條替代路徑(Backup Path)來做路徑維護。當繞路路徑中的一條鏈結(Link)斷裂時,路徑維護程序就會啟動。我們使用二斷線行動節點的資訊以規劃出一區域需求範圍來做區域路徑搜尋以尋找一條替代路徑。
模擬結果顯示我們提出的可靠度繞路協定(RORP)與資料流為導向的繞路協定(FORP)相較,有較低的繞路負載量(Routing Overhead)和較短的路徑延遲時間(Routing Delay Time)。因此可靠度繞路協定使用一條較可靠的繞路路徑可以有效的降低資料傳輸的成本。
A mobile ad hoc network (MANET) is a dynamically reconfigurable wireless network with no fixed infrastructures.
In this thesis, we propose a reliable on-demand routing protocol (RORP) with mobility prediction. In this scheme, we determine the duration of time between two connected mobile nodes by using the global positioning system (GPS), and discover a request region between the source node and the destination node for routing discovery. During routing discovery, we can find many routes from the source node to the destination node. Then we select the routing path that requires the longest duration of time for transmission to increase routing reliability. Due to frequent topological changes of MANETs, the transmission of data may be broken. Thus, we also propose a GPS-aided partial reconstruction process that selects a backup path for maintenance. When a link on a routing path will break, the route maintenance process will start. We use the information from two disconnected mobile nodes to plan a local request region and execute a local route discovery to find a backup path.
Simulation results show that RORP has a lower routing overhead and a shorter routing delay time than FORP. Therefore, RORP uses a more reliable routing path that can decrease the cost of data transmission effectively.
Chapter 1 Introduction 2
1.1 Wireless Networks 2
1.2 Problems of Mobile Ad Hoc Networks (MANETs) 2
1.3 Design Concept 2
1.4 Thesis Organization 2
Chapter 2 Related Works 2
2.1 Protocols of Mobile Ad Hoc Networks (MANETs) 2
2.2 Proactive Routing Protocols 2
2.3 Reactive Routing Protocols 2
2.4 Location-Based Routing Protocols 2
2.5 Global Positioning System (GPS) 2
Chapter 3 Preliminaries 2
3.1 Expected Region and Request Region 2
3.2 Duration of Time 2
3.3 Flow Oriented Routing Protocol (FORP) 2
Chapter 4 Reliable On-Demand Routing Protocol (RORP) 2
4.1 Tables for Routing 2
4.2 Route Discovery 2
4.3 Route maintenance 2
Chapter 5 Experimental Results 2
Chapter 6 Conclusions and Future Works 2
References 2
[1]S. Abhyankar and D. P. Agrawal, "Distributed Mobility-Aware Route Selection for Wireless Ad Hoc Networks," IEEE Computing and Communications Conference, pp. 241-247, April 2002.
[2]G. Aggelou, R. Tafazolli, "RDMAR: A Bandwidth-Efficient Routing Protocol for Mobile Ad Hoc Networks," Proceedings of The Second ACM International Workshop on Wireless Mobile Multimedia (WoWMoM), August 1999.
[3]R. Bar-Yehuda, O. Goldreich, and A. Itai, "On the Time-Complexity of Broadcast in Multi-Hop Radio Networks: An Exponential Gap between Determinism and Randomization," Journal of Computer and System Sciences, pp. 104-126, August 1992.
[4]R. Bar-Yehuda, A. Israeli, and A. Itai, "Multiple Communication in Multihop Radio Networks," Society for Industrial and Applied Mathematics (SIAM) Journal on Computing, pp. 875-887, August 1993.
[5]S. Basagni, D. B. Johnson, and D. A. Woodward, "A Distance Routing Effect Algorithm for Mobility (DREAM)," Proceedings of the Fourth Annual ACM/IEEE International conference on Mobile computing and networking, pp. 76-84, October 1998.
[6]A. Boukerche and S. Rogers, "GPS Query Optimization in Mobile," Proceedings of Sixth IEEE Symposium, pp 198-203, July 2001.
[7]C. C. Chiang, "Routing in Clustering Multihop Mobile Wireless Networks with Fading Channel,"Proceedings of IEEE Sensors for Industry Conference (SICON), pp. 197-211, April 1997.
[8]C. Y. Chiu, W. E.H.-K, and G. H. Chen, "Stability Aware Cluster Routing Protocol for Mobile Ad Hoc Networks," IEEE Parallel and Distributed Systems Proceedings, pp. 471-479, December 2002.
[9]I. Chlamtac and O. Weinstein, "The Wave Expansion Approach to Broadcasting in Multihop Radio Networks," IEEE Transaction on Communication, pp. 426-433, March 1991.
[10]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, Vol. 4, pp. 36-45, February 1997.
[11]Z. J. Haas, "A New Routing Protocol for the Reconfigurable Wireless Networks," Proceedings of the IEEE International Conference on Universal Personal Communications (ICUPC), pp.562-566, October 1997.
[12]D. B. Johnson and D. A. Maltz, "Dynamic Source Routing in Ad Hoc Wireless Networks," Kluwer Academic Publishers, 1996.
[13]T. Ken, S. J. Lee, and G. Mario, "A Reliable, Congestion-Control Led Multicast Transport Protocol in Multimedia Multi-Hop Networks," IEEE Wireless Personal Multimedia Communications, pp. 252-256, October 2002.
[14]D. Kim, C. K. Toh, and Y. Choi, "Location-Aware Long-Life Route Selection in Wireless Ad Hoc Networks," IEEE Electronics Letters, pp. 1584-1586, August 2000.
[15]W. I. Kim, D. H. Kwon, and Y. J. Suh, "A Reliable Route Selection Algorithm Using Global Positioning Systems in Mobile Ad-Hoc Networks," IEEE International Conference on Communications, pp 3191-3195, June 2001.
[16]Y. B. Ko and N. H. Vaidya, "Location-Aided Routing in Mobile Ad Hoc Networks," ACM Wireless Networks, Vol. 6, No. 4, pp. 307-321, July 2000.
[17]W.-H. Liao, Y.-C. Tseng, and J.-P. Sheu, "GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks," Telecommunication Systems, Vol. 18, No. 1, pp. 37-60, September 2001.
[18]W. Lou and J. Wu, "On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks," IEEE Transactions on Mobile Computing, pp. 111-122, April 2002.
[19]J. N. Mario and I. T. Lu, "A Peer-to-Peer Zone-Based Two-Level Link State Routing for Mobile Ad Hoc Networks," IEEE Journal on Selected Areas in Communications, Vol. 17, No. 8, pp. 1415-1425, August 1999.
[20]S. Murthy and J. J. Barcia-Luna-Aceves, "An Efficient Routing Protocol for Wireless Networks," ACM Mobile Networks and Applications Journal, Special issue on Routing in Mobile Communication Networks, 1996.
[21]V. Park and M. S. Corson, "A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks," Proceedings of the IEEE INFOCOM 1997, Kobe, Japan, pp. 1405-1413, April 1997.
[22]G. Pei, G. Mario, and T. W. Chen, "Fisheye State Routing: A routing Scheme for Ad Hoc Wireless Networks," Proceedings of the International Chamber of Commerce (ICC), New Orleans, LA, June 2000.
[23]C. E. Perkins and P. Bhagwat, "Highly Dynamic Destination Sequenced Distance-Vector Routing (DSDV) for Mobile Computers," Proceedings of the ACM Special Interest Group on Data Communication, London, UK, pp. 234-244, September 1994.
[24]C. E. Perkins and E. Royer, "Ad-Hoc On-Demand Distance Vector Routing," Proceedings of the Second IEEE Workshop on Mobile Computing System and Application, New Orleans, LA, USA, pp. 90-100, February 1999.
[25]J. Pu, M. Eric and C. Gholamali, "Routing Reliability Analysis of Partially Disjoint Paths," IEEE Communication, Computers and Signal Processing, pp. 79-82, August 2001.
[26]T. S. Rappaport, Wireless Communications: Principles and Practice, Prentice-Hall, Upper Saddle River, NJ, 1995.
[27]C. Santivanez, R. Ramanathan, and I. Stavrakakis, "Making Link-State Routing Scale for Ad Hoc Networks," Proceedings of ACM International Symposium on Mobile Networking & Computing (MOBIHOC), pp. 22-33, October 2001.
[28]P. Sonal, S. Arun and T. A., "A Reliable Protocol for Processing within IP-Routed Networks," IEEE Computer Communications and Networks Proceedings, pp. 84-89, October 2002.
[29]I. Stoimennovic, M. Seddigh, and J. Zunic, "Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks," IEEE Transactions on Parallel and Distributed Systems, pp. 14-25, January 2002.
[30]W. Su, S. J. Lee, and G. Mario, "Mobility Prediction and Routing in Ad Hoc Wireless Networks," International Journal of Network Management, January 2001.
[31]C. K. Toh, "A Novel Distributed Routing Protocol to Support Ad-Hoc Mobile Computing," Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference, pp. 480-486, March 1996.
[32]S. William and G. Mario, "IPv6 Flow Handoff in Ad Hoc Wireless Networks Using Mobility Prediction," Global Bridge Communications (GLOBECOM), pp. 271-275, December 1999.
電子全文 電子全文(本篇電子全文限研究生所屬學校校內系統及IP範圍內開放)
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top