ACM Home Page
Please provide us with feedback. Feedback
Towards realistic mobility models for mobile ad hoc networks
Full text PdfPdf (225 KB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 9th annual international conference on Mobile computing and networking table of contents
San Diego, CA, USA
SESSION: Simulation and implementation issues table of contents
Pages: 217 - 229  
Year of Publication: 2003
ISBN:1-58113-753-2
Authors
Amit Jardosh  University of California at Santa Barbara, Santa Barbara, CA
Elizabeth M. Belding-Royer  University of California at Santa Barbara, Santa Barbara, CA
Kevin C. Almeroth  University of California at Santa Barbara, Santa Barbara, CA
Subhash Suri  University of California at Santa Barbara, Santa Barbara, CA
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 258,   Citation Count: 64
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/938985.939008
What is a DOI?

ABSTRACT

One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number of significant benefits, including repeatable scenarios, isolation of parameters, and exploration of a variety of metrics. The topology and movement of the nodes in the simulation are key factors in the performance of the network protocol under study. Once the nodes have been initially distributed, the mobility model dictates the movement of the nodes within the network. Because the mobility of the nodes directly impacts the performance of the protocols, simulation results obtained with unrealistic movement models may not correctly reflect the true performance of the protocols. The majority of existing mobility models for ad hoc networks do not provide realistic movement scenarios; they are limited to random walk models without any obstacles. In this paper, we propose to create more realistic movement models through the incorporation of obstacles. These obstacles are utilized to both restrict node movement as well as wireless transmissions. In addition to the inclusion of obstacles, we construct movement paths using the Voronoi diagram of obstacle vertices. Nodes can then be randomly distributed across the paths, and can use shortest path route computations to destinations at randomly chosen obstacles. Simulation results show that the use of obstacles and pathways has a significant impact on the performance of ad hoc network protocols.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
L. Bajaj, M. Takai, R. Ahuja, K. Tang, R. Bagrodia, and M. Gerla. GlomoSim: A Scalable Network Simulation Environment. Computer Science Department Technical Report, \#990027, UCLA, 1997.
2
3
 
4
5
 
6
T. Camp, J. Boleng, and V. Davies. A Survey of Mobility Models for Ad Hoc Network Research. Wireless Communications & Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, 2(5):483--502, 2002.
 
7
V. Davies. Evaluating Mobility Models Within an Ad hoc Network. Master's thesis, Colorado School of Mines, 2000.
 
8
E. W. Dijkstra. A Note on Two Problems in Connection with Graphs. Num. Mathematik, 1:269--271, 1959.
 
9
R. A. Guerin. Channel Occupancy Time Distribution in a Cellular Radio System. IEEE Transactions on Vehicular Technology, 36(3):89--99, 1987.
 
10
Z. Haas. A New Routing Protocol for Reconfigurable Wireless Networks. In Proceedings of the IEEE International Conference on Universal Personal Communications (ICUPC), pages 562--565, October 1997.
11
12
 
13
 
14
B. Liang and Z. Haas. Predictive Distance-based Mobility Management for PCS Networks. In Proceedings of the IEEE Conference on Computer Communication (INFOCOM), New York, NY, March 1999.
 
15
 
16
 
17
18
 
19
E. M. Royer, P. M. Melliar-Smith, and L. E. Moser. An Analysis of the Optimum Node Density for Ad hoc Mobile Networks. In Proceedings of the IEEE International Conference on Communications, pages 857--861, Helsinki, Finland, June 2001.

CITED BY  65
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Amit Jardosh: colleagues
Elizabeth M. Belding-Royer: colleagues
Kevin C. Almeroth: colleagues
Subhash Suri: colleagues

Peer to Peer - Readers of this Article have also read: