(3.231.226.13) 您好!臺灣時間:2020/05/27 01:51
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
本論文永久網址: 
line
研究生:凌瑋駿
研究生(外文):Wei-Jiun Ling
論文名稱:行動隨意網路可調適及可延展之位置服務協定
論文名稱(外文):SEEKER: An Adaptive and Scalable Location Service for Mobile Ad Hoc Networks
指導教授:江振瑞
指導教授(外文):Jehn-Ruey Jiang
學位類別:碩士
校院名稱:國立中央大學
系所名稱:資訊工程研究所
學門:工程學門
學類:電資工程學類
論文出版年:2006
畢業學年度:94
語文別:英文
論文頁數:48
中文關鍵詞:行動隨意網路位置服務位置管理延展性調適性
外文關鍵詞:mobile ad hoc network (MANET)location managementlocation servicescalabilityadaptive
相關次數:
  • 被引用被引用:0
  • 點閱點閱:116
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:7
  • 收藏至我的研究室書目清單書目收藏:0
以位址資訊為基礎的繞徑協定使用地理資訊做輔助,相較於以拓撲為基礎(topology-based) 的繞徑協定,如 AODV 以及 DSR…等,能使得行動隨意式網路(MANET)具備更好的規模可變性與更低的路由負載。然而,以位址資訊為基礎的繞徑協定在遞送封包之前,首先需依賴位置服務法 (location services scheme)來提供他們目的地點的位置,然後他們才能將封包正確地遞送至目的地。因此,保持以位址資訊為基礎的繞徑協定的優點便是設計一個位置服務法,其需要具備有越高的規模可變性(Scalability)以及越低的協定控制負擔(Protocol overhead)。本篇論文提出 SEEKER來完成上述的目標。SEEKER的基本想法是使用群聚更新(aggregate update) 的方式整合一群行動主機(mobile nodes)並使他們能同時更新他們目前的位置。使用此種方法,我們嘗試去減低大部分的位址更新或維護的負擔(update overhead),同時保持很高的查詢成功率 (query success rate)。除此之外,SEEKER可改變位置更新的間隔時間來適應行動主機移動速度的改變,這樣能使SEEKER 節省更多位置更新的負擔。我們使用四種衡量方式來模擬 SEEKER:位置維護成本(Location maintenance cost),位置查詢成本(Location query cost),以及查詢的成功率(Query success rate),封包遞送成功率(Packet Delivery Rate)。在我們的模擬中,將 SEEKER與其它四個位置服務法 – GLS,HIGH-GRADE,XYLS,及GHLS 做比較。模擬與比較的結果顯示SEEKER具有同等地好的效能。
The location-based routing protocols for mobile ad-hoc networks (MANETs) use geographic information to achieve higher scalability and lower control overhead than those of the topology-based routing protocols, e.g. AODV and DSR, etc. However, location-based routing protocols rely on location services scheme to provide them with the location information of the destination position, so they can forward packets to the destination properly. To keep the advantage of the location-based routing protocol, the location service should has as high as possible scalability and as low as possible control overhead. This paper proposes SEEKER to accomplish such goals. The basic idea of SEEKER is the aggregate update that integrates a group of position updates to perform them altogether. In this way, we reduce a lot of location maintenance (update) overhead, and meanwhile query success rate is kept comparably high. Moreover, SEEKER can adapt to mobility by changing the frequency of the aggregate update. This can make SEEKER save more location update cost. We simulate SEEKER in terms of four metrics: the location maintenance cost, the location query cost, the query success rate, and the packet delivery rate. We also compare SEEKER with four location services - GLS, HIGH-GRADE, XYLS and GHLS. The results show that SEEKER has comparably good performances.
Contents

Abstract I
摘要 II
誌謝 III
Contents IV
List of Figures VI
List of Tables VIII
1. Introduction 1
1.1 Background 1
1.2 Research motivation 2
1.3 Research objectives 3
2. Related work 4
2.1 Location-based forwarding 5
2.2 Quorum-Based Location Service (XYLS) 7
2.3 Hierarchical-Based Location Service (GLS) 9
2.4 Hash-based Location Service (SLURP) 10
2.5 Other enhanced location services 12
2.5.1 Scalable Ad-hoc Location Management (SLALoM) 12
2.5.2 Enhancing GLS location service (HIGH-GRADE) 14
2.5.3 Multi-Home Region Location Service (ADLS) 16
2.5.4 Geographic Hashing Location Service (GHLS) 18
3. The SEEKER Location Service 20
3.1 Assumption 20
3.2 Location update 21
3.3 Location query 23
3.4 Adaptive Location Update 25
4. Performance Analysis 28
4.1 Simulation scenario 28
4.2 Performance of SEEKER under 600 nodes 29
4.2.1 Query Performance 29
4.2.2 Data delivery performance 34
4.2.3 Adaptive update interval 35
4.3 Performance of SEEKER above 600 nodes 37
4.3.1 Query performance 38
4.3.2 Data delivery performance 41
5. Conclusion 43
6. Acknowledgments 44
7. Reference 45
[1]IEEE, Wireless LAN medium access control (MAC) and physical layer (PHY) Spec, IEEE 802.11 standard (1998).
[2]Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu, and Jorjeta Jetcheva. A performance comparison of multi-hop wireless adhoc network routing protocols. In Proc. ACM/IEEE MobiCom, pages85–97, October 1998.
[3]Barry M. Leiner, Robert J. Ruth, and Ambatipudi R. Sastry. Goals and challenges of the DARPA GloMo program. IEEE Personal Communications,3(6):34–43, December 1996.
[4]I. Stojmenovic, “A scalable quorum based location update scheme for routing in ad hoc wireless networks,” Technical Report TR-99-09, SITE, University of Ottawa, Sep. 1999.
[5]I. Stojmenovic, “Home agent based location update and destination search schemes in ad hoc wireless networks,” Technical Report TR-99-10, SITE, University of Ottawa, Sep. 1999.
[6]P.-H. Hsiao, “Geographical Region Summary Service for Geographical Routing,” The ACM Symposium on Mobile ad hoc Networking & Computing (MobiHoc 2001) Poster Paper, Vol. 5, No. 4, Oct. 2001.
[7]J. Li, J. Jannotti, Douglas S. J. De Couto, D. R. Karger and R. Morris, “A scalable location service for geographic ad hoc routing,” Proceedings of the sixth annual international conference on Mobile computing and networking, Aug. 2000.
[8]Christine T. Cheng, H. L. Lemberg, Sumesh J. Philip, E. van den Berg, and T. Zhang. SLALoM: A scalable location management scheme for large mobile ad-hoc networks. In Proceedings of IEEE WCNC, March 2002.
[9]S.-C. M. Woo and S. Singh, “Scalable routing protocol for ad hoc networks, ”Wireless Networks, Vol. 7, No. 5, Sep. 2001.
[10]Y Yu, GH Lu, ZL Zhang. “Enhancing location service scalability with HIGH-GRADE “in Proceedings of IEEE Mobile Ad-hoc and Sensor Systems, Oct. 2004.
[11]Y. Xue, B. Li, and K. Nahrstedt, “A scalable location management scheme in mobile ad-hoc networks,” Proceedings of 26th Annual IEEE Conference on Local Computer Networks, pp. 102 -111, 2001.
[12]Performance Comparison of Scalable Location Service for Geographic Ad Hoc Routing, IEEE INFOCOM, 2005.
[13]Boon-Chong Seet; Yan Pan; Wen-Jing Hsu; Chiew-Tong Lau, Multi-Home Region Location Service for Wireless Ad Hoc Networks: An Adaptive Demand-Driven Approach, Jan. 2005.
[14]M. Mauve, J. Widmer, H. Hartenstein, A survey on position-based routing in mobile ad-hoc networks, IEEE Network Magazine, 15(6):30 - 39, November 2001.
[15]H. Takagi and L. Kleinrock, “Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals,” IEEE Trans. Commun., vol. 32, no. 3, Mar. 1984, pp. 246–57.
[16]T.-C. Hou and V. O.K. Li, “Transmission Range Control in Multihop Packet Radio Networks,” IEEE Trans. Commun., vol. 34, no. 1, Jan. 1986, pp.38–44.
[17]E. Kranakis, H. Singh, and J. Urrutia, “Compass Routing on Geometric Networks,” Proc. 11th Canadian Conf. Comp. Geo., Vancouver, Aug. 1999.
[18]P. Bose et al., “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,”Proc. 3rd ACM Int’l. Wksp. Discrete Algorithms and Methods for Mobile Comp. and Commun., 1999, pp. 48–55.
[19]B. Karp and H. T. Kung, “Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. 6th Annual ACM/IEEE Int’l. Conf. Mobile Comp. Net., Boston, MA, Aug. 2000, pp. 243–54.
[20]J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Elsevier North-Holland, 1976).
[21]K.R. Gabriel and R.R. Sokal, A new statistical approach to geographic variation analysis, Systematic Zoology 18 (1969) 259–278.
[22]P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing withguaranteed delivery in ad hoc wireless networks,” in Proc. of ACM DIALM Workshop, August 1999.
[23]Stefano Basagni, Imrich Chlamtac, Violet R. Syrotiuk, and Barry A.Woodward. A distance routing effect algorithm for mobility (DREAM). In Proceedings of ACM MobiCom 98, pages 76–84, 1998.
[24]B. Karp and H. Kung, “GPSR: greedy perimeter stateless routing for wireless networks,” Proceedings of the sixth annual international conference on Mobile computing and networking, pp. 243-254, 2000.
[25]C. E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” in Proc. of ACM SIGCOMM, August 1994.
[26]D. B. Johnson and D. A. Maltz, “Dynamic source routing in ad hoc wireless networks,” Mobile Computing, Kluwer Academic, 1996.
[27]C. E. Perkins and E. M. Royer, “Ad hoc on-demand distance vector routing,” in Proc. of IEEE WMCSA, February 1999.
[28]Z. J. Haas and M. R. Pearlman, “The performance of query control schemes for the zone routing protocol,” in Proc. of ACM SIGCOMM, August 1998.
[29]The Network Simulator - ns-2, http://www.isi.edu/nsnam/ns/.
[30]CMU Monarch Group, CMU Monarch extensions to ns. http://www.monarch.cs.cmu.edu/.
[31]K.N. Amouris, S. Papavassiliou, and M. Li. A position-based multi-zone routing protocol for wide area mobile ad-hoc networks. In Proceedings of the IEEE Vehicular Technology Conference (VTC), pages 1365–1369, 1999.
[32]Z.J. Haas and B. Liang. Ad hoc mobility management with randomized database groups. In Proceedings of the IEEE International Conference on Communications (ICC), pages 1756–1762, 1999.
[33]Z.J. Haas and B. Liang. Ad hoc mobility management with uniform quorum systems. IEEE/ACM Transactions on Networking, 7(2):228–240, April 1999.
[34]G. Karumanchi, S. Muralidharan, and R. Prakash. Information dissemination in partitionable mobile ad hoc networks. In Proceedings of the IEEE Symposium on Reliable Distributed Systems, pages 413, 1999.
[35]B. Liang and Z.J. Haas. Virtual backbone generation and maintenance in ad hoc network mobility management. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 1293 1302, 2000.
[36]S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker. GHT: A geographic hash table for data-centric storage in sensornets. In Proceedings of ACM WSNA, 2002.
[37]S. Giordano and M. Hamdi. Mobility management: The virtual home region. Technical Report SSC/1999/037, Ecole Polytechnique Federale de Lausanne, October 1999.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔