Stochastic geometry and random graphs for the analysis and design of wireless networks

2009 ◽  
Vol 27 (7) ◽  
pp. 1029-1046 ◽  
Author(s):  
M. Haenggi ◽  
J.G. Andrews ◽  
F. Baccelli ◽  
O. Dousse ◽  
M. Franceschetti
Keyword(s):  
Wireless Networks ◽  
Random Graphs ◽  
Stochastic Geometry ◽  
Analysis And Design

Guest editorial: geometry and random graphs for the analysis and design of wireless networks

2009 ◽  
Vol 27 (7) ◽  
pp. 1025-1028 ◽  
Author(s):  
Martin Haenggi ◽  
Jeffrey Andrews ◽  
Francois Baccelli ◽  
Olivier Dousse ◽  
Massimo Franceschetti ◽  
...  
Keyword(s):  
Wireless Networks ◽  
Random Graphs ◽  
Guest Editorial ◽  
Analysis And Design

Analysis and design of scheduling schemes for wireless networks with unsaturated traffic

2021 ◽  
Vol 18 (2) ◽  
pp. 65-85
Author(s):  
Jianfei Li ◽  
Juan Wen ◽  
Min Sheng
Keyword(s):  
Wireless Networks ◽  
Analysis And Design

Moving Aerial Base Station Networks: A Stochastic Geometry Analysis and Design Perspective

2019 ◽  
Vol 18 (6) ◽  
pp. 2977-2988 ◽  
Author(s):  
Saeede Enayati ◽  
Hamid Saeedi ◽  
Hossein Pishro-Nik ◽  
Halim Yanikomeroglu
Keyword(s):  
Stochastic Geometry ◽  
Base Station ◽  
Analysis And Design ◽  
Design Perspective ◽  
Geometry Analysis

scholarly journals Performance analysis of cache-enabled wireless networks considering stochastic geometry approach

2019 ◽  
Vol 13 (8) ◽  
pp. 1043-1050
Author(s):  
Leila Enamipour ◽  
Zolfa Zeinalpour-Yazdi ◽  
Babak Hossein Khalaj
Keyword(s):  
Wireless Networks ◽  
Performance Analysis ◽  
Stochastic Geometry

Connectivity model of wireless networks via dependency links random graphs

2011 ◽  
Vol 58 (1) ◽  
pp. 122-141 ◽  
Author(s):  
Ke Zuo ◽  
Huaimin Wang ◽  
Quanyuan Wu ◽  
Dongmin Hu
Keyword(s):  
Wireless Networks ◽  
Random Graphs ◽  
Connectivity Model

scholarly journals The Random Connection Model on the Torus

2014 ◽  
Vol 23 (5) ◽  
pp. 796-804
Author(s):  
LUC DEVROYE ◽  
NICOLAS FRAIMAN
Keyword(s):  
Wireless Networks ◽  
Random Graphs ◽  
High Probability ◽  
Random Connection Model

We study the diameter of a family of random graphs on the torus that can be used to model wireless networks. In the random connection model two pointsxandyare connected with probabilityg(y−x), wheregis a given function. We prove that the diameter of the graph is bounded by a constant, which depends only on ‖g‖1, with high probability as the number of vertices in the graph tends to infinity.

Sign in / Sign up

Export Citation Format

Share Document