QoS routing based on parallel elite clonal quantum evolution for multimedia wireless sensor networks

Zhou, J; Dutkiewicz, E; Liu, RP; Fang, G; Liu, Y

QoS routing based on parallel elite clonal quantum evolution for multimedia wireless sensor networks

Zhou, J Dutkiewicz, E

Liu, RP

Fang, G Liu, Y

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE Wireless Communications and Networking Conference, WCNC, 2014, pp. 2498 - 2503
Issue Date:: 2014-01-01

Closed Access

	Filename	Description	Size
	06952781.pdf	Published version	223.58 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zhou, J	en_US
dc.contributor.author	Dutkiewicz, E https://orcid.org/0000-0002-4268-9286	en_US
dc.contributor.author	Liu, RP https://orcid.org/0000-0001-7001-6305	en_US
dc.contributor.author	Fang, G	en_US
dc.contributor.author	Liu, Y	en_US
dc.date.issued	2014-01-01	en_US
dc.identifier.citation	IEEE Wireless Communications and Networking Conference, WCNC, 2014, pp. 2498 - 2503	en_US
dc.identifier.isbn	9781479930838	en_US
dc.identifier.issn	1525-3511	en_US
dc.identifier.uri	http://hdl.handle.net/10453/121110
dc.description.abstract	© 2014 IEEE. Quality of Service (QoS) routing is one of the key enabling techniques for multimedia wireless sensor networks (WSNs). However, the multi-constraints QoS routing problem is an NP-hard problem, and the computational complexity of an exhaustive search over all the paths is too high for large scale multimedia WSNs. In this paper, a novel parallel elite clonal quantum evolutionary algorithm is proposed to solve the multi-constraints QoS routing problem. The proposed algorithm minimizes the energy consumption, while guaranteeing QoS performance, including delay, bandwidth, delay jitter and packet loss rate, in multimedia WSNs. The algorithm is tested by extensive simulations and its performance is compared with the genetic algorithm and ant colony optimization. Simulation results demonstrate that the proposed algorithm achieves lower energy consumption at a faster convergence rate than the other two evolutionary algorithms.	en_US
dc.relation.ispartof	IEEE Wireless Communications and Networking Conference, WCNC	en_US
dc.relation.isbasedon	10.1109/WCNC.2014.6952781	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	QoS routing based on parallel elite clonal quantum evolution for multimedia wireless sensor networks	en_US
dc.type	Conference Proceeding
utslib.for	100510 Wireless Communications	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
utslib.copyright.status	closed_access	*
pubs.publication-status	Published	en_US

Abstract:

© 2014 IEEE. Quality of Service (QoS) routing is one of the key enabling techniques for multimedia wireless sensor networks (WSNs). However, the multi-constraints QoS routing problem is an NP-hard problem, and the computational complexity of an exhaustive search over all the paths is too high for large scale multimedia WSNs. In this paper, a novel parallel elite clonal quantum evolutionary algorithm is proposed to solve the multi-constraints QoS routing problem. The proposed algorithm minimizes the energy consumption, while guaranteeing QoS performance, including delay, bandwidth, delay jitter and packet loss rate, in multimedia WSNs. The algorithm is tested by extensive simulations and its performance is compared with the genetic algorithm and ant colony optimization. Simulation results demonstrate that the proposed algorithm achieves lower energy consumption at a faster convergence rate than the other two evolutionary algorithms.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/121110