Optimal detector design for molecular communication systems using an improved swarm intelligence algorithm

Optimal detector design for molecular communication systems using an improved swarm intelligence algorithm

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Micro & Nano Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The authors optimise the detection process of diffusion-based molecular communication systems utilising the weighted sum detector with appropriate weight values. Interestingly, no optimisation technique has ever been proposed for the calculation of the weights. To this end, they build on the standard particle swarm optimisation (PSO) technique and propose a robust iterative optimisation algorithm, called acceleration-aided PSO (A-APSO). While modified swarm-based optimisation algorithms focus on slight variations of the standard mathematical formulas, in A-APSO, the acceleration variable of the particles in the swarm is also involved in the search space of the optimisation problem. Particularly, they implement the A-APSO algorithm to evaluate the detector's weights that minimise the closed-form expression of the error probability. Their findings reveal that, when employing the A-APSO weights, the error performance is superior to that achieved by utilising the weight values already existing in the literature or those evaluated with the standard PSO algorithm.


    1. 1)
    2. 2)
    3. 3)
      • 3. Wang, J., Yin, B., Peng, M.: ‘Diffusion based molecular communication: principle, key technologies, and challenges’, China Commun., 2017, 14, pp. 118.
    4. 4)
    5. 5)
      • 5. Shi, L., Yang, L.L.: ‘Diffusion-based molecular communications: inter-symbol interference cancellation and system performance’. IEEE/CIC Int. Conf. Communications in China (ICCC), 2016, pp. 16.
    6. 6)
    7. 7)
      • 7. Nelson, P.: ‘Biological physics: energy, information, life’ (Freeman, San Francisco, CA, USA, 2008).
    8. 8)
      • 8. Kennedy, J., Eberhart, R.: ‘Particle swarm optimization’. IEEE Int. Conf. Neural Networks (ICNN), 1995, pp. 19421948.
    9. 9)
      • 9. Shi, Y., Eberhart, R.C.: ‘Parameter selection in particle swarm optimization’. Conf. Evolutionary Programming, 1998, pp. 591600.
    10. 10)
      • 10. Shi, Y., Eberhart, R.C.: ‘A modified particle swarm optimizer’. IEEE Int. Conf. Evolutionary Computation, 1998, pp. 6973.
    11. 11)
      • 11. Yang, X.-S., Deb, S., Fong, S.: ‘Accelerated particle swarm optimization and support vector machine for business optimization and applications’. Int. Conf. Networked Digital Technologies (NDT), 2011, pp. 5366.
    12. 12)
    13. 13)
      • 13. Dong, W., Zhou, M.: ‘A supervised learning and control method to improve particle swarm optimization algorithms’, IEEE Trans. Syst., Man Cybern., Syst., 2017, PP, pp. 114.
    14. 14)
    15. 15)
      • 15. Elkaim, G. H., Siegel, M.: ‘A lightweight control methodology for formation control of vehicle swarms’. World Congress of the Int. Federation of Automatic Control (IFAC), 2005, pp. 191196.
    16. 16)
    17. 17)
      • 17. Dayal, P.A.S., Venkatesu, K., Anirudh, B., et al: ‘Accelerated particle swarm optimization of pattern synthesis’. Int. Conf. Electromagnetic Interference & Compatibility (INCEMIC), 2016, pp. 14.
    18. 18)
    19. 19)
      • 19. Mishra, S., Bisoi, R.: ‘Image denoising using neural network based accelerated particle swarm optimization’. IEEE Power, Communication and Information Technology Conference (PCITC), 2015, pp. 901904.
    20. 20)
    21. 21)
    22. 22)

Related content

This is a required field
Please enter a valid email address