Please use this identifier to cite or link to this item:
http://dspace.dtu.ac.in:8080/jspui/handle/repository/15440
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | KUMAR, SHASHI | - |
dc.date.accessioned | 2016-12-23T04:38:17Z | - |
dc.date.available | 2016-12-23T04:38:17Z | - |
dc.date.issued | 2014-06 | - |
dc.identifier.uri | http://dspace.dtu.ac.in:8080/jspui/handle/repository/15440 | - |
dc.description.abstract | In wireless ad-hoc networks, every node performs communication with other nodes directly or through the intermediate nodes because of limited bandwidth (BW). Almost all network nodes are operated on lithium ion rechargeable batteries; these batteries have a limited lifetime (3 to 4 hours only). Hence, power-efficient routing in wireless Ad hoc networks is an important research issue as it determines the network lifetime. This work proposes a novel optimized power efficient routing algorithm (OPERA) considering the network parameters like node density, power consumption, traffic congestion and node status. The proposed work ranks the communication parameters based on different traffic congestion zones like maximum, moderate and minimum, using Analytical Hierarchy Process (AHP) and selects optimal path. The OPERA is an adaptive and Energy efficient technique. A simulation study is performed to compare the performance of OPERA with AODV protocol. Our result indicates that OPERA consumes less energy as compare to AODV. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartofseries | TD NO.1543; | - |
dc.subject | ROUTING PROTOCOL | en_US |
dc.subject | AD-HOC NETWORKS | en_US |
dc.subject | OPERA | en_US |
dc.subject | AHP | en_US |
dc.title | ENERGY EFFICIENT ROUTING PROTOCOL FOR WIRELESS AD-HOC NETWORKS | en_US |
dc.type | Thesis | en_US |
Appears in Collections: | M.E./M.Tech. Electronics & Communication Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
m.tech thesis modify.pdf | 1.8 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.