Wireless sensor network localization with autonomous mobile beacon by path finding

Li, S; Kong, X; Lowe, D; Ryu, HG

Wireless sensor network localization with autonomous mobile beacon by path finding

Li, S Kong, X

Lowe, D Ryu, HG

Permalink

Publication Type:: Conference Proceeding
Citation:: 2012 International Conference on Information Science and Applications, ICISA 2012, 2012
Issue Date:: 2012-07-30

Closed Access

	Filename	Description	Size
	2011007858OK.pdf	Published version	1.55 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	Li, S	en_US
dc.contributor.author	Kong, X https://orcid.org/0000-0001-7855-858X	en_US
dc.contributor.author	Lowe, D	en_US
dc.contributor.author	Ryu, HG	en_US
dc.date.issued	2012-07-30	en_US
dc.identifier.citation	2012 International Conference on Information Science and Applications, ICISA 2012, 2012	en_US
dc.identifier.isbn	9781467321860	en_US
dc.identifier.uri	http://hdl.handle.net/10453/31900
dc.description.abstract	Sensor data with geographical information become ubiquitous with development of location base applications in various businesses. There is no exception to Wireless sensor network (WSN) as it is getting more practical under the booming of semiconductor industry. Localization of WSN usually depends on beacons that equip with GPS or GSM module. The cost of finance and energy hamper the application of WSN. Robot or flight vehicle called Mobile Beacon (MB) can relieve the issue and enhance the application area of WSN. Based on the framework we proposed in [14], we renovate the algorithm to find the best position for MB in every step by grouping weight of cosine similarity to mining the relation between responsible sensors. The MB machine works in an autonomous mode to find dynamic path without any supervision. In simulation, it is proved that the novel method makes the best of observation and covers unknown sensors as many as possible without heavy computation and struggle of energy. With appropriate parameters, the method can reach a 90% average coverage rate on any random distribution of sensors. © 2012 IEEE.	en_US
dc.relation.ispartof	2012 International Conference on Information Science and Applications, ICISA 2012	en_US
dc.relation.isbasedon	10.1109/ICISA.2012.6220950	en_US
dc.title	Wireless sensor network localization with autonomous mobile beacon by path finding	en_US
dc.type	Conference Proceeding
utslib.for	090203 Automotive Mechatronics	en_US
dc.location.activity	Suwon, South Korea
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
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

Sensor data with geographical information become ubiquitous with development of location base applications in various businesses. There is no exception to Wireless sensor network (WSN) as it is getting more practical under the booming of semiconductor industry. Localization of WSN usually depends on beacons that equip with GPS or GSM module. The cost of finance and energy hamper the application of WSN. Robot or flight vehicle called Mobile Beacon (MB) can relieve the issue and enhance the application area of WSN. Based on the framework we proposed in [14], we renovate the algorithm to find the best position for MB in every step by grouping weight of cosine similarity to mining the relation between responsible sensors. The MB machine works in an autonomous mode to find dynamic path without any supervision. In simulation, it is proved that the novel method makes the best of observation and covers unknown sensors as many as possible without heavy computation and struggle of energy. With appropriate parameters, the method can reach a 90% average coverage rate on any random distribution of sensors. © 2012 IEEE.

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

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