loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
32nd IEEE Conference on Local Computer Networks (LCN 2007)
Performance of Mobile Ad Hoc Networks with Random and Predetermined Mobility Patterns using OPNET: Preliminary Results
Dublin, Ireland
October 15-October 18
ISBN: 0-7695-3000-1
ASCII Text
x 
 
Dan P. Denson, Suresh Muknahallipatna, Margareta Stefanovic, "Performance of Mobile Ad Hoc Networks with Random and Predetermined Mobility Patterns using OPNET: Preliminary Results," Local Computer Networks, Annual IEEE Conference on, pp. 781-783, 32nd IEEE Conference on Local Computer Networks (LCN 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/LCN.2007.52,
author = {Dan P. Denson and Suresh Muknahallipatna and Margareta Stefanovic},
title = {Performance of Mobile Ad Hoc Networks with Random and Predetermined Mobility Patterns using OPNET: Preliminary Results},
journal ={Local Computer Networks, Annual IEEE Conference on},
volume = {0},
year = {2007},
issn = {0742-1303},
pages = {781-783},
doi = {http://doi.ieeecomputersociety.org/10.1109/LCN.2007.52},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Local Computer Networks, Annual IEEE Conference on
TI - Performance of Mobile Ad Hoc Networks with Random and Predetermined Mobility Patterns using OPNET: Preliminary Results
SN - 0742-1303
SP781
EP783
A1 - Dan P. Denson,
A1 - Suresh Muknahallipatna,
A1 - Margareta Stefanovic,
PY - 2007
KW - Mobility; Random; Pursue; Nomadic; Model; Stability
VL - 0
JA - Local Computer Networks, Annual IEEE Conference on
ER -
 
Dan P. Denson, University of Wyoming, USA
Suresh Muknahallipatna, University of Wyoming, USA
Margareta Stefanovic, University of Wyoming, USA
By definition the nodes in mobile ad hoc networks move from one location to another in either a random or predetermined pattern. The performance of a mobile ad hoc network is dependent on the node mobility pattern as well as topology, data traffic patterns, and radio interference. A group of nodes using a particular type of mobility pattern will form a network without any preexisting network infrastructure.

In this paper, we present preliminary results of a mobile ad hoc network with random and predetermined mobility pattern based on the reference point group mobility model. Since it is difficult to obtain a real mobility pattern, we first demonstrate the development of a predetermined synthetic mobility pattern using OPNET as a discrete event simulator. Next, using the predetermined synthetic and random mobility patterns, we demonstrate the importance of one of the operating parameters namely position update interval on the capability of the nodes to follow the desired mobility pattern.

Index Terms:
Mobility; Random; Pursue; Nomadic; Model; Stability
Citation:
Dan P. Denson, Suresh Muknahallipatna, Margareta Stefanovic, "Performance of Mobile Ad Hoc Networks with Random and Predetermined Mobility Patterns using OPNET: Preliminary Results," lcn, pp.781-783, 32nd IEEE Conference on Local Computer Networks (LCN 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.