Research of Congestion in Ad Hoc Networks Based on Cross-Layer Cooperative Processing

Specific to the frequent congestion problems for Ad-Hoc Networks, using the idea of cross-layer design, combined with the principle of node cooperation, integrating the directed graph theory in the local route selection, presents a mechanism of pseudo directed path graph to solve the congestion problems in Ad-Hoc Networks. Selecting the best local cooperative node by adding trust level in the cooperative nodes, achieves the purpose of rapidly completing the partial path reconstruction. Through simulation experiments, the protection of congested nodes in Ad-Hoc Networks, by pseudo directed path graph, can alleviate the load pressure of the congestion node effectively, improve the network´s end-to-end throughput greatly, thereby, enhance the service quality for the entire network.