CB-ALCA: a cluster-based adaptive lightweight cryptographic algorithm for secure routing in wireless sensor networks
by M. Revanesh; V. Sridhar; John M. Acken
International Journal of Information and Computer Security (IJICS), Vol. 11, No. 6, 2019

Abstract: Wireless sensor network (WSN) focuses on various properties such as, clustering, authentication, routing, security, reliability and resource usage. Among these security is a critical issue in hostile environments. In this paper, a cluster-based routing algorithm is performed through adaptive lightweight cryptographic scheme. Firstly, we form clusters using improved fuzzy C means (iFCM) clustering. Then we select the optimum and reliable path to send data using improved artificial bee colony (iABC) algorithm. To construct a path, we consider node degree, node residual energy, valid distance and node mobility. A lightweight encryption approach is concerned for secure data transmission using RC6 block cipher algorithm. Once the simulation tests evaluated on NS3.26 network simulator, the experimental results obtained showed for our proposed work and it achieves good performance in terms of memory usage, communication overhead, transmission delay, bit error rate, energy consumption, computation time for encryption and decryption and packet delivery ratio.

Online publication date: Tue, 15-Oct-2019

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 Information and Computer Security (IJICS):
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