臺灣博碩士論文加值系統

機會網路是個非常不穩定的網路通訊架構，僅藉由通訊設備隨意移動再互相靠近的情況下才可以進行資料的傳遞。傳統機會網路都是考慮在一個無障礙的空間範圍內進行隨意的移動，但這種情境僅可適用在少數環境下，如天空中，大海上等俱有非常空曠地形的環境進行移動。這樣的假設不符合實際應用的情形，一般在陸地上的移動都會受限於道路影響，較無法自由的移動。
因此在此論文中，我們提出適用於道路上的機會網路-以圖論為基礎之非對稱性機會網路(Graph based asymmetric opportunistic network)與其移動模型。在graph based opportunistic networks中，我們強調了道路重要性，所有移動的通訊裝置都是在可行進的道路上移動，也就是受到障礙物影響而限制的移動，在受道路限制移動的情況我們覺得能更符合實際應用，同時也適用更多變的地理環境。
除了道路性考量的Graph based opportunistic network，我們也同時考慮每個地點到達的可能性(機率)不同，此處稱為不對稱性(asymmetric)。Graph based asymmetric opportunistic network指的是某些較熱門的地區經過的人會較不熱門的地區多，或是較容易行進的路線會較不容易行進的路線人多，還有更多的條件可能造成一個區域每條到達或離開的路徑使用比率不同，我們也認為加上這個條件能使移動模型更加真實，更貼近現實生活環境。因此，我們提出非對稱性機會網路的概念(Asymmetric Opportunistic Network)。此移動模型比前人模型更可以較接近真實的移動方式。
除此之外，此論文同時探討在Graph Based Asymmetric Opportunistic Network下如何佈署固定數量的資訊交換站來提升整體網路的傳遞效能。透過本篇論文的研究我們希望能以借用圖論的技巧，以理論客觀的角度，來找出各個可增進資訊交換的地點來設置資訊交換站，並且希望此概念可以應用於更多貼近的現實環境。
另外，本篇論文模擬一個自行車機會網路的情境。此網路以自行車網路(BikeNet)為基礎，在一個自行車休閒遊憩場所，自行車配備有可通訊的設備，可進行互相通訊功能，形成自行車網路，並以佈建公共自行車系統(PBS)做為固定的資訊交換場所。

Opportunistic network is an unreliable network architecture, and each mobile device can only directly communicate within the mobile devices which are within the communication range. Previous results usually assume that mobile devices in opportunistic network can move in an area without obstacle, but this condition seems unrealistic because many space may exist obstacles such as sky area, ocean area etc. In this thesis, we proposed a graph-based asymmetric opportunistic network, which is more appropriate to real applications. Graph based asymmetric opportunistic network also emphasized that the popular place in a deployed area has higher road usage rate than other.
This thesis also discusses how to deploy a fixed number of information exchange stations to enhance the packet delivery ratio and delay time of a given graph based asymmetric opportunistic network. We define a mobility model by using the graph technique, and use this model to find out where to locate an information exchange station. Finally, we also demonstrate the contribution of the proposed ideas by conducting simulations in a bicycle asymmetric opportunistic network.

摘要 i
Abstract iii
圖目錄 v
第一章 簡介 1
第一節 無線感測網路簡介 2
第二節 機會網路簡介 4
第三節 機會網路移動模型 6
第四節 研究動機 7
第二章 機會網路相關應用與研究 9
第一節 機會網路應用 9
第二節 機會網路研究 10
第三章 自行車隨意網路 12
第一節 公共自行車系統(PBS) 12
第二節 自行車旅遊 13
第三節 自行車隨意網路 14
第四章 以圖為基礎之非對稱機會網路 15
第一節 移動模型定義 15
第二節 網路通訊模式 16
第三節 移動模型 16
第五章 以圖為基礎之非對稱機會網路之數學分析 20
第一節 相遇方式 20
第二節 期望通訊機率 21
第三節 加入資訊交換站的期望通訊機率 27
第六章 實驗結果 30
第一節 模擬環境 30
第二節 實驗結果 30
第七章 結論與未來方向 34
參考文獻 35

[1]. Chung-Ming Huang, Kun-chan Lan and Chang-Zhou Tsai, “A Survey of Opportunistic Networks”, IEEE International Conference on Advanced Information Networking and Applications, 2006.
[2]. 熊永平,孙利民,牛建伟,刘燕,“机会网络”, Journal of Software, Vol.20, No.1, January 2009, pp.124−137.
[3]. Nikodin Ristanovic, George Theodorakopoulos and Jean-Yves Le Boudec, “Traps and pitfalls of using contact traces in performance studies of opportunistic networks”, IEEE INFOCOM, 2012.
[4]. Luciana Pelusi, Andrea Passarella, and Marco Conti, IIT-CNR, “Opportunistic Networking Data Forwarding in Disconnected Mobile Ad hoc Networks”, IEEE Communications Magazine, Volume 44, Issue 11,pp.134-141 , November 2006.
[5]. Hummel, K.A. ; Dept. of Distrib. & Multimedia Syst., Univ. of Vienna, Vienna, Austria ; Hess, A., “Movement Activity Estimation for Opportunistic Networking Based on Urban Mobility Traces”, Wireless Days, 2010.
[6]. Hoang Anh Nguyen, Silvia Giordano, “Routing in Opportunistic Networks”, International Journal of Ambient Computing and Intelligence
[7]. Marios Logothetis, Vera Stavroulaki, Andreas Georgakopoulos, Dimitrios Karvounas, Nikos Koutsouris, Kostas Tsagkaris, Panagiotis Demestichas, Milenko Tosic, Dragan Boskovic, “Opportunistic Network Creation Schemes for Capacity Extension in Wireless Access and Backhaul Segments”, pp. 201-216, Mobile Networks and Management, 2012
[8]. Daehyun Ban ; Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA ; Devetsikiotis, M., “A Content Freshness Enhancement with Infrastructures in Mobile Opportunistic Networks”, Military Communications Conference, 2011
[9]. Parris, I. ; Sch. of Comput. Sci., Univ. of St. Andrews, St. Andrews, UK ; Henderson, T., “The impact of location privacy on opportunistic networks”, World of Wireless, Mobile and Multimedia Networks, 2011
[10]. Marcelo Pias, Kuang Xu, Pan Hui, Jon Crowcroft, Guang-Hua Yang, Victor O.K. Li and Salman Taherian, “Sentient bikes for collecting mobility traces in opportunistic”, Proceeding HotPlanet '09 Proceedings of the 1st ACM International Workshop on Hot Topics of Planet-Scale Mobility Measurements, 2009
[11]. Juan Carlos García-Palomares, Javier Gutiérrez, Marta Latorre, “Optimizing the location of stations in bike-sharing programs: A GIS approach”, pp. 235-246, Applied Geography, 2012
[12]. Brittany Bonnette, “The Implementation of a Public-Use Bicycle Program in Philadelphi”, University of Pennsylvania, 2007
[13]. P. Juang, H. Oki, Y. Wang, M. Maronosi, L. Peh, D. Rubenstein, Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet”, Proc. ASPLOS, Oct 2002
[14]. A. Pentland, R. Fletcher, A. Hasson, “DakNet: Rethinking Connectivity in Developing Nations”, IEEE Computer, Volumn 37, Issue 1, pp.78-83, 2004
[15]. Jean-Yves Le Boudec, Milan Vojnovic´, “The Random Trip Model Stability Stationary Regime, and Perfect Simulation”, IEEE/ACM Transactions on Networking, Volumn 14, Issue 6, pp.1153-1166, 2006
[16]. D. Karamshuk, Boldrini Chiara, M. Conti, A. Passarella, “Human Mobility Models for Opportunistic Networks”, IEEE Communications Magazine, Volumn 49, Issue 12, pp.157-165, 2011
[17]. C.M. Huang, K.c. Lan, C.Z. Tsai, “A Survey of Opportunistic Networks”, IEEE Advanced Information Networking and Applications, pp.1672-1677, 2008
[18]. Midgley P., “Bicycle-sharing schemes: enhancing sustainable mobility in urban areas”, United Nations, Department of Economic and Social Affairs, 2011
[19]. http://hscc.cs.nthu.edu.tw/project/
[20]. 陳逸寧, 俞征武, “行動感測網路上之動態覆蓋技術”, 2013
[21]. Fan Li, Yu Wang, “Routing in Vehicular Ad Hoc Networks: A Survey”, Volume 2, Issue 2, IEEE Vehicular Technology Magazine, 2007
[22]. Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, Erdal Cayirci, Georgia Institute of Technology, “A Survey on Sensor Networks”, Volume 40, Issue 8, pp. 102-114, IEEE Communications Magazine, 2002
[23]. David B. Johnson, David A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks”, Mobile Computing, pp. 153-181, 1996
[24]. http://monarch.cs.rice.edu/~santa/research/mobility/
[25]. Wen Ouyang, Chang Wu Yu, Kun-Ming Yu, Ko-Jui Lin, Jo-Heng Yu, Hsin-Wen Chang, Lin-Li Tai, Chung-Han Lin, “Station Decision Problem in Bicycle Ad Hoc Networks”, Ubiquitous Intelligence & Computing and 9th International Conference on Autonomic & Trusted Computing, 2012
[26]. S. B. Eisenman, E. Miluzzo, N. D. Lane, R. A. Peterson, G-S. Ahn, A. T. Campbell, “The BikeNet mobile sensing system for cyclist experience mapping”, Embedded networked sensor systems, 2007
[27]. http://www.haggleproject.org/