在無線感測網路中以延長網路生命週期為目的之避洞繞徑協定

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：16

、訪客IP：3.133.109.211

姓名

王詩媛(Shih-Yuen Wang) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

在無線感測網路中以延長網路生命週期為目的之避洞繞徑協定
(Hole Avoiding Routing Protocol for Extending the Lifetime of Wireless Sensor Network)

相關論文

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

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

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

摘要(中)

在無線感測網路中，由空洞所引起的『local minimum phenomenon』是geographic greedy forwarding時常要面對的一個重要挑戰。如今，多數現存的繞洞研究傾向於將資料封包沿著空洞或禁止區域的周圍傳送。這樣的設計會導致空洞與禁止區域周圍的感測節點比其他感測節點更快用盡它們的電量，擴大洞的大小並縮短網路生命週期。在本篇論文中，我們提出一個能量有效避洞繞徑協定(HARP)來處理在無線感測網路環境下的這個問題。我們在空洞的周圍建立延展區域來減輕繞徑封包時空洞外圍感測節點的能量消耗。此外，我們也考慮多洞的環境，不會為了避洞而捨棄選擇在洞之間的較短路徑。實驗結果顯示我們的協定在網路生命週期上有較好的執行結果。

摘要(英)

In wireless sensor networks, an important challenge often faced in geographic greedy forwarding is the “local minimum phenomenon” which is caused by holes. Nowadays, most existing research works for bypassing holes tend to route data packets along the perimeter of holes or forbidden regions. Such a scheme causes the boundary nodes on the perimeter of holes and forbidden regions exhaust their energy faster than others, thus enlarging the hole sizes and shortening the network lifetime. In this paper, we propose an energy efficient Hole Avoiding Routing Protocol (HARP) to address this problem in wireless sensor networks. We establish expanded areas encircling the hole for mitigating load of boundary nodes when routing packets. Besides, we also consider multi-hole environment, do not discard a choice of shorter path that passes through between holes in order to dodge holes. The experimental result shows that our protocol achieves better performance in network lifetime.

關鍵字(中)

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

關鍵字(英)

★ wireless sensor network
★ routing algorithm
★ Distributed algorithms

論文目次

Chapter 1 Introduction...........................1
Chapter 2 Related work...........................5
Chapter 3 Hole Avoiding Routing Protocol.........9
3.2 Hole Avoiding Routing Protocol (HARP)........11
3.2.1 Shorter Detouring Direction................12
3.2.2 Occasion of Greedy Forwarding..............14
3.2.3 Packet Guiding in Single-Hole Environment..14
3.2.4 Selected Priority .........................18
3.2.5 Packet Guiding in Multi-Hole Environment...24
3.3 Discussion the HARP..........................25
Chapter 4 Simulations...........................28
4.1 Lifetime and Hops of HARP....................30
4.2 Cost of Hot Area Construction of HARP........32
4.3 Lifetime and Hops of Three Routing...........32
Chapter 5 Conclusions...........................38
References.......................................39
Appendix.........................................42

參考文獻

[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, 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, 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 , 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, 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, 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, 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, 2003.
[9] 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, no. 2, pp. 187-200, 2006.
[10] G. G. Finn, “Routing and addressing problems in large metropolitan-scale internetworks,” Technique Report ISI/RR87180, Information Sciences Institute, University of Southern California, 1987.
[11] 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, no. 10, pp. 995-1006, 2005.
[12] 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, 2004.
[13] 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, 2008.
[14] 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, 2000.
[15] 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 , 1998.
[16] 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, no. 2, 2007, pp. 215-228.
[17] 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, 2000.
[18] W. H. 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, 2001.
[19] 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, 2006.
[20] 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, 2007.
[21] 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, 2004.
[22] 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, 2006.
[23] B. Hofmann. Wellenhof, H. Lichtenegger and J. Collins, Global positioning system: theory and practice, Fourth Edition. Springer-Verlag, 1997.
[24] 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, 2008.
[25] 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, 2007.
[26] 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, no. 4, pp. 1509-1522, 2005.

指導教授

許健平、張貴雲
(Jang-Ping Sheu、Guey-Yun Chang)

審核日期

2009-10-2

推文