Improved RTS-CTS algorithm to solve mobile hidden station problem in MANET

This paper provides a new algorithm to solve mobile hidden station problem in MANET (Mobile Ad Hoc Network). As is known, mobile hidden station problem is very common in MANET and degrades the network throughput severely. MANET realizes the space diversity by choosing a cluster-head (relay node) and allocating its member nodes. Cluster-heads has a good quality among member nodes. When mobile hidden station enter a cluster where its cluster-head is communicating with one of member nodes, collision happens and the data frames that have been transmitted must be given up and seen as invalid. In this condition, the cluster-head has no ability to find out the interference and this causes a great waste of MANET resource. In order to solve mobile hidden station problem in MANET, provide a new algorithm called Improved RTS-CTS algorithm, which improves network performance (throughput and collision rate) compared with the original RTS-CTS algorithm.