跳到主要內容

臺灣博碩士論文加值系統

(54.92.164.9) 您好!臺灣時間:2022/01/23 04:55
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:許尊惠
研究生(外文):Tsun-Hui Hsu
論文名稱:以信號強度連結方式建構訊源繞徑於無線區域網路
論文名稱(外文):Signal-Strength-Based Connection for Source-Destination Routing in Mobile Ad Hoc Networks
指導教授:黃振發黃振發引用關係王億富王億富引用關係
指導教授(外文):Jen-Fa HuangYih-Fuh Wang
學位類別:碩士
校院名稱:國立成功大學
系所名稱:電機工程學系碩博士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:英文
論文頁數:58
中文關鍵詞:無線網路繞徑信號強度
外文關鍵詞:routingsignal-strengthad hoc network
相關次數:
  • 被引用被引用:0
  • 點閱點閱:248
  • 評分評分:
  • 下載下載:38
  • 收藏至我的研究室書目清單書目收藏:0
以IEEE 802.1規範之無線區域網路標準而言,若可移動節點 (mobile node)欲傳送訊息至公眾網路需透過存取擷取點 (access point) 和基站 (station) 來支援。然而為了實現節點移動於有線網路和具分散式功能系統者或是內部擷取點之通訊協定間能達到互相通訊功能,其相關規範已被明確制定。以一個可移動且為多段式跳躍的無線電腦網路,亦可稱為ad hoc網路,其中配置了無線傳輸及接收裝置,且為任意移動的節點。我們將以不同的演算方式進行討論和模擬,當傳遞訊息於分散式系統之無線網路中或配合擷取點的使用於ad hoc網路傳遞訊息至有線區域網路時也一併討論。
在本篇論文中,我們介紹一個預測演算法去描述兩個移動節點間彼此之信號強度且提出一個以信號強度的預測演算法去做兩個移動節點能有較穩定且有較少中斷的通訊路徑建立於ad hoc網路。我們考慮將測試平台建構在一同族群的方格串狀之區域架構,並比較以信號強度之預測方式 (Signal-Strength-Predictive-based source Routing, SSPR) 、連結時間預測方式 (Connection-Time-Predictive-based source Routing, CTPR) 與近似叢集閘道交換方式 (Similar Clustering Gateway Switch Routing, SCGSR) 於ad hoc網路中。模擬模型中嘗試改變移動節點的數目、節點的移動速度及節點的發射涵蓋範圍等參數,進而分析計算連結路徑的平均中斷次數及進行資料傳遞的到達完成率 (reachability %)。
The IEEE 802.11 wireless LAN standard specifies which message shall be exchanged an access point and a station to support mobility. However, the implementation of mobility in the wired part of the network, and the distribution system or inter-access point protocol, is specified. A mobile, multi-hop wireless computer network, also termed as ad hoc network, can be envisioned as a collection of routers, equipped with wireless transmitter / receiver, which are free to move about arbitrarily. We present and simulate different scheme for the distribution system used to forward messages between nodes in a ad hoc wireless network. The usage of access points in ad hoc mode as bridges or gateways towards a wired LAN is also discussed.
In this thesis, we introduce a prediction algorithm, signal-strength-predictive-based algorithm, that characterizes the strength of relationship between two nodes and to propose a distributed routing algorithm between two nodes in order to find a set of paths between them which are more stable and less failure in a specific context. We construct the platform model under a grid clustering group architecture and a random distribution of mobile nodes and usage the SSPR (Signal-Strength-Predictive-based source Routing) algorithm, CTPR (Connection-Time-Predictive-based source Routing) algorithm and SCGSR (Similar Clusterhead Gateway Switch Routing) algorithm for mobile ad hoc network. The simulation model can calculate the average number of link failure versus parameters of mobile node and to analyze the reachability of service requirement for destination node.
Abstract………………………………………………………………………..............II
Contents……………………..…….……………………….…………..….............III
List of Figures……………………..………………………………………............…V

Chapter 1.Introduction………………………………………………….............……1
1.1 Personal Communications Network Architecture…………...………………………1
1.2 Multihop Mobile Wireless Networks……………………………...………………...3
1.3 Outline of the Thesis…………………………………………………....……………5

Chapter2. Mobile Ad Hoc Network Environment………..………………..............6
2.1 Mobile Ad Hoc Network Technologies……………....………………….……………6
2.2 IEEE MAC Protocol for Wireless LANs………………………….……....…………11
2.3 Categories of Source Routing of Ad Hoc Network………………...………….…16

Chapter 3.The Proposed Predictive-Based Source Routing Scheme…….........…19
3.1 The Pervious Related Work………………………………………………...…………19
3.2 Mobility Prediction Method…………………………………………....……………23
3.3 The Signal-Predictive-Based Source Routing……………………..………………24
3.3.1 Prediction Affinity between Two Nodes………………………….…………25
3.3.2 Evaluation of Each Node………………...……………………….………….28
3.3.3 Signal Cost Function…………….…………………………….……………..29
3.3.4 Link Failure and Rerouting Mechanism……………………....…..……………30

Chapter 4. Simulation Results On the Proposed Scheme………....……..........34
4.1 Proposed Scheme for the Wireless LAN……………………………..……………..34
4.2 Experiment Testbed………………………………………………………..………....39
4.3 Simulation Results and Discussion…………….…………………………………..43

Chapter 5. Conclusion..…..…..…..….…..…..…..……...…...…..….…..….53

References……………………...………………………………………….............…56
[1] H. D. Sherali, C. M. Pendyala, and T. S. Rappaport, “Optimal location of transmitters for micro-cellular radio communication system design,” IEEE Journal on Selected Areas in Communications, vol. 14, no. 4, pp. 662-673, May 1996.
[2] Amre El-Hoiyidi “Implementation Options for the Distribution System in the 802.11 Wireless LAN Infrastructure Network,” IEEE Network, 2000.
[3] Chen K.C., “Medium Access Control of Wireless LANs for Mobile Computing,” IEEE Network, vol. 8, no 5, Sept. 1994, pp. 50-63.
[4] Andrew S. Tanenbaum “Computer Networks,” Prentice-Hall, Inc., 1996.
[5] ESTI, “Broadband radio access network (BRAN); HIPERLAN type2 technical specification; physical (PHY) layer,” Tech. Rep., ETSI, 1999.
[6] IEEE Standard 802.11a, part II, “Wireless LAN medium access control (MAC) and physical layer (PHY) specifications: High speed physical layer in the 5GHz band,” Tech. Rep., IEEE, 1999.
[7] M.Unbehaun, “A feasibility study of wireless networks for 17 and 60GHz and the impact of deployment strategies on the system performance,” Licentiate thesis KTH, Stockholm, Sweden, March 2001.
[8] John W. “Bridging Wireless Protocols,” IEEE Communications Magazine, Nov. 2001. pp. 90-97.
[9] Arbaugh, Shankar, and Wan, “Your Wireless Network Has No Clothes,” Univ. of MD, Mar. 2001.
[10] Atkinson and Kent, “Security Architecture for the Internet Protocol,” RFC2401, Nov. 1998.
[11] Zygumunt J. Haas “A New Routing for the Reconfigurable Wireless Networks,” IEEE Aug. 1997.
[12] A. Iwata, C.-C. Chiang, G. Pei, M. Gerla, and T.-W. Chen, “Scalable Routing Strategies for Ad Hoc Wireless networks”, IEEE, J. on selected area in comm. Vol. 17, No.8, pp. 1369-1379, Aug. 1999.
[13] A. B. Mcdona ld, and T. F. Znati, “A Mobility-Based Framework for Adaptive Clustering in Wireless Ad Hoc Networks”, IEEE, J. on selected area in comm. Vol. 17, No.8, pp. 1466-1487, Aug. 1999.
[14] C. R. Lin, and M. Gerla, “Adaptive Clustering for Mobile Wireless Nerworks”, IEEE, J. on selected area in comm. Vol. 15, No.7, pp. 1265-1275, Sept. 1997.
[15] D. A. Maltz, J. Broch, J. Jetcheva, and D. B. Johnson, “The Effects of On-Demand Behavior in Routing Protocols for Multihop Wireless Ad Hoc Networks”, IEEE, J. on selected area in comm. Vol. 17, No.8, pp. 1439-1453, Aug. 1999.
[16] K. Pahlavan, and A. H. Levesque, “Wireless Information Networks”, N.Y., Wiley-Interscience Publication, pp. 41, 1995.
[17] K. Pahlavan, and A. H. Levesque, “Wireless Information Networks”, N.Y., Wiley-Interscience Publication, pp. 41, 1995.
[18] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad-Hoc Wireless Networks,” Mobile Computing, T. lmielinski and H. Korth, Eds., Kluwer, 1996, pp 153-81.
[19] C. E. Perkins and E. M. Royer, “Ad-hoc On-Demand Distance Vector Routing,” Proc. 2nd IEEE Wksp. Mobile Comp. Sys. and Apps., Feb. 1999, pp. 90-100.
[20] V. D. Park and M. S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. INFCOM ’97, Apr. 1997.
[21] C. C. Chiang, “Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel,” Proc. IEEE SICON ’97, Apr. 1997, pp 197-211.
[22] C.R. Lin and M. Gerla, “Adaptive clustering for mobile wireless networks,” IEEE J. Select. Areas Commun., vol. 15, pp. 1265-1275, Sept. 1997.
[23] T.C. Hou and T.J. Tasi, “Adaptive clustering in a hierarcial ad hoc network,” in Proc. Int. Computer Symp., Taiwan, Taiwan, R.O.C., Dec. 1998, pp.171-176.
[24] B. Das and V. Bharghavan, “Routing in ad-hoc networks using minimum connected dominating sets,” in Proc. IEEE Int. Conf. Communications, Montreal, QC, Canada, June 1997, pp. 376-380.
[25] A. B. McDonald and T.F. Znati, “A mobility-based framework for adaptive clustering in wireless ad hoc networks,” IEEE J. Select. Areas Commun., vol. 17, pp. 1466-1487, Aug. 1999.
[26] N. H. Vaidya, P. Krishna, M. Chatterjee, and D. K. Pradhan, “A cluster-based approach for routing in dynamic networks,” ACM Comput. Commun. Rev., vol. 17, no. 2, Apr. 1997.
[27] A. Iwata, C.-C. Chiang, G Pei, M. Gerla, and T.-W. Chen, “Scalable routing strategies for ad hoc networks,” IEEE J. Select. Areas Commun., vol. 17, pp. 1369-1679, Aug. 1999.
[28] C.-C. Chiang, “Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel,” Proc. IEEE SICON ’97, Apr. 1997, pp.197-211.
[29] T. S. Rappaport, Wireless Communications: Principles and Practice, Prentice Hall, Upper Saddle River, NJ, OCT. 1995.
[30] R. Dube, C. D. Rais, K. Wang and S. K. Tripathi, Signal stability based adaptive routing for ad hoc mobile networks, Technical Report CS-TR-3646, UMIACS-TR-96-34, Institute for Advanced Computer Studies, Department of Computer Science, University of Maryland, College Park, MD 20742, USA, August, 1996.
[31] K. Pahlavan, and A. H. Levesque, “Wireless Information Networks”, N. Y., Wiley-Interscience Publish, 1995, pp. 41.
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top