Capacity-Aware Routing with Hop-Count Constraint and Its Adaptivity

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 521
  • Download : 0
In multi-hop wireless networks, the shorter transmission range of a single hop provides the higher capacity of communication with the increased hop count. Thus, capacity-aware routing generates routes with large hop counts, which incurs long processing delay and lower reliability. In this paper, we propose capacity-aware routing with hop-count constraint (CAR-HCC). It ensures capacity-aware routes but not to exceed the specified number of hops. The guaranteed maximum number of hops of a route bounds processing delay of the route and reliability loss. We propose CAR-HCC algorithm, which generates optimal capacity routes given hop-count constraint, with a polynomial time complexity. Moreover, we propose sub-optimal on-demand routing scheme which can be used as an extension of popular reactive routing. Then, for soft real-time applications, adaptive CAR-HCC is also proposed as a trade-off between capacity and deadline property. The simulation results show that CAR-HCC generates capacity-aware route providing reasonable delay.
Publisher
INT INFORMATION INST
Issue Date
2009-07
Language
English
Article Type
Article
Citation

INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, v.12, pp.827 - 838

ISSN
1343-4500
URI
http://hdl.handle.net/10203/96002
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0