TY - GEN
T1 - Performance study of end-to-end traffic-aware routing
AU - Al-Qassas, Raad S.
AU - Mackenzie, Lewis M.
AU - Ould-Khaoua, Mohamed
PY - 2006
Y1 - 2006
N2 - There has been a lot research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider finding the shortest path from source to destination in building a route. However, this can lead to some network nodes being more overloaded than the others, In MANETs resources, such as node power and channel bandwidth are often at a premium and, therefore, it is important to optimise their use as much as possible. Consequently, a traffic-aware technique to distribute the load is very desirable in order to make good utilisation of nodes resources, A number of traffic aware techniques have recently been proposed and can be classified into two categories: end-to-end and on-the-spot. The performance merits of the existing end-to-end traffic aware techniques have been analysed and compared against traditional routing algorithms, There has also been a performance comparison among the existing on-the-spot techniques. However, there has so far been no similar study that evaluates and compares the relative performance merits of end-to-end techniques. In this paper we describe an extensive performance evaluation of two end-to-end techniques, based on degree of nodal activity and traffic density, using measures based on throughput, end-to-end delay and routing overhead.
AB - There has been a lot research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider finding the shortest path from source to destination in building a route. However, this can lead to some network nodes being more overloaded than the others, In MANETs resources, such as node power and channel bandwidth are often at a premium and, therefore, it is important to optimise their use as much as possible. Consequently, a traffic-aware technique to distribute the load is very desirable in order to make good utilisation of nodes resources, A number of traffic aware techniques have recently been proposed and can be classified into two categories: end-to-end and on-the-spot. The performance merits of the existing end-to-end traffic aware techniques have been analysed and compared against traditional routing algorithms, There has also been a performance comparison among the existing on-the-spot techniques. However, there has so far been no similar study that evaluates and compares the relative performance merits of end-to-end techniques. In this paper we describe an extensive performance evaluation of two end-to-end techniques, based on degree of nodal activity and traffic density, using measures based on throughput, end-to-end delay and routing overhead.
UR - http://www.scopus.com/inward/record.url?scp=33750099372&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33750099372&partnerID=8YFLogxK
U2 - 10.1109/ANSS.2006.37
DO - 10.1109/ANSS.2006.37
M3 - Conference contribution
AN - SCOPUS:33750099372
SN - 0769525598
SN - 9780769525594
T3 - Proceedings - Simulation Symposium
SP - 8
EP - 15
BT - Proceedings - 39th Annual Simulation Symposium
PB - IEEE Computer Society
T2 - 39th Annual Simulation Symposium, 2006
Y2 - 2 April 2006 through 6 April 2006
ER -