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
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Ad hoc on-demand distance-vector routing scalability
ACM SIGMOBILE Mobile Computing and Communications Review
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Performance of Route Caching Strategies in Dynamic Source Routing
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Simulation of large ad hoc networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
The capacity of wireless networks
IEEE Transactions on Information Theory
An evaluation of inter-vehicle ad hoc networks based on realistic vehicular traces
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
An efficient demand-driven and density-controlled publish/subscribe protocol for mobile environments
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces
ACM SIGMETRICS Performance Evaluation Review
Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces
INFOCOM'10 Proceedings of the 29th conference on Information communications
Demand-driven publish/subscribe in mobile environments
Wireless Networks
Performance comparison of end-to-end and on-the-spot traffic-aware techniques
International Journal of Communication Systems
| Hi-index | 0.00 |
In an ad hoc network each host (node) participates in routing packets. Ad hoc networks based on 802.11 WLAN technology have been the focus of several prior studies. These investigations were mainly based on simulations of scenarios involving up to 100 nodes (usually 50 nodes) and relaxed (too unrealistic) data traffic conditions. Many routing protocols in such setting offer the same performance, and many potential problems stay undetected. At the same time, an ad hoc network may not want (or be able) to limit the number of hosts involved in the network. As more nodes join an ad hoc network or the data traffic grows, the potential for collisions and contention increases, and protocols face the challenging task to route data packets without creating high administrative load. The investigation of protocol behavior in large scenarios exposes many hidden problems. The understanding of these problems helps not only in improving protocol scalability to large scenarios but also in increasing the throughput and other QoS metrics in small ones. This paper studies on the example of AODV and DSR protocols the influence of the network size (up to 550 nodes), nodes mobility, nodes density, suggested data traffic on protocols performance. In this paper we identify and analyze the reasons for poor absolute performance that both protocols demonstrate in the majority of studied scenarios. We also propose and evaluate restructured protocol stack that helps to improve the performance and scalability of any routing protocol in wireless ad hoc networks.