Boundary node selection algorithms by simple geometrical properties in WSNs

Rafiei, A

Boundary node selection algorithms by simple geometrical properties in WSNs

Rafiei, A

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings - AMS 2011: Asia Modelling Symposium 2011 - 5th Asia International Conference on Mathematical Modelling and Computer Simulation, 2011, pp. 221 - 226
Issue Date:: 2011-09-07

Closed Access

	Filename	Description	Size
	2010005221OK.pdf		1.72 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	Rafiei, A	en_US
dc.date.issued	2011-09-07	en_US
dc.identifier.citation	Proceedings - AMS 2011: Asia Modelling Symposium 2011 - 5th Asia International Conference on Mathematical Modelling and Computer Simulation, 2011, pp. 221 - 226	en_US
dc.identifier.isbn	9780769544144	en_US
dc.identifier.uri	http://hdl.handle.net/10453/29562
dc.description.abstract	Catastrophic events in wireless sensor networks can result in large holes in network coverage. Repair of such damage requires accurate identification of the proper subset of nodes which form the boundary of the damaged region, such that some of these nodes - the so-called outer boundary nodes - may be directed to reduce the size of the damaged region by either increasing sensing and transmission power or physically moving closer to the centre of the damaged region. Decisions as to whether a particular node should participate in the recovery process can made autonomously based on limited local information available to a node and its immediate neighbors. This paper proposes a number of algorithms which nodes may use to determine whether or not they belong to the set of outer boundary nodes. Simulation results are presented which compare the efficacy of each algorithm using a number of metrics. © 2011 IEEE.	en_US
dc.relation.ispartof	Proceedings - AMS 2011: Asia Modelling Symposium 2011 - 5th Asia International Conference on Mathematical Modelling and Computer Simulation	en_US
dc.relation.isbasedon	10.1109/AMS.2011.48	en_US
dc.title	Boundary node selection algorithms by simple geometrical properties in WSNs	en_US
dc.type	Conference Proceeding
utslib.for	0802 Computation Theory and Mathematics	en_US
dc.location.activity	Kuala Lumpur, Malaysia and Manila, Philippines	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/Students
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

Catastrophic events in wireless sensor networks can result in large holes in network coverage. Repair of such damage requires accurate identification of the proper subset of nodes which form the boundary of the damaged region, such that some of these nodes - the so-called outer boundary nodes - may be directed to reduce the size of the damaged region by either increasing sensing and transmission power or physically moving closer to the centre of the damaged region. Decisions as to whether a particular node should participate in the recovery process can made autonomously based on limited local information available to a node and its immediate neighbors. This paper proposes a number of algorithms which nodes may use to determine whether or not they belong to the set of outer boundary nodes. Simulation results are presented which compare the efficacy of each algorithm using a number of metrics. © 2011 IEEE.

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

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