Probability based routing for Ad Hoc networks in a building

Ad Hoc networks are gaining popularity day by day and their presence is expanding into every field, soon they will be part of our day to day life. In the proposed method, a scenario of an office building is taken with 'n' nodes and 'm' floors. A routing algorithm is proposed for the above scenario taking into consideration, the probabilities of each node to be present on a particular floor. The routing algorithm is thus dynamic in nature and also proves to be efficient even in case of nodes moving to different floors. The aim is to optimize the number of data transfers between various nodes while sending the data from source to the destination.