{"title":"MaxMin Share Based Medium Access for Attaining Fairness and Channel Utilization in Mobile Adhoc Networks","authors":"P. Priakanth, P. Thangaraj","country":null,"institution":"","volume":35,"journal":"International Journal of Electronics and Communication Engineering","pagesStart":2138,"pagesEnd":2144,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/2540","abstract":"Due to the complex network architecture, the mobile\r\nadhoc network-s multihop feature gives additional problems to the\r\nusers. When the traffic load at each node gets increased, the\r\nadditional contention due its traffic pattern might cause the nodes\r\nwhich are close to destination to starve the nodes more away from the\r\ndestination and also the capacity of network is unable to satisfy the\r\ntotal user-s demand which results in an unfairness problem. In this\r\npaper, we propose to create an algorithm to compute the optimal\r\nMAC-layer bandwidth assigned to each flow in the network. The\r\nbottleneck links contention area determines the fair time share which\r\nis necessary to calculate the maximum allowed transmission rate used\r\nby each flow. To completely utilize the network resources, we\r\ncompute two optimal rates namely, the maximum fair share and\r\nminimum fair share. We use the maximum fair share achieved in\r\norder to limit the input rate of those flows which crosses the\r\nbottleneck links contention area when the flows that are not allocated\r\nto the optimal transmission rate and calculate the following highest\r\nfair share. Through simulation results, we show that the proposed\r\nprotocol achieves improved fair share and throughput with reduced\r\ndelay.","references":null,"publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 35, 2009"}