带状无线传感网为长距离带状分布,现有的数据收集算法无法很好解决其数据收集延迟较大的问题。提出了一种主动定位移动Sink的数据收集算法DCFAN(Data Collection based on Forwarding of Agent Nodes),DCFAN构建移动Sink的同步代理节点...带状无线传感网为长距离带状分布,现有的数据收集算法无法很好解决其数据收集延迟较大的问题。提出了一种主动定位移动Sink的数据收集算法DCFAN(Data Collection based on Forwarding of Agent Nodes),DCFAN构建移动Sink的同步代理节点以及存储同步代理节点的线节点序列,通过获取同步代理节点转发感知数据到Sink汇聚点。仿真结果表明,DCFAN算法能有效降低网络节点能耗以及数据收集延迟,同时提升数据收集率,适用于对数据收集延迟具有一定要求的带状无线传感网应用场景。展开更多
The IEEE 802.22 standard based on wireless Cognitive Radio (CR) is an optimal solution to resolve the inefficient spectrum utility problem. In this paper, we focus on the spectrum allocation in IEEE 802.22 mesh networ...The IEEE 802.22 standard based on wireless Cognitive Radio (CR) is an optimal solution to resolve the inefficient spectrum utility problem. In this paper, we focus on the spectrum allocation in IEEE 802.22 mesh networks and propose a new graph-theory algorithm. The algorithm aims at two objectives: one is the sum of the allocated channel bandwidth is maximum, and the other is the number of users can be active simultaneity is maximum. In this proposed algorithm, the topology of network was modeled as a general graph and could be transformed into a weighted complete bipartite-graph by three processes. The simulations show that the presented algorithm can improve the performance of spectrum allocation.展开更多
文摘带状无线传感网为长距离带状分布,现有的数据收集算法无法很好解决其数据收集延迟较大的问题。提出了一种主动定位移动Sink的数据收集算法DCFAN(Data Collection based on Forwarding of Agent Nodes),DCFAN构建移动Sink的同步代理节点以及存储同步代理节点的线节点序列,通过获取同步代理节点转发感知数据到Sink汇聚点。仿真结果表明,DCFAN算法能有效降低网络节点能耗以及数据收集延迟,同时提升数据收集率,适用于对数据收集延迟具有一定要求的带状无线传感网应用场景。
文摘The IEEE 802.22 standard based on wireless Cognitive Radio (CR) is an optimal solution to resolve the inefficient spectrum utility problem. In this paper, we focus on the spectrum allocation in IEEE 802.22 mesh networks and propose a new graph-theory algorithm. The algorithm aims at two objectives: one is the sum of the allocated channel bandwidth is maximum, and the other is the number of users can be active simultaneity is maximum. In this proposed algorithm, the topology of network was modeled as a general graph and could be transformed into a weighted complete bipartite-graph by three processes. The simulations show that the presented algorithm can improve the performance of spectrum allocation.
