Non-dominated quantum iterative routing optimization for wireless multihop networks
Routing in Wireless Multihop Networks (WMHNs) relies on a delicate balance of diverse and often conflicting parameters, when aiming for maximizing the WMHN performance. Classified as a Non-deterministic Polynomial-time hard problem (NP-hard), routing in WMHNs requires sophisticated methods. As a ben...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2015-09-15.
|
| Subjects: | |
| Online Access: | Get fulltext |