DSpace@nitr >
National Institue of Technology- Rourkela >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/1159

Full metadata record

DC FieldValueLanguage
contributor.authorRout, S-
contributor.authorTuruk, A K-
contributor.authorSahoo, Bibhudatta-
date.accessioned2010-01-25T22:00:08Z-
date.available2010-01-25T22:00:08Z-
date.issued2009-
identifier.citation12th International Conference on Information Technology, December 21-24, 2009, Pages 223-226en
identifier.urihttp://hdl.handle.net/2080/1159-
description.abstractWireless networking has witnessed an explosion of interest from consumers in recent years for its applications in mobile and personal communication. Energy efficiency is also an important design consideration due to the limited battery life of wireless node. In order to maximize the network life time and to minimize energy consumption, instead of routing through shortest path we propose routing through alternate paths. Along with that when traversing in one path, other nodes of network will be switched off in order to reduce energy consumption. For efficient sleep and active node mechanism we divide the entire network into clusters. In this paper we propose the method of using clustering along with that the probabilistic approach to find the number of active and sleep nodes at a particular time. We consider the network in terms of queuing network and consider the packets arrival rate in terms of poison distribution.en
format.extent528565 bytes-
format.mimetypeapplication/pdf-
language.isoen-
publisherMc Graw Hillen
subjectQueuing theory,en
subjectpoison distribution,en
subjectprobability,en
subjectclustering,en
subjectwireless ad hoc networken
titleEnergy Efficiency in Wireless Ad Hoc Network using Clusteringen
typeArticleen
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
icit-adhoc.pdf516KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.

 

Powered by DSpace Feedback