Capability aware routing algorithm for Mobile Ad-Hoc Network in workplace
Sarbani Roy, Dhrubajyoti Chatterjee, Nandini Mukherjee · 2008
In the present scenario, mobile communication is being widely used in the areas where infrastructure-based telecommunication systems are unavailable or to deploy one is not cost effective. However, often users suffer due to the fact that mobile devices have very low computational capability and thus are incapable of executing many applications with higher resource requirements. In a mobile adhoc network (MANET) environment, when a node (a mobile device) is unable to accomplish a job, the job may be transferred to other nodes, which can fulfill its requirements in terms of resources. In ad-hoc network-based environments, such nodes should be found on demand, i.e. an algorithm should reach every node and match the requirements of a job with the capability of each node. Movements of the nodes result in change of routes, requiring some mechanism to determine the routes to such node every time a job is submitted. This paper particularly emphasizes on the potentials of using PDAs or laptops of users within an office or in a meeting place. Users can submit their job requirements and then the request will pass through the MANET in order to search for a suitable node that would be able to respond back to the user. This paper proposes a capability aware ad-hoc routing algorithm (CAODV) for using in such scenario. CAODV gathers information regarding the capability of a node during route discovery and uses this information in selecting the node and the best route to that node. A modification of this algorithm to reduce the search for already searched routes is also presented in this paper.