无线传感器网络中采用预约机制的MAC协议改进

提出一种基于信道预约的MAC协议CR-MAC(channel-reservation MAC),该协议是在S-MAC（sensor-MAC）协议基础上进行的改进。当有数据需要发送时,首先以基于竞争的方式发送和接收信道预约信息,实现信道的按需分配;信道预约完成后各节点按照预约好的时间片进行激活,以时分复用的方式传输数据。CR-MAC协议能够有效地减少节点的空闲侦听和串音干扰,从而降低能量消耗和传输延时。     

利用发送和接收时隙分配策略改善无线传感器网络MAC协议能效

摘　要 针对无线传感器网络中存在数据冲突和串音而影响MAC协议能量效率的问题,提出了基于接收和基于发送的TDMA-MAC协议时隙分配策略。通过考虑各种无线收发器模式(即发送、接收、休眠和空闲)花费的不同时间段来计算WSN能耗,假设聚类中WN数据包时间间隔为指数分布,采用两级TDMA方法实现对多步聚类的评估。利用OPNET Modeler软件执行仿真实验验证了本文模型的有效性,仿真结果表明,基于接收的SAS的能效是基于发送的SAS的5倍,相比基于分簇的TDMA/CDMA混合HCT-MAC协议,本文协议可节省4.3%的能量,减少了0.35ms的端到端延迟,相比倍增超周期多信道MAC协议,可节省10.8%的能量,减少了1ms的端到端延迟。     

针对无线传感网络的内存数据压缩算法

无线传感网络是能量受限的网络环境。很多研究通过分析改善网络分层模型中各层协议,延长了无线传感网络环境下单节点和全局网络寿命。使用了若干种压缩方法:报文级压缩、报文头压缩和载荷压缩,以减少传输数据冗余,节省传感器发送接收的能量损耗。用压缩率较高的LWO算法压缩载荷内容;对占用空间相对较小但需要多次解析的协议包头,宜用报文级和报文头压缩算法,从而在压缩数据冗余的同时,减轻传感器节点压缩解压操作的开销。这种压缩算法是一种内存压缩,它保留了数据块的部分含义,在压缩率和CPU开销间达到了较好的平衡。     

基于功率控制和冲突避免的无线Mesh网络低能耗MAC协议

为了解决IEEE 802.11协议在无线Mesh网络中能量利用效率低的问题,提出一种改进的低能耗MAC协议PCCA。PCCA协议在IEEE 802.11协议的基础上加入两个核心算法,即动态功率控制算法(DPCA)和冲突避免算法(CAA),以此降低能耗。DPCA通过接收节点计算发送节点所需的最佳发射功率,降低数据发送的能耗;CAA利用邻居通信状态表对潜在的冲突进行判断,让可能引起冲突的节点进入休眠以节约能量。仿真结果表明PCCA协议最多可降低约20%的能耗。     

无线传感器网中基于时隙轮循的串音控制策略

提出了一种基于时隙轮循的无线传感器网络MAC协议串音控制策略。此策略以簇结构组织网络,由簇头为簇内节点分配互不重叠的工作时隙,并以自带信令的方式来避免节点之间可能的串音。理论分析及仿真表明采用时隙轮循的串音控制策略有效地减少了节点间的串音,提高了无线传感器网络MAC协议的能量有效性。     

传感网络中误差有界的分段逼近数据压缩算法

无线传感器网络通常能量、带宽有限.一个关键而实用的需求是,在保证数据质量的情况下,对持续到达的采样数据进行在线式压缩.主要贡献:①利用传感器节点内置的缓冲区,提出了单传感器节点上基于分段常量逼近的准在线式数据压缩算法(PCADC-sensor),并给出了在无穷范数误差度量下的实现;②提出了单传感器节点上基于分段线性逼近的在线式数据压缩算法(PLADC-sensor).分别在无穷范数和2范数误差度量的情况下给出了计算PLA的两种简单快速算法,推导了分段线性一致逼近的充要条件;③簇头或基站无需接收原始采样数据,提出了基于原始数据的分段线性表示的压缩算法(PLRDC-cluster),推导了同一节点不同时段、不同节点相同时段两种情况下的计算公式.实验结果表明,这些算法较好地匹配了传感器数据流模型,显著减少了冗余数据传输.     

多跳无线传感器网络的高能效数据收集协议

提出了一种集基于节点地理位置信息的集成拓扑控制、MAC和路由为一体的高能效数据收集协议REEGF(geographic forwarding protocol with reliable and energy-efficient).REEGF使用了具有双无线信道协作通信结构的网络节点,以利用唤醒信道发送和侦听忙音减少节点的空闲侦听时间.利用无线传感器网络的时间同步算法和依赖于本地节点密度、节点剩余能量的概率同步调度算法,REEGF使处于监测状态的网络节点以概率在每个网络侦听周期同步唤醒,减少冗余节点的空闲     

一种基于功率控制的无线传感器网络MAC协议

提出了一种基于功率控制的无线传感器网络MAC协议,根据节点接收阈值,计算出节点发送最优功率,在根本上减小发送功率从而节省节点能量。为了减少节点间的碰撞,引入了自适应调整竞争窗口和快速退避机制,减少节点空闲时间,从而进一步减少节点耗能。仿真结果显示在能量和吞吐量上都有显著提高。     

一种基于空间相关性的无线传感器网络MAC协议

在大规模无线传感器网络中传输的监测数据具有较大的空间相关性,数据的传输存在一定冗余.如何有效的减少冗余数据的传输来改善网络性能成为一个重要的研究课题.本文以环状空间相关性模型为基础,从节点的筛选策略研究入手,提出一种能量高效的无线传感器网络MAC协议SEMAC.SEMAC协议采用信号强度优先的节点选择算法和冲突避免机制...     

基于广播机制的流量自适应混合MAC协议研究

针对流量自适应混合MAC协议的不足,提出一种广播机制改进方案.在基于CSMA和TDMA流量自适应混合MAC协议基础上引入广播机制,节点被提前通知只在发送或接受数据时处于活动状态,其他时刻则处于休眠状态,从而能最大限度地避免串音,空闲侦听和数据冲突.NS2仿真表明,改进的协议能进一步减少系统能量消耗,维持较高的吞吐率.     

适用于水声传感网络的多链路传输MAC协议

针对水声传感网络存在的高时延、低信道利用率等问题,提出一种新的多链路传输介质访问控制协议.该协议节点通过RTS/CTS握手协议交互时延信息和传输计划,实现多条链路传输数据.在汇聚节点接收多个节点的数据时,汇聚节点根据节点的时延和接收的数据帧大小规划节点之间的发送顺序,避免传输冲突造成的能量损失和低信道利用率,同时为得到...     

A novel gossip-based sensing coverage algorithm for dense wireless sensor networks

Wireless sensor networks (WSNs) have been widely studied and usefully employed in many applications such as monitoring environments and embedded systems. WSNs consist of many nodes spread randomly over a wide area; therefore, the sensing regions of different nodes may overlap partially. This is called the “sensing coverage problem”. In this paper, we define a maximum sensing coverage region (MSCR) problem and present a novel gossip-based sensing-coverage-aware algorithm to solve the problem. In the algorithm, sensor nodes gossip with their neighbors about their sensing coverage region. In this way, nodes decide locally to forward packets (as an active node) or to disregard packets (as a sleeping or redundant node). Being sensing-coverage-aware, the redundant node can cut back on its activities whenever its sensing region is k-covered by enough neighbors. With the distributed and low-overhead traffic benefits of gossip, we spread energy consumption to different sensor nodes, achieve maximum sensing coverage with minimal energy consumption in each individual sensor node, and prolong the whole network lifetime. We apply our algorithm to improve LEACH, a clustering routing protocol for WSNs, and develop a simulation to evaluate the performance of the algorithm.     

Energy-aware node placement,topology control and MAC scheduling for wireless sensor networks

In the WSNs, the nodes closer to the sink node have heavier traffic load for packet forwarding because they do not only collect data within their sensing range but also relay data for nodes further away. The unbalanced power consumption among sensor nodes may cause network partition. This paper proposes efficient node placement, topology control, and MAC scheduling protocols to prolong the sensor network lifetime, balance the power consumption of sensor nodes, and avoid collision. Firstly, a virtual tree topology is constructed based on Grid-based WSNs. Then two node-placement techniques, namely Distance-based and Density-based deployment schemes, are proposed to balance the power consumption of sensor nodes. Finally, a collision-free MAC scheduling protocol is proposed to prevent the packet transmissions from collision. In addition, extension of the proposed protocols are made from a Grid-based WSN to a randomly deployed WSN, enabling the developed energy-balanced schemes to be generally applied to randomly deployed WSNs. Simulation results reveal that the developed protocols can efficiently balance each sensor node’s power consumption and prolong the network lifetime in both Grid-based and randomly deployed WSNs.     

CCS-MAC: Exploiting the overheard data for compression in wireless sensor networks

Both the overhearing and overhearing avoidance in a densely distributed sensor network may inevitably incur considerable power consumption. In this paper we propose a so-called CCS-MAC (collaborative compression strategy-based MAC) MAC protocol which facilitates to exploit those overheard data that is treated useless in traditional MAC protocols for the purpose of cost and energy savings. Particularly the CCS-MAC enables different sensor nodes to perform data compression cooperatively with regard to those overheard data, so that the redundancy of data prepared for the link layer transmission can be totally eliminated at the earliest. The problem of collaborative compression is analyzed and discussed along with a corresponding linear programming model formulated. Based on it a heuristic node-selection algorithm with a time complexity of (O(N²)) is proposed to the solve the linear programming problem. The node-selection algorithm is implemented in CCS-MAC at each sensor node in a distributed manner. The experiment results verify that the proposed CCS-MAC scheme can achieve a significant energy savings so as to prolong the lifetime of the sensor networks so far.     

A two-hop clustered image transmission scheme for maximizing network lifetime in wireless multimedia sensor networks

In traditional wireless sensor networks, normal sensor nodes which measure scalar physical phenomena like temperature, pressure and humidity usually compress the data before sending them out to minimize the communication energy consumption. However, this strategy may not be suitable for image transmission in wireless multimedia sensor networks. In the traditional clustering structure, when the camera-equipped node or the cluster head compresses the images, an energy hole will appear. This is a key factor that affects the lifetime of the network. To avoid the energy hole problem, a two-hop clustered image transmission scheme is proposed in this paper. In the proposed scheme, many redirectors are used to compress and forward the images for the purpose of reducing energy consumption of the camera-equipped node and the cluster head. With adaptive adjustment of the transmission radius in the camera cluster and tasks allocation based on the residual energy of the normal sensor nodes by the camera-equipped node, the energy consumption of the nodes in the network is balanced. The experimental results show that the proposed scheme can prolong the network lifetime dramatically in the case of the sensor nodes deployed densely.     

无线传感器网络中基于关联度的多查询优化

无线传感器网络是一种以数据为中心的网络,用户通过基站向网络提出查询请求获取所需数据。如何通过多查询的优化来减少传感器节点的能耗以延长网络生命期是无线传感器网络中需要解决的关键问题之一。提出了基于关联度的多查询优化算法,其基本思想是节点通过节点与候选父亲节点之间的关联度来选择父节点,从而被相同查询覆盖的节点聚集成一个组,多个查询间共享组中节点的数据,在网络中对查询数据进行有效的融合,充分减少了网络的数据传输量,延长了网络的生命期。理论分析和模拟实验表明该算法可以充分减少数据传输量,从而达到节能的目的。     

一种带有可控阈值参数的分簇路由优化算法

针对传感网中大量冗余数据导致通信频繁中断的问题,提出一种带有可控阈值参数的分簇路由优化算法。引入蚁群算法中的适应度函数和启发式函数,使得下一跳簇首节点的选择更具针对性,实现网络路由树的建立与事件域节点的分布式成簇。利用可控阈值参数和变异系数对网络路由所选最短路径进行优化,保证节点能量消耗较低的同时全网延时最小,并通过全局信息素的更新策略抑制长链路的产生,以均衡全网能量并延长网络生存周期。实验结果表明,该算法与DMOA和MTTA算法在抑制网络能量消耗和延长网络生存周期方面进行对比,其性能指标平均提升了13.72%和12.06%。     

水声传感器网络中的节能路由协议改进算法

在大规模三维水声传感器网络中,针对节点能耗和网络传输效率的问题,本文基于节点定位和LEACH算法,提出了一种适用于水声通信传感器网络路由算法,该算法采用定位、聚类、唤醒和排列的思想,首先通过定位,确定节点的位置信息,再通过聚类方法,使水下的节点分成不同的簇,形成节点休眠及唤醒的单元.在数据通信过程中,通过及时唤醒簇单元,使需要利用的簇节点及时被唤醒,处于活跃状态,而暂时不被需要的节点进行休眠,从而达到节能的效果.而在簇内传输时,考虑了节点的剩余能量信息,选择最优节点进行信息传输.仿真实验表明,该算法能够提高网络的整体寿命时间.     

无线传感器网络能量均衡的多sink分簇路由算法

针对无线传感器网络中传感器节点能量有限以及节点能耗不均衡的问题,提出了一种基于能量均衡的多sink分簇路由算法（EBMCR）。该算法在簇头选择阶段,综合考虑了节点的剩余能量级和节点到sink的距离等因素选择簇头节点;在簇间通信过程,采用多跳传输的方式,综合考虑了路径能量消耗、路径最小剩余能量和节点到sink的跳数等因素,选择节点到多个sink的最优路径。仿真结果表明,该算法能够有效地均衡网络能量,延长网络生命周期。