無線感測網路克服障礙物及延長網路存活時間之繞徑協定

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：37

、訪客IP：3.135.241.187

姓名

陳佳偉(Chi-Wei Chen) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

無線感測網路克服障礙物及延長網路存活時間之繞徑協定
(An Obstacle-Avoidance Routing Protocol in Wireless Sensor Network)

相關論文

★ 基於OP-TEE的可信應用程式軟體生態系統	★ 在低軌道衛星無線通訊中的CSI預測方法
★ 為多流量低軌道衛星系統提出的動態換手策略	★ 基於Trustzone的智慧型設備語音隱私保護系統
★ 一種減輕LEO衛星網路干擾的方案	★ TruzGPS:基於TrustZone的位置隱私權保護系統
★ 衛星地面整合網路之隨機接入前導訊號設計與偵測	★ SatPolicy: 基於Trustzone的衛星政策執行系統
★ TruzMalloc: 基於TrustZone 的隱私資料保護系統	★ 衛星地面網路中基於物理層安全的CSI保護方法
★ 低軌道衛星地面整合網路之安全非正交多重存取傳輸	★ 低軌道衛星地面網路中的DRX機制設計
★ 衛星地面整合網路之基於集合系統的前導訊號設計	★ 基於省電的低軌衛星網路路由演算法
★ 衛星上可重組化計算之安全FPGA動態部分可重組架構	★ 衛星網路之基於空間多樣性的前導訊號設計

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

無線感測網路具有價格便宜以及易於佈建的特性，因此在近幾年已成為一項被廣泛討論的研究議題，特別是在一些危險或是難以到達的區域，無法以人力佈建之處，常見的方法是空拋感測器的方式建立無線感測網路。
在實際的場景中可能存在著山丘、湖泊等障礙物，導致感測器的佈署不平均或是被破壞，使得無線感測網路拓樸存在空洞，多數現有的繞境協定會使其路徑集中於空洞周圍，使得空洞周圍節點電量很快被耗盡。
本篇論文提出一個分散式的方法分散空洞周圍節點電量消耗，以達到延長無線感測網路生命週期之目的。

摘要(英)

In wireless sensor networks, an important challenge often faced in geographic routing is the “local minimum phenomenon” which is caused by obstacles. For solving this problem, most obstacle-avoiding schemes route packets along the perimeter of obstacles or forbidden regions. Thus, sensor nodes on the perimeter of obstacles and forbidden regions exhaust their energy faster than others, which enlarge the hole size, called growing hole problem. In this paper, we propose an discrete energy-efficient Obstacle Avoiding Routing Protocol (OARP) to disperse energy consumption of sensor nodes on the perimeter of obstacles for solving growing hole problem, and prolong the network lifetime.

關鍵字(中)

★ 分散式演算法
★ 繞徑演算法
★ 無線感測網路

關鍵字(英)

★ wire
★ Distributed algorithms
★ geographic routing

論文目次

Chapter 1 Introduction ........................................................................ 1
Chapter 2 Related work ...................................................................... 5
Chapter 3 Obstacle Avoiding Routing Protocol ................................ 8
3.1 Communication Loading of Hot Spots ................................................. 8
3.1.1 Worst Case .......................................................................................... 10
3.2 Expanded Hot Area ............................................................................. 14
3.3 Shorter Detouring Direction Determination ....................................... 15
3.4 Obstacle Avoiding Routing Protocol (OARP) .................................... 17
3.4.1 Random-Based Obstacle Avoiding Routing Protocol (RB-OARP) .... 17
3.4.2 RB-OARP in Multi-Hole Environments ............................................. 20
3.4.3 Location-Based Obstacle Avoiding Routing Protocol (LB-OARP) ... 22
3.4.4 LB-OARP in Multi-Hole Environments ............................................. 25
Chapter 4 Simulations ....................................................................... 28
4.1 Analysis............................................................................................... 29
4.1.1 Network Lifetime ................................................................................ 29
4.2 Performance Evaluation ...................................................................... 35
4.2.1 Network Lifetime ................................................................................ 35
4.2.2 Exhausted Time ................................................................................... 44
4.2.3 Path Length ......................................................................................... 47
4.3 Cost of Hot Area Construction ............................................................ 50
Chapter 5 Conclusions and Future Works ...................................... 51
References .............................................................................................. 52
Appendix ................................................................................................ 56

參考文獻

[1] The Network Simulator ns-2, http://www.isi.edu/nsnam/ns/
[2] N. Ahmed, S. Kanhere and S. Jha, “The holes problem in wireless sensor networks: a survey,” in Journal of the ACM Sigmobile Mobile Computing and Communication Review, Vol. 9, Issue 2, pp. 4-18, April 2005.
[3] M. Aissani, A. Mellouk, N. Badache and M. Djebbar, “A new approach of announcement and avoiding routing voids in wireless sensor networks,” in Proceedings of Global Telecommunications Conference (GLOBECOM 2008), pp. 1-5, New Orleans, LA, USA, Dec. 2008.
[4] S. Basagni, I. Chlamtac, V. Syrotiuk and B. Woodward, “A distance routing effect algorithm for mobility (DREAM),” in Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking (ACM/IEEE MOBICOM), pp. 76-84, Dallas, Texas, USA , Oct. 1998.
[5] S. Capkun, M. Hamdi and J. Hubaux, “GPS-free positioning in mobile ad hoc networks,” in Proceedings of 34th Annual Hawaii International Conference on System Sciences, pp. 3481-3490, Maui, Hawaii, USA, Jan. 2001.
[6] C. Chang, K. Shih, S. Lee and S. Chang, “RGP: active route guiding protocol for wireless sensor networks with obstacles,” in Proceedings of the 3rd IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS’06), pp. 367-376, Vancouver, Canada, Oct. 2006.
[7] C. Chang, W. Ju, C. Chang and Y. Chen, “WRGP: weight-aware route guiding protocol for wireless sensor networks with obstacles,” in Proceedings of the 3rd IEEE International Conference on Communications (ICC 2008), pp. 3302 – 3306, Beijing, China, May 2008.
[8] C. Y. Chang, C. T. Chang and S. C. Tu, “Obstacle- free geocasting protocols for single/multi-destination short message services in ad hoc networks,” in Journal of Wireless Networks, Vol. 9, No. 2, pp. 143-155, Mar. 2003.
[9] G. Y. Chang, J. P. Sheu, “Contour-Based Hole Avoiding Routing Protocol in Wireless Sensor Networks,” in Proceedings of Global Communications Conference (GLOBECOM 2010), Miami, Florida, USA, Dec. 2010.
[10] Q. Fang, J. Gao and L. J. Guibas, “Locating and bypassing routing holes in sensor networks,” in Journal of Mobile Networks and Applications, Vol. 11, Issue 2, pp. 187-200, April. 2006.
[11] G. G. Finn, “Routing and addressing problems in large metropolitan-scale internetworks,” Technique Report ISI/RR87180, Information Sciences Institute, University of Southern California, Mar. 1987.
[12] T. He, J.A. Stankovic, C. Lu and T.F. Abdelzaher, “A spatiotemporal communication protocol for wireless sensor networks,” in Journal of IEEE Transactions on Parallel and Distributed Systems (TPDS), Vol. 16, Issue 10, pp. 995-1006, Oct. 2005.
[13] B. Hofmann-Wellenhof, H. Lichtenegger and J. Collins, Global positioning system: theory and practice, Fourth Edition. Springer-Verlag, 1997.
[14] T. Hu, Y. Fei, “QELAR: A Machine-Learning-Based Adaptive Routing Protocol for Energy-Efficient and Lifetime-Extended Underwater Sensor Networks,” in Journal of IEEE Transactions on Mobile Computing (TMC), Vol. 9, Issue 6, pp. 796-809, Jun. 2010.
[15] A. Jadbabaie, “On geographic routing without location information,” in Proceedings of the 43th IEEE Conference on Decision and Control, pp. 4764-4769, Atlantis, Paradise Island, Bahamas, Dec. 2004.
[16] Z. Jiang, J. Ma, W. Lou and J. Wu, “An information model for geographic greedy forwarding in wireless ad-hoc sensor networks,” in Proceedings of the 27th Conference on Computer Communications (INFOCOM 2008), pp. 825 - 833, Phoenix, AZ, USA, April 2008.
[17] Z. Jiang, J. Ma, W. Lou and J. Wu, “A Straightforward Path Routing in Wireless Ad Hoc Sensor Networks,” in Proceedings of the 29th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2009), pp. 103 – 108, Québec, Canada, Jun. 2009.
[18] B. Karp and H. T. Kung, “GPSR: greedy perimeter stateless routing for wireless networks,” in Proceedings of the 6th Annual International Conference on Mobile Computing, pp. 243-254, Boston, Massachusetts, USA, Aug. 2000.
[19] Y. Ko and N. Vaidya, “Location-aided routing (LAR) in mobile ad hoc networks,” in Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking (ACM/IEEE MOBICOM), pp. 66-75, Dallas, Texas, USA , Oct. 1998.
[20] F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, “Geometric ad-hoc routing: Of theory and practice,” in Proceedings of the 27th Annual Symposium on Principles of Distributed Computing (PODC ’03), pp. 63-72, Boston, Massachusetts, USA, Jul. 2003.
[21] J. Li, J. Jannotti, D. DeCouto, D. Karger and R. Morris, “A scalable location service for geographic ad-hoc routing.” in Proceedings of the 6th Annual ACM/IEEE International Conference, on Mobile Computing and Networking, pp.120-130, Boston, MA, Aug. 2000.
[22] Wen-Hwa Liao, Jang-Ping Sheu, and Yu-Chee Tseng, “GRID: a fully location-aware routing protocol for mobile ad hoc networks”, in Telecommunication Systems, Vol. 18, pp. 37-60, Sep. 2001.
[23] K. Liu, N. Abu-Ghazaleh and K. Kang, “Location verification and trust management for resilient geographic routing,” in Journal of the Parallel and Distributed Computing (JPDC), Vol. 67, Issue 2, pp. 215-228, Feb. 2007.
[24] S. Olariu and I. Stojmenovic, “Design guidelines for maximizing lifetime and avoiding energy holes in sensor networks with uniform distribution and uniform reporting,” in Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 1-12, Barcelona, Catalunya, SPAIN, April 2006.
[25] P. K. Sahoo, K. Y. Hsieh and J. P. Sheu, “Boundary node selection and target detection in wireless sensor network,” in Proceedings of the IFIP International Conference on Wireless and Optical Communications Networks (WOCN 2007), Singapore, Jul. 2007.
[26] M. Sichitiu and V. Ramadurai, “Localization of wireless sensor networks with a mobile beacon,” in Proceedings of the 1st IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS’04), pp. 174-183, Fort Lauderdale, Florida, USA, Oct. 2004.
[27] G. Tan, M. Bertier and A.-M. Kermarrec, “Visibility-Graph-based Shortest-Path Geographic Routing in Sensor Networks,” in Proceedings of the 28th IEEE International Conference on Computer Communications (INFOCOM), pp. 1719-1727, Rio de Janeiro, Brazil, April 2009.
[28] X.Wu, G. Chen and S. Das, “On the energy hole problem of nonuniform node distribution in wireless sensor networks,” in Proceedings of the 3rd IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS’06), pp. 180-187, Vancouver, Canada, Oct. 2006.
[29] Y. Yoo, D.P. Agrawal, “Mobile Sensor Relocation to Prolong the Lifetime of Wireless Sensor Networks,” in Proceedings of IEEE 67th Vehicular Technology Conference (VTC 2008), Marina Bay, Singapore, May 2008.
[30] F. Yu, Y. Choi , S. Park, E. Lee, Y. Tian and S. H. Kim, “Virtual circle based geometric modeling of holes for geographic routing,” in Proceedings of Wireless Communications and Networking Conference (WCNC 2008), pp. 2426-2431, Las Vegas, USA, April 2008.
[31] L. Zhao, B. Kan, Y. Xu and X. Li, “FT-SPEED: a fault-tolerant, real-time routing protocol for wireless sensor networks,” in Proceedings of International Conference on Wireless Communications, Networking and Mobile Computing (WiCom), pp. 2531-2534, Shanghai, China, Sep. 2007.
[32] L. Zou, M. Lu and Z. Xiong, “A distributed algorithm for the dead end problem of location based routing in sensor networks,” in Journal of IEEE Transactions on Vehicular Technology (TVT), Vol. 54, Issue 4, pp. 1509-1522, Jul. 2005.

指導教授

張貴雲(Guey-Yun Chang)

審核日期

2010-11-26

推文