Hits:

Indexed by:期刊论文

Date of Publication:2014-01-01

Journal:AD HOC & SENSOR WIRELESS NETWORKS

Included Journals:SCIE、Scopus

Volume:21

Issue:3-4

Page Number:219-235

ISSN No.:1551-9899

Key Words:Localization algorithm; connected k-neighborhood; duty cycle; radio range irregularity; dynamic network; wireless sensor networks

Abstract:In this paper, we investigate the performance of Hop-based localization algorithms in time-varying and direction-varying connectivity (TDVC) wireless sensor network under various parameter configurations. In real scenario, TDVC is a common phenomenon which arises from the node's duty cycle for saving energy and radio range irregularity of sensor node due to multiple factors, such as variance in radio frequency, sending power and different packet loss probabilities, depending on the direction of propagation. With empirical data obtained from Tmote Sky/TelosB platform, we establish a TDVC network model for simulation, called Time and Direction Connectivity Variation Model (TDCVM). This model is the first to bridge the discrepancy between ideal connectivity models used by some previous literatures and the practical connectivity between nodes of network. With this model, we do extensive experiments using three Hop-based localization methods (DV-Hop, HCRL and REP) to analyze the impact of parameters, i.e., k, degree of irregularity (DOT), anchor node density, and the number of nodes of a network on localization accuracy. Our results show that these parameters are interactional and different parameter configurations have different localization errors. Furthermore, these experimental results can be used to direct the design of dynamic (the "dynamic" results from duty-cycling) algorithms under more realistic environment and achieve high localization accuracy. To the best of our knowledge, our insight is the only performance exploration for range-free localization algorithms with duty-cycled and radio-range-irregular sensor nodes.