Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/15861
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhar, R-
dc.date.accessioned2024-07-13T13:44:34Z-
dc.date.available2024-07-13T13:44:34Z-
dc.date.issued2011-
dc.identifier.isbn9789380864715-
dc.identifier.urihttps://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/15861-
dc.description.abstractWireless sensor networks are new generation of networks. These networks are appropriate means for collecting and diffusing environmental information, or communicating occurrence of an event to sink node. The main challenge for diffusing information in sensor networks is the limitations in sources and existing bandwidth. Several parameters are involved in selection of middle nodes of information diffusion path, and since existing methods take only some standards into account, it is obvious that they suffer from a number of defects. In our proposed algorithm, five more important factors are combined to score to nodes in routing process. This process called „SARA‟ is more flexible, and enhances routing quality through fair division of node‟s roles in transmission of information packets towards sink node. The main objectives of this method are; decrease of consumption energy and the uniform distribution, increase of network lifetime, decrease of traffic load and load balance, possibility of more effective aggregation of data and improving the reliability of formed paths. Several simulations have shown higher competency of this method.en_US
dc.language.isoenen_US
dc.publisherInternational Journal of Computer Application [IJCA]en_US
dc.subjectSink Nodeen_US
dc.subjectNetwork Lifetimeen_US
dc.subjectLoad Balancingen_US
dc.subjectWireless Sensor Networksen_US
dc.subjectWireless Networksen_US
dc.titleWireless Networks using Algorithmen_US
dc.typeArticleen_US
Appears in Collections:Journal Articles

Files in This Item:
There are no files associated with this item.


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