Game-theoretic medium access control protocol for wireless sensor networks

In the traditional medium access control (MAC) protocols for wireless sensor networks (WSNs), energy consumption is traded for throughput and delay. However, in future WSNs, throughput and delay performance had better not be sacrificed for energy conservation. Here first, an incompletely cooperative game-theoretic heuristic-based constraint optimisation framework is introduced to achieve the goals of throughput, delay and energy conservation simultaneously. Then a simplified game-theoretic MAC (G-MAC) protocol is presented, which can be easily implemented in WSNs. Simulation results show that compared with two typical MAC protocols for WSNs, sensor MAC and timeout MAC, G-MAC can increase system throughput, and decrease delay and packet-loss-rate, while maintaining relatively low energy consumption.     

面向分簇无线传感器网络的两层动态地址分配协议

针对分簇无线传感器网络提出了一种新的两层动态地址分配(TTDA)协议.TTDA采用两级地址分配方式,即基站为簇头分配地址,簇头为簇成员分配地址.基站为簇头分配地址时,采用Huffman编码,使得离基站更远的簇头获取更短的地址,从而节省地址传输能耗.地址分配基于租约,只在一段时间内有效,因此节点失效后可以回收其地址.T1...     

无线芯片域网络自适应多址调制方案的研究

为了解决多芯片构成的无线芯片域网络（WCAN）中的多用户网络通信问题,进行了WCAN自适应多址调制方案研究。结合WCAN的具体应用场景,首先研究了芯片内/间的无线信道特性,分析了多址跳时脉冲位置调制（TH PPM）技术的干扰噪声源及BER性能;然后在此基础上提出了自适应多址TH PPM方案,设计了智能化的传输机制,以对WCAN中芯片内/间的功率、误码率、传输速率进行权衡;最后通过仿真给出了其性能分析。研究结果显示,该方案在确保芯片内/间无线互连QoS可靠的同时,能够合理地分配系统资源,显著提高系统的传输性能,有效解决固定多址调制技术存在资源分配不均,系统性能不稳定的缺陷。     

无线传感器网络自适应差错控制技术研究

基于IEEE802.15.4标准建立了自动请求重传(ARQ)和前向纠错(FEC)两种差错控制技术的能量效率模型,分析了各参数对两种技术能量效率的影响,得到了ARQ技术最优负载长度和FEC技术最优纠错码参数,进而提出了一种根据无线链路接收信号强度自适应选择使用ARQ或FEC的差错控制方案,以适应无线传感器网络中无线链路质...     

Medium access control layer management for saving energy in wireless sensor networks routing algorithms

Wireless sensor networks (WSNs) consist of small nodes that are capable of sensing, computing, and communication. One of the greatest challenges in WSNs is the limitation of energy resources in nodes. This limitation applies to all of the protocols and algorithms that are used in these networks. Routing protocols in these networks should be designed considering this limitation. Many papers have been published examining low energy consumption networks. One of the techniques that has been used in this context is cross-layering. In this technique, to reduce the energy consumption, layers are not independent but they are related to each other and exchange information with each other. In this paper, a cross-layer design is presented to reduce the energy consumption in WSNs. In this design, the communication between the network layer and medium access layer has been established to help the control of efforts to access the line to reduce the number of failed attempts. In order to evaluate our proposed design, we used the NS2 software for simulation. Then, we compared our method with a cross-layer design based on an Ad-hoc On-demand Distance Vector routing algorithm. Simulation results show that our proposed idea reduces energy consumption and it also improves the packet delivery ratio and decreases the end-to-end delay in WSNs.     

HREF: a highest remaining energy first adaptive clustering algorithm for wireless sensor/mesh networks

A simple mechanism to prolong the life cycle of the network by balancing nodes’ energy consumption is to rotate the active dominating set (DS) through a set of legitimate DSs. This paper proposes a novel adaptive clustering algorithm named HREF (Highest Remaining Energy First). In the HREF algorithm, cluster formation is performed cyclically and each node can declare itself as a cluster head autonomously if it has the largest residual energy among all its adjacent nodes. The performance effectiveness of the HREF algorithm is investigated and compared to the D-WCDS (Disjoint Weakly Connected Dominating Set) algorithm. In this paper, we assume the network topology is fixed and does not require sensor mobility. This allows us to focus on the impact of clustering algorithms on communication between network nodes rather than with the base station. Simulation results show that in the D-WCDS algorithm energy depletion is more severe and the variance of the node residual energy is also much larger than that in the HREF algorithm. That is, nodes’ energy consumption in the HREF algorithm is in general more evenly distributed among all network nodes. This may be regarded as the main advantage of the HREF adaptive clustering algorithm.     

大规模无线传感器网络分布式无锚节点定位算法

提出了一种低成本的大规模无线传感器节点分布式定位算法--仅需要选出少量参考节点和利用节点自身的无线收发器即可实现整个网络节点的定位的无锚节点定位算法.该算法首先从网络中所有普通节点中按照一定准则选取5个基准节点,以这5个基准节点作为"锚节点",确定一个坐标系;其他未知节点将根据到基准节点的距离计算出自身坐标.未知节点到...     

基于遗传算法的三维无线传感器网络定位新算法

针对三维无线传感器网络节点自身定位问题,提出了一种基于遗传算法的新定位算法。该算法通过分析未知节点与它的无线射程范围内的已知节点之间的通讯约束和距离测量,对未知节点建立数学模型;针对此数学模型利用遗传算法求解,把该解作为未知节点的估计位置。理论分析和试验结果表明,该算法具有很强的健壮性,未知节点的失效和新节点的加入不会影响算法的性能,并且算法定位精度高,条件简单,适合各种规模的无线传感器网络的节点定位。     

LWDSA: light-weight digital signature algorithm for wireless sensor networks

The essential security mechanism in wireless sensor networks (WSNs) is authentication, where nodes can authenticate each other before transmitting a valid data to a sink. There are a number of public key authentication procedures available for WSN in recent years. Due to constraints in WSN environment there is a need for light-weight authentication procedure that consumes less power during computation. This proposed work aims at developing a light-weight authentication protocol using MBLAKE2b with elliptic curve digital signature algorithm (ECDSA). The proposed protocol is also tested using the protocol verification tool Scyther and found to be secure in all claims and roles. This proposed algorithm increases the network life time and reduces the computation time, which is essential for the constrained environment like WSNs.     

事件驱动型传感器网络能量有效数据融合算法

从降低网络能耗和平衡网络负载的角度,提出了网络的一种能量有效的数据融合算法EFDAA,可应用于节点数量及覆盖度均较大的事件驱动型无线传感器网络.该算法采用正六边形网格划分方法,基于全网能量消耗模型计算所需的融合节点数,解决由于无规则选取融合节点数量而造成的网络能耗增加问题,并且能够优化融合节点的分布;为平衡网格内节点负载,以节点剩余能量、邻节点度和移动性作为选取融合节点的权重因子,基于距离信息自适应调整网格内节点间的单跳通信级别.仿真实验结果表明,融合节点数量的优选,降低了网络总的能量消耗;相比较于HEED算法,EFDAA有效延长了网络生命期.     

Energy-efficient cluster-based scheme for failure management in sensor networks

Wireless sensor networks are characterised by dense deployment of energy constrained nodes. Owing to the deployment of large number of sensor nodes in uncontrolled hostile environments and unmonitored operation, it is common for the nodes to exhaust its energy and become inactive. The failing nodes create holes in the network topology causing connectivity loss, which may lead to critical information loss. To avoid degradation of performance, it is necessary that the failures are detected well in advance and appropriate measures are taken to sustain the network operation. An energy-efficient cluster-based technique is proposed to detect failures and recover the cluster structure. The proposed technique relies on the cluster members to detect the failures in the cluster and recover the connectivity. The proposed failure detection and recovery technique recovers the cluster structure in less than one-fourth of the time taken by the Gupta algorithm and is also proven to be 70% more energy-efficient than the same. The proposed cluster-based failure detection and recovery scheme proves to be an efficient and quick solution to robust and scalable sensor network for long and sustained operation.     

Differentiated cooperative multiple access for multimedia communications over fading wireless networks

The quality of service (QoS) support for multimedia communications faces a big challenge in a fading wireless network. On one hand, conventional automatic repeat request (ARQ) schemes are not effective for small-scale fading channels with correlated errors due to consecutive retransmission failures. On the other hand, large-scale fading due to propagation loss or shadowing severely limits transmission range. A novel differentiated cooperative medium access control (MAC) protocol, called DC-MAC, is proposed to enhance the QoS support for multimedia communications while supporting service differentiation based on the IEEE 802.11e architecture. By enabling cooperative ARQ, the retransmission is initiated from an appropriate transmission queue of an appropriate relay node instead of the original source. Since unnecessary and useless retransmissions may intensify the node contention and degrade the system performance contrarily, a novel negative acknowledgement feedback mechanism is introduced for loss distinguishing and channel estimation such that cooperative retransmission will be employed only when necessary and only by competent nodes. Extensive simulations are conducted on the OPNET platform to analyse the performances of DC-MAC under both small-scale and large-scale fading. Simulation results show that the proposed scheme significantly improves the performances of both multimedia applications and best-effort data applications in terms of throughput, delay and coverage with moderate user contention.     

基于贝塞尔曲线的WSN等值线绘制算法

从无线传感器网络(WSN)环境数值监测应用的实际需求出发,提出了一种应用于该类场景中的等值线绘制(CMBC)算法。CMBC算法基于图形学中常用的贝塞尔(Bezier)曲线理论,通过选择部分节点提供信息给网关节点绘制等值线。此方法有效解决了监测应用场景中对最终监测精度的需求与大量报告节点所引发的高流量负载和网络能耗之间的矛盾。仿真结果表明,CMBC算法和已有研究工作相比能够使用更少的汇报节点完成高精度等值线的绘制,因此CMBC算法能够节省节点的能量,延长网络的生存期。     

基于蚁群优化的WSN负载均衡数据汇集算法

针对无线传感器网络(WSN)数据汇集应用中负载分配不均衡,使得网络节点出现早死,网络寿命缩短的问题,提出了一种基于蚁群优化(ACO)的负载均衡的数据汇集(Load-balancing data gathering based on ACO,L-ACO)算法。根据不同的任务,L-ACO算法将蚂蚁分为三类:前向探索蚂蚁(FD-ANT)、前向运输蚂蚁(Fr-ANT)和后向蚂蚁(B-ANT)。此算法定义蚂蚁的转移概率与路径信息素成反比,并采用父节点负载作为启发因子,使得蚂蚁趋向于走负载低的路径。通过前向蚂蚁与后向蚂蚁的分工合作,使得各条路径上的负载逐渐趋于均衡,从而延长网络寿命。仿真实验表明L-ACO算法可行。     

Anchor-free localisation algorithm and performance analysis in wireless sensor networks

A hybrid anchor-free localisation scheme for multihop wireless sensor networks is presented. First, a relatively dense group of nodes is selected as a base, which are localised by using the multidimensional scaling method. Secondly, the robust quads (RQ) method is employed to localise other nodes, following which the robust triangle and radio range (RTRR) approach is used to perform the localisation task. The RQ and the RTRR methods are used alternately until no more nodes can be localised by the two approaches. Simulation results demonstrate that the proposed hybrid localisation algorithm performs well in terms of both accuracy and the success rate of localisation. To evaluate the accuracy of anchor-free localisation algorithms, the authors derive two different accuracy measures: the Cramer-Rao lower bound (CRLB) to benchmark the coordinate estimation errors and the approximate lower bound to benchmark the distance errors. Simulation results demonstrate that both the CRLB and the distance error lower bound provide references for the accuracy of the location algorithms.     

基于时空滤波的无线传感器网络抗差节点定位算法

针对无线传感器网络的最小二乘定位算法抗差性的不足,提出了一种基于时空滤波(STF)的抗差性加权最小二乘(WLS)节点定位算法--STLS.该算法基于空间域滤波的数据一致性检测算法利用相邻节点间必须满足的几何约束关系,采用优化矩阵操作,剔除粗差邻居节点,其计算复杂度为多项式的平方.通过使用具有2步收敛特性的DFP算法,最小化目标代价函数,实现节点的快速定位.实验结果表明,在均匀网格拓扑或各向异性C型网格拓扑下,该算法均可有效识别和剔除测距低估粗差点,其定位精度明显优于未进行空间一致性检测的加权最小二乘定位算法,当网络平均连通度较低时,该优势表现得尤为明显.     

基于能量优化模型的无线传感器网络分簇算法

考虑到无线传感器分簇网络中簇的规模、簇头数量和节点剩余能量是能量有效型分簇路由算法关注的重要指标,提出了一种基于能量优化模型(EOM)的分布式分簇算法——EOMC,该算法通过建立网络能耗优化模型,以最优簇头数构建分簇通信规模,并结合功率控制将候选簇头限制在一定宽度的选举环带,使得簇头分布均衡,同时兼顾到节点剩余能量进行分簇,以达到均衡节点能耗,延长网络生存期的目的。与低能耗自适应分簇分层(LEACH)协议的对比仿真的结果表明,该算法能够达到预期指标,算法的开销相对较小。     

时间异步无线传感器网络的目标跟踪动态成簇算法

为了解决时间异步无线传感器网络在目标跟踪时的节点协作管理和跟踪时间配准问题,提出了一种适用于时间异步条件下目标跟踪的动态成簇算法。该方法通过分析目标的无线信号强度和各节点至目标的距离来动态组建跟踪簇,然后依据目标及簇头的通信距离对簇头射频信号的覆盖区域进行功能划分,实现节点对目标的协作跟踪,同时以簇为跟踪时间的计算单元,通过簇内计时和簇间贯序传递的方法实现跟踪时间的配准。仿真实验表明,该算法进行目标跟踪时能有效均衡网络能耗,且具有较好的跟踪精度和系统鲁棒性。     

Controlled deployments for wireless sensor networks

In wireless sensor networks (WSNs), the operation of sensor nodes has to rely on a limited supply of energy (such as batteries). To support long lifetime operation of WSNs, an energy-efficient way of sensor deployment and operation of the WSNs is necessary. A new controlled layer deployment (CLD) protocol to guarantee coverage and energy efficiency for a sensor network is proposed. CLD outperforms previous similar protocols in that it can achieve the same performances and guarantee full area coverage and connection using a smaller number of sensors. It can also ameliorate the 'cascading problem' that reduces the whole network lifetime. Finally, analysis and simulation results show that CLD can use fewer sensor nodes for coverage and also increases the lifetime of the sensor network when compared with the probing environment and adapting sleeping (PEAS) protocol.     

基于距离分区的多级异构无线传感器网络成簇算法

为了防止无线传感器网络(WSN)节点因为通信距离过长而过早死亡,有效延长网络生命周期,提出了一种基于距离分区的高能效的多级异构无线传感器网络成簇算法(MHCADP)。此算法将监测区域分为三部分,并根据不同监测区域和基站的距离部署能量不同的三类节点,按照节点剩余能量与网络平均能量的比例来选举簇头节点,让较高初始能量和剩余能量的节点拥有更多的机会成为簇头。另外,在数据传输时,考虑节点和基站的距离以及自身剩余能量,选择单跳或多跳的传输方式。仿真实验结果表明,与现有的重要成簇算法——低能耗自适应分簇分层(LEACH)算法和稳定选举协议(SEP)算法相比,MHCADP算法能够有效减少网络能量消耗和平衡网络负载,使网络稳定周期和生命周期延长50%以上。