Intersection-based forwarding protocol for vehicular ad hoc networks
详细信息    查看全文
  • 作者:Xin Guan ; Yan Huang ; Zhipeng Cai ; Tomoaki Ohtsuki
  • 关键词:Intermittently connected ; Mobile ad hoc ; Epidemic theory ; Forwarding ; Vehicular network
  • 刊名:Telecommunication Systems
  • 出版年:2016
  • 出版时间:May 2016
  • 年:2016
  • 卷:62
  • 期:1
  • 页码:67-76
  • 全文大小:1,092 KB
  • 参考文献:1.Chen, M., Kwon, T., Mao, S., & Leung, V. C. M. (2009). Spatial-temporal relation-based energy-efficient reliable routing protocol in wireless sensor networks. International Journal of Sensor Networks, 5, 129–141.CrossRef
    2.Chen, M., Yang, L. T., Kwon, T., Zhou, L., & Jo, Minho. (2011). Itinerary planning for energy-efficient agent communications in wireless sensor networks. IEEE Transactions on Vehicular Technology, 60(7), 3290–3299.CrossRef
    3.Chen, M., Lai, C.-F., & Wang, H. (2011). Mobile multimedia sensor networks: Architecture and routing. EURASIP Journal on Wireless Communications and Networking, 2011(1), 1–9.
    4.Cai, Z., Duan, Y., & Bourgeois, A. (2014). Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks. Journal of Combinatorial Optimization. doi:10.​1007/​s10878-013-9623-y .
    5.Zheng, X., Li, J., Gao, H., & Cai, Z. (2014). Capacity of wireless networks with multiple types of multicast sessions. Mobihoc.
    6.Zhang, L., Wang, X., Lu, J., Ren, M., Duan, Z., & Cai, Z. (2014). A novel contact prediction based routing scheme for DTNs. Transactions on Emerging Telecommunications Technologies.
    7.Cheng, S., Cai, Z., & Li, J. (2014). Curve query processing in wireless sensor networks. IEEE Transactions on Vehicular Technology.
    8.Wang, X., Guo, L., Ai, C., Li, J., & Cai, Z. (2013). An urban area-oriented traffic information query strategy in VANETs. WASA, 7792, 313–324.
    9.Pantazis, N. A., Nikolidakis, S. A., & Vergados, D. D. (2013). Energy-efficient routing protocols in wireless sensor networks: A survey. IEEE Communications Survey and Tutorials, 15(2), 551–591.CrossRef
    10.Liu, C., & Wu, J. (2012). On multicopy opportunistic forwarding protocols in nondeterministic delay tolerant networks. IEEE Transactions on Parallel and Distributed Systems, 23(6), 1121–1128.CrossRef
    11.Wasef, A., & Shen, X. (2013). EMAP: Expedite message authentication protocol for vehicular ad hoc networks. IEEE Transaction on Mobile Computing, 12(1), 78–89.CrossRef
    12.Cespedes, S., Taha, S., & Shen, X. (2013). A multi-hop authenticated proxy mobile IP scheme for asymmetric VANET. IEEE Transaction on Vehicular Technology, 62(7), 3271–3286.CrossRef
    13.Ghafoor, K. Z., Bakar, K. A., van Eenennaam, E. M., Khokhar, R. H., & Gonzalez, A. J. (2011). A fuzzy logic approach to beaconing for vehicular ad hoc networks. Telecommunication Systems Journal.
    14.Zeadally, S., Hunt, R., Chen, Y.-S., Irwin, A., & Hassan, A. (2010). Vehicular ad hoc networks (VANETS): Status, results, and Challenges. Telecommunication Systems Journal, 1–25.
    15.Li, J. S., & Liu, K. H. (2013). A lightweight identity authentication protocol for vehicular networks. Telecommunication System Journal, 425–438.
    16.Li, G. S., Wang, W. L., Yao, X. W., & Chen, W. J. (2013). SOBP: A sender-designated opportunistic broadcast protocol for VANET. Telecommunication System Journal, 453–467.
    17.Zhang, Y., Chen, M., Mao, S., Hu, L., & Leung, V. (2014). CAP: Crowd activity prediction based on big data analysis. IEEE Network, 28(4), 52–57.CrossRef
    18.Zhao, Y., Zhang, Y., Yu, T., Liu, T., Wang, X., Tian, X., & Liu, X. (2014). CityDrive: A map-generating and speed-optimizing driving system. In Proceedings of the IEEE INFOCOM 2014, April, Toronto.
    19.Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks, Technical Report CS-200006. Tech. Rep.: Duke University.
    20.Zhang, D., Yang, Z., Raychoudhury, V., Chen, Z., & Lloret, J. (2013). An energy-effcient routing protocol using movement trend in vehicular ad-hoc networks. The Computer Journal, 56(8), 938–946.CrossRef
    21.Guan, X., Chen, M., & Ohtsuki, T. (2012). Epidemic theory based H+ 1 hop forwarding for intermittently connected mobile ad hoc networks. EURASIP Journal on Wireless Communications and Networking, 2012(1), 76.CrossRef
    22.Yuan, J., Zheng, Y., Xie, X., & Sun, G. (2011). Driving with knowledge from the physical world. In The 17th ACM SIGKDD international conference on Knowledge Discovery and Data mining, KDD’11. New York, NY: ACM.
    23.Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., & Huang, Y. (2010). T-drive: Driving directions based on taxi trajectories. In Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS ’10 (pp. 99–108). New York, NY: ACM.
    24.Zhang, D., Huang, H., Liao, X., Chen, M. Empirical study on taxi GPS traces for vehicular ad hoc networks. IEEE ICC2012, 581–585.
    25.Lu, N., Luan, T. H., Wang, M., Shen, S., & Bai, F. Bounds of asymptotic performance limits of social-proximity vehicular networks. IEEE/ACM Transactions on Networking 22(3), 812–825.
    26.Zhang, D., Zhang, D., Xiong, H., Yang, L. T., & Vasilakos, Thanos V. (2014). BASA: Building mobile ad-hoc social network on top of android. IEEE Network Magazine, 28(1), 4–9.CrossRef
    27.Lu, N., Luan, T. H., Wang, M., Shen, X. S., & Bai, F. (2012). Capacity and delay analysis for social-proximity urban vehicular networks. In Proceedings of IEEE INFOCOM, Orlando, pp. 1476–1484.
    28.Leguay, J., Lindgren, A., Scott, J., Friedman, T., Crowcroft, J., & Hui, P. (2006). CRAWDAD data set upmc/content (v. 2006–11-17). http://​crawdad.​cs.​dartmouth.​edu .
    29.Snyder, D. L., & Miller, M. I. (1991). Random Point Processes in Time and Space. Berlin: Springer.CrossRef
    30.Sarafijanovic-Djukic, M. P. N., & Grossglauser, M. (2006). Island hopping: Efficient mobility-assisted forwarding in partitioned networks. Proceedings of the 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications Networks (SECON 06), Vol. 1, pp. 226–235.
    31.Keränen, A., Ott, J., & Kärkkäinen, T. (2009). The ONE simulator for DTN protocol evaluation. ”In SIMUTools ’09: Proceedings of the 2nd international conference on simulation tools and techniques.
  • 作者单位:Xin Guan (1)
    Yan Huang (2)
    Zhipeng Cai (3)
    Tomoaki Ohtsuki (4)

    1. School of Information Science and Technology, Heilongjiang University, Harbin, 150080, Heilongjiang, China
    2. School of Electronic Engineering, Heilongjiang University, Harbin, 150080, Heilongjiang, China
    3. Department of Computer Science, Georgia State University, 25 Park Place, Suite 741, Atlanta, GA, 30302, USA
    4. Graduate School of Science and Technology, Keio University, Yokohama-shi, 223-8522, Japan
  • 刊物类别:Business and Economics
  • 刊物主题:Economics
    Business Information Systems
    Computer Communication Networks
    Artificial Intelligence and Robotics
    Probability Theory and Stochastic Processes
  • 出版者:Springer Netherlands
  • ISSN:1572-9451
文摘
Vehicular ad hoc networks (VANETs) make the transmission between vehicles possible without infrastructure. However, ad hoc networks also increase the redundancy of networks. To decrease the redundancy of networks and make VANETs more efficient, we introduce the new routing protocol: intersection-based forwarding protocol (IBFP). In urban-area, we set virtual ports (VP) at each intersection. The virtual port is served by stopping vehicle which is waiting for the traffic light in front of the intersection. VP will gather all the packets that need to be forwarded from all passing by vehicles. When VP leaves this intersection, it will transmit all the copies of packets to the next VP. As the movement of VP, packets can be transmitted to every intersection in a very short period of time like the epidemic process. Destination vehicles can receive packets with high success rate. The epidemic process only exists among VPs. Therefore, on the premise of high success rate, the proposed IBFP can transmit packets with less delay and redundancy.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700