Change search
ReferencesLink to record
Permanent link

Direct link
Energy efficient routing in wireless networks
2006 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

CMAX and max-min zPmin are two packet forwarding techniques designed to save energy wireless ad-hoc networks. Their aim is to forward packets in such a way that the network's energy is conserved better than if they were forwarded along the path with the least count of hops (i e using the traditional forwarding technique). This master thesis compares the two energy efficient forwarding techniques against each other and, against a least-hop scheme. The comparison is made by simulation in static networks using the Network Simulator (ns-2). Hence this thesis also shows that simulation of more abstract “routing protocols”, such as these bare packet forwarding techniques, can be performed in ns-2. CMAX and max-min zPmin are thus implemented as routing modules of ns-2, along with a least-hop technique. The work here is only concerned about the packet forwarding procedure itself, and because of this the implementations are somewhat centralized, or omnipotent: Each node is allowed to know the exact position of every other node in the network at all times. For disseminating battery updates limited-flooding is employed, a method which uses the idea of only propagating information a certain distance from the information source. ns-2 is also extended with all the necessary features that are needed by the algorithms, such as mechanisms to enable nodes gather global information from existing data structures, support for variable signaling range and a signaling range dependent energy consumption model. The work is described in detail and decisions are backed up with references to aid the understanding of it and make it easier to use, both as a product and a foundation. The simulations here only examine static networks where the nodes never move from their initial position. In this setting, using a “fair random traffic model”, they indicate that the energy efficient algorithms perform better than the shortest path scheme when the network is sparse and, that CMAX performs better than max-min zPmin. Performance is measured by both looking at network lifetime and how much user data the schemes manage to successfully carry from source to sink. This booklet contains a summary of other interesting approaches that aim to conserve energy in a wireless network, such as different methods to perform topology control and hierarchical routing. There is also a proposition of a new cluster based energy efficient algorithm that is based on ideas collected from some of the summarized schemes.

Place, publisher, year, edition, pages
Keyword [en]
Technology, datorkommunikation, trådlösa lokala datanät, energieffektiva, vägval, energieffektivitet, cmax, max-min zpmin, ns-2, trådlösa statiska nätverk
Keyword [sv]
URN: urn:nbn:se:ltu:diva-42226ISRN: LTU-EX--06/125--SELocal ID: 045fe2ee-d9e0-4785-8db1-122bdd217ad6OAI: diva2:1015444
Subject / course
Student thesis, at least 30 credits
Educational program
Computer Science and Engineering, master's level
Validerat; 20101217 (root)Available from: 2016-10-04 Created: 2016-10-04Bibliographically approved

Open Access in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar
Total: 4 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: 1 hits
ReferencesLink to record
Permanent link

Direct link