應用低功率藍芽於耐延遲無線隨意網路之點對點訊息傳輸演算法

A Novel P2P Short Message Transmission Algorithm for Delay-Tolerant MANETs with Bluetooth Low Energy

王詠文(Yung-Wen Wang)

指導教授 ： 郭斯彥

國立臺灣大學/電機資訊學院/電子工程學研究所/碩士(2015年)

https://doi.org/10.6342/NTU.2015.00074

摘要

近幾年由於智慧型手機以及平板裝置的興起，也帶動無線通訊技術如IEEE802.11、近場通訊、以及低功率藍芽快速發展，智慧裝置透過這些技術進行相互通訊而形成的網路又稱為「行動無線隨意網路」(Mobile Ad hoc Network)。 然而，行動無線隨意網路不依靠基地台或網路擷取點進行通訊，斷斷續續的節點狀況與快速變化的網路拓樸結構會使以往點對點傳輸之路由演算法並不穩定。基於以上的狀況，這類通訊中必須要有耐延遲(Delay-Tolerant)的特性，我們又稱這種網路「耐延遲行動無線隨意網路」(DTMs)。
在這篇論文中，由於人群的移動特性造就出手機裝置之間的移動相似性，屬於同一社群的人相遇的次數普遍會高於屬於不同社群的人，基於此特性，我們可以根據一些事前資訊建立出手機之間的社群網路模型，計算出每位節點幫忙轉傳訊息到終點的成功率來增加耐延遲網路的整體傳送成功率；而當網路狀況屬於穩定時，我們再切換成傳統行動無線隨意網路的演算法進行可靠傳輸。最後，我們使用Android手機得來的低功率藍芽的參數進行設計並且拿台大校園做為模擬情境，與其他現存的演算法進行比較，證實了我們的AL-DS演算法可以在不同的網路狀況下仍有穩定的傳輸成功率，並且隨著節點增加，傳輸的延遲會逐漸下降。

關鍵字

無線隨意網路 ； 耐延遲網路 ； 間歇性連接網路 ； 路由演算法 ； 低功秏藍芽

並列摘要

In the last few years, the introduction of smart phones and tablets with short range wireless communication techniques like IEEE802.11, NFC and Bluetooth Low Energy(BLE) has made the rapid development of Mobile Ad hoc network (MANET). However, algorithms for end-to-end based routing may not always be robust due to the sparse node density, frequent disruption of network topology and lacking of fixed infrastructures. With these natures, the communication needs to be delay-tolerant. We refer such networks as Delay-Tolerant MANETs(DTMs).
In this paper, for Delay Tolerant Network, we found that there is usually a homogeneous relationship between mobile nodes. It’s because of the nature that people in the same groups tend to meet each other more times than people in different groups. As a result, we use pre-defined information to make some social patterns and each node can use them to calculate the successful forwarding probability. As for those networks with high and stable node density, we use algorithms designed for MANET to establish a reliable data transfer. Moreover, we design the data structure for Android application to meet the standard of BLE.
At the end of this paper, we use the characteristics of Android BLE and NTU campus to construct a simulation model. Besides, we compare our method with different existing routing algorithms. The simulation result proves that our AL-DS algorithm can have stable delivery ratio regardless of the sparsity of network and lower delay when the nodes in the network increase.

並列關鍵字

Mobile Ad Hoc Networks ； Delay Tolerant Networks ； Intermittently Connected Networks ； Routing algorithm ； Bluetooth Low Energy

參考文獻

[1]C. Perkins and E. Royer, “Ad-hoc on-demand distance vector routing,” in Proc. WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications, 1999.

[2]D. Johnson, D. Maltz, and J. Broch, “DSR: the dynamic source routing protocol for multihop wireless ad hoc networks,” Ad Hoc Networking. Reading, MA: Addison-Wesley, 2001, ch.5.

[3]Y. Cao and Z. Sun, “Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges,” IEEE Commun. Surv. Tutorials, vol. 15, no. 2, pp. 654-677, 2013.

[5]T. Spyropoulos, K. Psounis and C. Raghavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case,” IEEE/ACM Trans. Networking, vol. 16, no. 1, pp. 77-90, 2008.

[6]M. Grossglauser and D. Tse, “Mobility increases the capacity of ad-hoc wireless networks,” Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 2001.