J4 ›› 2011, Vol. 38 ›› Issue (5): 34-39.doi: 10.3969/j.issn.1001-2400.2011.05.006

• Original Articles • Previous Articles     Next Articles

Distributed cooperative routing algorithm for mobile Ad Hoc networks

ZHANG Wansheng1;LIU Kai1;WANG Li1,2
  

  1. (1. School of Elec. and Info. Engineering, Beihang Univ., Beijing  100191, China;
    2. Flight Inspection Center, General Administration of Civil Aviation of China, Beijing  101312, China)
  • Received:2010-10-09 Online:2011-10-20 Published:2012-01-14
  • Contact: ZHANG Wansheng E-mail:zhangws@ee.buaa.edu.cn

Abstract:

A distributed throughput-optimized cooperative routing (TOCR) algorithm is proposed to improve network throughput in the mobile Ad Hoc network. Through theoretical analysis, by means of a cooperative relay, the received signal-to-noise ratio (SNR) at a recipient node can be increased, and then the probability of successful packet reception and link throughput are increased. Based on the adaptive forwarding cluster routing (AFCR) algorithm, the TOCR algorithm constructs cooperative links with maximum throughput on a route hop by hop, and finally establishes the route with the maximum throughput from the source node to the destination node. Simulation results show that compared with the noncooperative routing algorithm, the proposed algorithm can obviously improve network throughput, especially in the presence of low transmission power and a large number of nodes.

Key words: mobile Ad Hoc networks, cooperative routing, cooperative communication, relay selection

CLC Number: 

  • TN915.04

Baidu
map