This study focused on differences in vehicle-to-vehicle radio channel character- istics in the same region but different traffic density and speeds at 5.9 GHz （congestion and non-congestion）. The continuous measurem...This study focused on differences in vehicle-to-vehicle radio channel character- istics in the same region but different traffic density and speeds at 5.9 GHz （congestion and non-congestion）. The continuous measurement campaign was conducted on a city expressway through the complex dense urban area in Wu- hart, China. Small-scale channel characteris- tics including power delay profile, amplitude fading distribution, K-factor, delay spread and Doppler shift were obtained, respectively. Spe- cifically, the cumulative distribution function of root mean square delay spreads and root mean square Doppler spreads in the non-con- gested scenario and congested scenario were all fitted well with Lognormal distribution. We also found out that different intensity of traffic and speed of vehicles have little effect on root mean square delay spreads, but have a big im- pact on root mean square Doppler spreads and level crossing rate. According to estimation outcomes, the V2V channel characteristics for urban areas in Chinese big city were differ- ent from the previous measured results under similar scenarios in Europe. Delay spread and level crossing rate in this study can provide significant references to design the wireless communication system for vehicle-to-vehicle channel.展开更多
An r-uniform graph C is dense if and only if every proper subgraph G' of G satisfies λ(G') < λ(G).,where λ(G) is the Lagrangian of a hypergraph G. In 1980's, Sidorenko showed that π(F), the Turá...An r-uniform graph C is dense if and only if every proper subgraph G' of G satisfies λ(G') < λ(G).,where λ(G) is the Lagrangian of a hypergraph G. In 1980's, Sidorenko showed that π(F), the Turán density of an γ-uniform hypergraph F is r! multiplying the supremum of the Lagrangians of all dense F-hom-free γ-uniform hypergraphs. This connection has been applied in the estimating Turán density of hypergraphs. When γ=2 the result of Motzkin and Straus shows that a graph is dense if and only if it is a complete graph. However,when r ≥ 3, it becomes much harder to estimate the Lagrangians of γ-uniform hypergraphs and to characterize the structure of all dense γ-uniform graphs. The main goal of this note is to give some sufficient conditions for3-uniform graphs with given substructures to be dense. For example, if G is a 3-graph with vertex set [t] and m edges containing [t-1]^(3),then G is dense if and only if m≥{t-2 3)+(t-2 2)+1. We also give a sufficient condition on the number of edges for a 3-uniform hypergraph containing a large clique minus 1 or 2 edges to be dense.展开更多
基金supported by Norwegian Research Council(No.256309)supported by an International Cooperation Project:5G-Channel Measurement and Channel Modeling for Ocean Scenario(No.20172h0046)+3 种基金Hubei college excellent young science and technology innovation team project:Fast Varying Channel Modeling and Analysis(No.T201736)Young Scientists Found of National Natural Science Foundation of China(No.61701356)Fundamental Research Funds for the Central Universities(No.2017-JL-004)(China Scholarship Council) CSC agency for funding and the Super Radio AS
文摘This study focused on differences in vehicle-to-vehicle radio channel character- istics in the same region but different traffic density and speeds at 5.9 GHz （congestion and non-congestion）. The continuous measurement campaign was conducted on a city expressway through the complex dense urban area in Wu- hart, China. Small-scale channel characteris- tics including power delay profile, amplitude fading distribution, K-factor, delay spread and Doppler shift were obtained, respectively. Spe- cifically, the cumulative distribution function of root mean square delay spreads and root mean square Doppler spreads in the non-con- gested scenario and congested scenario were all fitted well with Lognormal distribution. We also found out that different intensity of traffic and speed of vehicles have little effect on root mean square delay spreads, but have a big im- pact on root mean square Doppler spreads and level crossing rate. According to estimation outcomes, the V2V channel characteristics for urban areas in Chinese big city were differ- ent from the previous measured results under similar scenarios in Europe. Delay spread and level crossing rate in this study can provide significant references to design the wireless communication system for vehicle-to-vehicle channel.
基金supported by National Natural Science Foundation of China (Grant No. 11271116)
文摘An r-uniform graph C is dense if and only if every proper subgraph G' of G satisfies λ(G') < λ(G).,where λ(G) is the Lagrangian of a hypergraph G. In 1980's, Sidorenko showed that π(F), the Turán density of an γ-uniform hypergraph F is r! multiplying the supremum of the Lagrangians of all dense F-hom-free γ-uniform hypergraphs. This connection has been applied in the estimating Turán density of hypergraphs. When γ=2 the result of Motzkin and Straus shows that a graph is dense if and only if it is a complete graph. However,when r ≥ 3, it becomes much harder to estimate the Lagrangians of γ-uniform hypergraphs and to characterize the structure of all dense γ-uniform graphs. The main goal of this note is to give some sufficient conditions for3-uniform graphs with given substructures to be dense. For example, if G is a 3-graph with vertex set [t] and m edges containing [t-1]^(3),then G is dense if and only if m≥{t-2 3)+(t-2 2)+1. We also give a sufficient condition on the number of edges for a 3-uniform hypergraph containing a large clique minus 1 or 2 edges to be dense.
