SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Zheng Jie) srt2:(2015-2019);lar1:(cth)"

Sökning: WFRF:(Zheng Jie) > (2015-2019) > Chalmers tekniska högskola

  • Resultat 1-3 av 3
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • 2019
  • Tidskriftsartikel (refereegranskat)
  •  
2.
  • Zheng, Hui, et al. (författare)
  • Exact Line-of-Sight Probability for Channel Modeling in Typical Indoor Environments
  • 2018
  • Ingår i: IEEE Antennas and Wireless Propagation Letters. - 1548-5757 .- 1536-1225. ; 17:7, s. 1359-1362
  • Tidskriftsartikel (refereegranskat)abstract
    • The probability of line-of-sight (LOS) propagation is crucial for channel modeling and small-cell network evaluation. In this letter, by taking the layout of building structures into account, an analytical LOS probability model is proposed for typical indoor scenarios, which have rectangular rooms and corridors. The proposed model is validated through Monte Carlo simulations. Numerical results show that the proposed model estimates the network performance accurately and efficiently.
  •  
3.
  • Zheng, Hui, et al. (författare)
  • The Analysis of Indoor Wireless Communications by a Blockage Model in Ultra-Dense Networks
  • 2018
  • Ingår i: IEEE Vehicular Technology Conference. - 1550-2252. ; 2018-August
  • Konferensbidrag (refereegranskat)abstract
    • In indoor environments, the performance of ultra-dense cellular networks is significantly affected by blockages, especially for ultra-high frequencies. However, previous works either ignore or simplify such effects for analysing the networks. On the basis of stochastic geometry, this paper proposes a mathematically tractable approach to analyse ultra-dense networks in indoors, which considers both the effects of wall blockages and the distance-based path loss. The effects of wall blockages are firstly investigated by modelling the walls as a Boolean scheme of straight lines on a finite plane. Then a path loss model incorporating both the blockage-based and distance-based path loss is applied to analyse the performance of indoor networks. Finally, the analytical result is validated by comparing it with Monte Carlo simulations. The simulation results also show that the optimum transmitter density is finite for indoor ultra-dense networks with blockages, although the coverage probability benefits from the increase of transmitter density.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-3 av 3
Typ av publikation
tidskriftsartikel (2)
konferensbidrag (1)
Typ av innehåll
refereegranskat (3)
Författare/redaktör
Zhang, Jie (2)
Kelly, Daniel (1)
Bengtsson-Palme, Joh ... (1)
Nilsson, Henrik (1)
Kelly, Ryan (1)
Li, Ying (1)
visa fler...
Moore, Matthew D. (1)
Liu, Fang (1)
Zhang, Yao (1)
Jin, Yi (1)
Raza, Ali (1)
Rafiq, Muhammad (1)
Zhang, Kai (1)
Khatlani, T (1)
Kahan, Thomas (1)
Sörelius, Karl, 1981 ... (1)
Batra, Jyotsna (1)
Roobol, Monique J (1)
Backman, Lars (1)
Yan, Hong (1)
Lorkowski, Stefan (1)
Thrift, Amanda G. (1)
Zhang, Wei (1)
Hammerschmidt, Sven (1)
Patil, Chandrashekha ... (1)
Wang, Jun (1)
Pollesello, Piero (1)
Conesa, Ana (1)
El-Esawi, Mohamed A. (1)
Zhang, Weijia (1)
Li, Jian (1)
Marinello, Francesco (1)
Frilander, Mikko J. (1)
Wei, Pan (1)
Badie, Christophe (1)
Zhao, Jing (1)
Li, You (1)
Bansal, Abhisheka (1)
Rahman, Proton (1)
Parchi, Piero (1)
Polz, Martin (1)
Ijzerman, Adriaan P. (1)
Subhash, Santhilal, ... (1)
Quinn, Terence J. (1)
Uversky, Vladimir N. (1)
Gemmill, Alison (1)
Zhang, Yi (1)
Meule, Adrian (1)
Vohl, Marie-Claude (1)
Grimm, Dominik G. (1)
visa färre...
Lärosäte
Chalmers tekniska högskola  (3)Ta bort avgränsningen
Göteborgs universitet (1)
Uppsala universitet (1)
Högskolan i Halmstad (1)
Stockholms universitet (1)
Lunds universitet (1)
visa fler...
Karolinska Institutet (1)
visa färre...
Språk
Engelska (3)
Forskningsämne (UKÄ/SCB)
Naturvetenskap (3)
Teknik (2)
Medicin och hälsovetenskap (1)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy