A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
AO2P: Ad Hoc On-Demand Position-Based Private Routing Protocol
IEEE Transactions on Mobile Computing
On-demand loop-free routing with link vectors
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
With the increase in size and application are of the communication network, more attention has been paid to the invulnerability of mobile ad hoc network. By analyzing the working mechanism and key techniques of the Ad Hoc Qos routing models, the searching for the most optimal routing is NP-hard problem. There is only sub-optimal routing available because of the rather high complexity of the algorithm. This paper analysis the Qos parameters firstly, then build the quantum multi-programming model considering the link distance, node power and time delay to choose the optimal route to transmit the data effetely. Simulations and comparisons with some typical route algorithms show that our algorithm is robust and effective.