PEADG(Power Efficient Algorithm for Data Gathering)协议是基于WSN的抄表系统数据收集协议,PEADG协议建立的网络拓扑结构由多棵树组成,树根节点分担了网络负载,较好地延长了网络生命期,但PEADG协议仍然存在一些问题,如:没有考虑多棵...PEADG(Power Efficient Algorithm for Data Gathering)协议是基于WSN的抄表系统数据收集协议,PEADG协议建立的网络拓扑结构由多棵树组成,树根节点分担了网络负载,较好地延长了网络生命期,但PEADG协议仍然存在一些问题,如:没有考虑多棵树上节点个数的平衡等。针对协议中存在的问题,提出了三方面的改进:①平衡了拓扑结构中多棵树的网络负载;②增加了对节点剩余能量的考虑;③利用基站收集了网络拓扑信息。利用MATLAB工具对改进后的协议进行了仿真,结果表明改进后的协议延长了网络的生命期。展开更多
从协议测试的角度出发研究了基于时间自动机模型的无线传感器网络数据收集协议测试用例生成方法,提出利用UPPAAL工具对数据收集协议建立时间自动机模型,进而利用UPPAAL Co Ver工具生成满足特定覆盖标准的测试路径集合的方法。为了便于...从协议测试的角度出发研究了基于时间自动机模型的无线传感器网络数据收集协议测试用例生成方法,提出利用UPPAAL工具对数据收集协议建立时间自动机模型,进而利用UPPAAL Co Ver工具生成满足特定覆盖标准的测试路径集合的方法。为了便于生成实际测试用例,开发了辅助自动测试用例生成工具ATCGT。通过一个工业界的无线抄表数据收集协议的建模与测试用例生成实例,阐明了该方法的有效性。展开更多
研究了基于下行无线信息和能量协同传输(simultaneous wireless-information and power-transfer,SWIPT)大规模多输入单输出(multiple-input and single-output,MISO)系统的吞吐率优化问题.该系统为时分双工(time division duplex,TDD)...研究了基于下行无线信息和能量协同传输(simultaneous wireless-information and power-transfer,SWIPT)大规模多输入单输出(multiple-input and single-output,MISO)系统的吞吐率优化问题.该系统为时分双工(time division duplex,TDD)模式,同时移动站采用先收集后传输的协议.在下行信噪比(signal-to-noise ratio,SNR)和移动站的传输功率约束下,为实现上行吞吐率的最大化,对功率分配系数和下行传输时间进行了联合优化,由于该问题为非凸优化问题,采用基于拉格朗日乘子的梯度算法进行优化.最后,通过与单独优化下行传输时间算法的比较,验证了该联合优化算法的优越性.展开更多
Energy-efficient data gathering in multi-hop wireless sensor networks was studied,considering that different node produces different amounts of data in realistic environments.A novel dominating set based clustering pr...Energy-efficient data gathering in multi-hop wireless sensor networks was studied,considering that different node produces different amounts of data in realistic environments.A novel dominating set based clustering protocol (DSCP) was proposed to solve the data gathering problem in this scenario.In DSCP,a node evaluates the potential lifetime of the network (from its local point of view) assuming that it acts as the cluster head,and claims to be a tentative cluster head if it maximizes the potential lifetime.When evaluating the potential lifetime of the network,a node considers not only its remaining energy,but also other factors including its traffic load,the number of its neighbors,and the traffic loads of its neighbors.A tentative cluster head becomes a final cluster head with a probability inversely proportional to the number of tentative cluster heads that cover its neighbors.The protocol can terminate in O(n/lg n) steps,and its total message complexity is O(n2/lg n).Simulation results show that DSCP can effectively prolong the lifetime of the network in multi-hop networks with unbalanced traffic load.Compared with EECT,the network lifetime is prolonged by 56.6% in average.展开更多
文摘PEADG(Power Efficient Algorithm for Data Gathering)协议是基于WSN的抄表系统数据收集协议,PEADG协议建立的网络拓扑结构由多棵树组成,树根节点分担了网络负载,较好地延长了网络生命期,但PEADG协议仍然存在一些问题,如:没有考虑多棵树上节点个数的平衡等。针对协议中存在的问题,提出了三方面的改进:①平衡了拓扑结构中多棵树的网络负载;②增加了对节点剩余能量的考虑;③利用基站收集了网络拓扑信息。利用MATLAB工具对改进后的协议进行了仿真,结果表明改进后的协议延长了网络的生命期。
文摘从协议测试的角度出发研究了基于时间自动机模型的无线传感器网络数据收集协议测试用例生成方法,提出利用UPPAAL工具对数据收集协议建立时间自动机模型,进而利用UPPAAL Co Ver工具生成满足特定覆盖标准的测试路径集合的方法。为了便于生成实际测试用例,开发了辅助自动测试用例生成工具ATCGT。通过一个工业界的无线抄表数据收集协议的建模与测试用例生成实例,阐明了该方法的有效性。
文摘研究了基于下行无线信息和能量协同传输(simultaneous wireless-information and power-transfer,SWIPT)大规模多输入单输出(multiple-input and single-output,MISO)系统的吞吐率优化问题.该系统为时分双工(time division duplex,TDD)模式,同时移动站采用先收集后传输的协议.在下行信噪比(signal-to-noise ratio,SNR)和移动站的传输功率约束下,为实现上行吞吐率的最大化,对功率分配系数和下行传输时间进行了联合优化,由于该问题为非凸优化问题,采用基于拉格朗日乘子的梯度算法进行优化.最后,通过与单独优化下行传输时间算法的比较,验证了该联合优化算法的优越性.
基金Projects(61173169,61103203)supported by the National Natural Science Foundation of ChinaProject(NCET-10-0798)supported by the Program for New Century Excellent Talents in University of ChinaProject supported by the Post-doctoral Program and the Freedom Explore Program of Central South University,China
文摘Energy-efficient data gathering in multi-hop wireless sensor networks was studied,considering that different node produces different amounts of data in realistic environments.A novel dominating set based clustering protocol (DSCP) was proposed to solve the data gathering problem in this scenario.In DSCP,a node evaluates the potential lifetime of the network (from its local point of view) assuming that it acts as the cluster head,and claims to be a tentative cluster head if it maximizes the potential lifetime.When evaluating the potential lifetime of the network,a node considers not only its remaining energy,but also other factors including its traffic load,the number of its neighbors,and the traffic loads of its neighbors.A tentative cluster head becomes a final cluster head with a probability inversely proportional to the number of tentative cluster heads that cover its neighbors.The protocol can terminate in O(n/lg n) steps,and its total message complexity is O(n2/lg n).Simulation results show that DSCP can effectively prolong the lifetime of the network in multi-hop networks with unbalanced traffic load.Compared with EECT,the network lifetime is prolonged by 56.6% in average.
