ROMAN: Routing and opportunistic management of airborne networks

Most of the routing and replication algorithms for Mobile Peer to Peer (M-P2P) networks assume the network to be large and therefore, the architecture and algorithms are designed to be scalable. These algorithms however may not perform well with limited number of nodes in a network such as of UAVs. Thus, it is better to design algorithms to increase the efficiency of a small network if scalability is no longer an issue. For such small networks, we design and simulate an effective two layered graph based routing algorithm using store/forward concept. We also take into account UAVs orientation and configuration of radio communication hardware equipped with UAVs. Our routing algorithm provides good average connectivity in the network even while they are mobile. We use a single copy replication to increase the availability of data for distributed query processing. Our system has a network layer and application layer; both of which are integrated to provide better efficiency. We report performance results based on simulations by comparing reach-ability, path efficiency, availability and average connectivity.