Performance comparison and analysis of ad hoc routing algorithms

被引：21

作者：

Boukerche, A ^{[1
]}

机构：

[1] Univ N Texas, Dept Comp Sci, PARADISE Res Lab, Denton, TX 76203 USA

来源：

CONFERENCE PROCEEDINGS OF THE 2001 IEEE INTERNATIONAL PERFORMANCE, COMPUTING, AND COMMUNICATIONS CONFERENCE | 2001年

关键词：

D O I：

10.1109/IPCCC.2001.918650

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A Mobile ad-hoc network (Manet) is a system of wireless mobile nodes dynamically self-organizing in arbitrary and temporary network topologies. People and vehicles can thus be internetworked in areas without a pre-existing communication infrastructure, or when the use of such infrastructure requires wireless extension. Therefore, such networks are designed to operate in widely varying environments, from military networks to low-power sensor networks and other embedded systems. Frequent topology changes caused by node mobility make routing in ad hoc wireless networks a challenging problem. In this paper, we focus upon routing protocols for ad hoc networks. We study and compare the performance of several routing protocols. A variety of workload and scenarios using a variety of mobility, load and size of the ad hoc network were simulated.

引用

页码：171 / 178

页数：8