A channel allocation method based on dual-population differential evolution in wireless sensor networks Online publication date: Wed, 02-Jun-2021
by Yu Cao; Wei Wei; Huiting Pei
International Journal of Sensor Networks (IJSNET), Vol. 36, No. 1, 2021
Abstract: To solve the problem of low-efficiency channel allocation due to the high density of nodes in traditional wireless sensor networks (WSNs), a channel allocation method based on dual-population differential evolution is proposed. In our paper, the crossover and mutation operations of the differential evolution algorithm are analysed; multichannel mutation crossover optimisation is proposed by combining a differential evolution algorithm with a dual-population search method. Anti-interference optimisation is carried out for different network levels with a certain capacity, considering the time slot parameter interference degree, link capacity, and multichannel cross-layer analysis. According to the multichannel mutation cross-optimisation method, the constraint conditions are determined, the channel is divided, and a linear membership function is constructed to perform channel allocation. The experimental results show that when the mutation parameter and crossover probability of two-population differential evolution are 0.1 and 0.6, respectively, the channel allocation efficiency of the proposed method is the highest, and the shortest channel allocation time is 3.4 s.
Online publication date: Wed, 02-Jun-2021
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org