Effect of the number of participating nodes on recovery of WSN coverage holes

Rafiei, A; Abolhasan, M; Franklin, DR; Safaei, F; Smith, S; Ni, W

Effect of the number of participating nodes on recovery of WSN coverage holes

Rafiei, A Abolhasan, M

Franklin, DR

Safaei, F Smith, S Ni, W

Permalink

Publication Type:: Conference Proceeding
Citation:: 2017 27th International Telecommunication Networks and Applications Conference, ITNAC 2017, 2017, 2017-January pp. 1 - 8
Issue Date:: 2017-12-15

Closed Access

	Filename	Description	Size
	Effect of the Number of Participating Nodes on Recovery of WSN Coverage Holes.pdf	Published version	974.64 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	Rafiei, A	en_US
dc.contributor.author	Abolhasan, M https://orcid.org/0000-0002-4282-6666	en_US
dc.contributor.author	Franklin, DR https://orcid.org/0000-0002-9563-5943	en_US
dc.contributor.author	Safaei, F	en_US
dc.contributor.author	Smith, S	en_US
dc.contributor.author	Ni, W https://orcid.org/0000-0002-4933-594X	en_US
dc.date.issued	2017-12-15	en_US
dc.identifier.citation	2017 27th International Telecommunication Networks and Applications Conference, ITNAC 2017, 2017, 2017-January pp. 1 - 8	en_US
dc.identifier.isbn	9781509067961	en_US
dc.identifier.uri	http://hdl.handle.net/10453/126737
dc.description.abstract	© 2017 IEEE. Coverage holes (CHs) due to the correlated node failures, if not appropriately addressed in a timely manner, not only disrupt network's operation but also can compromise its integrity. In the absence of centralised control, distributed node relocation can be an effective solution to recover CHs. Relocation algorithms that mainly applied to all nodes to address networks' coverage and unbalanced deployments problems, are not efficient as participating nodes beyond a certain distance and depth from the CHs do not significantly contribute to recovery of CHs. Here, the effects of the number of participating nodes and movement iterations on recovery of CHs are examined in two Voronoi-based and one force-based node relocation algorithms.	en_US
dc.relation.ispartof	2017 27th International Telecommunication Networks and Applications Conference, ITNAC 2017	en_US
dc.relation.isbasedon	10.1109/ATNAC.2017.8215433	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Effect of the number of participating nodes on recovery of WSN coverage holes	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2017-January	en_US
utslib.for	0805 Distributed Computing	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 - CRIN - Realtime Information Networks
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
pubs.organisational-group	/University of Technology Sydney/Students
utslib.copyright.status	closed_access	*
pubs.publication-status	Published	en_US
pubs.volume	2017-January	en_US

Abstract:

© 2017 IEEE. Coverage holes (CHs) due to the correlated node failures, if not appropriately addressed in a timely manner, not only disrupt network's operation but also can compromise its integrity. In the absence of centralised control, distributed node relocation can be an effective solution to recover CHs. Relocation algorithms that mainly applied to all nodes to address networks' coverage and unbalanced deployments problems, are not efficient as participating nodes beyond a certain distance and depth from the CHs do not significantly contribute to recovery of CHs. Here, the effects of the number of participating nodes and movement iterations on recovery of CHs are examined in two Voronoi-based and one force-based node relocation algorithms.

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

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