Organized topology based routing protocol in incompletely predictable ad-hoc networks

We define the incompletely predictable ad-hoc networks, which has no need for nodes to move or whose nodes move in a very limited area around the basic position that has been initially settled at.We construct Static Organized Topology (S-OT) Model and Dynamic Organized Topology (D-OT) Model for the incompletely predictable ad-hoc networks.Static Organized Topology Based Routing using Anti-Pheromone (APS-OTBR) is designed on the basis of "anti-pheromone".Combined with greedy algorithm, Dynamic Organized Topology Based Routing using Greedy Algorithm (GrD-OTBR) is proposed to adapt the environment described by D-OT.Our simulation shows that APS-OTBR has a reasonable node utilization frequency, and GrD-OTBR has a stable performance when network size changes and performs better in a relatively small size of the network. Nowadays, ad-hoc networks are becoming increasingly popular and has been put into practice in many kinds of applications. However, in some environments, such as ground temperature monitoring or medical and health care, the traditional routing protocols are not proper, due to the fact that the topologies of these networks are relatively stable in a very long period. Such networks are defined as the incompletely predictable network. Nodes in such networks move only in a limited range from the basic positions which are initiated at the very beginning. In this paper, we propose a new protocol named Organized Topology Based Routing (OTBR) to adapt to the environments mentioned above. It is worth noting that the concept of Organized Topology (OT) can be divided into two different situations: one is called the Static Organized Topology (S-OT) and the other is called the Dynamic Organized Topology (D-OT). Moreover, a new concept named ``anti-pheromone'' is put forward to achieve high energy efficiency. In particular, a Static Organized Topology Based Routing using Anti-Pheromone (APS-OTBR) is presented on the basis of the characteristic of S-OT. In addition, according to the feature of D-OT, Dynamic Organized Topology Based Routing using Greedy Algorithm (GrD-OTBR) is proposed. Simulation results show that APS-OTBR has proper utilization ratio of nodes to achieve energy efficient, and GrD-OTBR has a stable performance when network size changes. Last but not least, to achieve higher node utilization, a new concept of equilateral triangle topology is proposed.