Performance measurement of various routing protocols in ad-hoc networks
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. A number of routing protocols like Destination-Sequenced Distance-Vector (DSDV), Adhoc On-Demand Distance Vector Ro...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
IAENG
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/30544 |
| _version_ | 1848753118766956544 |
|---|---|
| author | Rahman, Anisur Islam, S. Talevski, Alex |
| author2 | S I Ao |
| author_facet | S I Ao Rahman, Anisur Islam, S. Talevski, Alex |
| author_sort | Rahman, Anisur |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. A number of routing protocols like Destination-Sequenced Distance-Vector (DSDV), Adhoc On-Demand Distance Vector Routing (AODV), Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA) have been implemented. In this paper, a comprehensive attempt has been made to compare the performance of two prominent on-demand reactive routing protocols for mobile ad hoc networks: DSR and AODV, along with the traditional proactive DSDV protocol. A simulation model with MAC and physical layer models have been used to study interlayer interactions and their performance implications. The On-demand protocols, AODV and DSR perform better than the table-driven DSDV protocol. Although DSR and AODV share similar on-demand behavior, the differences in the protocol mechanics can lead to significant performance differentials. The performance differentials have been analyzed by varying network load, mobility, and network size. |
| first_indexed | 2025-11-14T08:19:26Z |
| format | Conference Paper |
| id | curtin-20.500.11937-30544 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T08:19:26Z |
| publishDate | 2009 |
| publisher | IAENG |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-305442022-12-09T06:09:42Z Performance measurement of various routing protocols in ad-hoc networks Rahman, Anisur Islam, S. Talevski, Alex S I Ao Oscar Castillo Craig Douglas David Dagan Feng Jeong-A Lee Hidden terminal problem Bellman-Ford Routing Algorithm Source Routing An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. A number of routing protocols like Destination-Sequenced Distance-Vector (DSDV), Adhoc On-Demand Distance Vector Routing (AODV), Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA) have been implemented. In this paper, a comprehensive attempt has been made to compare the performance of two prominent on-demand reactive routing protocols for mobile ad hoc networks: DSR and AODV, along with the traditional proactive DSDV protocol. A simulation model with MAC and physical layer models have been used to study interlayer interactions and their performance implications. The On-demand protocols, AODV and DSR perform better than the table-driven DSDV protocol. Although DSR and AODV share similar on-demand behavior, the differences in the protocol mechanics can lead to significant performance differentials. The performance differentials have been analyzed by varying network load, mobility, and network size. 2009 Conference Paper http://hdl.handle.net/20.500.11937/30544 IAENG fulltext |
| spellingShingle | Hidden terminal problem Bellman-Ford Routing Algorithm Source Routing Rahman, Anisur Islam, S. Talevski, Alex Performance measurement of various routing protocols in ad-hoc networks |
| title | Performance measurement of various routing protocols in ad-hoc networks |
| title_full | Performance measurement of various routing protocols in ad-hoc networks |
| title_fullStr | Performance measurement of various routing protocols in ad-hoc networks |
| title_full_unstemmed | Performance measurement of various routing protocols in ad-hoc networks |
| title_short | Performance measurement of various routing protocols in ad-hoc networks |
| title_sort | performance measurement of various routing protocols in ad-hoc networks |
| topic | Hidden terminal problem Bellman-Ford Routing Algorithm Source Routing |
| url | http://hdl.handle.net/20.500.11937/30544 |