Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/1066
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRout, S-
dc.contributor.authorTuruk, A K-
dc.contributor.authorSahoo, Bibhudatta-
dc.date.accessioned2009-11-19T03:22:54Z-
dc.date.available2009-11-19T03:22:54Z-
dc.date.issued2009-
dc.identifier.citationProceedings of Fourth Innovative Conference on Embedded Systems, Mobile Communication and Computing, July 27-29, 2009, Pages 3-8en
dc.identifier.urihttp://hdl.handle.net/2080/1066-
dc.description.abstractEnergy is a critical resource in the design of wireless networks. Since wireless devices are usually powered by batteries. . Battery capacity is finite and the progress of battery technology is very slow, with capacity expected to make little improvement in the near future. Under these conditions, many techniques for conserving power have been proposed to increase battery life. In this dissertation we consider energy consumption cannot be achieved by routing through shortest path. By taking the shortest path energy of a small set of nodes decreases very rapidly as compare to other nodes, making the nodes to die which leads network to partition. So to maximize network life instead of using the shortest path try to use alternate path to avoid congestion. In this paper we propose one algorithm of finding alternate routes in wireless network which may decrease energy consumption by sharing the load and avoiding congested path and retransmission.en
dc.format.extent357365 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherMacmillanen
dc.subjectAd hoc networks,en
dc.subjectEnergy efficiency,en
dc.subjectAlternate path,en
dc.subjectQueue,en
dc.subjectBacktrack traversalen
dc.titleEnergy Efficiency in Wireless Network: Through Alternate Path Routingen
dc.typeArticleen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
sr_icemc2.pdf348.99 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.