|
|
|
| ARBFAM: Ad hoc Routing Based on Fame, Available Bandwidth and Minimum Hops |
| Chen Chen; Pei Chang-xing; Guo Nan; Chen Nan; Yi Yun-hui |
| National Key Lab. of Integrated Service Networks, Xidian Univ., Xi’an 710071, China |
|
|
|
|
Abstract 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.
|
|
Received: 16 January 2006
|
|
|
|
|
|
|
|
|
2007, Vol. 29 
