Range grouping for routing in dynamic networks

Abstract

Most of the networks that we see in our day to day lives today are types of dynamic networks i.e. networks which keep on changing in very short period of time. One example of such a network is the network formed by Bluetooth connectivity. Due to limited range of wireless trans-receivers, a mobile node can communicate with the mobile nodes that lie within its range. Hence, in order to communicate with nodes in far-off regions, forwarding of data have to be done. Our methodology is based on this concept. Our proposition will first apply an algorithm to cluster the existing nodes in two types of clusters called INTER and INTRA clusters and then perform routing with the help of routing algorithm as proposed by us. The information regarding change in topology is maintained in the form of lists [data structure] which helps in routing the data effectively. © 2012 Springer-Verlag.