DocumentCode
3678012
Title
An Efficient Algorithm for Deriving Mobility Scenarios from New Mobility Model Representing Spatially and Temporally Biased Change of Node Mobility and Node Density for Mobile Ad Hoc Networks
Author
Takahiro Shigeta;Eitaro Kohno;Yoshiaki Kakuda
Author_Institution
Grad. Sch. of Inf. Sci., Hiroshima City Univ., Hiroshima, Japan
fYear
2014
Firstpage
556
Lastpage
562
Abstract
Node mobility models for MANETs are important to affect performance of their routing protocols. We have already proposed a new mobility model representing spatially and temporally biased change of node mobility and node density for MANETs. In order to evaluate routing protocols of MANETs for our new mobility model, this paper presents an efficient algorithm for enabling derivation of various mobility scenarios for our new mobility model if parameters called "variation rate" representing degree of biased variation of node mobility and node density are only inputted. Using the derived mobility scenarios in simulation experiments, performance of routing protocols for MANETs can be evaluated from the viewpoint of a new metric "variation rate".
Keywords
"Mobile computing","Routing protocols","Conferences","Stochastic processes","Nickel","Mobile ad hoc networks"
Publisher
ieee
Conference_Titel
Ubiquitous Intelligence and Computing, 2014 IEEE 11th Intl Conf on and IEEE 11th Intl Conf on and Autonomic and Trusted Computing, and IEEE 14th Intl Conf on Scalable Computing and Communications and Its Associated Workshops (UTC-ATC-ScalCom)
Type
conf
DOI
10.1109/UIC-ATC-ScalCom.2014.23
Filename
7307003
Link To Document