TY - GEN
T1 - StarDust
T2 - SenSys'06: 4th International Conference on Embedded Networked Sensor Systems
AU - Stoleru, Radu
AU - Vicaire, Pascal
AU - He, Tian
AU - Stankovic, John A.
PY - 2006
Y1 - 2006
N2 - The problem of localization in wireless sensor networks where nodes do not use ranging hardware, remains a challenging problem, when considering the required location accuracy, energy expenditure and the duration of the localization phase. In this paper we propose a framework, called StarDust, for wireless sensor network localization based on passive optical components. In the StarDust framework, sensor nodes are equipped with optical retro-reflectors. An aerial device projects light towards the deployed sensor network, and records an image of the reflected light. An image processing algorithmis developed for obtaining the locations of sensor nodes. For matching a node ID to a location we propose a constraint-based label relaxation algorithm. We propose and develop localization techniques based on four types of constraints: node color, neighbor information, deployment time for a node and deployment location for a node. We evaluate the performance of a localization system based on our framework by localizing a network of 26 sensor nodes deployed in a 120-60ft 2 area. The localization accuracy ranges from 2 ft to 5 ft while the localization time ranges from 10 milliseconds to 2 minutes.
AB - The problem of localization in wireless sensor networks where nodes do not use ranging hardware, remains a challenging problem, when considering the required location accuracy, energy expenditure and the duration of the localization phase. In this paper we propose a framework, called StarDust, for wireless sensor network localization based on passive optical components. In the StarDust framework, sensor nodes are equipped with optical retro-reflectors. An aerial device projects light towards the deployed sensor network, and records an image of the reflected light. An image processing algorithmis developed for obtaining the locations of sensor nodes. For matching a node ID to a location we propose a constraint-based label relaxation algorithm. We propose and develop localization techniques based on four types of constraints: node color, neighbor information, deployment time for a node and deployment location for a node. We evaluate the performance of a localization system based on our framework by localizing a network of 26 sensor nodes deployed in a 120-60ft 2 area. The localization accuracy ranges from 2 ft to 5 ft while the localization time ranges from 10 milliseconds to 2 minutes.
KW - Localization
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=34547442398&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547442398&partnerID=8YFLogxK
U2 - 10.1145/1182807.1182814
DO - 10.1145/1182807.1182814
M3 - Conference contribution
AN - SCOPUS:34547442398
SN - 1595933433
SN - 9781595933430
T3 - SenSys'06: Proceedings of the Fourth International Conference on Embedded Networked Sensor Systems
SP - 57
EP - 70
BT - SenSys'06
Y2 - 31 October 2006 through 3 November 2006
ER -