Advanced Search
Volume 29 Issue 5
Jan.  2011
Turn off MathJax
Article Contents
Chen Chen, Pei Chang-xing, Guo Nan, Chen Nan, Yi Yun-hui. ARBFAM: Ad hoc Routing Based on Fame, Available Bandwidth and Minimum Hops[J]. Journal of Electronics & Information Technology, 2007, 29(5): 1206-1210. doi: 10.3724/SP.J.1146.2006.00081
Citation: Chen Chen, Pei Chang-xing, Guo Nan, Chen Nan, Yi Yun-hui. ARBFAM: Ad hoc Routing Based on Fame, Available Bandwidth and Minimum Hops[J]. Journal of Electronics & Information Technology, 2007, 29(5): 1206-1210. doi: 10.3724/SP.J.1146.2006.00081

ARBFAM: Ad hoc Routing Based on Fame, Available Bandwidth and Minimum Hops

doi: 10.3724/SP.J.1146.2006.00081
  • Received Date: 2006-01-16
  • Rev Recd Date: 2006-10-08
  • Publish Date: 2007-05-19
  • Based on the analysis of the communication status in real life Ad hoc networks, a new metric, which utilizes fame, available bandwidth and minimum hops, is presented in order to overcome the node selfishness and drawbacks of min-hop routing selection method. Through cross layer design on MAC and network layer, a novel routing protocol, ARBFAM(Ad hoc Routing Based on Fame, Available Bandwidth and Minimum Hops ), which employs the new metric is given in this paper. Simulation results show, compared with DSR, fairness between nodes is improved and congestion control and load balance is implemented by using ARBFAM. At the same time, average life-span and end-to-end throughput is increased, whereas average end-to-end delay is decreased.
  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (3050) PDF downloads(785) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return