个人信息Personal Information
副教授
硕士生导师
性别:男
毕业院校:中国科学技术大学
学位:博士
所在单位:软件学院、国际信息与软件学院
学科:计算机系统结构. 软件工程
办公地点:软件学院综合楼415
联系方式:wfsun@dlut.edu.cn
电子邮箱:wfsun@dlut.edu.cn
Impact of Duty Cycle and Radio Range Irregularity on Localization Algorithms for Wireless Sensor Networks
点击次数:
论文类型:期刊论文
发表时间:2014-01-01
发表刊物:AD HOC & SENSOR WIRELESS NETWORKS
收录刊物:SCIE、Scopus
卷号:21
期号:3-4
页面范围:219-235
ISSN号:1551-9899
关键字:Localization algorithm; connected k-neighborhood; duty cycle; radio range irregularity; dynamic network; wireless sensor networks
摘要: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.