Skip to main content
SpringerLink
Log in

Closed Circle DNA Model to QoS Routing for Ad Hoc Networks

  • Conference paper
Network Computing and Information Security (NCIS 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 345))

Included in the following conference series:

  • 1334 Accesses

Abstract

QoS routing problem is typical NP problem, we will adapt closed circle DNA model to resolve this problem. First, use three groups of DNA sequence to encode arc, cost and probe of each path; Second, use purposive ending technology to synthesize fixed jumping-off point and end point of all paths; third, filter out all minimal cost paths by inserting experiment and electrophoresis experiment; finally find the path with detect experiment. The process of algorithm’s realization is straight forward; complexity of the algorithm is greatly reduced.

Project supported by the National Nature Science Foundation of China (No. 60903188). and supported by the National Natural Science Foundation, China(No. 71271138), and the Humanities and Social Sciences Planning Fund of Ministry of Education (No.10YJA630187).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Adleman, L.M.: Molecular computation of solutions to combinatorialproblems. Science 266(11), 1021–1024 (1994)

    Article  Google Scholar 

  2. Zhou, K., Gao, Z., Xu, J.: An Algorithm of DNA Computing on 0-1 Planning Problem. Advances in Systems Science and Applications 5(4), 587–593 (2005)

    Google Scholar 

  3. Liu, W.: TSP problem based on DNA computing. Journal of Chemical Information and Computer Science 42(5), 1176–1178 (2002)

    Article  Google Scholar 

  4. Zhou, K., Tong, X., Xu, J.: An algorithm of sticker DNA chip model on making spanning tree problem. In: Proc. of the Fifth International Conference on Machine Learning and Cybernetics, pp. 4287–4292 (2006)

    Google Scholar 

  5. Darehmiraki, M., MishmastNehi, H.: A surface-based DNA algorithm for the solving binary knapsack problem. Applied Mathematics and Computation 188(2), 1991–1994 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Zhou, K., Wang, Y., Liu, W., et al.: DNA algorithmof edge coloring problem on closed circle DNA. Journal of Huazhong University of Science and Technology (Nature Science) 34(9), 25–28 (2006)

    MathSciNet  Google Scholar 

  7. Yin, Z., Ye, C.-M., Wen, M.: DNA Encoding Design Based on Minimal Free Energy. Computer Engineerand Application 1(4), 542–549 (2010)

    Google Scholar 

  8. Deaton, R., Murphy, R.C., Garzon, M., et al.: Good encodings for DNA-based solutions to combinatorial problems. In: Proc. 2nd Annual Meeting DNA Based Computing, pp. 247–258 (1996)

    Google Scholar 

  9. Shin, S.Y., Lee, I.H., Kim, D.: Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing. IEEE Transaction on Evolutionary Computation 9(2), 143–158 (2005)

    Article  MathSciNet  Google Scholar 

  10. Khalid, N.K., Ibrahim, Z.: DNA Sequence Optimization Based on Continuous Particle Swarm Optimizationfor Reliable DNA Computing and DNA Nanotechnology. Journal of Computer Science 4(11), 942–950 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Engineering, Shanghai University of Electric Power, Shanghai, 200090, China

    Zhi Yin & Mi Wen

  2. Business School, University of Shanghai for Science and Technology, Shanghai, 200093, China

    Zhi Yin & Chunming Ye

Authors
  1. Zhi Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mi Wen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chunming Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer and Information Engineering, Shanghai University of Electric Power, 200090, Shanghai, China

    Jingsheng Lei

  2. Caritas Institute of Higher Education, 18 Chui Ling Road, Tseung Kwan O, Hong Kong, China

    Fu Lee Wang

  3. School of Computer Engineering, Computer Science Division, Nanyang Technological University (NTU), 50 Nanyang Avenue, Singapore

    Mo Li

  4. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Yuan Luo

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yin, Z., Wen, M., Ye, C. (2012). Closed Circle DNA Model to QoS Routing for Ad Hoc Networks. In: Lei, J., Wang, F.L., Li, M., Luo, Y. (eds) Network Computing and Information Security. NCIS 2012. Communications in Computer and Information Science, vol 345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35211-9_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35211-9_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35210-2

  • Online ISBN: 978-3-642-35211-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation