Routing protocols in ad hoc networks

Authors:
Dan Galatchi;Roxana Zoican
Affiliations:
Electronic and Telecommunication Faculty, Telecommunication Department, Politechnica University of Bucharest, Bucharest, Romania;Electronic and Telecommunication Faculty, Telecommunication Department, Politechnica University of Bucharest, Bucharest, Romania
Venue:
TELE-INFO'05 Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics
Year:
2005

Citing 2
Cited 0

Scalable routing strategies for ad hoc wireless networks

IEEE Journal on Selected Areas in Communications
QoS routing in ad hoc wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ad hoc networking involves computers, typically wireless mobile nodes (MNs), that cooperatively form a network without specific user administration or configuration. In other words, ad hoc networking allows an arbitrary collection of MNs to create a network on demand. A node in the ad hoc network, whether it be a laptop, autonomous agent, or sensor, is in charge of routing information between its neighbors, thus maintaining connectivity of the network. In this paper, we perform a simulation and performance study on some routing protocols for ad hoc networks. Distributed Bellman-Ford (DBF), a traditional table-driven routing algorithm, is simulated to evaluate its performance in multihop wireless networks. In addition, two on-demand routing protocols, Dynamic Source Routing (DSR) and Associativity-Based Routing (ABR), with distinctive route selection algorithms are simulated in a common environment to quantitatively measure and contrast their performance.