Exploiting relay nodes for maximizing wireless underground sensor network lifetime

Tam, NT; Dung, DA; Hung, TH; Binh, HTT; Yu, S

Exploiting relay nodes for maximizing wireless underground sensor network lifetime

Tam, NT Dung, DA Hung, TH Binh, HTT Yu, S

Permalink

Publisher:: Springer Science and Business Media LLC
Publication Type:: Journal Article
Citation:: Applied Intelligence, 2020, 50, (12), pp. 4568-4585
Issue Date:: 2020-12-01

Closed Access

	Filename	Description	Size
	Tam2020_Article_ExploitingRelayNodesForMaximiz.pdf	Published version	2.7 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	Tam, NT
dc.contributor.author	Dung, DA
dc.contributor.author	Hung, TH
dc.contributor.author	Binh, HTT
dc.contributor.author	Yu, S https://orcid.org/0000-0003-4485-6743
dc.date.accessioned	2021-01-05T19:54:13Z
dc.date.available	2021-01-05T19:54:13Z
dc.date.issued	2020-12-01
dc.identifier.citation	Applied Intelligence, 2020, 50, (12), pp. 4568-4585
dc.identifier.issn	0924-669X
dc.identifier.issn	1573-7497
dc.identifier.uri	http://hdl.handle.net/10453/145095
dc.description.abstract	© 2020, Springer Science+Business Media, LLC, part of Springer Nature. A major challenge in wireless underground sensor networks is the signal attenuation originated from multi-environment transmission between underground sensor nodes and the above-ground base station. To overcome this issue, an efficient approach is deploying a set of relay nodes aboveground, thereby reducing transmission loss by shortening transmitting distance. However, this introduces several new challenges, including load balancing and transmission loss minimization. This paper tackles the problem of deploying relay nodes to reduce transmission loss under a load balancing constraint by proposing two approximation algorithms. The first algorithm is inspired by Beam Search, combined with a new selection scheme based on Boltzmann distribution. The second algorithm aims to further improve the solutions obtained by the former by reducing the transmission loss. We observe that we can find an optimal assignment between sensor nodes and a set of the chosen relay in polynomial time by reformulating the part of the problem as a bipartite matching problem with minimum cost. Experimental results indicate that the proposed methods perform better than the other existing ones in most of our test instances while reducing the execution time.
dc.language	en
dc.publisher	Springer Science and Business Media LLC
dc.relation.ispartof	Applied Intelligence
dc.relation.isbasedon	10.1007/s10489-020-01735-y
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0801 Artificial Intelligence and Image Processing
dc.subject.classification	Artificial Intelligence & Image Processing
dc.title	Exploiting relay nodes for maximizing wireless underground sensor network lifetime
dc.type	Journal Article
utslib.citation.volume	50
utslib.for	0801 Artificial Intelligence and Image Processing
utslib.for	0801 Artificial Intelligence and Image Processing
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	closed_access	*
dc.date.updated	2021-01-05T19:54:01Z
pubs.issue	12
pubs.publication-status	Published
pubs.volume	50
utslib.citation.issue	12

Abstract:

© 2020, Springer Science+Business Media, LLC, part of Springer Nature. A major challenge in wireless underground sensor networks is the signal attenuation originated from multi-environment transmission between underground sensor nodes and the above-ground base station. To overcome this issue, an efficient approach is deploying a set of relay nodes aboveground, thereby reducing transmission loss by shortening transmitting distance. However, this introduces several new challenges, including load balancing and transmission loss minimization. This paper tackles the problem of deploying relay nodes to reduce transmission loss under a load balancing constraint by proposing two approximation algorithms. The first algorithm is inspired by Beam Search, combined with a new selection scheme based on Boltzmann distribution. The second algorithm aims to further improve the solutions obtained by the former by reducing the transmission loss. We observe that we can find an optimal assignment between sensor nodes and a set of the chosen relay in polynomial time by reformulating the part of the problem as a bipartite matching problem with minimum cost. Experimental results indicate that the proposed methods perform better than the other existing ones in most of our test instances while reducing the execution time.

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

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