研究生: |
邱冠龍 Chiou, Guann Long |
---|---|
論文名稱: |
車載網路中以行車路徑為基礎之群播訊息傳送 On Trajectory-Based I2V Group Message Delivery over Vehicular Ad Hoc Networks |
指導教授: |
楊舜仁
Yang, Shun Ren |
口試委員: |
陳健
Chen, Chien 逄愛君 Pang, Ai Chun 蔡欣穆 Tsai, Hsin Mu 高榮駿 Kao, Jung Chun |
學位類別: |
博士 Doctor |
系所名稱: |
電機資訊學院 - 資訊工程學系 Computer Science |
論文出版年: | 2016 |
畢業學年度: | 104 |
語文別: | 英文 |
論文頁數: | 87 |
中文關鍵詞: | 群播訊息傳遞 、基礎設施至車輛通訊 、行車路徑 、車間通訊網路 、繞路事件 |
外文關鍵詞: | Group Message Delivery, Infrastructure-to-Vehicle Communcations, trajectory, vehicular ad hoc networks, detour events |
相關次數: | 點閱:3 下載:0 |
分享至: |
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
在過往研究中,為提升基礎設施運用車間通訊網路(Vehicular Ad hoc Networks; VANETs)傳送到訊息到車輛的效率,有提出利用目標車輛行車路徑預測車輛可能的訊息會合點,以增進傳送成功率的方法。然而,這些方法並沒有去考慮行車環境對車輛的影響,以及會合點彼此之間的地緣關係。更甚者,當車輛發生繞路事件時,這些研究也無法針對此類事件做出相對應的處理。因此,我們在這篇論文提出兩個方法-eTGMD和tc-eTGMD,來解決上述問題。eTGMD 設計主要是在忽略繞路事件所造成的影響下,希望以最少的封包去完成群組車輛的訊息傳遞。其主要設計原理是去探索群組內車輛的未來行車路徑,找出幾個適切的訊息會合點,再利用群播樹(multicast tree)將訊息傳至這些會合點,待群組車輛經過時接收。具體而言,eTGMD運用迭代法,在每回合使用貪婪演算法去找出能以最少封包量服務最多車輛的點,再把選出的會合點加入群播樹。為驗證其效能,我們針對eTGMD利用數學模型分析執行效能及執行時間,亦提出電腦模擬模型來研究所設計之協定的效能。第二個方法tc-eTGMD則是致力於當繞路事件對傳輸效能造成影響時,提供一個有效率的解法,以維持傳送成功率。其主要設計原理是試圖去降低處理繞路事件時兩個必要的程序─繞路通知、以及路徑再規劃─所消耗的網路資源。具體而言,我們將運作環境切成若干個小型的區塊,並在各區塊中找出伺服的代理人協助處理繞路事件,以減低每次的處理時間以及伺服器的運算資源。為了因應分區的路徑建立議題,我們亦提出相對應的階層式建樹協定。為驗證tc-eTGMD的效能,我們提出電腦模擬模型來研究繞路事件帶來的效能影響以及所設計之協定的效能。
In the literature, future vehicle trajectories have been exploited to improve the performance of challenging infrastructure-to-vehicle (I2V) group message delivery over vehicular ad hoc networks. However, most of these researches separately handles the rendezvous point selection and the multicast tree construction, results in significantly restricting the overall message delivery performance. Moreover, they do not consider that the destination vehicles make take unexpected detours. To resolve these issues, this dissertation designs a series of trajectory-based I2V group message delivery protocol, eTGMD and tc-eTGMD, for delay-tolerant vehicular applications. The first work, eTGMD, applies for low/non-detour-event environment. The goal of eTGMD is to minimize the overall transmission cost under the premise that the delay constraint is guaranteed. It is achieved by iteratively selecting a promising rendezvous point and extending the current multicast tree to cover the selected rendezvous point. The second work, tc-eTGMD, designs for high-detour event environment. The objective of tc-eTGMD is to design a I2V group message delivery protocol which can handle the detour events with the lowest required overhead. Specifically, when member vehicles take detours, rather than rebuilding the whole tree, tc-eTGMD tries to only redeploy the routes to the detour vehicles. Theoretical analysis and simulation results show the effectiveness of the proposed trajectory-based I2V group message protocols in computational complexity, packet delivery ratio, and the transmission overhead.
[1] K. Dar, M. Bakhouya, J. Gaber, M. Wack, and P. Lorenz,“Wireless Communication Technologies for ITS Applications [Topics in Automotive Networking],”IEEE Communications Magazine, vol. 48, no. 5, pp. 156–162, May 2010.
[2] G. Karagiannis, O. Altintas, E. Ekici, G. Heijenk, B. Jarupan, K. Lin, and T. Weil, “Vehicular Networking: A Survey and Tutorial on Requirements, Architectures, Challenges, Standards and Solutions,” IEEE Communications Surveys Tutorials, vol. 13, no. 4, pp. 584–616, Fourth 2011.
[3] M. Alsabaan, W. Alasmary, A. Albasir, and K. Naik, “Vehicular Networks for a Greener Environment: A Survey,” IEEE Communications Surveys Tutorials, vol. 15, no. 3, pp. 1372–1388, Third 2013.
[4] Cisco, “Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update, 2013-2018,” February 2014.
[5] L. Li and L. Sun, “Seer: Trend-Prediction-Based Geographic Message Forwarding in Sparse Vehicular Networks,” in IEEE International Conference on Communications (ICC), May 2010.
[6] A. Festag, P. Papadimitratos, and T. Tielert, “Design and Performance of Secure Geocast for Vehicular Communication,” IEEE Transaction on Vehicular Technology, vol. 59, no. 5, pp. 2456–2471, 2010.
[7] U. Lee, J. Lee, J. Park, and M. Gerla, “FleaNet: A Virtual Market Place on Vehicular Networks,” IEEE Transactions on Vehicular Technology, vol. 59, no. 1, pp. 344–355, 2010.
[8] M. Jerbi, A Beylot, S Senouci, and Y. Ghamri-Doudane, “Geo-Localized Virtual Infrastructure for VANETs: Design and Analysis,” in IEEE Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008, Nov 2008, pp. 1–6.
[9] I. Leontiadis, P. Costa, and C. Mascolo, “Persistent Content-Based Information Dissemination in Hybrid Vehicular Networks,” in IEEE International Conference on Pervasive Computing and Communications, 2009. PerCom 2009, March 2009, pp. 1–10.
[10] M. Fiore, C. Casetti, C. Chiasserini, and D. Borsetti, “Persistent Localized Broadcasting in VANETs,” IEEE Journal on Selected Areas in Communications, vol. 31, no. 9, pp. 480–490, September 2013.
[11] H. Woo and M. Lee, “Vehicle Location Service Scheme Using the Vehicle Trajectory for VANETs,” in 14th International Conference on Advanced Communication Technology (ICACT ’12), February 2012, pp. 1256–1261.
[12] X. Feng, J. Zhang, and Q. Zhang, “Trajectory-Assisted Delay-Bounded RoutingWith Moving Receivers in Vehicular Ad-Hoc Networks,” in IEEE 19th International Workshop on Quality of Service (IWQoS '11), June 2011, pp. 1–3.
[13] F. Xu, S. Guo, J. Jeong, Y. Gu, Q. Cao, M. Liu, and T. He, “Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks,” in Proceedings of the 30th IEEE International Conference on Computer Communications (INFOCOM '11), April 2011, pp. 441–445.
[14] J. Jeong, S. Guo, Y. Gu, T. He, and D. Du, “TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks,” in 29th IEEE International Conference on Distributed Computing Systems (ICDCS '09), June 2009, pp. 231–238.
[15] J. Jeong, S. Guo, Y. Gu, T. He, and D. Du, “Trajectory-Based Statistical Forwarding for Multihop Infrastructure-to-Vehicle Data Delivery,” IEEE Transactions on Mobile Computing, vol. 11, no. 10, pp. 1523–1537, Oct 2012.
[16] J. Jeong, T. He, and D. Du, “TMA: Trajectory-Based Multi-Anycast Forwarding for Efficient Multicast Data Delivery in Vehicular Networks,” Computer Networks, vol. 57, no. 13, pp. 2549–2563, 2013. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S1389128613001424
[17] W. Hsieh, S. Yang, and G. Chiou, “TGMD: A Trajectory-Based Group Message Delivery Protocol for Vehicular Ad Hoc Networks,” in IEEE International Conference on Communications (ICC), June 2012.
[18] I. Leontiadis, P. Costa, and C. Mascolo, “Extending Access Point Connectivity through Opportunistic Routing in Vehicular Networks,” in Proceedings of the 29th IEEE International Conference on Computer Communications (INFOCOM '10), 2010, pp. 1–5.
[19] N. Benamar, K. Singh, M. Benamar, D. Ouadghiri, and J. Bonnin, “Routing Protocols in Vehicular Delay Tolerant Networks: A Comprehensive Survey,” Computer Communications, vol. 48, no. 0, pp. 141 – 158, 2014. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0140366414001212
[20] J. Isento, J. Rodrigues, J. Dias, M. Paula, and A. Vinel, “Vehicular Delay-Tolerant Networks?A Novel Solution for Vehicular Communications,” IEEE Intelligent Transportation Systems Magazine, vol. 5, no. 4, pp. 10–19, winter 2013.
[21] H. Labiod, N. Ababneh, and M. Garcia de la Fuente, “An Efficient Scalable Trajectory Based Forwarding Scheme for VANETs,” in 2010 24th IEEE International Conference on Advanced Information Networking and Applications (AINA), April 2010, pp. 600–606.
[22] F. De Rango, F. Veltri, and S. Marano, “Hierarchical trajectory-based routing protocol for Vehicular Ad Hoc Networks,” in 2008 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS 2008), June 2008, pp. 189–196.
[23] Y. Feng, F. Wang, J. Liao, and Q. Qian, “Driving Path Predication Based Routing Protocol in Vehicular Ad hoc Networks,” International Journal of Distributed Sensor Networks, vol. 2013, p. 10, 2013.
[24] H. Dau and H. Labiod, “Opportunistic trajectory-based routing for V2V communications,” in 2011 IEEE 22nd International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC), Sept 2011, pp. 783–787.
[25] F. Rango, F. Veltri, P. Fazio, and S. Marano, “Two-level Trajectory-Based Routing Protocol for Vehicular Ad Hoc Networks in Freeway and Manhattan Environments,” Journal of Networks, vol. 4, no. 9, 2009. [Online]. Available: http://ojs.academypublisher.com/index.php/jnw/article/view/0409866880
[26] P. Fazio, F. de Rango, and A. Lupia, “Vehicular Networks and Road Safety: an Application for Emergency/Danger Situations Management Using the WAVE/802.11p Standard,” Advances in Electrical and Electronic Engineering, vol. 11, no. 5, 2013. [Online]. Available: http://advances.uniza.sk/index.php/AEEE/article/view/890
[27] Y. Wu, Y. Zhu, and B. Li, “Infrastructure-assisted routing in vehicular networks,” in 2012 Proceedings IEEE INFOCOM, March 2012, pp. 1485–1493.
[28] M. Rondinone and J. Gozalvez, “Distributed And Real Time Communications Road Connectivity Discovery through Vehicular Ad-hoc Networks,” in 2010 13th International IEEE Conference on Intelligent Transportation Systems (ITSC), Sept 2010, pp. 1079–1084.
[29] L. Li, Y. Liu, Z. Li, and L. Sun, “R2R: Data forwarding in large-scale bus-based delay tolerant sensor networks,” in IET International Conference on Wireless Sensor Network, 2010. (IET-WSN), Nov 2010, pp. 27–31.
[30] S. Hosseininezhad and V. Leung, “Data Dissemination for Delay Tolerant Vehicular Networks: Using Historical Mobility Patterns,” in Proceedings of the Third ACM International Symposium on Design and Analysis of Intelligent Vehicular Networks and Applications, ser. DIVANet ’13. New York, NY, USA: ACM, 2013, pp. 115–122. [Online]. Available: http://doi.acm.org/10.1145/2512921.2512923
[31] R. Tian, B. Zhang, C. Li, and J. Ma, “Sparsely-deployed relay node assisted routing algorithm for vehicular ad hoc networks,” Wireless Communications and Mobile Computing, vol. 15, no. 9, pp. 1309–1319, 2015. [Online]. Available: http://dx.doi.org/10.1002/wcm.2405
[32] C. Liu, J. Yang, and S. Wu, “Dynamic Routing-Tree Based Data Forwarding Scheme for Urban Vehicular Ad Hoc Networks,” in 2012 IEEE 12th International Conference on Computer and Information Technology (CIT), Oct 2012, pp. 672–677. [33] X. Jiang and D. Du, “A BUS vehicular network integrated with traffic infrastructure,” in 2013 International Conference on Connected Vehicles and Expo (ICCVE), Dec 2013, pp. 562–567.
[34] Y. Ding, W. Wang, Y. Cui, X.Gong, and B. Wang, “Moving Target Oriented Opportunistic Routing Algorithm in Vehicular Networks,” International Journal of Distributed Sensor Networks, vol. 2013, p. 10, 2013.
[35] C. Wu, S. Wang, D. Ben, X. Wang, and M. Guizani, “Dynamic cluster based price control and gateway management for VANETs,” in 2012 IEEE International Conference on Communications (ICC), June 2012, pp. 3959–3963.
[36] Y. Zhu, Y. Qiu, Y. Wu, M. Gao, B. Li, and Y. Hu, “On adaptive routing in urban vehicular networks,” Wireless Networks, vol. 19, no. 8, pp. 1995–2004, 2013. [Online]. Available: http://dx.doi.org/10.1007/s11276-013-0581-1
[37] R. Tian, B. Zhang, J. Zheng, and J. Ma, “A new distributed routing protocol using partial traffic information for vehicular ad hoc networks,” Wireless Networks, vol. 20, no. 6, pp. 1627–1637, 2014. [Online]. Available: http://dx.doi.org/10.1007/s11276-014-0699-9
[38] B. Aslam, F. Amjad, and C. Zou, “PMTR: Privacy-Enhancing Multilayer Trajectory-Based Routing Protocol for Vehicular Ad Hoc Networks,” in 2013 IEEE Military Communications Conference (MILCOM 2013), Nov 2013, pp. 882–887.
[39] A. Ho, Y. Ho, K. Hua,and R. Villafane, “A near-optimal broadcast technique for vehicular networks,” in 2009 Wireless Telecommunications Symposium (WTS 2009), April 2009, pp. 1–8.
[40] L. Li, S. Zhang, Z.Yang, and Y. Zhu, “Data Dissemination in Mobile Wireless Sensor Network Using Trajectory-Based Network Coding,” International Journal of Dis- tributed Sensor Networks, vol. 2013, p. 10, 2013.
[41] R. Jiang, Y. Zhu, X.Wang, and L. Ni, “TMC: Exploiting Trajectories for Multicast in Sparse Vehicular Networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 26, no. 1, pp. 262–271, Jan 2015.
[42] O. Choi, S. Kim, J. Jeong, H. Lee, and S. Chong, “Delay-optimal data forwarding in Vehicular Sensor Networks,” in 2013 11th International Symposium on Modeling Optimization in Mobile, Ad Hoc Wireless Networks (WiOpt), May 2013, pp. 532–539.
[43] N. Brahmi, L. Boukhatem, N. Boukhatem, M. Boussedjra, N. Nuy, H. Labiod, and J. Mouzna, “End-to-end routing through a hybrid ad hoc architecture for V2V and V2I communications,” in 2010 The 9th IFIP Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net), June 2010, pp. 1–8.
[44] L. Chen, S. Fu, J. Zhang, X. Zou, Y. Liu and F. Yin, “Trajectory-Based Optimal Area Forwarding for Infrastructure-to-Vehicle Data Delivery with Partial Deployment of Stationary Nodes,” International Journal of Distributed Sensor Networks, vol. 2013, p. 10, 2013.
[45] M. Abu-Elkheir, H. Hassanein, I. Elhenawy, and S. Elmougy, “Map-guided trajectory-based position verification for vehicular networks,” in 2012 IEEE Wireless Communications and Networking Conference (WCNC), April 2012, pp. 2538–2542.
[46] B. Jarupan and E. Ekici, “Location- and delay-aware cross-layer communication in V2I multihop vehicular networks,” IEEE Communications Magazine, vol. 47, no. 11, pp. 112–118, November 2009.
[47] Y. Zhu, Y. Bao, and B. Li, “On Maximizing Delay-Constrained Coverage of Urban Vehicular Networks,” IEEE Journal on Selected Areas in Communications, vol. 30, no. 4, pp. 804–817, May 2012.
[48] X. Hou, P. Deshpande, and S. Das, “Moving bits from 3G to metro-scale WiFi for vehicular network access: An integrated transport layer solution,” in 2011 19th IEEE International Conference on Network Protocols (ICNP), Oct 2011, pp. 353–362.
[49] M. Parsa, Q. Zhu, and J. Garcia-Luna-Aceves, “An Iterative Algorithm for Delay-Constrained Minimum-Cost Multicasting,” IEEE/ACM Transactions on Networking, vol. 6, no. 4, pp. 461–474, Aug. 1998. [Online]. Available: http://dx.doi.org/10.1109/90.720901
[50] A. Wasef and X. Shen, “REP: Location Privacy for VANETs Using Random Encryption Periods,” Mobile Networks and Applications, vol. 15, no. 1, pp. 172–185, 2010. [Online]. Available: http://dx.doi.org/10.1007/s11036-009-0175-4
[51] W. Min and L. Wynter, “Real-Time Road Traffic Prediction with Spatio-Temporal Correlations,” Transportation Research Part C: Emerging Technologies, vol. 19, no. 4, pp. 606 – 616, 2011. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0968090X10001592
[52] A. Skordylis and N. Trigoni, “Delay-Bounded Routing in Vehicular Ad-Hoc Networks,” in Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc '08). New York, NY, USA: ACM, 2008, pp. 341–350.
[53] M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, “Approximation Algorithms for Directed Steiner Problems,” in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '98). Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 1998, pp. 192–200. [Online]. Available: http://dl.acm.org/citation.cfm?id=314613.314700
[54] V. Chvatal, “A Greedy Heuristic for the Set-Covering Problem,” Mathematics of Operations Research, vol. 4, no. 3, pp. 233–235, 1979.
[55] H. Kuhn and A. Tucker, “Nonlinear Programming,” in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, 1950. Berkeley and Los Angeles: University of California Press, 1951, pp. 481–492.
[56] J. H‥arri, F. Filali, C. Bonnet, and M. Fiore, “VanetMobiSim: Generating Realistic Mobility Patterns for VANETs,” in Proceedings of the 3rd International Workshop on Vehicular Ad Hoc Networks, ser. VANET ’06. New York, NY, USA: ACM, 2006, pp. 96–97. [Online]. Available: http://doi.acm.org/10.1145/1161064.1161084
[57] National Statistics, Directorate General of Budget, Accounting and Statistics (DGBAS) of Executive Yuan, R.O.C. (Taiwan).
[58] R. L. Graham, “An efficient algorith for determining the convex hull of a finite planar set,” Information processing letters, vol. 1, no. 4, pp. 132–133, 1972.