Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
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
Distributed Algorithms
Wireless Access Method to Ensure Each User's QoS in Unpredictable and Various QoS Requirements
Wireless Personal Communications: An International Journal
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
On the Vulnerabilities and Protection of OSPF Routing Protocol
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Hi-index | 0.00 |
In this paper we investigate the performance of IEEE 802.11b/g ad hoc networks by means of an experimental study. We examine a dynamic topology, using high mobility conditions in order to simulate the effect of nodes moving in and out of the coverage area, thus resulting in link failures, dropped packets, lost packets and dynamic route acquisition. More specifically, we gather metrics for the two most important network performance factors, namely packet throughput and delay over high mobility conditions, using the simulation environment of NS-2. Our study considers the enhancement of Distributed Bellman-Ford algorithm, which is a widely used algorithm, and assesses the effectiveness of the enhanced version on top of a fourth generation system (4-G).