Cross-Layer Congestion Control in Wireless Ad Hoc Network

Abstract

Congestion control is a critical issue in mobile ad-hoc networks. This paper reflects a cooperatively ideal strategy of cross-layer congestion control, routing and setting up ad hoc wireless networks. We first calculate the degree check and scheduling check using multi-commodity flowing variables and calculate reserve sharing in networks with secure wireless channels as a service expansion issue with these controls. By dual corrosion, the reserve sharing problem naturally decomposes into three sub-issues: congestion control, routing, and scheduling that interact through congestion price. The overall junction property of this procedure is demonstrated. We next prolong the dual system to handle networks with time-varying channels and adaptive multi-proportion devices. The constancy of this resultant system is traditional, and its performance is characterized by an ideal position system which has the best feasible proportion state at the link layer. We then take a broad view the results mentioned above of an overall model of queueing network served by a set of interdependent parallel servers with time-varying service abilities, which models many design issues in communication networks. We show that for a curved optimization issue where a subset of variables lies in a polytope and the rest in a curved set, the dual-based procedure remains stable and optimum when the check set is modulated by an irreducible finite-state Markov series. This paper so offering a step toward a systematic way to carry out the cross-layer design by “Layering as optimization corrosion” for time-varying channel models.