In multihop wireless networks, fair allocation of bandwidth among different nodes is one of the critical problems. Although there is a significant research on the fairness issues in single-hop wireless networks, research on multihop fairness is rarely found in the literature. A user node in a multi-hop network has to transmit both relayed and its own traffic. Therefore, besides the contention with other nodes for the same destination, there is an inevitable contention between its own and relayed traffic in the network layer. Accordingly, a mechanism for fair data flow scheduling in a node is needed. In this thesis, a scheduling algorithm is proposed which is trying to allocate node's bandwidth fairly between different contention traffic flows. The main purpose of this algorithm, named HBPQ (History Based Priority Queuing) is the prevention of starvation occurance for any active flow in network. At the other hand, HBPQ tries to bring close together the satisfaction of users. HBPQ uses a satisfaction function to measure the user's gratifications. If HBPQ is used for flow scheduling in multihop wireless ad-hoc networks, the simulation results show that each active network's flow, receives a throughput proportional to distance between its source and destination.
