Research on ad-hoc network connectivity has mainly focused on asymptotic results in the number of nodes in the network. For a one-dimensional ad-hoc network G1, assuming all the nodes are independently uniform distrib...Research on ad-hoc network connectivity has mainly focused on asymptotic results in the number of nodes in the network. For a one-dimensional ad-hoc network G1, assuming all the nodes are independently uniform distributed in a closed interval [0, Z]（z ∈ R^＋）, we derive a generic formula for the probability that the network is connected. The finite connected ad-hoc networks is analyzed. And we separately suggest necessary conditions to make the ad-hoc network to be connected in one and two dimensional cases, facing possible failed nodes （f-nodes）. Based on the necessary condition and unit-disk assumption for the node transmission, we prove that the nodes of the connected two-dimensional ad-hoc networks （G2） can be divided into at most five different groups. For an f-node no in either of the five groups, we derive a close formula for the probability that there is at least one route between a pair of nodes in G2 -- {no}.展开更多
Vehicles travelling as platoons can reduce the huge traffic jams on the highway. Platoon members can share vehicle information such as speed and acceleration via vehicular ad hoc networks （VANETs） communication to m...Vehicles travelling as platoons can reduce the huge traffic jams on the highway. Platoon members can share vehicle information such as speed and acceleration via vehicular ad hoc networks （VANETs） communication to maintain a constant inter-vehicle and inter-platoon distances. However, connectivity is a fundamental measurement to indicate the linking quality of VANETs. This paper analyzes the access and connectivity probability between the vehicles and the road side units （RSUs） of the multi-way platoon-based VANETs with roadside infrastructure. We denote the connectivity probability as the probability that the vehicles on the highway can access to at least one RSU besides the road within a designated number of hops. Moreover, besides considering the connection on the same road, we study the connection between the vehicles and the RSU via vehicles on the nearby neighbor roads. The analytical results have been validated by simulations and results show that the connectivity probability can be improved when there are platoons in a network. Meanwhile, the connectivity probability is higher in the multi-way vehicle-to-infrastructure （V2I） communication network than that in a one-way V2I communication network. The results in this paper can help to reduce the jams on the highway and achieve intelligent driving. Then the safety and comfort of the drivers and passengers on the highway can be improved. Moreover, these results can provide forceful theoretical support to the future intelligent transportation system （ITS） design.展开更多
The probability model is used to analyze the fault tolerance of mesh. To simplify its analysis, it is as-sumed that the failure probability of each node is independent. A 3-D mesh is partitioned into smaller submeshes...The probability model is used to analyze the fault tolerance of mesh. To simplify its analysis, it is as-sumed that the failure probability of each node is independent. A 3-D mesh is partitioned into smaller submeshes,and then the probability with which each submesh satisfies the defined condition is computed. If each submesh satis-fies the condition, then the whole mesh is connected. Consequently, the probability that a 3-D mesh is connected iscomputed assuming each node has a failure probability. Mathematical methods are used to derive a relationship be-tween network node failure probability and network connectivity probability. The calculated results show that the 3-D mesh networks can remain connected with very high probability in practice. It is formally proved that when thenetwork node failure probability is boutded by 0.45 %, the 3-D mesh networks of more than three hundred thousandnodes remain connected with probability larger than 99 %. The theoretical results show that the method is a power-ful technique to calculate the lower bound of the connectivity probability of mesh networks.展开更多
In Ad-hoc wireless network, connectivity is a fundamental issue which restricts the design of system protocol. Based on the theory of stochastic geometry, a connectivity model focused on signal-to-interference （SIR）...In Ad-hoc wireless network, connectivity is a fundamental issue which restricts the design of system protocol. Based on the theory of stochastic geometry, a connectivity model focused on signal-to-interference （SIR） ratio is set up in presence of Nakagami-m fading and interference. This paper derives a close formula of connectivity probability with interference and Nakagami-m fading which is never obtained in previous works. Two-dimension shot-noise theory in stochastic geometry for interference is well applied. The formula is verified by simulation. The results show that the connectivity is affected by the scatter of users, wireless propagation environment, interference and so on.展开更多
基金the National Natural Science Foundation of China (Grant No. 60572066)Key Scientific Research Project of Shanghai Municipal Education Commission (Grant No. 06ZZ84)CityU, Hong Kong, Applied R & D Funding (ARD) (Grant No. 9668009)
文摘Research on ad-hoc network connectivity has mainly focused on asymptotic results in the number of nodes in the network. For a one-dimensional ad-hoc network G1, assuming all the nodes are independently uniform distributed in a closed interval [0, Z]（z ∈ R^＋）, we derive a generic formula for the probability that the network is connected. The finite connected ad-hoc networks is analyzed. And we separately suggest necessary conditions to make the ad-hoc network to be connected in one and two dimensional cases, facing possible failed nodes （f-nodes）. Based on the necessary condition and unit-disk assumption for the node transmission, we prove that the nodes of the connected two-dimensional ad-hoc networks （G2） can be divided into at most five different groups. For an f-node no in either of the five groups, we derive a close formula for the probability that there is at least one route between a pair of nodes in G2 -- {no}.
基金supported by the Application and Basic Research Project of Sichuan Province(2012JY0096)Fundamental Research Funds for the Central Universities of Southwest University for Nationalities(2016NZYQN23)
文摘Vehicles travelling as platoons can reduce the huge traffic jams on the highway. Platoon members can share vehicle information such as speed and acceleration via vehicular ad hoc networks （VANETs） communication to maintain a constant inter-vehicle and inter-platoon distances. However, connectivity is a fundamental measurement to indicate the linking quality of VANETs. This paper analyzes the access and connectivity probability between the vehicles and the road side units （RSUs） of the multi-way platoon-based VANETs with roadside infrastructure. We denote the connectivity probability as the probability that the vehicles on the highway can access to at least one RSU besides the road within a designated number of hops. Moreover, besides considering the connection on the same road, we study the connection between the vehicles and the RSU via vehicles on the nearby neighbor roads. The analytical results have been validated by simulations and results show that the connectivity probability can be improved when there are platoons in a network. Meanwhile, the connectivity probability is higher in the multi-way vehicle-to-infrastructure （V2I） communication network than that in a one-way V2I communication network. The results in this paper can help to reduce the jams on the highway and achieve intelligent driving. Then the safety and comfort of the drivers and passengers on the highway can be improved. Moreover, these results can provide forceful theoretical support to the future intelligent transportation system （ITS） design.
基金Project (69928201) supported by the National Science Fund for Distinguished Young Scholars+1 种基金project (90104028) by the National Natural Science Foundation of China Project by Changjiang Scholar Re-ward Project
文摘The probability model is used to analyze the fault tolerance of mesh. To simplify its analysis, it is as-sumed that the failure probability of each node is independent. A 3-D mesh is partitioned into smaller submeshes,and then the probability with which each submesh satisfies the defined condition is computed. If each submesh satis-fies the condition, then the whole mesh is connected. Consequently, the probability that a 3-D mesh is connected iscomputed assuming each node has a failure probability. Mathematical methods are used to derive a relationship be-tween network node failure probability and network connectivity probability. The calculated results show that the 3-D mesh networks can remain connected with very high probability in practice. It is formally proved that when thenetwork node failure probability is boutded by 0.45 %, the 3-D mesh networks of more than three hundred thousandnodes remain connected with probability larger than 99 %. The theoretical results show that the method is a power-ful technique to calculate the lower bound of the connectivity probability of mesh networks.
基金supported by the National Natural Science Foundation of China(61171094)National Science & Technology Key Project(2011ZX03001-006-02,2011ZX03005-004-03)+1 种基金the Key Project of Jiangsu Provincial Natural Science Foundation (BK2011027)the Graduate Student Innovation Plan of Jiangsu Province(CXZZ11_0387)
文摘In Ad-hoc wireless network, connectivity is a fundamental issue which restricts the design of system protocol. Based on the theory of stochastic geometry, a connectivity model focused on signal-to-interference （SIR） ratio is set up in presence of Nakagami-m fading and interference. This paper derives a close formula of connectivity probability with interference and Nakagami-m fading which is never obtained in previous works. Two-dimension shot-noise theory in stochastic geometry for interference is well applied. The formula is verified by simulation. The results show that the connectivity is affected by the scatter of users, wireless propagation environment, interference and so on.
