Responsive image
博碩士論文 etd-0726115-095336 詳細資訊
Title page for etd-0726115-095336
論文名稱
Title
一個基於接收訊號強度決定傳送機率之氾濫路由機制
A Probability-based Flooding Scheme Based on Received Signal Strength
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
58
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2015-07-29
繳交日期
Date of Submission
2015-08-26
關鍵字
Keywords
無線感測網路、無線隨意網路、廣播風暴、廣播、氾濫路由、機率導向氾濫路由、鄰居資訊導向氾濫路由、位置導向氾濫路由
probability-based flooding, location-based flooding, flooding, broadcast storm, broadcast, neighbor-knowledge flooding, wireless Ad-hoc network, wireless sensor network
統計
Statistics
本論文已被瀏覽 5673 次,被下載 46
The thesis/dissertation has been browsed 5673 times, has been downloaded 46 times.
中文摘要
氾濫路由(flooding)是一種將訊息或資料散佈到環境中所有節點的方法。每一個的節點都將收到的封包儘可能地再送往所有可連結的路徑。在無線網路的環境中,使用氾濫路由的節點會透過向自己的通訊範圍內進行廣播(broadcast)來將封包送往所有相鄰的節點。而在最基本的氾濫路由機制中,所有第一次收到新封包的節點都至少會廣播一次來將資料傳遞出去,這個行為在節點數量眾多時會造成廣播風暴問題(broadcast storm problem),在無線環境中產生大量的訊息碰撞與頻寬資源的消耗,以及因重傳導致的傳輸延遲以及節點本身的電力資源浪費等問題。
為了解決廣播風暴的問題,本論文提出一個新形態的氾濫路由機制,以節點間的無線訊號強度(signal strength)作為基礎,再結合位置導向(location-based)與機率導向(probability-based)的方法來降低環境中負責進行廣播的節點數量,進而減少冗餘封包的數量而達到降低廣播風暴所產生的影響。且節點間不需要定期交換hello message來避免產生額外的成本。本論文所提出的方法同時也包含了解決傳統機率導向的氾濫路由方法中整體送達率不足(low delivery ratio)的問題。
藉由模擬的結果可以看出本論文所提出的氾濫路由方法在無線環境中可以有效地降低廣播的節點數量減少訊息碰撞的產生,以及提供與其他方法相比起來較可靠的整體送達率(delivery ratio)。有效的抑止了在傳統的氾濫路由方法中廣播風暴所造成的影響。
Abstract
The flooding algorithm is a routing mechanism which distributing packets to every nodes in the environment. Every incoming packet is sent through each outgoing links. In wireless network the flooding algorithm forwards packet by broadcast. In simplest flooding scheme, every node in the network forwards the flooding message for the first time it received. However this simple mechanism generates massive redundant packets, causing resource contention, and data collisions in the network. It is referred as the broadcast storm problem.
To ease the bad effect of broadcast storm problem, we proposed a novel flooding scheme based on received signal strength, which combine probability-based and location-based flooding algorithms to reduce the number of retransmitting nodes. The proposed mechanism does not acquire neighbor node information via exchange hello messages periodically. The proposed flooding mechanism also achieves high delivery ratio compared with traditional probability-based flooding algorithms.
The simulation result shows that our scheme has fewer forwarding nodes to rebroadcast the packet. It reduces large number of collisions compared and has high delivery ratio compared with other flooding algorithms. It therefore effectively ease the broadcast storm problem.
目次 Table of Contents
學位論文審定書 i
論文公開授權書 ii
摘要 iii
Abstract iv
目錄 v
圖目錄 vii
表目錄 ix
第一章 導論 1
1.1 簡介 1
1.2 研究動機 3
1.3 論文架構 4
第二章 相關背景 5
2.1 無線隨意網路(Wireless Ad-Hoc Network) 5
2.2 氾濫路由(Flooding) 6
2.2.1機率導向氾濫(Probability-based Flooding) 7
2.2.2位置導向氾濫(Location-based Flooding) 10
2.2.3鄰居資訊導向氾濫(Neighbor knowledge-based Flooding) 11
第三章 研究方法 13
3.1 基本條件與情境假設 13
3.2 機制架構 13
3.3 第一階段機率計算p1 15
3.3.1由GPS座標資訊計算DGPS 15
3.3.2 由訊號強度資訊計算Dstrength 15
3.3.3 計算機率p1 16
3.4 第二階段機率計算p2 19
3.5 設備不具GPS定位功能之對應機制 21
第四章 模擬與效能分析 23
4.1 模擬環境與參數設定 23
4.2 評測項目 27
4.3 模擬結果與分析 28
4.3.1 Free Space Model – packet size 64 bytes 28
4.3.2 Free Space Model – packet size 128 bytes 33
4.3.3 Shadowing Model – packet size 64 bytes 37
4.3.4 Shadowing Model – packet size 64 bytes in urban scenario 41
第五章 結論 44
參考文獻 45
參考文獻 References
[1] Yu-Chee Tseng, Ni Sze-Ya, Chen Yuh-Shyan, and Sheu Jang-Ping. “The broadcast storm problem in a mobile ad hoc network.” In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), pages 151-162, 1999.
[2] Charles Perkins, Elizabeth Belding-Royer, and Samir Das. “Ad hoc on-demand distance vector (AODV) routing.” No. RFC 3561. 2003.
[3] David B. Johnson, and David A. Maltz. “Dynamic source routing in ad hoc wireless networks.” Internet Draft (work in progress)(1998)draft-ietf-manet-dsr-00.txt
[4] Sung-Ju Lee, William Su, and Mario Gerla. "On-demand multicast routing protocol in multihop wireless mobile networks." Internet-Draft, draft-ietf-manet- odmrprp-Ol.txt, Jun. 1999, Work in progress.
[5] Thomas Clausen, and Philippe Jacquet. “Optimized link state routing protocol (OLSR).” No. RFC 3626. 2003.
[6] Guoyou He. "Destination-sequenced distance vector (DSDV) protocol." Networking Laboratory, Helsinki University of Technology (2002).
[7] Zygmunt J. Haas, Marc R. Pearlman, and Prince Samar. "The zone routing protocol (ZRP) for ad hoc networks." draft-ietf-manet-zone-zrp-04.txt (2002).
[8] Prince Samar, Marc R. Pearlman, and Zygmunt J. Haas. "Independent zone routing: an adaptive hybrid routing framework for ad hoc wireless networks." IEEE/ACM Trans. Networking, vol. 12, no. 4, pages 595-608, Aug. 2004.
[9] Dilli Ravilla, V. Sumalatha, and Dr P. Reddy. "Performance comparisons of ZRP and IZRP routing protocols for ad hoc wireless networks." In International Conference on Energy, Automation, and Signal, pages 1-8, Dec. 2011.

[10] Brad Williams, and Tracy Camp. "Comparison of broadcasting techniques for mobile ad hoc networks." In Proceedings of The 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC 2002), Lausanne, Switzerland, Jun 2002.
[11] Yoav Sasson, David Cavin, and André Schiper. "Probabilistic broadcast for flooding in wireless mobile ad hoc networks." IEEE Wireless Communications and Networking Conference (WCNC), March 2003.
[12] Yu-Chee Tseng, Sze-Yao Ni, and En-Yu Shih. "Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network." IEEE Transactions on Computers , vol. 52, no. 5, pages 545–557, May 2003.
[13] Qi Zhang, and Dharma P. Agrawal. "Dynamic probabilistic broadcasting in mobile ad hoc networks." Proc. of Vehicular Technology Conference Fall 2003 , Orlando, October 2003.
[14] Hyocheol Jeong, Hyeonjun Jeong, and Younghwan Yoo. "Dynamic probabilistic flooding algorithm based-on neighbor information in wireless sensor networks." Information Networking (ICOIN), 2012 International Conference on:Communication, Networking & Broadcasting, pages 340-345, 2012.
[15] Hyo-Cheol Jeong, Ki-Deok Kwon, and Younghwan Yoo. "Cross-layer counter-based flooding without location information in wireless sensor networks." In Proceedings of the Seventh International Conference on Information Technology, pages 840-845, 2010.
[16] Kanitsorn Suriyapaiboonwattana, Chotipat Pornavalai, and Goutam Chakraborty. "An adaptive alert message dissemination protocol for VANET to improve road safety." IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), pages 1639-1644, August 2009.
[17] Jesus Arango, Mikael Degermark, Alon Efrat, Stephen Pink, “An Efficient Flooding Algorithm for Mobile Ad-hoc Networks,” in Proc. of WiOpt, Mar. 2004.
[18] Jie Wu, and Fei Dai. "Broadcasting in ad hoc networks based on self-pruning." Proc. of the 22nd Annual Joint Conf. of IEEE Communication and Computer Society (INFOCOM), (CD-ROM), 2003.
[19] Majid Khabbazian, and Vijay K. Bhargava. "Localized broadcasting with guaranteed delivery and bounded transmission redundancy." IEEE Transactions on Computers, vol. 57, no. 8, pages 1072-1086, Aug. 2008.
[20] Wei Lou, and Jie Wu. "Double-covered broadcast (dcb): A simple reliable broadcast algorithm in MANETs." In Proceedings of the 23st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM ’04), Hong Kong, China, Mar. 2004.
[21] R. Vadivel, and B. Narasimhan. "A Reliable Flooding Mechanism for Mobile Ad-Hoc Networks." Intelligent Computing Applications (ICICA), 2014 International Conference on. IEEE, 2014.
[22] Amir Qayyum, Laurent Viennot, and Anis Laouiti. "Multipoint relaying for flooding broadcast messages in mobile wireless networks." In Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS), vol 9, page 298, Jan. 2002.
[23] Trong Duc Le, and Hyunseung Choo. "Efficient flooding scheme based on 2-hop backward information in ad hoc networks." IEEE International Conference on Communications(ICC), pages 2443-2447, May 2008.
[24] Ivan Stojmenovic, Mahtab Seddigh, and Jovisa Zunic. "Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks." IEEE Transactions. Parallel and Distributed Systems, vol 13 no.1, pages 14-25, Jan 2002.
[25] Fei Dai, and Jie Wu. "An extended localized algorithm for connected dominating set formation in ad hoc wireless networks." IEEE Transactions. Parallel and Distributed Systems, vol 15 no.10, pages 908-920, 2004.
[26] Peng-Jun Wan, Khaled M. Alzoubi, and Ophir Friede. "Distributed construction of connected dominating set in wireless ad hoc networks." INFOCOM 2002. Twenty-First annual joint conference of the IEEE computer and communications societies.
[27] Michael R. Garey, and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: W.H. Freeman, 1979.
[28] Sudipto Guha, and Samir Khuller. "Approximation algorithms for connected dominating sets." Algorithmica vol.20, no.4, pages 374–387, 1998.
[29] The Network Simulator – ns-2, http://www.isi.edu/nsnam/ns/.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:自定論文開放時間 user define
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code