首页 | 本学科首页   官方微博 | 高级检索  
     检索      

无线传感器网络数据聚合网络划分算法
引用本文:杨挺,孙雨耕,张强,南国芳.无线传感器网络数据聚合网络划分算法[J].天津大学学报(自然科学与工程技术版),2008,41(11):1276-1280.
作者姓名:杨挺  孙雨耕  张强  南国芳
作者单位:天津大学电气与自动化工程学院,天津大学系统工程研究所
基金项目:国家自然科学基金,国家教育部博士点基金新教师资助项目 
摘    要:提出了一种应用于无线传感器网络数据聚合的有效划分算法算法选取网络中一组无环连通点集抽象为广义数据汇聚点集.当传感器节点进行数据汇报时,信源节点依按需路由策略将数据传送到广义数据汇聚点集中数据在广义数据汇聚点集内经过在网计算,依表驱动路由快速转发至sink.理论计算确定最优广义数据汇聚点集选取方式,提出分布式“贪婪远跳”算法构建广义数据汇聚点集.仿真论证该优化选择保证网络内任意节点两跳可达广义数据汇聚点集的概率为97%,分析数据传输性能证明了该算法的有效性.

关 键 词:无线传感器网络  广义数据汇聚点集  按需路由  表驱动路由

Wireless Sensor Network Segmentation Algorithm for Data Gather
YANG Ting,SUN Yu-geng,ZHANG Qiang,NAN Guo-fang.Wireless Sensor Network Segmentation Algorithm for Data Gather[J].Journal of Tianjin University(Science and Technology),2008,41(11):1276-1280.
Authors:YANG Ting  SUN Yu-geng  ZHANG Qiang  NAN Guo-fang
Institution:YANG Ting, SUN Yu-geng, ZHANG Qiang, NAN Guo-fang( 1. School of Electrical Engineering and Automation, Tianjin University, Tianjin 300072, China; 2.Institute of Systems Engineering, Tianjin University, Tianjin 300072, China)
Abstract:A wireless sensor network segmentation algorithm for data gather is proposed.The algorithm uses a group of connective nodes without loop as a generalized data gather vertex set.The source transmits data to the generalized data gather vertex set with demand routing.In the set,data are aggregated and transmitted to sink with table driven routing.This paper proposes an optimal method to select the generalized data gather vertex set and a distributed "greedy long-distance" algorithm to build the generalized data gather vertex set.The simulation proves the optimal method can make the probability of each sensor node reaching the generalized data gather vertex set in two jumps achieve 97%.The analysis of data transmis-sion shows the segmentation algorithm is feasible.
Keywords:wireless sensor network  generalized data gather vertex set  demand routing  table driven routing
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号