Performance measurement of various routing protocols in ad-hoc networks
dc.contributor.author | Rahman, Anisur | |
dc.contributor.author | Islam, S. | |
dc.contributor.author | Talevski, Alex | |
dc.contributor.editor | S I Ao | |
dc.contributor.editor | Oscar Castillo | |
dc.contributor.editor | Craig Douglas | |
dc.contributor.editor | David Dagan Feng | |
dc.contributor.editor | Jeong-A Lee | |
dc.date.accessioned | 2017-01-30T13:20:16Z | |
dc.date.available | 2017-01-30T13:20:16Z | |
dc.date.created | 2010-02-07T20:02:22Z | |
dc.date.issued | 2009 | |
dc.identifier.citation | Rahman, Anisur and Islam, Sohidul and Talevski, Alex. 2009. Performance measurement of various routing protocols in ad-hoc networks, in S I Ao, Oscar Castillo, Craig Douglas, David Dagan Feng and Jeong-A Lee (ed), International MultiConference of Engineers and Computer Scientists (IMECS 2009), Mar 18 2009, pp. 321-323. Hong Kong: IAENG. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/30544 | |
dc.description.abstract |
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. | |
dc.publisher | IAENG | |
dc.subject | Hidden terminal problem | |
dc.subject | Bellman-Ford Routing Algorithm | |
dc.subject | Source Routing | |
dc.title | Performance measurement of various routing protocols in ad-hoc networks | |
dc.type | Conference Paper | |
dcterms.source.startPage | 321 | |
dcterms.source.endPage | 323 | |
dcterms.source.title | Proceedings of the international multiconference of engineers and computer scientists (IMECS 2009) | |
dcterms.source.series | Proceedings of the international multiconference of engineers and computer scientists (IMECS 2009) | |
dcterms.source.isbn | 9789881701220 | |
dcterms.source.conference | International MultiConference of Engineers and Computer Scientists (IMECS 2009) | |
dcterms.source.conference-start-date | Mar 18 2009 | |
dcterms.source.conferencelocation | Hong Kong | |
dcterms.source.place | Hong Kong | |
curtin.department | Centre for Extended Enterprises and Business Intelligence | |
curtin.accessStatus | Open access | |
curtin.faculty | Curtin Business School | |
curtin.faculty | The Centre for Extended Enterprises and Business Intelligence (CEEBI) |