• ISSN 0258-2724
  • CN 51-1277/U
  • EI Compendex
  • Scopus 收录
  • 全国中文核心期刊
  • 中国科技论文统计源期刊
  • 中国科学引文数据库来源期刊

基于兴趣点分类的无线传感器网络扫描覆盖机制

舒莉,  林锋,  刘中豪,  游健,  周激流

downloadPDF
文章导航 > 西南交通大学学报  > 2014 >  27(1): 165-172.
舒莉, 林锋, 刘中豪, 游健, 周激流. 基于兴趣点分类的无线传感器网络扫描覆盖机制[J]. 西南交通大学学报, 2014, 27(1): 165-172. doi: 10.3969/j.issn.0258-2724.2014.01.026
引用本文: 舒莉, 林锋, 刘中豪, 游健, 周激流. 基于兴趣点分类的无线传感器网络扫描覆盖机制[J]. 西南交通大学学报, 2014, 27(1): 165-172. doi: 10.3969/j.issn.0258-2724.2014.01.026
shu
SHU Li, LIN Feng, LIU Zhonghao, YOU Jian, ZHOU Jiliu. POI Classfication Based Sweep Coverage Scheme in Wireless Sensor Networks[J]. Journal of Southwest Jiaotong University, 2014, 27(1): 165-172. doi: 10.3969/j.issn.0258-2724.2014.01.026
Citation: SHU Li, LIN Feng, LIU Zhonghao, YOU Jian, ZHOU Jiliu. POI Classfication Based Sweep Coverage Scheme in Wireless Sensor Networks[J]. Journal of Southwest Jiaotong University, 2014, 27(1): 165-172. doi: 10.3969/j.issn.0258-2724.2014.01.026
shu

基于兴趣点分类的无线传感器网络扫描覆盖机制

doi: 10.3969/j.issn.0258-2724.2014.01.026
基金项目: 

教育部博士点基金优先发展领域资助项目（20110181130007）

四川省科技支撑项目（2011RZ0004，2010GZ0169）

POI Classfication Based Sweep Coverage Scheme in Wireless Sensor Networks

    摘要
  • 摘要: 针对无线传感器网络中的扫描覆盖问题，建立了同时满足兴趣点覆盖需求和数据投递要求的扫描覆盖数学模型，并通过与组合覆盖中经典的车辆路径问题类比分析，证明了该问题是NP-hard 问题.在此基础上，提出了一种基于兴趣点分类的扫描覆盖机制FCSC （FDBSCAN_clustering_based sweep coverage）.该机制利用FDBSCAN聚类算法，根据兴趣点位置信息将兴趣点分类，针对每类兴趣点，利用启发式算法生成移动传感器节点对兴趣点的访问路径，完成数据采集.仿真结果表明，在相同的网络场景下，相较于传统的扫描覆盖机制，提出的机制有效地降低了算法复杂度，节约了50%以上的算法运行时间.

     

    Abstract: A sweep coverage model for wireless sensor network which satisfies both POI (point of interest) coverage and data delivery was proposed. The sweep coverage problem was proved to be a NP-hard after translating it to a vehicle routing problem which is a classic combinatorial optimization problem. Based on this model, a novel sweep coverage scheme FCSC (FDBSCAN_clustering_based sweep coverage) was proposed by introducing clustering algorithm to classify POIs in accordance with their locations. FCSC was operated with two steps. In the first step, all the POIs in monitoring area were classified using FDBSCAN algorithm. Then, in the second step, an insertion heuristic algorithm was applied for the POIs in the same cluster to generate the trajectory of mobile sensor nodes. The simulation results show that compared with traditional sweep coverage approaches, FCSC effectively reduces the computational complexity and decreases overall execution time by more than 50% while achieving the similar performance in the same network scenarioes.

     

    • HTML全文
    • 参考文献(16)
  • 周小佳, 吴侠, 闫斌. 基于移动基站的动态无线传感器网络[J]. 西南交通大学学报, 2011, 46(5): 793-797. ZHOU Xiaojia, WU Xia, YAN Bin. Dynamic wireless sensor network based on mobile base station[J]. Journal of Southwest Jiaotong University, 2011, 46(5): 793-797.
    CARDEI M, WU Jie. Handbook of sensor networks[M]. Boca Raton: CRC Press, 2005: 361-372.
    AMMARI H M, DAS S K. Centralized and clustered k-coverage protocols for wireless sensor networks[J]. IEEE Transactions on Computers, 2012, 61(1): 118-133.
    BAI Xiaole, YUN Ziqiu, XUAN Dong, et al. Deploying four-connectivity and full-coverage wireless sensor networks[C]//Proceedings of IEEE INFOCOM 2008.Phoenix: IEEE Press, 2008: 296-300.
    WANG Xiaolong, NI Wenjing, FANG Qiansheng, et al. Study on worst case coverage of mobile sensors in hybrid wireless sensor networks[J]. Applied Mechanics and Materials, 2012, 157(5): 1004-1007.
    TAO Dan, TANG Shaojie, ZHANG Haitao, et al. Strong barrier coverage in directional sensor networks[J]. Computer Communications, 2012, 35(8): 895-905.
    CHENG Weifang, LI Mo, LIU Kebin, et al. Sweep coverage with mobile sensors[C]//Proceedings of 22nd IEEE International Parallel and Distributed Processing Symposium. Miami: IEEE Press, 2008: 1-9.
    LI Mo, CHENG Weifang, LIU Kebin, et al. Sweep coverage with mobile sensors[J]. IEEE Transactions on Mobile Computing, 2011, 10(11): 1534-1545.
    ZHANG Zhenya, CHEN Yan, CHENG Hongmei, et al. MTSP based solution for minimum mobile node number problem in sweep converge of wireless sensor network[C]//Proceedings of IEEE ICCSNT. Hangzhou: IEEE Press, 2011: 1827-1830.
    XI Min, WU Kui, QI Yong, et al. Run to potential: sweep coverage in wireless sensor networks[C]//Proceedings of IEEE ICPP. Vienna: IEEE Press, 2009: 50-57.
    林锋, 王伟, 周激流. MASC:一种基于移动辅助节点的Sweep Coverage机制[J]. 四川大学学报:工程科学版, 2010, 42(6): 119-125. LIN Feng, WANG Wei, ZHOU Jiliu. MASC: a sweep coverage approach with mobile-assisted carriers[J]. Journal of Sichuan University: Engineering Science Edition, 2010, 42(6): 119-125.
    周水庚, 周傲英, 金文, 等. FDBSCAN:一种快速DBSCAN算法[J]. 软件学报, 2000, 11(6): 735-744. ZHOU Shuigeng, ZHOU Aoying, JIN Wen, et al. FDBSCAN: a fast DBSCAN algorithm[J]. Journal of Software, 2000, 11(6): 735-744.
    LENSTRA J K, KAN A R. Complexity of vehicle routing and scheduling problems[J]. Networks, 1981, 11(3): 221-227.
    XU Rui, WUNSCH D. Survey of clustering algorithms[J]. IEEE Transactions on Neural Networks, 2005, 16(3): 645-678.
    ESTER M, KRIEGEL H P, SANDER J, et al. A density-based algorithm for discovering clusters in large spatial databases with noise[C]//Proceedings of the 2nd International Conference on Knowledge Discovery and Data mining. Portland: AAAI Press, 1996: 226-231.
    SOLOMON M M. Algorithms for the vehicle routing and scheduling problems with time window constraints[J]. Operations Research, 1987, 35(2): 254-265.
    • 相关文章
    • 施引文献
  • 附加材料(0)
  • 加载中
WeChat 点击查看大图
计量
  • 文章访问数:  990
  • HTML全文浏览量:  80
  • PDF下载量:  770
  • 被引次数: 0
出版历程
  • 收稿日期:  2013-01-10
  • 刊出日期:  2014-01-25

目录

    /

    返回文章
    返回

    Copyright © 2009 西南交通大学学报

    地址：四川省成都市郫都区犀安路999号西南交通大学犀浦校区《西南交通大学学报》编辑部

    电话：028-66367562传真：028-66366552Email：xbz@home.swjtu.edu.cn

    本系统由 北京仁和汇智信息技术有限公司 开发 技术支持： info@rhhz.net