无线传感器网络中一种近似Skyline 查询处理算法

由于无线传感器网络的能源有限,且在许多应用中Skyline 查询的部分结果即可满足用户需求,提出了一 种近似Skyline 查询处理算法,在满足用户查询需求的前提下最大化地节省能量.该算法仅需无线传感器网络中的部 分传感器节点回传其感知数据即可计算出Skyline 查询的一个近似结果集.由于该算法在处理查询时,每个传感器节 点只需考察自身数据信息即可决定是否回传其感知数据,而无须与其他传感器节点的感知数据进行比较,因此可以 避免大量的网内通信开销,从而节省网络能源.模拟环境下的大量实验结果表明,该算法可以根据用户的应用需求, 节能地处理传感器网络中的近似skyline 查询.     

基于压缩感知的水下传感器网络预约多址接入协议

相比于陆地无线传感器网络, 水下传感器网络拥有更大的传播时延, 导致许多已经比较成熟的MAC协议不能直接应用于水下。提出了基于压缩感知的水下传感器网络预约多址接入协议, 充分利用水下环境中的长传播时延, 使网络中各节点能够在时间和空间上对信道资源进行共用, 实现多个用户同时进行信道预约, 提高了信道的利用率。在考虑多用户分集基础上, 该协议使成功预约到信道的用户可以利用有限的全部带宽资源进行高速传输, 以此来提高整个网络的吞吐性能。仿真结果表明, 与传统的RTS/CTS方案相比, 该协议具有更高效的信道预约能力, 更高的数据传输效率, 以及更好的吞吐性能。     

高数据融合的非均匀分簇无线传感器网络路由协议*

探讨了基于非均匀分簇的无线传感器网络路由协议,提出了一种高数据融合的非均匀分簇无线传感器网络路由协议。仿真实验结果表明,该路由协议有效地平衡了无线传感器网络的节点能耗,延长了网络的存活时间。     

一种空间查询高效的无线传感网络路由协议

在以数据为中心的大规模无线传感网络中,感知数据查询通常以空间查询为主,而感知节点携带能量极为有限,因此提高感知数据空间查询能量利用效率尤为重要。 GeoGrid协议是一种完全基于地理位置信息的路由协议,适用于大规模无线传感网络应用场景,但其空间查询效率较低。针对大规模空间查询应用场景,从成簇方式、簇首选举、网络拓扑层次构建及路由策略等方面对 GeoGrid 进行优化,提出一种基于四叉树结构的空间查询能量高效的无线传感网络路由协议———QuadGrid,并对 GeoGrid、QTBDC 及 QuadGrid 的空间查询能耗进行仿真分析。实验结果表明,与 GeoGrid、QTBDC 相比, QuadGrid网络能耗更均衡,网络生命周期更长,空间查询更高效。     

Random coverage with guaranteed connectivity: joint scheduling for wireless sensor networks

Sensor scheduling plays a critical role for energy efficiency of wireless sensor networks. Traditional methods for sensor scheduling use either sensing coverage or network connectivity, but rarely both. In this paper, we deal with a challenging task: without accurate location information, how do we schedule sensor nodes to save energy and meet both constraints of sensing coverage and network connectivity? Our approach utilizes an integrated method that provides statistical sensing coverage and guaranteed network connectivity. We use random scheduling for sensing coverage and then turn on extra sensor nodes, if necessary, for network connectivity. Our method is totally distributed, is able to dynamically adjust sensing coverage with guaranteed network connectivity, and is resilient to time asynchrony. We present analytical results to disclose the relationship among node density, scheduling parameters, coverage quality, detection probability, and detection delay. Analytical and simulation results demonstrate the effectiveness of our joint scheduling method.     

Performance analysis of an adaptive,energy-efficient MAC protocol for wireless sensor networks

We propose an adaptive and energy-efficient TDMA-based MAC protocol that significantly reduces energy consumption in the network, while efficiently handling network traffic load variations and optimizing channel utilization through a timeslot stealing mechanism and a timeslot reassignment procedure. We have analytically derived the average delay performance of our MAC protocol, with and without the timeslot stealing mechanism. Our delay model, validated via simulations, shows that the timeslot stealing mechanism can substantially improve the protocol throughput in scenarios with varying and asymmetric traffic patterns. Evaluation results show that the timeslot reassignment procedure is efficient in handling the longer timescale changes in the traffic load, while the timeslot stealing mechanism is better in handling the shorter timescale changes in the traffic patterns.     

一种无线传感器网络的多优先级数据聚集协议

无线传感器网络当前已成为一种新的分布计算模式，由于大部分无线传感器网络中节点的能源是不可补充的，因此需使用数据聚集协议提高整个网络的生命周期，传统的数据聚集协议不能保证网络中的高实时性数据的延迟较低．文中提出的DAIDA协议根据节点上的流量状况及数据的不同优先级要求自适应地调整数据链路层发送的数据包的大小，模拟结果表明，高实时性数据通过网络的延迟低于低实时性数据的延迟，并且延长了无线传感器网络的生命周期。     

SEEL:无线传感器网络下自适应、低延迟的节能媒质接入控制协议

无线传感器网络有着广泛的应用前景,然而由于传感器节点能量有限,因此传感器网络上运行的协议必须具备能量有效性以获得较长的生命周期.而媒质接入控制子层是节点能量消耗的主要所在,因此无线传感器网络设计的关键问题之一是媒质的接入控制.提出了一种自适应低延迟的节能MAC协议——SEEL协议,根据当前的网络负载自适应地调节竞争窗口的大小,从而减小节点数据传送的碰撞几率和由于碰撞而导致的能量消耗;采用了快速退避机制,减少了节点在退避过程中的空闲监听时间;扩展了RTS/CTS消息机制,可减少节点在每帧活动阶段的时间以及减小数据的延迟,两者都能节约能量的使用.实验结果显示,SEEL协议具有比S-MAC和TEEM协议更好的性能.     

无线传感器网络快速组网机制的改进

无线网络的入网连接时延过长,在要求快速组网的场合下应用不理想。对IEEE802.15.4无线传感器网络的协议进行了改进,NS2仿真结果证明,与原协议标准相比,分别将入网连接的两个步骤时延缩短了90%和80%左右,改进效果非常明显,使得无线网络能够应用到实时监测场合。     

Dynamic duty cycle and adaptive contention window based QoS-MAC protocol for wireless multimedia sensor networks

Rapid penetration of small, customized wireless devices and enormous growth of wireless communication technologies has already set the stage for large-scale deployment of wireless sensor networks. While the need to minimize the energy consumption has driven significant researches in wireless sensor networks, offering some precise quality of service (QoS) for multimedia transmission over sensor networks has not received significant attention. However, the emerging new applications like video surveillance, telemedicine and traffic monitoring needs transmission of wireless multimedia over sensor networks. Naturally, offering some better QoS for wireless multimedia over sensor networks raises significant challenges. The network needs to cope up with battery-constraints, while providing improved QoS (end-to-end delay and bandwidth requirement). This calls for a suitable sensory MAC protocol capable of achieving application-specific QoS. In this paper, we have proposed a new QoS-based sensory MAC protocol, which not only adapts to application-oriented QoS, but also attempts to conserve energy without violating QoS-constraints. Performance modeling, analysis and simulation results demonstrate that the proposed protocol is capable of providing lower delay and better throughput, at the cost of reasonable energy consumption, in comparison to other existing sensory MAC protocols.     

面向带状无线传感网低延迟可靠数据收集算法

带状无线传感网为长距离带状分布，现有的数据收集算法无法很好解决其数据收集延迟较大的问题。提出了一种主动定位移动Sink的数据收集算法DCFAN（Data Collection based on Forwarding of Agent Nodes），DCFAN构建移动Sink的同步代理节点以及存储同步代理节点的线节点序列，通过获取同步代理节点转发感知数据到Sink汇聚点。仿真结果表明，DCFAN算法能有效降低网络节点能耗以及数据收集延迟，同时提升数据收集率，适用于对数据收集延迟具有一定要求的带状无线传感网应用场景。     

An efficient data-centric storage method using time parameter for sensor networks

In wireless sensor networks, various schemes have been proposed to efficiently store and process sensed data. Among them, the data-centric storage (DCS) scheme is one of the most well-known. The DCS scheme distributes data regions and stores the data in the sensor that is responsible for the region. The DCS based scheme was proposed to reduce the communication cost for transmitting data and to efficiently process exact queries and range queries. Recently, a KDDCS scheme was proposed to overcome storage hot-spots by dynamically readjusting the distributed data regions to sensors based on the K-D tree. However, the existing DCS based schemes including KDDCS suffer from query hot-spots that are formed when query regions are not uniformly distributed. As a result, it reduces the lifetime of the sensor network.In this paper, we propose a new DCS based scheme, called Time-Parameterized Data-Centric Storage (TPDCS), that avoids the problems of storage hot-spots and query hot-spots. To decentralize the skewed data and queries, the data regions are assigned by a time dimension as well as data dimensions in our proposed scheme. Therefore, TPDCS extends the lifetime of sensor networks. It is shown through various experiments that our scheme outperforms the existing schemes.     

无线传感器网络中ERARP拓扑控制算法

为了延长无线传感器网络的生命周期,进行了无线传感器网络中节能路由协议的探索性研究,提出了一种新的节能路由协议并将其具体实现.首先分析了传感器网络应用的特点以及设计和应用中的限制,综述了现有传感器网络中节能路由设计的方法,设计并实现了一种基于能量的半径自适应路由协议ERARP;然后在OPNET仿真平台上对该协议进行了仿真模拟;最后与无线传感器网络传统的两种节能路由协议基于信息协商的传感器网络协议和直接扩散协议在同等条件下针对节点能量使用、延迟、丢包率和吞吐量等四个性能评价指标进行了对比.结果表明,ERARP使得节点能够根据自身剩余能量的状况对节点的运行模式进行控制,同时对无线模块的收发半径进行动态调整,达到节能目的.     

Performance analysis of opportunistic broadcast for delay-tolerant wireless sensor networks

This paper investigates a class of mobile wireless sensor networks that are unconnected most of the times; we refer to them as delay-tolerant wireless sensor networks (DTWSN). These networks inherit their characteristics from both delay tolerant networks (DTN) and traditional wireless sensor networks. After introducing DTWSNs, three main problems in the design space of these networks are discussed: routing, data gathering, and neighbor discovery. A general protocol is proposed for DTWSNs based on opportunistic broadcasting in delay-tolerant networks with radio device on-off periods. Three performance measures are defined in the study: the energy for sending queries to ask for data from possible neighbors (querying energy), data transfer energy, and absorption time (delay). A simple yet accurate approximation for the data-transfer energy is proposed. An analytic model is provided to evaluate the querying energy per contact (epc). Simulation results for the data propagation delay show that the querying energy per contact measure obtained from the analytic model is proportional to the product of the querying energy and the delay. A practical rule of thumb for an optimal query interval in terms of delay and energy is derived from different parts of the study.     

无线传感器网络的一种数据管理底层协议

以数据为中心(data-centric)的数据管理是当今公认的无线传感器网络数据管理模式,由于其通讯量小、可扩展性好、适应网络规模和拓扑变化等优良性能而受到日益广泛的关注。提出一套适用于无线传感器网络的数据管理底层协议,其基本功能是利用传感器节点的数据通讯和存储能力,使某区域的数据(包括历史数据)总保存在离该区域最近的传感器节点中,而不随最初采集该数据节点的关闭或移动而丢失或移动。该协议在网络中建立起的结构稳定性,使网络中的数据查询过程避免了因网络拓扑的动态变化造成的访问中断和路由更换,为以数据为中心(data-centric)的数据管理的可靠实现提供了支持。     

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

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

考虑干扰的无线传感器网络拓扑控制问题研究

无线传感器网络的拓扑控制是一个十分重要的技术问题。干扰对传感器网络应用产生了重要的影响,较大的传输干扰将导致信号的碰撞,增大网络延时间。但是,目前的大多数文献没有把干扰作为传感器网络拓扑控制的设计目标和考虑因素之一。本文研究考虑干扰的拓扑控制机制问题,根据传感器网络通信特点,设计了最优的集中式算法和适合合实际应用的次优分布式算法解决该问题。模拟实验结果表明,提出的算法与传统算法相比能有效减少网络干扰、节省能量消耗和减少网络延时,因此是一种新的高效的拓扑控制机制。     

Multiround Distributed Lifetime Coverage Optimization protocol in wireless sensor networks

Coverage and lifetime are two paramount problems in wireless sensor networks (WSNs). In this paper, a method called Multiround Distributed Lifetime Coverage Optimization protocol (MuDiLCO) is proposed to maintain the coverage and to improve the lifetime in wireless sensor networks. The area of interest is first divided into subregions, and then the MuDiLCO protocol is distributed to the sensor nodes in each subregion. The proposed MuDiLCO protocol works in periods during which sets of sensor nodes are scheduled, with one set for each round of a period, to remain active during the sensing phase and thus ensure coverage so as to maximize the WSN lifetime. The decision process is carried out by a leader node, which solves an optimization problem to produce the best representative sets to be used during the rounds of the sensing phase. The optimization problem formulated as an integer program is solved to optimality through a Branch-and-Bound method for small instances. For larger instances, the best feasible solution found by the solver after a given time limit threshold is considered. Compared with some existing protocols, simulation results based on multiple criteria (energy consumption, coverage ratio, and so on) show that the proposed protocol can prolong efficiently the network lifetime and improve the coverage performance.     

End-to-end delay estimation for multi-hop wireless networks with random access policy

End-to-end delay analysis is an important element of network performance analysis in multi-hop wireless networks.In this paper,we propose an analytical model for estimating the end-to-end delay performance of wireless networks employing a random access policy for managing node’transmissions on shared channels with time-varying capacity.To obtain the closed form expression,a new concept of residual effective capacity is presented using the definitions of effective bandwidth theory and effective capacity theory.This allows us to calculate the cumulative distribution function of the queuing delay.Based on this concept,we derive a formula to calculate the average end-to-end delay for multi-hop wireless networks,with the result including the effect of a random access protocol,which has not previously been considered.Finally,we validate our analysis through simulations and provide an example application for our results.     

Optimizing in-network aggregate queries in wireless sensor networks for energy saving

This study proposes a method of in-network aggregate query processing to reduce the number of messages incurred in a wireless sensor network. When aggregate queries are issued to the resource-constrained wireless sensor network, it is important to efficiently perform these queries. Given a set of multiple aggregate queries, the proposed approach shares intermediate results among queries to reduce the number of messages. When the sink receives multiple queries, it should be propagated these queries to a wireless sensor network via existing routing protocols. The sink could obtain the corresponding topology of queries and views each query as a query tree. With a set of query trees collected at the sink, it is necessary to determine a set of backbones that share intermediate results with other query trees (called non-backbones). First, it is necessary to formulate the objective cost function for backbones and non-backbones. Using this objective cost function, it is possible to derive a reduction graph that reveals possible cases of sharing intermediate results among query trees. Using the reduction graph, this study first proposes a heuristic algorithm BM (standing for Backbone Mapping). This study also develops algorithm OOB (standing for Obtaining Optimal Backbones) that exploits a branch-and-bound strategy to obtain the optimal solution efficiently. This study tests the performance of these algorithms on both synthesis and real datasets. Experimental results show that by sharing the intermediate results, the BM and OOB algorithms significantly reduce the total number of messages incurred by multiple aggregate queries, thereby extending the lifetime of sensor networks.