Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scenario-based performance analysis of routing protocols for mobile ad-hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Scalability study of the ad hoc on-demand distance vector routing protocol
International Journal of Network Management
The Georgia Tech Network Simulator
MoMeTools '03 Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research
Ad hoc Networking
Simulation of large scale networks II: large-scale network simulations with GTNetS
Proceedings of the 35th conference on Winter simulation: driving innovation
JiST: an efficient approach to simulation using virtual machines: Research Articles
Software—Practice & Experience
Performance of Routing Protocols in Very Large-Scale Mobile Wireless Ad Hoc Networks
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Scalability of routing methods in ad hoc networks
Performance Evaluation - Performance 2005
An efficient node selection metric for in-network process deployment
Proceedings of the 4th Annual International Conference on Wireless Internet
SCALAR: Scalable data lookup and replication protocol for mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
This article focuses on the performance and scalability study of very large-scale wireless ad hoc networks. As wireless devices become more and more popular, ad hoc networks grow in the number of nodes as well as the complexity of communication among the large number of nodes. However, due to the limitation of simulation technologies, it is either impossible or very hard to investigate the scalability of ad hoc routing protocols in very large-scale wireless networks. In this article, a comprehensive simulation study is conducted of the performance of an on-demand routing protocol on a very large scale, with as many as 50,000 nodes in the network. The authors address the scalability analysis based on various network sizes, node density, traffic load, and mobility. The reasons for packet loss are analyzed and categorized at each network layer. Based on the observations, the authors optimize the parameter selection and try to exhaust the scalability boundary of the on-demand routing protocol for wireless ad hoc networks.