Design of New Scheduling Algorithm for Ad hoc Networks with Capability of Differential Service

Wireless networking and multimedia contents are two rapidly emerging technological trends. From among which ad-hoc networks can be mentioned With the development of ad-hoc networks, we can anticipate the extensive of the multimedia application in personal networks or other collaborative scenarios. Ad-hoc network is also mainly constrained the bandwidth. Propose of scheduling in this research is to service the flows by both selecting the fixed or minimally mobile nodes that provide network backbone access and dynamically adopting the contention window size of flows. This model is robust to mobility and variances in channel capacity and imposes no control message overhead on the network, in calculating CW size, attenting to collision rate and flow´s current QoS.