支持异步TDOA测量的确定性定位网络

在工业场景中，复杂无线环境对定位网络的影响导致定位存在实时可靠性差、精度低的问题.基于此，本文设计了在信标节点异步情况下支持TDOA（Time Difference-Of-Arrival）测量的确定性定位网络模型（ASync-DetNET），同时提出了适用于ASync-DetNET的节点感知模型和定位模型.通过简化了定位节点对数据信息的获取方式，合理调度通信资源，使得能够满足不同精度的定位需求，在保障定位精度的前提下，提高定位的实时可靠性.本文在实际搭建的面向复杂工业环境的UWB（Ultra-WideBand）室内定位系统中进行测试，结果表明文中方法能够在一定程度上提高了定位精度，保证定位的确定性.     

一种基于EIP-PSO的无线多媒体传感网QoS路由算法

针对无线多媒体传感器网络（wMsN）多约束服务质量问题,文章在粒子群优化（ParticleSwarmOptimization,PSO）算法的基础上增加多约束QoS条件,提出了一种基于EIP—PS0的无线多媒体传感网QoS路由（EIP．PS0）算法,该算法设计了一种高效初始路径（EfficientInitialPath,EIP）机制,解决了粒子群初始化过程中网络和计算开销大的问题,并且用基因块儿变异机制解决了算法后期易陷入局部最优的问题。网络仿真结果表明：与GA-PSO算法相比,EIP—PSO算法降低了网络开销,减小了网络平均端到端时延,达到了很好的收敛效果。     

无线传感器网络中多移动sink的选择策略

针对移动终端作为无线传感器网络中的移动sink情况下,提出了具有多个移动sink的稀疏无线传感器网络体系结构M2S2N.考虑到移动终端广泛存在的特性,为了有效地收集传感数据,提出了无线传感器网络中对移动sink的选择策略,并在此基础上提出了一种适合于M2S2N的基于功率控制的机会传输调度算法.仿真和分析表明选择最佳的移动sink可以有效地提高传感器节点的能量有效性和数据传输成功率.     

无线传感器网络自身定位方法研究与实现

作为一种全新的信息获取和处理平台,无线传感器网络能在应用领域内实现复杂的大范围监测和跟踪任务,因而网络中的节点自身定位就显得尤为重要.而现有节点自身定位算法大多数建立于节点布署于同一平面的理想状态,与实际的被监测区域有一定的差距.因此提出一种改进算法──补偿系数算法,同时在三边测量法中使用了坐标误差最小的最优解──最小二乘解来提高无线传感器网络节点自身定位的准确程度以满足实际应用的需要.     

Auto-learning TSN：时间敏感网络（TSN）的可用性优化

许多网络应用（如工业控制）都要求网络提供确定性的传输服务,传统的统计复用网络无法满足这一类应用需求。IEEE 802.1时间敏感网络（TSN）相关标准和研究能够在以太网上提供确定性的网络服务。简述TSN的基本原理,利用网络演算对TSN中的关键排队机制进行了定量分析,并提出自学习TSN机制,通过网络智能化自适应支持非TSN端侧设备组网,结合时延保证算法形成端到端TSN方案,为TSN技术的进一步推广和应用打下了基础。     

基于WIA-PA的瓦斯监测传感器网络网关设计

WIA-PA标准的无线传感器网络在煤矿生产中的推广要求无线传感器网络和CAN总线进行互联,网关是关键设备。本文设计了基于WIA-PA标准以无线射频芯片CC2430为核心以STM32F107控制器的瓦斯监测传感器网络中的网关。详细介绍了网关的硬件组成和工作原理,重点讨论了软件部分的设计。实验表明该设计具有稳定性、可靠性、实时性,满足瓦斯监测传感器网络对数据透明传输的要求。     

WSN中基于网络覆盖控制算法优化研究

无线传感器网络中,传感器节点的能量不易补充,如何提高能量效率成为了传感器网络研究的重大问题。文章首先分析了经典的无线传感器网络节点调度算法（CPNSS算法）。针对其利用率低,能量不均衡的问题,提出了一种高效节能的无线传感器网络覆盖优化算法（Efficient Coverage—Preserving Node Scheduling Scheme）,并具体介绍了ECPNSS算法设计及其实现过程。最后,将ECPNSS算法应用于LEACH协议,仿真结果表明,ECPNSS算法能有效节省网络能量,延长网络生存期。     

低占空比无线传感器网络邻居发现算法研究

低占空比(low duty cycle,LDC)无线传感器网络邻居发现算法是当前无线传感器网络领域的研究热点之一。当前LDC无线传感器网络的邻居发现算法大致可分为同步邻居发现算法和异步邻居发现算法,其中异步发现算法又可分为基于法定人数的调度算法（Grid quorum和 U-connect）和基于中国剩余定理的调度方法(Disco算法)。针对发现延迟和能量消耗,通过仿真实验对当前LDC无线传感器网络邻居发现领域里的典型算法进行了对比分析,在此基础上得出LDC无线传感器网络邻居发现算法新的研究方向。     

具有能量和位置意识基于ACO的WSN路由算法

通过融合传感器节点的剩余能量和地理位置信息,设计一种具有传感器节点能量和地理位置意识的基于蚁群优化方法的无线传感器网络路由算法(ELACO);针对路由空洞现象,提出一种路由回退机制,提高了路由搜索成功率.仿真结果表明,ELACO算法具有很高的路由查寻成功率,能够更好地均衡传感器节点能量消耗,从而延长网络使用寿命.     

时间敏感网络流量调度算法研究综述

时间敏感网络（Time-sensitive Networking,TSN）是一种新型确定性网络,具有低时延、低抖动等特点,能够满足现代网络传输控制的要求。流量调度是TSN标准中关键技术之一,用于确保流量传输的服务质量。首先对时间敏感网络的发展背景、重要机制、应用场景进行阐述,着重研究5种时间敏感网络流量调度机制,包括基于时间的整形机制、基于信用值的整形机制、循环队列转发机制、帧抢占机制以及异步流量整形机制;然后,分析了流量调度算法的研究现状,归纳和总结了时间触发（Time-triggered,TT）流和事件触发（Event-triggered,ET）流的调度算法,分析了目前流量调度算法存在的问题;最后,指出了TSN流量调度算法的发展方向和趋势。     

无线传感器网络自适应目标跟踪节点调度算法

在无线传感器网络中,设计合理的节点调度算法是提高网络感知能力、降低系统能耗的关键。在分析节点能耗模型的基础上,针对移动目标跟踪型网络应用,提出一种高能效的无线传感器网络自适应节点调度算法ANSTT。该算法根据节点对移动目标的感知能力,以及节点的相对剩余能量水平,自动调整节点工作模式。仿真实验表明,ANSTT算法在维持低感知延时、高目标感知率的同时,可有效降低系统能耗,延长网络寿命。     

Meta‐heuristic algorithms for channel scheduling problem in wireless sensor networks

The channel scheduling problem is to decide how to commit channels for transmitting data between nodes in wireless networks. This problem is one of the most important problems in wireless sensor networks. In this problem, we aim to obtain a near‐optimal solution with the minimal energy consumption within a reasonable time. As the number of nodes increases in the network, however, the amount of calculation for finding the solution would be too high. It can be difficult to obtain an optimal solution in a reasonable execution time because this problem is NP‐hard. Therefore, most of the recent studies for such problems seem to focus on heuristic algorithms. In this paper, we propose efficient channel scheduling algorithms to obtain a near‐optimal solution on the basis of three meta‐heuristic algorithms; the genetic algorithm, the Tabu search, and the simulated annealing. In order to make a search more efficient, we propose some neighborhood generating methods for the proposed algorithms. We evaluate the performance of the proposed algorithms through some experiments in terms of energy consumption and algorithm execution time. The experimental results show that the proposed algorithms are efficient for solving the channel scheduling problem in wireless sensor networks. Copyright © 2011 John Wiley & Sons, Ltd.     

Real-time scheduling with quality of service constraints

Whether or not the introduction of traffic classes improves upon the performance of ATM networks is discussed within the framework provided by a class of networks that guarantees quality of service. To provide a meaningful comparison the authors define the concept of a schedulable region, a region in the space of loads for which the quality of service is guaranteed. The authors show the dependence of the schedulable region on the scheduling algorithm employed, quality of service parameters, and traffic statistics. An efficient real-time scheduling algorithm is introduced that substantially increases the schedulable region without incurring prohibitive complexity costs. The schedulable region associated with this algorithm is compared with the ones generated by the static priority scheduling algorithm and a variant of the minimum laxity threshold algorithm. The size and shape of the schedulable region is explored by means of simulations     

Achieving maximum flow in interference-aware wireless sensor networks with smart antennas

Directional antenna offers various benefits for wireless sensor networks, such as increased spatial reuse ratio and reduced energy consumption. In this paper, we formulate the maximum flow problem as an optimization problem in interference-limited wireless sensor networks with switched beam directional antennas. The optimization problem is solvable in the presence of an omniscient controller, but it is NP-hard. Therefore, we seek a distributed algorithm to achieve the maximum flow through jointly routing and scheduling. The maximum flow between given source destination pair is determined forwardly hop by hop and is verified by the proposed feasible condition at downstream nodes. This method works for both single-beam antenna and multi-beam antenna with some variation in the feasibility condition.     

一种面向三维感知的无线多媒体传感器网络覆盖增强算法

 覆盖作为无线传感器网络中的基础问题直接反映了网络感知服务质量.本文在分析现有无线多媒体传感器网络覆盖增强算法的基础上,构建节点三维感知模型,提出面向三维感知的多媒体传感器网络覆盖增强算法(Three-Dimensional Perception Based Coverage-Enhancing Algorithm,TDPCA).该算法将节点主感知方向划分为仰俯角和偏向角,并根据节点自身位置及监测区域计算并调整各节点最佳仰俯角,在此基础上基于粒子群优化调整节点偏向角,从而有效减少节点感知重叠区及感知盲区,最终实现监测场景的区域覆盖增强.仿真实验表明:对比已有的覆盖增强算法,TDPCA可有效降低除节点感知重叠区和盲区,最终实现网络的高效覆盖.     

Performance evaluation of sensor deployment using optimization techniques and scheduling approach for K-coverage in WSNs

In the wireless sensor networks, sensor deployment and coverage are the vital parameter that impacts the network lifetime. Network lifetime can be increased by optimal placement of sensor nodes and optimizing the coverage with the scheduling approach. For sensor deployment, heuristic algorithm is proposed which automatically adjusts the sensing range with overlapping sensing area without affecting the high degree of coverage. In order to demonstrate the network lifetime, we propose a new heuristic algorithm for scheduling which increases the network lifetime in the wireless sensor network. Further, the proposed heuristic algorithm is compared with the existing algorithms such as ant colony optimization, artificial bee colony algorithm and particle swarm optimization. The result reveals that the proposed heuristic algorithm with adjustable sensing range for sensor deployment and scheduling algorithm significantly increases the network lifetime.     

Secure coverage-preserving node scheduling scheme using energy prediction for wireless sensor networks

With the fast development of the micro-electro-mechanical systems(MEMS),wireless sensor networks(WSNs)have been extensively studied.Most of the studies focus on saving energy consumption because of restricted energy supply in WSNs.Cluster-based node scheduling scheme is commonly considered as one of the most energy-efficient approaches.However,it is not always so efficient especially when there exist hot spot and network attacks in WSNs.In this article,a secure coverage-preserved node scheduling scheme for WSNs based on energy prediction is proposed in an uneven deployment environment.The scheme is comprised of an uneven clustering algorithm based on arithmetic progression,a cover set partition algorithm based on trust and a node scheduling algorithm based on energy prediction.Simulation results show that network lifetime of the scheme is 350 rounds longer than that of other scheduling algorithms.Furthermore,the scheme can keep a high network coverage ratio during the network lifetime and achieve the designed objective which makes energy dissipation of most nodes in WSNs balanced.     

分簇无线传感器网络动态时隙分配MAC协议

为降低大规模无线传感器网络的平均能耗,提出了一种基于动态分配的调度型无线传感器网络MAC协议（SDC-MAC）。该协议簇间使用FDMA方式分配无线信道,簇内通过TDMA方式给各个节点分配可变长的时隙。随着簇结构的变化,簇头通过时隙分配通知,对簇内节点的时隙分配进行动态调整,簇成员节点则根据控制信息进行休眠和唤醒。仿真结果显示,该算法有效地降低了网络的平均能耗,当网络流量高时还可降低平均数据包时延。     

DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks

This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O(delta ) time and message complexity where delta is the maximum size of a two-hop neighborhood in a wireless network while message complexity remains O(delta ), assuming that message delays can be bounded by an unknown constant. DRAND is the first fully distributed version of RAND. The algorithm is suitable for a wireless network where most nodes do not move, such as wireless mesh networks and wireless sensor networks. We implement the algorithm in TinyOS and demonstrate its performance in a real testbed of Mica2 nodes. The algorithm does not require any time synchronization and is shown to be effective in adapting to local topology changes without incurring global overhead in the scheduling. Because of these features, it can also be used even for other scheduling problems such as frequency or code scheduling (for FDMA or CDMA) or local identifier assignment for wireless networks where time synchronization is not enforced. We further evaluate the effect of the time-varying nature of wireless links on the conflict-free property of DRAND-assigned time slots. This experiment is conducted on a 55-node testbed consisting of the more recent MicaZ sensor nodes.