Please use this identifier to cite or link to this item:
http://13.232.72.61:8080/jspui/handle/123456789/2378
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tiwari, Ashish Kumar | - |
dc.contributor.author | Basavaraju, T. G. | - |
dc.contributor.author | Chandavarkar, B. R. | - |
dc.date.accessioned | 2019-07-12T06:38:06Z | - |
dc.date.available | 2019-07-12T06:38:06Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | Tiwari, Ashish Kumar., Basavaraju, T. G., & Chandavarkar, B. R. (2010). Congestion adaptive routing in Wireless Mesh Networks. International conference on wireless and optical communications networks, 1-5. | en_US |
dc.identifier.other | 10.1109/WOCN.2010.5587362 | - |
dc.identifier.uri | http://13.232.72.61:8080/jspui/handle/123456789/2378 | - |
dc.description.abstract | The main reason for packet loss in Wireless Mesh Networks (WMNs) is due to congestion. Presently, routing in WMNs is not congestion-adaptive. Routing may let a congestion happen which is detected by congestion control. The way in which the congestion is handled results in longer delay and more packet loss and requires significant overhead if a new route is needed. Hence, we propose a congestion adaptive routing protocol (CARP) for WMNs with such properties. Our ns-2 simulation results confirm that CARP can successfully achieve a high packet delivery ratio with lower routing overhead and latency in WMNs | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Wireless Mesh Networks | en_US |
dc.subject | Routing Protocols | en_US |
dc.subject | Congestion Adaptivity | en_US |
dc.title | Congestion Adaptive Routing in Wireless Mesh Networks. | en_US |
dc.type | Article | en_US |
Appears in Collections: | Faculty Publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Congestion Adaptive Routing in Wireless Mesh Networks.pdf | 195.32 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.