liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Energy Efficient Routing in Ad Hoc Networks
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
2014 (English)Independent thesis Basic level (degree of Bachelor), 10,5 credits / 16 HE creditsStudent thesis
Abstract [en]

This thesis presents a comparison between a basic shortest path routing policy of the Destination-Sequence Distance Vector (DSDV) protocol and two power-aware policy variations of it. In the two modified versions, the routes are selected based on the energy available on the nodes and not only the shortest path distance to the destination. Simulations are conducted for a given situation of nodes and the energy efficiency of the three aforementioned policies are evaluated for example scenarios.

First, a brief overview of the theory behind the study is presented. It consists of an description of ad hoc networking, DSDV, and our energy-aware modifications to DSDV.

After the fundamental theory, the method is presented. It consists of a description of how the simulated scenarios relates to a real-world scenario and the simplifications made in the model. We present an overview of the model used for simulation and the operation of the program. This section ends with an explanation of the three simulated policies: shortest path, simple weighted and doubled weighted.

When the theory behind the thesis are completed, the simulations are conducted. The results are examined and a summary of their meaning is discussed. It is explained how the assumptions effect the reliability of the study and an estimation of the accuracy of the results are presented.

We find that the power-aware policy variations (simple weighted and double weighted) both achieve better network lifetime than the basic shortest path policy, at the cost of slightly longer per-packet paths. These results are encouraging and show that very simple modifications to DSDV can achieve significant gains in the network lifetime, helping users get the most out of their networks. Future investigation could try to optimize these gains.

Place, publisher, year, edition, pages
2014. , 20 p.
Keyword [en]
Ad hoc, DSDV, routing, energy awareness, shortest path, routing policy
National Category
Computer Science
URN: urn:nbn:se:liu:diva-109310ISRN: LIU-IDA/LITH-EX-G--14/065--SEOAI: diva2:737257
Subject / course
Computer and information science at the Institute of Technology
Available from: 2014-08-20 Created: 2014-08-12 Last updated: 2014-08-20Bibliographically approved

Open Access in DiVA

fulltext(796 kB)74 downloads
File information
File name FULLTEXT01.pdfFile size 796 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Nilsek, EmmieOlsson, Christoffer
By organisation
Department of Computer and Information ScienceThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 74 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 166 hits
ReferencesLink to record
Permanent link

Direct link