IEICE TRANSACTIONS on Communications
Connectivity of Ad Hoc Networks with Random Mobility Models
Summary :
We analyze the connectivity of simulation ad hoc networks, which use random mobility models. Based on the theorem of minimum degree, the study of connectivity probability is converted into an analysis of the probability of minimum node degree. Detailed numerical analyses are performed for three mobility models: random waypoint model, random direction model, and random walk model. For each model, the connectivity probability is calculated and its relations with the communication range r and the node number n are illustrated. Results of the analyses show that with the same network settings, the connectivity performance decreases in the following order: random walk model, random direction model, and random waypoint model. This is because of the non-uniform node distribution in the last two models. Our work can be used by researchers to choose, modify, or apply a reasonable mobility model for network simulations.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E97-B No.5 pp.952-959
- Publication Date
- 2014/05/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E97.B.952
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Yan-tao LIU
Bohai University
Ying TIAN
Bohai University
Jian-ping AN
Beijing Institute of Technology
Heng LIU
Beijing Institute of Technology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yan-tao LIU, Ying TIAN, Jian-ping AN, Heng LIU, "Connectivity of Ad Hoc Networks with Random Mobility Models" in IEICE TRANSACTIONS on Communications,
vol. E97-B, no. 5, pp. 952-959, May 2014, doi: 10.1587/transcom.E97.B.952.
Abstract: We analyze the connectivity of simulation ad hoc networks, which use random mobility models. Based on the theorem of minimum degree, the study of connectivity probability is converted into an analysis of the probability of minimum node degree. Detailed numerical analyses are performed for three mobility models: random waypoint model, random direction model, and random walk model. For each model, the connectivity probability is calculated and its relations with the communication range r and the node number n are illustrated. Results of the analyses show that with the same network settings, the connectivity performance decreases in the following order: random walk model, random direction model, and random waypoint model. This is because of the non-uniform node distribution in the last two models. Our work can be used by researchers to choose, modify, or apply a reasonable mobility model for network simulations.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E97.B.952/_p
Copy
@ARTICLE{e97-b_5_952,
author={Yan-tao LIU, Ying TIAN, Jian-ping AN, Heng LIU, },
journal={IEICE TRANSACTIONS on Communications},
title={Connectivity of Ad Hoc Networks with Random Mobility Models},
year={2014},
volume={E97-B},
number={5},
pages={952-959},
abstract={We analyze the connectivity of simulation ad hoc networks, which use random mobility models. Based on the theorem of minimum degree, the study of connectivity probability is converted into an analysis of the probability of minimum node degree. Detailed numerical analyses are performed for three mobility models: random waypoint model, random direction model, and random walk model. For each model, the connectivity probability is calculated and its relations with the communication range r and the node number n are illustrated. Results of the analyses show that with the same network settings, the connectivity performance decreases in the following order: random walk model, random direction model, and random waypoint model. This is because of the non-uniform node distribution in the last two models. Our work can be used by researchers to choose, modify, or apply a reasonable mobility model for network simulations.},
keywords={},
doi={10.1587/transcom.E97.B.952},
ISSN={1745-1345},
month={May},}
Copy
TY - JOUR
TI - Connectivity of Ad Hoc Networks with Random Mobility Models
T2 - IEICE TRANSACTIONS on Communications
SP - 952
EP - 959
AU - Yan-tao LIU
AU - Ying TIAN
AU - Jian-ping AN
AU - Heng LIU
PY - 2014
DO - 10.1587/transcom.E97.B.952
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E97-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2014
AB - We analyze the connectivity of simulation ad hoc networks, which use random mobility models. Based on the theorem of minimum degree, the study of connectivity probability is converted into an analysis of the probability of minimum node degree. Detailed numerical analyses are performed for three mobility models: random waypoint model, random direction model, and random walk model. For each model, the connectivity probability is calculated and its relations with the communication range r and the node number n are illustrated. Results of the analyses show that with the same network settings, the connectivity performance decreases in the following order: random walk model, random direction model, and random waypoint model. This is because of the non-uniform node distribution in the last two models. Our work can be used by researchers to choose, modify, or apply a reasonable mobility model for network simulations.
ER -
English
