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.
| Original language | English |
|---|---|
| Pages (from-to) | 34-39 |
| Number of pages | 6 |
| Journal | Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University |
| Volume | 38 |
| Issue number | 5 |
| DOIs | |
| State | Published - Oct 2011 |
Keywords
- Cooperative communication
- Cooperative routing
- Mobile Ad Hoc networks
- Relay selection
Fingerprint
Dive into the research topics of 'Distributed cooperative routing algorithm for mobile Ad Hoc networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver