BALANCING THROUGHPUT AND FAIRNESS FOR CONCURRENT FLOWS BASED ON PER FLOW SCHEDULING IN AD HOC NETWORKS

Perumal Ganeshkumar and Kuppusamy Thyagarajah

Keywords

Transmission control protocol, ATP, ad hoc network, rate estimation

Abstract

The focus of this paper is to present an efficient scheduling mechanism for the queue maintained by an intermediate node of a reliable transport protocol for ad hoc network (ATP) [K. Sundaresan, V. Anantharaman, H.-Y. Hsieh & R. Sivakumar, ATP: A reliable transport Protocol for ad hoc networks, IEEE Transactions on Mobile Computing, 4(6), 2005, 588–603]. In this regard, investigation is done to find out the problems experienced by the ATP flow due to the maintenance of Qt (queuing delay) and Tt (transmission delay) on per node basis. To overcome the drawback of the identified problem, a new approach which maintains Qt and Tt on per flow basis called per flow rate–based transport protocol (PFRTP) is suggested. In PFRTP, research is done to maintain state on per flow basis rather than on per node basis. Using ns 2 simulator, the performance of PFRTP and ATP is compared. It is shown that considerable performance improvement is obtained in terms of fairness ratio.

Important Links:



Go Back