Non-Dominated Quantum Iterative Routing Optimization for Wireless Multihop Networks

IEEE Access

Volumn 3, Issue , 2015, Pages 1704-1728

  Alanis, Dimitrios ^a   Botsinis, Panagiotis ^a   Babar, Zunaira ^a   Ng, Soon Xin ^a   Hanzo, Lajos ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

BBHT QSA; DHA; NDQO; Pareto Optimality; Quantum Computing; WMHNs

Indexed keywords

ALGORITHMS; COMPLEX NETWORKS; ITERATIVE METHODS; MULTIOBJECTIVE OPTIMIZATION; NETWORK ROUTING; PARETO PRINCIPLE; POLYNOMIAL APPROXIMATION; QUANTUM COMPUTERS; WIRELESS AD HOC NETWORKS; WIRELESS NETWORKS;

BBHT-QSA; DHA; NDQO; PARETO-OPTIMALITY; QUANTUM COMPUTING; WMHNS;

COMPUTATIONAL COMPLEXITY;

EID: 84959853149     PISSN: None     EISSN: 21693536     Source Type: Journal    
DOI: 10.1109/ACCESS.2015.2478793     Document Type: Article

References (62)

1. B. Alawieh, Y. Zhang, C. Assi, and H. Mouftah, "Improving spatial reuse in multihop wireless networks-A survey," IEEE Commun. Surveys Tuts., vol. 11, no. 3, pp. 71-91, Aug. 2009.
2. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A survey on sensor networks," IEEE Commun. Mag., vol. 40, no. 8, pp. 102-114, Aug. 2002.
3. X. Hong, K. Xu, and M. Gerla, "Scalable routing protocols for mobile ad hoc networks," IEEE Netw., vol. 16, no. 4, pp. 11-21, Jul. 2002.
4. S. Galli, A. Scaglione, and Z. Wang, "For the grid and through the grid: The role of power line communications in the smart grid," Proc. IEEE, vol. 99, no. 6, pp. 998-1027, Jun. 2011.
5. D. Alanis, P. Botsinis, S. X. Ng, and L. Hanzo, "Quantum-assisted routing optimization for self-organizing networks," IEEE Access, vol. 2, pp. 614-632, 2014.
6. X. Zhu, L. Shen, and T.-S. P. Yum, "Hausdorff clustering and minimum energy routing for wireless sensor networks," IEEE Trans. Veh. Technol., vol. 58, no. 2, pp. 990-997, Feb. 2009.
7. M. Chen, V. C. M. Leung, S. Mao, Y. Xiao, and I. Chlamtac, "Hybrid geographic routing for-exible energy-Delay tradeoff," IEEE Trans. Veh. Technol., vol. 58, no. 9, pp. 4976-4988, Nov. 2009.
8. A. E. A. A. Abdulla, H. Nishiyama, J. Yang, N. Ansari, and N. Kato, "HYMN: A novel hybrid multi-hop routing algorithm to improve the longevity of WSNs," IEEE Trans. Wireless Commun., vol. 11, no. 7, pp. 2531-2541, Jul. 2012.
9. M. Al-Rabayah and R. Malaney, "A new scalable hybrid routing protocol for VANETs," IEEE Trans. Veh. Technol., vol. 61, no. 6, pp. 2625-2635, Jul. 2012.
10. F. Hoffmann, D. Medina, and A. Wolisz, "Joint routing and scheduling in mobile aeronautical ad hoc networks," IEEE Trans. Veh. Technol., vol. 62, no. 6, pp. 2700-2712, Jul. 2013.
11. H. Li, L. Lai, and H. V. Poor, "Multicast routing for decentralized control of cyber physical systems with an application in smart grid," IEEE J. Sel. Areas Commun., vol. 30, no. 6, pp. 1097-1107, Jul. 2012.
12. G. A. Shah, V. C. Gungor, and O. B. Akan, "A cross-layer QoS-aware communication framework in cognitive radio sensor networks for smart grid applications," IEEE Trans. Ind. Informat., vol. 9, no. 3, pp. 1477-1485, Aug. 2013.
13. S. Canale, A. Di Giorgio, A. Lanna, A. Mercurio, M. Pan-li, and A. Pietrabissa, "Optimal planning and routing in medium voltage PowerLine communications networks," IEEE Trans. Smart Grid, vol. 4, no. 2, pp. 711-719, Jun. 2013.
14. H. Yetgin, K. T. K. Cheung, M. El-Hajjar, and L. Hanzo, "Cross-layer network lifetime optimisation considering transmit and signal processing power in wireless sensor networks," IETWireless Sensor Syst., vol. 4, no. 4, pp. 176-182, Dec. 2014.
15. H. Yetgin, K. T. K. Cheung, M. El-Hajjar, and L. Hanzo, "Cross-layer network lifetime maximization in interference-limited WSNs," IEEE Trans. Veh. Technol., vol. 64, no. 8, pp. 3795-3803, Aug. 2015.
16. D. P. Huttenlocher, G. A. Klanderman, and W. J. Rucklidge, "Comparing images using the Hausdorff distance," IEEE Trans. Pattern Anal. Mach. Intell., vol. 15, no. 9, pp. 850-863, Sep. 1993.
17. E. Sakhaee and A. Jamalipour, "The global in--ight Internet," IEEE J. Sel. Areas Commun., vol. 24, no. 9, pp. 1748-1757, Sep. 2006.
18. L. Davis, Handbook of Genetic Algorithms. New York, NY, USA: Van Nostrand Reinhold, 1991.
19. K. Deb, "Multi-objective optimization," in Search Methodologies, E. K. Burke and G. Kendall, Eds. New York, NY, USA: Springer-Verlag, 2005, pp. 273-316. [Online]. Available: http://dx.doi.org/10.1007/ 0-387-28356-0-10
20. H. Yetgin, K. T. K. Cheung, and L. Hanzo, "Multi-objective routing optimization using evolutionary algorithms," in Proc. IEEEWireless Commun. Netw. Conf. (WCNC), Apr. 2012, pp. 3030-3034.
21. M. Camelo, C. Omaa, and H. Castro, "QoS routing algorithm based on multi-objective optimization for wireless mesh networks," in Proc. IEEE Latin-Amer. Conf. Commun. (LATINCOM), Sep. 2010, pp. 1-6.
22. F. V. C. Martins, E. G. Carrano, E. F. Wanner, R. H. C. Takahashi, and G. R. Mateus, "A hybrid multiobjective evolutionary approach for improving the performance of wireless sensor networks," IEEE Sensors J., vol. 11, no. 3, pp. 545-554, Mar. 2011.
23. E. Masazade, R. Rajagopalan, P. K. Varshney, C. K. Mohan, G. K. Sendur, and M. Keskinoz, "A multiobjective optimization approach to obtain decision thresholds for distributed detection in wireless sensor networks," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 40, no. 2, pp. 444-457, Apr. 2010.
24. R. P. Feynman, "Simulating physics with computers," Int. J. Theoretical Phys., vol. 21, no. 6, pp. 467-488, Jun. 1982.
25. P. Benioff, "Quantum mechanical hamiltonian models of Turing machines," J. Statist. Phys., vol. 29, no. 3, pp. 515-546, Nov. 1982. [Online]. Available: http://dx.doi.org/10.1007/BF01342185
26. D. Deutsch, "Quantum theory, the Church-Turing principle and the universal quantum computer," Proc. R. Soc. Lond. A, Math. Phys. Sci., vol. 400, no. 1818, pp. 97-117, Jul. 1985.
27. D. Deutsch and R. Jozsa, "Rapid solution of problems by quantum computation," Proc. R. Soc. Lond. A, Math. Phys. Sci., vol. 439, no. 1907, pp. 553-558, Dec. 1992.
28. L. K. Grover, "A fast quantum mechanical algorithm for database search," in Proc. 28th Annu. ACM Symp. Theory Comput., 1996, pp. 212-219.
29. M. Boyer, G. Brassard, P. Høyer, and A. Tapp. (1996). "Tight bounds on quantum searching." [Online]. Available: http://arxiv.org/abs/ quant-ph/9605034
30. C. Durr and P. Høyer. (1996). "A quantum algorithm for-nding the minimum," [Online]. Available: http://arxiv.org/abs/quant-ph/9607014
31. P. W. Shor, "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer," SIAM J. Comput., vol. 26, no. 5, pp. 1484-1509, 1997.
32. R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca, "Quantum algorithms revisited," Proc. R. Soc. Lond. A, Math. Phys. Sci., vol. 454, no. 1969, pp. 339-354, Jan. 1998.
33. G. Brassard, P. Høyer, and A. Tapp, "Quantum counting," in Automata, Languages and Programming. New York, NY, USA: Springer-Verlag, 1998, pp. 820-831.
34. G. Brassard, P. Høyer, M. Mosca, and A. Tapp. (2000). "Quantum amplitude ampli-cation and estimation." [Online]. Available: http://arxiv.org/abs/quant-ph/0005055
35. A. Malossini, E. Blanzieri, and T. Calarco, "Quantum genetic optimization," IEEE Trans. Evol. Comput., vol. 12, no. 2, pp. 231-241, Apr. 2008.
36. G. Brassard, F. Dupuis, S. Gambs, and A. Tapp. (2011). "An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance." [Online]. Available: http://arxiv.org/abs/1106.4267
37. Z. Babar, S. X. Ng, and L. Hanzo, "Near-capacity code design for entanglement-assisted classical communication over quantum depolarizing channels," IEEE Trans. Commun., vol. 61, no. 12, pp. 4801-4807, Dec. 2013.
38. Z. Babar, S. X. Ng, and L. Hanzo, "EXIT-chart-aided near-capacity quantum turbo code design," IEEE Trans. Veh. Technol., vol. 64, no. 3, pp. 866-875, Mar. 2014.
39. Z. Babar, P. Botsinis, D. Alanis, S. X. Ng, and L. Hanzo, "The road from classical to quantum codes: A hashing bound approaching design procedure," IEEE Access, vol. 3, pp. 146-176, 2015.
40. S. Imre and F. Balazs, Quantum Computing and Communications: An Engineering Approach. New York, NY, USA: Wiley, 2005.
41. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information. Cambridge, U.K.: Cambridge Univ. Press, 2010.
42. C. Zalka, "Grover's quantum searching algorithm is optimal," Phys. Rev. A, vol. 60, no. 4, pp. 2746-2751, Oct. 1999.
43. G. Syswerda, "A study of reproduction in generational and steady state genetic algorithms," Found. Genet. Algorithms, vol. 2, pp. 94-101, 1991.
44. J. Chiaverini et al., "Implementation of the semiclassical quantum Fourier transform in a scalable system," Science, vol. 308, no. 5724, pp. 997-1000, May 2005.
45. P. Botsinis, S. X. Ng, and L. Hanzo, "Quantum search algorithms, quantum wireless, and a low-complexity maximum likelihood iterative quantum multi-user detector design," IEEE Access, vol. 1, pp. 94-122, 2013.
46. P. Botsinis, S. X. Ng, and L. Hanzo, "Fixed-complexity quantum-assisted multi-user detection for CDMA and SDMA," IEEE Trans. Commun., vol. 62, no. 3, pp. 990-1000, Mar. 2014.
47. P. Botsinis, D. Alanis, S. X. Ng, and L. Hanzo, "Low-complexity softoutput quantum-assisted multiuser detection for direct-sequence spreading and slowsubcarrier-hopping aided SDMA-OFDM systems," IEEE Access, vol. 2, pp. 451-472, 2014.
48. P. Botsinis, D. Alanis, Z. Babar, S. X. Ng, and L. Hanzo, "Iterative quantum-assisted multi-user detection for multi-carrier interleave division multiple access systems," IEEE Trans. Commun., to be published.
49. P. Botsinis, D. Alanis, Z. Babar, S. X. Ng, and L. Hanzo, "Noncoherent quantum multiple symbol differential detection for wireless systems," IEEE Access, vol. 3, pp. 569-598, 2015.
50. Y. Han, D. M. Ancajas, K. Chakraborty, and S. Roy, "Exploring high-throughput computing paradigm for global routing," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 22, no. 1, pp. 155-167, Jan. 2014.
51. S. Mu, X. Zhang, N. Zhang, J. Lu, Y. S. Deng, and S. Zhang, "IP routing processing with graphic processors," in Proc. Design, Autom. Test Eur. Conf. Exhibit. (DATE), Mar. 2010, pp. 93-98.
52. J. Zhao, X. Zhang, X. Wang, Y. Deng, and X. Fu, "Exploiting graphics processors for high-performance IP lookup in software routers," in Proc. IEEE INFOCOM, Apr. 2011, pp. 301-305.
53. R. Mangharam and A. A. Saba, "Anytime algorithms for GPU architectures," in Proc. IEEE 32nd Real-Time Syst. Symp. (RTSS), Nov. 2011, pp. 47-56.
54. A. Uchida, Y. Ito, and K. Nakano, "An ef-cient GPU implementation of ant colony optimization for the traveling salesman problem," in Proc. 3rd Int. Conf. Netw. Comput. (ICNC), Dec. 2012, pp. 94-102.
55. U. Cekmez, M. Ozsiginan, and O. K. Sahingoz, "Adapting the GA approach to solve traveling salesman problems on CUDA architecture," in Proc. IEEE 14th Int. Symp. Comput. Intell. Informat. (CINTI), Nov. 2013, pp. 423-428.
56. T. Mohsenin, D. N. Truong, and B. M. Baas, "A low-complexity messagepassing algorithm for reduced routing congestion in LDPC decoders," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 57, no. 5, pp. 1048-1061, May 2010.
57. J. D. Owens, M. Houston, D. Luebke, S. Green, J. E. Stone, and J. C. Phillips, "GPU computing," Proc. IEEE, vol. 96, no. 5, pp. 879-899, May 2008.
58. J. D. Owens et al., "A survey of general-purpose computation on graphics hardware," Comput. Graph. Forum, vol. 26, no. 1, pp. 80-113, Mar. 2007.
59. L. L. Hanzo, S. X. Ng, W. Webb, and T. Keller, Quadrature Amplitude Modulation: From Basics to Adaptive Trellis-Coded, Turbo-Equalised and Space-Time Coded OFDM, CDMA and MC-CDMA Systems. New York, NY, USA: Wiley, 2004.
60. M. Salem et al., "An overview of radio resource management in relay-enhanced OFDMA-based networks," IEEE Commun. Surveys Tuts., vol. 12, no. 3, pp. 422-438, Aug. 2010.
61. S. Imre and L. Gyongyosi, Advanced Quantum Communications: An Engineering Approach. New York, NY, USA: Wiley, 2013.
62. M. Saeedi and M. Pedram, "Linear-depth quantum circuits for n-qubit Toffoli gates with no ancilla," Phys. Rev. A, vol. 87, no. 6, p. 062318, Jun. 2013.