Energy-Time Efficient Routing Algorithms for Mobile Ad Hoc Networks

Kim, Jinguk. 2013. Energy-Time Efficient Routing Algorithms for Mobile Ad Hoc Networks. Doctoral thesis, Goldsmiths, University of London [Thesis]

No full text available
[img] Text ( Energy-Time Efficient Routing Algorithms for Mobile Ad Hoc Networks )
COM_thesis_Kim_2013.pdf - Submitted Version
Permissions: Administrator Access Only

Download (1MB)

Abstract or Description

Mobile Ad Hoc Networks (MANETs) are one of the fastest growing technologies in wireless communication. Many routing algorithms have been proposed and developed to find and maintain routes between two mobile nodes. The most well known reactive routing algorithms, such as Dynamic Source Routing (DSR) and Ad hoc On demand Distance Vector (AODV), use a so-called Expanding Ring Search (ERS) technique in the route discovery process to find a valid route. However, in ERS, each time a source node fails to find the destination node, the source node needs to broadcast a Route Request (RREQ) packet and start the flooding procedure over again. Moreover, the ERS cannot stop the propagation of the RREQ packet until the pre defined Time-To-Live (TTL) value of ERS has expired (i.e when the TTL value reaches to zero). Finally, ERS does not consider any movements of the nodes. In this thesis, energy-time efficient routing algorithms are investigated for the route discovery process. Two efficient routing algorithms are developed, namely Blocking Expanding Ring Search (BERS) and Mobility Based Blocking Expanding Ring Search (MBERS). The BERS is proposed to reduce some energy waste in ERS during route discovery process. The MBERS is proposed to take into consideration of node movements, and was developed to save energy and time by controlling the transmission range, and the use of the maximum lifetime of the route. The performance of the two proposed routing algorithms are evaluated using both mathematical and simulation methods. The results show that the two proposed algorithms are more efficient than the ERS in terms of saving energy and time. The contributions of the thesis can be summarized as follows:

1. The tradeoff between the energy efficiency and time delay is discussed and two models, namely the Cost Model and Trade Model, are proposed to quantify the combined effect of energy-time efficiency.
2. The route discovery algorithm “BERS” is proposed to decrease energy consumption by reducing the number of packets sent over the network. The performance evaluations of the ERS and BERS are provided in terms of energy consumption, time delay, and energy-time efficiency. An analysis is performed between the Dual Tier Chase (DTC) algorithm and BERS as an initial attempt.
3. The route discovery algorithm “MBERS” is proposed to take into consideration the node movements and the selection of a maximum lifetime of the route which were not considered in BERS. The performance evaluations of the BERS and the MBERS algorithms are provided in terms of energy consumption, time delay, and energy-time efficiency.

Item Type:

Thesis (Doctoral)

Departments, Centres and Research Units:

Computing

Date:

2013

Item ID:

9613

Date Deposited:

18 Dec 2013 13:09

Last Modified:

08 Sep 2022 10:23

URI:

https://research.gold.ac.uk/id/eprint/9613

View statistics for this item...

Edit Record Edit Record (login required)