How to select optimal gateway in multi-domain wireless networks: Alternative solutions without learning

IEEE Transactions on Wireless Communications

Volumn 12, Issue 11, 2013, Pages 5620-5630

  Zhong, Sheng ^a   Zhang, Yuan ^a  

^a NANJING UNIVERSITY   (China)

Author keywords

Gateway selection; Multi domain networks; Optimization

Indexed keywords

EID: 84895059023     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2013.100113.121828     Document Type: Article

References (28)

1. F. Li, Y. Wang, and X.-Y. Li, "Gateway placement for throughput optimization in wireless mesh networks," in Proc. 2007 IEEE ICC, pp. 4955-4960.
2. X. Xu, S. Tang, X. Mao, and X.-Y. Li, "Distributed gateway placement for cost minimization in wireless mesh networks," in Proc. 2010 IEEE ICDCS, pp. 507-515.
3. T. He, K.-W. Lee, N. Sofra, and K. K. Leung, "Utility-based gateway deployment for supporting multi-domain dtns," in Proc. 2010 IEEE SECON, pp. 341-349.
4. Y. Song, S. H. Y. Wong, and K.-W. Lee, "Optimal gateway selection in multi-domain wireless networks: a potential game perspective," in Proc. 2011 ACM MOBICOM, P. Ramanathan, T. Nandagopal, and B. N. Levine, Eds., pp. 325-336.
5. C.-K. Chau, J. Crowcroft, K.-W. Lee, and S. H. Wong, "Inter-domain routing for mobile ad hoc networks," in Proc. 2008 ACM International Workshop on Mobility in the Evolving Internet Architecture, pp. 61-66. Available: http://doi.acm.org.gate.lib.buffalo.edu/10.1145/1403007.1403022
6. U. Ashraf, S. Abdellatif, and G. Juanole, "Gateway selection in back-bone wireless mesh networks," in Proc. 2009 IEEE WCNC, pp. 2548-2553.
7. Y. Zhao, J. Wu, F. Li, and S. Lu, "VBS: maximum lifetime sleep scheduling for wireless sensor networks using virtual backbones," in Proc. 2010 IEEE INFOCOM, pp. 1-5.
8. A. Durresi, M. Durresi, and L. Barolli, "Heterogeneous multi domain network architecture for military communications," in Proc. 2009 IEEE CISIS, L. Barolli, F. Xhafa, and H.-H. Hsu, Eds., pp. 382-387.
9. R. Agrawal and R. Srikant, "Privacy-preserving data mining," in Proc. 2000 ACM SIGMOD Conference, W. Chen, J. F. Naughton, and P. A. Bernstein, Eds., pp. 439-450.
10. W. Du and M. J. Atallah, "Privacy-preserving cooperative statistical analysis," in Proc. 2001 IEEE ACSAC, pp. 102-110.
11. D. Agrawal and C. C. Aggarwal, "On the design and quantification of privacy preserving data mining algorithms," in Proc. 2001 ACM PODS, P. Buneman, Ed.
12. H. Kargupta, S. Datta, Q. Wang, and K. Sivakumar, "On the privacy preserving properties of random data perturbation techniques," in Proc. 2003 IEEE ICDM, pp. 99-106.
13. V. Estivill-Castro and L. Brankovic, "Data swapping: balancing privacy against precision in mining for logic rules," in Proc. 1999 Springer DaWaK, ser. Lecture Notes in Computer Science, M. K. Mohania and A. M. Tjoa, Eds., vol. 1676, pp. 389-398.
14. E. Royer and C. Toh, "A review of current routing protocols for ad hoc mobile wireless networks," IEEE Pers. Commun., vol. 6, no. 2, pp. 46-55, 1999.
15. Q. Liu, M. A. Kok, N. Ghani, V. M. Muthalaly, and M. Wang, "Hierarchical inter-domain routing in optical dwdm networks," in Proc. 2006 IEEE INFOCOM..
16. C. Chau, J. Crowcroft, K. Lee, and S. Wong, "Inter-domain routing for mobile ad hoc networks," in Proc. 2008 ACM International Workshop on Mobility in the Evolving Internet Architecture, pp. 61-66.
17. M. Osborne and A. Rubinstein, A Course in Game Theory. Cambridge, MA, 1994.
18. A. Billionnet, S. Elloumi, and M. Plateau, "Convex quadratic programming for exact solution of 0-1 quadratic programs," RAIRO-Operations Research, 2005.
19. I. IBM ILOG. (2009) IBM ILOG CPLEX v12.1 User's Manual for CPLEX. Available: ftp://public.dhe.ibm.com/software/websphere/ilog/docs/optimization/ cplex/ps$\$usrmancplex.pdf
20. K. Holmström, "The tomlab optimization environment in Matlab," 1999.
21. R. Cramer, R. Gennaro, and B. Schoenmakers, "A secure and optimally efficient multi-authority election scheme," in Proc. 1997 Springer EUROCRYPT, ser. Lecture Notes in Computer Science, W. Fumy, Ed., vol. 1233, pp. 103-118.
22. I. Damg̊ard and M. Jurik, "Efficient protocols based on probabilistic encryption using composite degree residue classes," IACR Cryptology ePrint Archive, vol. 2000, p. 8, 2000.
23. A. C.-C. Yao, "Protocols for secure computations (extended abstract)," in Proc. 1982 IEEE FOCS, pp. 160-164.
24. I. Damg̊ard, M. Geisler, and M. Krøigaard, "Homomorphic encryption and secure comparison," IJACT, vol. 1, no. 1, pp. 22-31, 2008.
25. T. Nishide and K. Ohta, "Multiparty computation for interval, equality, and comparison without bit-decomposition protocol," in Proc. 2007 Springer Public Key Cryptography, ser. Lecture Notes in Computer Science, T. Okamoto and X. Wang, Eds., vol. 4450, pp. 343-360.
26. Y. Desmedt and Y. Frankel, "Threshold cryptosystems," in Proc. 1989 Springer CRYPTO, ser. Lecture Notes in Computer Science, G. Brassard, Ed., vol. 435, pp. 307-315.
27. O. Goldreich, The Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press, 2004.
28. V. Shoup, "NTL: a library for doing number theory, 2005." Available: http://www. shoup. net/ntl/index. html. Release, vol. 5.