An Efficient Method to Avoid Hidden Node Problem in Ad-Hoc Network

Abstract

An ad hoc network consists of various mobile nodes which are not physicals connected to each other. Ad-hoc network is temporary based network which does not rely on the infrastructure that is it is decentralized kind of network.[1] In such network, nodes communicate each other by sending data from one node to another in multi-hop mode[2]. Multi hop refer to the state when one node communicate with its immediate node and the data has to travel through many intermediate nodes from source to destination. Generally there are two problems associated with communication one is hidden node problem other one is exposed node problem. In general scenario when two nodes send data to the same node at same then collision occurs at that node, This is known as hidden node problem.[3] Hidden node problem can be avoided by RTS/CTS mechanism.[4] To make data secure from collision i.e to prevent hidden node problem and also to reduce delay time that occurs when nodes goes to waiting state during RTS/CTS handshake if the communication occurs before the CTS timer, integrating the concept of RTR with RTS/CTS. Apart from the introduction of RTR, in this paper there are other parameters such as data size and distance preference which will further help to define the priorities for the transfer of data.