文摘
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.