An energy-balanced routing algorithm in wireless seismic sensor network

Tong, X; Fang, G; Nguyen, D; Lin, J; Cabrera, E

An energy-balanced routing algorithm in wireless seismic sensor network

Tong, X Fang, G Nguyen, D

Lin, J Cabrera, E

Permalink

Publication Type:: Journal Article
Citation:: Journal of Computational and Theoretical Nanoscience, 2016, 13 (10), pp. 6823 - 6833
Issue Date:: 2016-01-01

Closed Access

	Filename	Description	Size
	DocumentOpener (6).pdf	Published Version	2.4 MB	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	Tong, X	en_US
dc.contributor.author	Fang, G	en_US
dc.contributor.author	Nguyen, D https://orcid.org/0000-0003-2659-8648	en_US
dc.contributor.author	Lin, J	en_US
dc.contributor.author	Cabrera, E	en_US
dc.date.issued	2016-01-01	en_US
dc.identifier.citation	Journal of Computational and Theoretical Nanoscience, 2016, 13 (10), pp. 6823 - 6833	en_US
dc.identifier.issn	1546-1955	en_US
dc.identifier.uri	http://hdl.handle.net/10453/100413
dc.description.abstract	© Copyright 2016 American Scientific Publishers All rights reserved. Due to unpredictable geological outdoor environments and imbalances in energy consumption of seismometer nodes in the wireless seismic sensor networks (WSSN), some seismometer nodes fail much earlier than others due to power loss. This would cause hot spot problems, network partitions, and significantly shorten network lifetime. In this paper, we designed an energy-balanced routing algorithm (EBRA) to ensure balanced energy consumption from all seismometer nodes in the WSSN and to enhance the connectivity and lifetime of the WSSN. By aiming at minimizing the imbalance in the residual energy, we divide the routing algorithm into two parts: clustering formation and inter-cluster routing. In clustering formation, we design an energy-balanced clustering algorithm, which selects the cluster head dynamically, based on residual energy, distance between the seismometer node and data collector. The clustering algorithm mitigates hot spot problems by balancing energy consumption among seismometer nodes. In regards to inter-cluster routing, we can relate it to the pareto-candidate set. To reduce the average multi-hop delay from cluster heads to the data collector, we optimize the pareto-candidate set by Hamming distance. In the design of EBRA, we consider minute details such as energy consumed by transmitting bits and impact of average multi-hop delay. This adds to the novelty of this work compared to the existing studies. Simulation results demonstrated a reduction in the average multi-hop delay by 87.5% with network size of 200 nodes in ten different data collector locations. Our algorithm also improves the network lifetime over the others three schemes by 7.8%, 23% and 45.4%, respectively.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DE150101092
dc.relation.ispartof	Journal of Computational and Theoretical Nanoscience	en_US
dc.relation.isbasedon	10.1166/jctn.2016.5633	en_US
dc.subject.classification	Nanoscience & Nanotechnology	en_US
dc.title	An energy-balanced routing algorithm in wireless seismic sensor network	en_US
dc.type	Journal Article
utslib.citation.volume	10	en_US
utslib.citation.volume	13	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	0202 Atomic, Molecular, Nuclear, Particle and Plasma Physics	en_US
utslib.for	0913 Mechanical Engineering	en_US
utslib.for	1007 Nanotechnology	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.issue	10	en_US
pubs.publication-status	Published	en_US
pubs.volume	13	en_US

Abstract:

© Copyright 2016 American Scientific Publishers All rights reserved. Due to unpredictable geological outdoor environments and imbalances in energy consumption of seismometer nodes in the wireless seismic sensor networks (WSSN), some seismometer nodes fail much earlier than others due to power loss. This would cause hot spot problems, network partitions, and significantly shorten network lifetime. In this paper, we designed an energy-balanced routing algorithm (EBRA) to ensure balanced energy consumption from all seismometer nodes in the WSSN and to enhance the connectivity and lifetime of the WSSN. By aiming at minimizing the imbalance in the residual energy, we divide the routing algorithm into two parts: clustering formation and inter-cluster routing. In clustering formation, we design an energy-balanced clustering algorithm, which selects the cluster head dynamically, based on residual energy, distance between the seismometer node and data collector. The clustering algorithm mitigates hot spot problems by balancing energy consumption among seismometer nodes. In regards to inter-cluster routing, we can relate it to the pareto-candidate set. To reduce the average multi-hop delay from cluster heads to the data collector, we optimize the pareto-candidate set by Hamming distance. In the design of EBRA, we consider minute details such as energy consumed by transmitting bits and impact of average multi-hop delay. This adds to the novelty of this work compared to the existing studies. Simulation results demonstrated a reduction in the average multi-hop delay by 87.5% with network size of 200 nodes in ten different data collector locations. Our algorithm also improves the network lifetime over the others three schemes by 7.8%, 23% and 45.4%, respectively.

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

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