On the Connectivity of One-dimensional Vehicular Ad Hoc Networks

作     者：Liao Jianxin Li Yuanzhen Li Tonghong Zhu Xiaomin Zhang Lei 

作者机构：State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China EBUPT Information Technology Co. Ltd Beijing 100083 China Technical University of Madrid Madrid Spain 28660 

出 版 物：《China Communications》 (中国通信（英文版）)

年 卷 期：2010年第7卷第2期

页      面：65-70页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 082304[工学-载运工具运用工程] 08[工学] 081201[工学-计算机系统结构] 0823[工学-交通运输工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by National Science Fund for Distinguished Young Scholars (No.60525110) National 973 Program (No. 2007CB307100, 2007CB307103) National Natural Science Foundation of China (No. 60902051) Chinese Universities Scientific Fund (BUP-T2009RC0505) Development Fund Project for Electronic and Information Industry (Mobile Service and Application System Based on 3G) 

主　　题：Intelligent Transportation Systems (ITS) connectivity Vehicular Ad Hoc Networks onedimensional Ad Hoc Networks 

摘      要：In this paper we analyze connectivity of one-dimensional Vehicular Ad Hoc Networks where vehicle gap distribution can be approximat- ed by an exponential distribution. The probabilities of Vehicular Ad Hoc Network connectivity for difference cases are derived. Furthermore we proof that the nodes in a sub-interval [z1, z1 ＋ △z] of interval [0,z],z 〉 0 where all the nodes are independently uniform distributed is a Poisson process and the relationship of Vehicle Ad hoc Networks and one-dimensional Ad Hoc networks where nodes independently uniform distributed in [zl, z1 ＋ △z] is explained. The analysis is validated by computing the probability of network connectivity and comparing it with the Mont Carlo simu- lation results.