Please use this identifier to cite or link to this item: http://13.232.72.61:8080/jspui/handle/123456789/358
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKusuma, M.-
dc.contributor.authorUmapathi, G. R.-
dc.date.accessioned2018-10-01T09:26:23Z-
dc.date.available2018-10-01T09:26:23Z-
dc.date.issued2014-
dc.identifier.citationKusuma, M., & Umapathi, G R. (2014). Implementation of Optimization of Latency in Wireless Mesh Network. International Journal of Computer Science and Information, 5(5), 6010-6015.en_US
dc.identifier.issn0975-9646-
dc.identifier.urihttp://13.232.72.61:8080/jspui/handle/123456789/358-
dc.description.abstractResearch interest towards wireless mesh network has improved drastically. WMN is emerging as promising technology for many useful applications. Many efforts have been conducted to maximize network throughput in multi-channel multi-radio wireless mesh network. Most current approaches are based on either purely static or purely dynamic. Channel allocation plays major role to maximize the network throughput. In hybrid channel allocation, every mesh node is equipped with static and dynamic interfaces. In turn, Interference and Congestion Aware Routing Protocol (ICAR) in hybrid network with both static and dynamic links, which are capable of balancing the channel usage in network, is proposed. ICAR balances the channel usage of network. Simulation results show the reduced packet delay without degrading the network throughput. Hybrid architecture performs better to changing traffic than pure static architecture, which achieves lower delay than existing approaches for hybrid networks.en_US
dc.language.isoenen_US
dc.publisherIJCSITen_US
dc.subjectInformation Scienceen_US
dc.subjectComputer networksen_US
dc.titleImplementation of Optimization of Latency in Wireless Mesh Network.en_US
dc.typeArticleen_US
Appears in Collections:Articles

Files in This Item:
File Description SizeFormat 
NOT A Big Data Security using Data Masking Methods.pdf554.2 kBAdobe PDFView/Open


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