Performance comparisons of battery aware routing algorithms in wireless ad-hoc networks

Thumbnail Image

URL

Journal Title

Journal ISSN

Volume Title

Helsinki University of Technology | Diplomityö
Checking the digitized thesis and permission for publishing
Instructions for the author

Authors

Date

2003

Department

Sähkö- ja tietoliikennetekniikan osasto

Major/Subject

Tietoliikennetekniikka

Mcode

S-72

Degree programme

Language

en

Pages

83

Series

Abstract

In ad-hoc networks, choosing the best route has direct effect on the network's lifetime, the average packet delay, and the throughput and the traffic interference. The choice of the best route is based upon the minimum cost path. The cost of a path is defined to be the sum of the costs of its corresponding links. A simulator has been implemented in MATLAB to find the best link cost function based on various parameters such as current/future battery level, transmission power, and signal processing cost. Also, a non-cooperative route selection procedure has been tested, where a node whose energy is lower than a specified threshold doesn't participate in routing. Firstly, the description of the research problem is presented. Then, the basics of ad-hoc networks (i.e. network layer and its protocols, MAC layer and its protocols) will be given. Then the main focus of the thesis, which is the optimization of routing algorithms considering the battery costs, is presented. Simulator model and assumptions are explained in detail. The simulation results will be presented together with the comments. Finally, an overall discussion on the results and the conclusions will be given.

Description

Supervisor

Häggman, Sven-Gustav

Thesis advisor

Makarevitch, Boris

Keywords

routing algorithms, MTPR, ALWA, shortest path algorithms, Bellman Ford Algorithm, ZRP, GSR, FSR, AODV, DSDV, LS

Other note

Citation

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-2020120449795

Collections

[dipl] Teknillinen korkeakoulu / TKK