信号强度和运动向量结合的无线传感器网络移动节点定位

无线传感器网络的定位是近年来无线传感器网络研究的重要课题.本文首先介绍了无线传感器网络的来源、重要性以及无线传感器网络定位的分类.然后提出了一种全新定位算法,信号强度和运动向量结合的无线传感器网络移动节点定位,简称SSMV算法,在外围布置四个锚节点,得用信号强度和未知节点在运动中向量的变化,对锚节点在内的未知节点进行定位,并对该算法进行了仿真和总结.通过与凸规划法进行比较,仿真结果表明,该算法有更高的定位精度.     

基于加权的社会网络重要节点发现算法研究

本文针对网络一般算法存在问题,提出来一种基于加权的社会网络重要节点发现算法。该算法基于社会网络中节点和边的属性进行有向加权社会网络建模,融合节点之间相对重要性理论和网络拓扑原理,共同发现加权的社会网络中的重要节点。     

基于全网休眠的ZigBee网络节能算法

无线传感器网络节点一般由电池供电而且部署后需要长时间工作,这就导致节点的能量成为网络运行的瓶颈。针对无线传感器网络节点能量受限的问题,提出了一种基于全网休眠的节能新算法。该算法使终端节点、路由节点和汇聚节点都能得到休眠,从而为网络中每一种节点节约能量;同时,为路由节点设计了长、短两种休眠策略,在不影响数据收发的前提下减少能耗。基于CC2630芯片的实验结果表明:与现有相关算法相比,该新算法使节点能耗降低10%。     

无线传感器网络中基于映射扩散的节点定位算法

提出了一种基于映射扩散的无线传感器网络节点定位算法,适用于规模较大、参考节点较少的无线传感器网络.该算法在传感器网络中首先随机选择一个节点作为"起始节点",然后根据扩散算法选择3个"一级节点",然后以每个一级节点为中心,逐级外推,直至覆盖网络中的所有节点.仿真结果证明,该算法可以快速准确进行定位,可降低和均衡所有节点的能耗,提高定位精度.     

基于无线传感器网络的一种改进Dv-Hop算法

无线传感器网络中的Dv-Hop算法是一种无需测距的节点定位算法,经仿真观察,该算法在信标节点密度较低时节点平均误差较大且稳定性不好.提出了一种改进Dv-Hop算法,即在一个网络区域的边缘设置信标节点.经仿真验证,该算法在和Dv-Hop同等信标节点密度的情况下,在定位精度、节点定位的稳定性以及能源消耗方面都有所改善.     

ADLE:一种Ad hoc网络分布式领导者选取算法

Ad hoc网络的动态拓扑结构和节点自组织给分布式算法的实现带来了诸多困难.Ad hoc网络分布式领导者选举算法:ADL.该算法基于广播机制,采用逻辑时戳保证消息的时序性,避免了节点饿死.同时,它通过缩小算法执行范围降低了消息复杂度,而且不需要节点了解系统中所有节点的信息,因而能够适应Ad hoc网络的动态拓扑结构和节点频繁出入.分析与仿真结果表明该算法具有较低的消息复杂度、小响应延迟和公平性.     

一种基于超节点和能量优先的无线传感器网络的高效查询算法

文中提出一种基于超节点和能量优先的无线传感器网络的高效查询算法.该算法包括传感器节点的层次聚类算法及基于能量代价模型等支撑技术,主要解决了以下两个问题:(1)数据如何从传感器节点传送到汇聚节点;(2)通过对传感器节点进行聚类,形成超节点,使得在查询过程中减少对无关节点的访问.实验表明该算法在提高无线传感器网络查询效率的情况下,延长网络的使用寿命.     

传感器网络中一种分布式数据汇聚层次路由算法

由于传感器网络具有能量约束,低速率冗余数据和多对一传输等特点,传统的端到端集中式路由算法一般不适合传感器网络.提出了一种分布式数据汇聚层次路由算法,该算法利用能量核的思想汇聚数据和减少传输到目的节点的信息.模拟结果表明:比较传统的端到端集中式路由算法,该算法可以显著减少能量消耗;与一般的数据汇聚算法相比,该算法在保证能量消耗少的条件下,具有复杂度低和可扩展性好的特点.     

基于加权最小二乘变尺度法的无线传感器网络定位

为了降低整个无线传感器网络的成本和减小测量误差对定位精度的影响,一般传统做法是把已定位的未知节点升级为信标节点,再对其他节点进行定位,但此情况会造成累积误差。为了减少累积误差,提出了一种加权的最小二乘变尺度定位算法,该算法首先利用加权最小二乘法对未知节点进行位置估计,然后把定位的未知节点升级为信标节点,再对剩下的未知节点进行位置估计,最后利用拟牛顿法对估计出来的位置进行优化。仿真结果表明,该算法能有效地减少测距误差和累积误差,降低网络成本,提高网络覆盖率和传感节点的定位精度,并且该算法不增加额外硬件设备,易于实现。     

基于电量均衡的无线传感器网络分簇算法

为了延长无线传感器网络的生命期,针对节点能耗分布不均匀的问题,提出一种电量均衡的分簇算法.该算法将节点剩余能量作为构建分簇结构的依据,对剩余能量较少的节点赋予一定的约束,使之成为普通节点,并使电量多的节点成为簇头节点,均衡网络电量负载,解决了网络中部分低电量节点担任骨干节点而导致能耗的问题,从而有效延长了网络的生命期.仿真实验证明了该算法的有效性.     

Efficient Energy Utilization Through Optimum Number of Sensor Node Distribution in Engineered Corona-Based (ONSD-EC) Wireless Sensor Network

An optimum sensor node deployment in wireless sensor network can sense the event precisely in many real time scenarios for example forests, habitat, battlefields, and precision agriculture. Due to these applications, it is necessary to distribute the sensor node in an efficient way to monitor the event precisely and to utilize maximum energy during network lifetime. In this paper, we consider the energy hole formation due to the unbalanced energy consumption in many-to-one wireless sensor network. We propose a novel method using the optimum number of sensor node Distribution in Engineered Corona-based wireless sensor network, in which the interested area is divided into a number of coronas. A mathematical models is proposed to find out the energy consumption rate and to distribute the optimum number of sensor node in each corona according to energy consumption rate. An algorithm is proposed to distribute the optimum number of sensor nodes in corona-based networks. Simulation result shows that the proposed technique utilized 95 % of the total energy of the network during network lifetime. The proposed technique also maximizes the network lifetime, data delivery and reduce the residual energy ratio during network lifetime.     

交通路灯监控系统的无线传感网链状路由算法

在交通路灯监控系统中为节省网络节点能耗和降低数据传输时延,提出一种无线传感网链状路由算法（CRASMS）。该算法根据节点和监控区域的信息将监控区域分成若干个簇区域,在每一个簇区域中依次循环选择某个节点为簇头节点,通过簇头节点和传感节点的通信建立簇内星型网络,最终簇头节点接收传感节点数据,采用数据融合算法降低数据冗余,通过簇头节点间的多跳路由将数据传输到Sink节点并将用户端的指令传输到被控节点。仿真结果表明：CRASMS算法保持了PEGASIS算法在节点能耗方面和LEACH算法在传输时延方面的优点,克服了PEGASIS 算法在传输时延方面和LEACH算法在节点能耗方面的不足,将网络平均节点能耗和平均数据传输时延保持在较低水平。在一定的条件下,CRASMS算法比LEACH和PEGASIS算法更优。     

无线传感网络中基于蚁群的路由算法

In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Ant-colony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.     

A new algorithm for cluster head selection in LEACH protocol for wireless sensor networks

In wireless sensor network, a large number of sensor nodes are distributed to cover a certain area. Sensor node is little in size with restricted processing power, memory, and limited battery life. Because of restricted battery power, wireless sensor network needs to broaden the system lifetime by reducing the energy consumption. A clustering‐based protocols adapt the use of energy by giving a balance to all nodes to become a cluster head. In this paper, we concentrate on a recent hierarchical routing protocols, which are depending on LEACH protocol to enhance its performance and increase the lifetime of wireless sensor network. So our enhanced protocol called Node Ranked–LEACH is proposed. Our proposed protocol improves the total network lifetime based on node rank algorithm. Node rank algorithm depends on both path cost and number of links between nodes to select the cluster head of each cluster. This enhancement reflects the real weight of specific node to success and can be represented as a cluster head. The proposed algorithm overcomes the random process selection, which leads to unexpected fail for some cluster heads in other LEACH versions, and it gives a good performance in the network lifetime and energy consumption comparing with previous version of LEACH protocols.     

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

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

无线传感器网络中基于概率的能量平衡算法

各传感器节点的能耗不平衡严重地影响了无线传感器网络的生命周期。该文提出了基于传输概率的能量平衡算法。首先把圆形区域网络模型划分成若干圆环,每一圆环中的传感器节点以混合传输的方式传输数据。其次,为使每个传感器节点能耗均衡,提出了一种混合传输概率求解算法,获得一组传输概率决定节点传输数据的方式,从而更好地平衡网络能耗。然后对圆环宽度进行了分析和优化。仿真结果证明这些算法可以有效地降低网络能耗,延长网络生命周期。     

基于能量均衡的无线传感器网络路由算法

为了提高无线传感器网络的生存时间,针对当前LEACH算法存在的能量不均衡难题,提出一种能量均衡的无线传感器网络节点路由算法。首先将监测区域看成以基站为中心的扇形区域,并将扇形区域分割成不同大小的弧形方块,每个弧形方块中的节点组成一个簇,根据节点剩余能量产生簇头,然后采用单跳和多跳相结合的簇间通信机制,最后采用仿真实验测试算法的性能。结果表明,本文算法有效提高了网络的能量利用率,能够实现节点之间的能耗均衡,使无线传感器的网络生存时间得到延长,适用于对网络生命周期要求较高的应用。     

多簇无线传感网的优化生存时间近邻功率控制算法

针对非均匀分布的无线传感网的生存时间问题,提出多簇无线传感网的优化生存时间近邻功率控制(NPCAOL_MC)算法。该算法采用K-means算法确定网络的簇个数和对应每个簇的节点,利用近邻算法评估每个簇的节点密度,确定簇的最优通信距离。结合Friss自由空间模型计算当前簇的最优发送功率。Sink节点广播通知其他节点,如果是同一簇内的节点相互通信,则采用簇最优功率发送数据,否则采用默认最大发送功率发送数据。仿真结果表明,利用NPCAOL_MC算法可以分析整个网络节点的位置信息,采用簇最优发送功率发送数据,从而提高生存时间,并使能耗经济有效。在密度分布不均的无线传感网中,NPCAOL_MC比采用固定发送功率的Ratio_w算法更优。     

紫外光无线传感器网络节能的研究与仿真

为了减少无线传感器网络节点的能量消耗,采用紫外光作为无线传感器网络的信息载体,研究了紫外光传感器节点的能量模型。理论分析了单跳节能和多跳节能,得出了计算最优跳数的数学表达式,并对单跳通信、多跳通信和最优跳通信的平均能量消耗进行了计算机仿真,仿真结果与理论分析一致;对于多跳通信带来的能量消耗不均匀的问题,利用移动sink节点来解决,通过仿真对比了sink节点不同移动速率对网络平均能量消耗、丢包率和端到端时延的影响。结果表明,借助移动sink节点可以降低网络的平均能量消耗,但要根据场景选择合适的移动速率。     

An efficient cluster-based communication protocol for wireless sensor networks

A wireless sensor network is a network of large numbers of sensor nodes, where each sensor node is a tiny device that is equipped with a processing, sensing subsystem and a communication subsystem. The critical issue in wireless sensor networks is how to gather sensed data in an energy-efficient way, so that the network lifetime can be extended. The design of protocols for such wireless sensor networks has to be energy-aware in order to extend the lifetime of the network because it is difficult to recharge sensor node batteries. We propose a protocol to form clusters, select cluster heads, select cluster senders and determine appropriate routings in order to reduce overall energy consumption and enhance the network lifetime. Our clustering protocol is called an Efficient Cluster-Based Communication Protocol (ECOMP) for Wireless Sensor Networks. In ECOMP, each sensor node consumes a small amount of transmitting energy in order to reach the neighbour sensor node in the bidirectional ring, and the cluster heads do not need to receive any sensed data from member nodes. The simulation results show that ECOMP significantly minimises energy consumption of sensor nodes and extends the network lifetime, compared with existing clustering protocol.