Please use this identifier to cite or link to this item:
http://13.232.72.61:8080/jspui/handle/123456789/345
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sudarsanan, D. | - |
dc.contributor.author | Sharanabasava | - |
dc.contributor.author | Megha, J. | - |
dc.date.accessioned | 2018-09-28T09:52:26Z | - |
dc.date.available | 2018-09-28T09:52:26Z | - |
dc.date.issued | 2013-09 | - |
dc.identifier.citation | Global Journal of Engineering Design and Technology | en_US |
dc.identifier.issn | 2319 – 7293 | - |
dc.identifier.uri | http://13.232.72.61:8080/jspui/handle/123456789/345 | - |
dc.description.abstract | Wireless Mesh Networks (WMNs) is a Communication network made up of radio nodes organized in a mesh topology and it is part of Ad-hoc network. WMNs have emerged as a key technology for next-generation wireless networking. Because of their advantages over other wireless networks [1], WMNs are undergoing rapid progress and inspiring numerous applications. WMNs is dynamic and Infrastructure less network. Due to dynamic nature it has many constraints like message collision, power consumption and congestion and Bandwidth. To maintain some of those constraints in wireless mesh network we use Hierarchical Clustering technique. Hierarchical Clustering makes the network fast, more efficient and reliable. Hierarchical Clustering techniques are used to solve routing and congestion control problems because it offers scalability and reduced overheads | en_US |
dc.language.iso | en | en_US |
dc.publisher | Globa Institute of Research and Education | en_US |
dc.subject | Information Science | en_US |
dc.subject | Computer networks | en_US |
dc.title | A Study on Wireless Mesh Network with Hierarchical Cluster. | en_US |
dc.type | Article | en_US |
Appears in Collections: | Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
A study-on-wireless-mesh-network-with-hierarchical-cluster.pdf | 383.62 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.