Detection of malicious rank attack nodes in communication network based on windowed frequency shift algorithm
by Hao Yang; Yibo Xia; Wen Cai; Xin Xie
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 16, No. 2, 2023

Abstract: In order to overcome the low detection efficiency and accuracy of existing detection methods for malicious nodes in communication networks, a detection method for malicious rank attack nodes in communication networks based on windowed frequency shift algorithm is proposed. According to the obtained signal samples, the windowed signal spectrum is obtained by windowed truncation and DTFT processing. Calculate the frequency shift of signal, judge the direction of frequency shift, calculate the amplitude and frequency parameters of sampling signal, and realise the abnormal detection of communication network signal. By further sensing, the malicious nodes with malicious behaviours are locked in a certain area, and the detection of malicious rank attack nodes is completed. The experimental results show that compared with the traditional methods, the proposed method has higher detection efficiency and accuracy, the highest detection rate can reach more than 98%, which can effectively protect the security of the communication network.

Online publication date: Wed, 24-May-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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 subs@inderscience.com