search query: @keyword MTPR / total: 1
reference: 1 / 1
« previous | next »
Author: | Cuzdan, Hakan |
Title: | Performance comparisons of battery aware routing algorithms in wireless ad-hoc networks |
Paristosta selvillä olevien langattomien ad-hoc-verkkojen reititysalgoritmien suorituskyvyn vertailu | |
Publication type: | Master's thesis |
Publication year: | 2003 |
Pages: | 83 Language: eng |
Department/School: | Sähkö- ja tietoliikennetekniikan osasto |
Main subject: | Tietoliikennetekniikka (S-72) |
Supervisor: | Häggman, Sven-Gustav |
Instructor: | Makarevitch, Boris |
OEVS: | Electronic archive copy is available via Aalto Thesis Database.
Instructions Reading digital theses in the closed network of the Aalto University Harald Herlin Learning CentreIn the closed network of Learning Centre you can read digital and digitized theses not available in the open network. The Learning Centre contact details and opening hours: https://learningcentre.aalto.fi/en/harald-herlin-learning-centre/ You can read theses on the Learning Centre customer computers, which are available on all floors.
Logging on to the customer computers
Opening a thesis
Reading the thesis
Printing the thesis
|
Location: | P1 Ark S80 | Archive |
Keywords: | routing algorithms MTPR ALWA shortest path algorithms Bellman Ford Algorithm ZRP GSR FSR AODV DSDV LS |
Abstract (eng): | 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. |
ED: | 2003-09-15 |
INSSI record number: 19959
+ add basket
« previous | next »
INSSI