基于无线传感器网络汇聚传输实时性的分布式调度算法

在无线传感器网络多种应用中,各节点需要在短时间内将采集的数据传输至汇聚节点,从而形成多对一的汇聚传输。针对网络汇聚传输的实时性,提出了一种分布式的节点传输调度算法。各节点只需要根据一跳范围内的邻居信息进行传输调度。仿真和分析表明该算法可以有效避免数据碰撞,并使得完成一次全网数据收集所需要的时隙数基本在网络节点总数的1.6到1.8倍左右,比目前其他调度算法在实时性和复杂度方面更具有优势。     

基于网络编码的无线传感网F-CS_n汇播增益的研究

在无线传感器网络（WSNs）中网络编码是一个研究热点,主要集中在单播模式、多播模式和广播模式。而汇播模式是无线传感器网络中很常见的通信模式并且相关的研究工作还很少。为了研究网络编码在汇播模式中的编码增益,提出了一种新的汇播模式F-CSn模型网络（完全型）。从理论上推导出了采用线性网络编码的优势、仿真证明了理论推导的准确性、和Tang等提出的CSn模型网络（非完全型）进行比较证明F-CSn模型网络（完全型）具有更多的可靠性增益。最终结论显示F-CSn模型网络（完全型）是更具有普遍性、适用性、更加提高网络传输可靠性的网络编码模型。     

Square partition‐based node scheduling algorithm for wireless passive sensor networks

Wireless passive sensor networks play an important role in solving the energy limitation of nodes in the Internet of Things, and node scheduling is a significant method used to improve the energy utilization of nodes. In this work, an unused energy model based on analyzing the energy consumption characteristics of passive nodes is proposed because no unified model of passive sensor nodes is reported in previous studies. A rapid square partition clustering method is proposed according to the analysis of the relation between the sensing and communication radii of nodes, and the secondary grouping and node scheduling in each cluster are implemented to ensure the coverage rate of networks. Experimental results show that the state distribution of nodes in the proposed algorithm is favorable. The performance of the proposed algorithm is significantly affected by the P ratio between the working and charging powers of nodes. When the value of P is less than 100, the network coverage and connectivity rate are maintained at more than 95% and 90%, respectively, and are both higher than the existing algorithm.     

Interference‐aware spectrum handover for cognitive radio networks

Cognitive radio (CR) is a promising technique for future wireless networks, which significantly improves spectrum utilization. In CR networks, when the primary users (PUs) appear, the secondary users (SUs) have to switch to other available channels to avoid the interference to PUs. However, in the multi‐SU scenario, it is still a challenging problem to make an optimal decision on spectrum handover because of the the accumulated interference constraint of PUs and SUs. In this paper, we propose an interference‐aware spectrum handover scheme that aims to maximize the CR network capacity and minimize the spectrum handover overhead by coordinating SUs’ handover decision optimally in the PU–SU coexisted CR networks. On the basis of the interference temperature model, the spectrum handover problem is formulated as a constrained optimization problem, which is in general a non‐deterministic polynomial‐time hard problem. To address the problem in a feasible way, we design a heuristic algorithm by using the technique of Branch and Bound. Finally, we combine our spectrum handover scheme with power control and give a convenient solution in a single‐SU scenario. Experimental results show that our algorithm can improve the network performance efficiently.Copyright © 2012 John Wiley & Sons, Ltd.     

Multi‐regional query scheduling in wireless sensor networks with minimum latency

Query scheduling as one of the most important technologies used in query processing has been widely studied recently. In this paper, we investigate the Minimum Latency Multi‐Regional Query Scheduling (ML‐MRQS) problem in wireless Sensor Networks (WSNs), which aims to generate a scheduling plan with minimum latency under a more practical query model called Multi‐Regional Query (MRQ). An MRQ targets at interested data from multiple regions of a WSN, where each region is a subarea. Because the ML‐MRQS problem is NP‐hard, we propose a heuristic scheduling algorithm Multi‐Regional Query Scheduling Algorithm (MRQSA) to solve this problem. Theoretical analysis shows that the latency of MRQSA is upper bounded by 23A + B + C for an MRQ with m query regions , where is the maximum latency for non‐overlapped regions, is the maximum latency for overlapped regions, and is the accumulated latency for data transmission from the accessing nodes to the sink. Simulation results show that MRQSA reduces latency by 42.7% to 51.63% with respect to different number of query regions, network density, region size, and interference/transmission range compared with C‐DCQS, while guaranteeing energy efficiency. Copyright © 2012 John Wiley & Sons, Ltd.     

QoS‐aware target coverage in wireless sensor networks

Wireless sensor networks have emerged recently as an effective way of monitoring remote or inhospitable physical targets, which usually have different quality of service (QoS) constraints, i.e., different targets may need different sensing quality in terms of the number of transducers, sampling rate, etc. In this paper, we address the problem of optimizing network lifetime while capturing those diversified QoS coverage constraints in such surveillance sensor networks. We show that this problem belongs to NP‐complete class. We define a subset of sensors meeting QoS requirements as a coverage pattern, and if the full set of coverage patterns is given, we can mathematically formulate the problem. Directly solving this formulation however is difficult since number of coverage patterns may be exponential to number of sensors and targets. Hence, a column generation (CG)‐based approach is proposed to decompose the original formulation into two subproblems and solve them iteratively. Here a column corresponds to a feasible coverage pattern, and the idea is to find a column with steepest ascent in lifetime, based on which we iteratively search for the maximum lifetime solution. An initial feasible set of patterns is generated through a novel random selection algorithm (RSA), in order to launch our approach. Experimental data demonstrate that the proposed CG‐based approach is an efficient solution, even in a harsh environment. Simulation results also reveal the impact of different network parameters on network lifetime, giving certain guidance on designing and maintaining such surveillance sensor networks. Copyright © 2009 John Wiley & Sons, Ltd.     

Interference‐aware MAC scheduling and admission control for multiple mobile WBANs used in healthcare monitoring

In this paper, we address the problem of interference when multiple time division multiple access‐based wireless body area networks (WBANs) come in the proximity of one another. We propose a simple solution that creates common non‐conflicting schedule between these interfering WBANs. Our proposed scheme allows the reuse of maximum possible time slots among WBANs that are two‐hop neighbors of one another. A flow admission control scheme is applied to control the flows during the period of interference. We show that the percentage of flows admitted because of flow control decreases with the increase in the network size and flow rate. We simulated a scenario where WBANs move randomly within a simulation area with a certain speed and meet at a particular point. We show that the signal to interference noise ratio (SINR) value of WBANs changes as long as they are within the transmission range of one another. Also, we show that the exchanges of common schedule (which is dependent on the number of times the SINR value drops below the threshold) are required in order to improve the packet delivery ratio in WBANs. Copyright © 2014 John Wiley & Sons, Ltd.     

Energy‐aware supply route data collecting methods using wireless sensor networks

In military action, marching is a common method used for supply‐troop movement. Supply routes are typically in the wilderness where the route conditions change over time. This paper proposes a power‐saving algorithm allowing supply troops to collect route information using wireless sensor network technology. Each member in the marching supply troop is equipped with a battery‐powered sensor. To save power consumption, the proposed methods schedule the sleeping period for each member according to the size of the marching supply troop and its moving velocity. Two data carrying methods are proposed to reduce the frequency of long‐distance data uploading. The first method allows the uploaded data to be carried within a single‐round data collection period, and the second method extends the data carrying period to multiple rounds. The simulation results show that scheduling a sleep period can prolong the sensing distance along the route. These two proposed methods can add an additional 18–70% in distance data over methods without scheduling a sleep period. The energy spent on long‐distance data transmissions can be improved by 7–25%. Copyright © 2015 John Wiley & Sons, Ltd.     

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.     

A cross-layer design: energy efficient multilevel dynamic feedback scheduling in wireless sensor networks using deadline aware active time quantum for environmental monitoring

Recently, Packet scheduling plays a vital role in Wireless Sensor Networks (WSNs). The major key challenges include delay, packet dropping, energy consumption and lifetime due to constraints in energy and computing resources. All the research works on packet scheduling scheme in WSN uses only First Come First Served (FCFS) and Dynamic Multilevel Priority (DMP) schemes. FCFS works based on packet arrival time, it leads to starvation and high processing overhead for real-time packets. DMP works in multilevel with dynamic priority reduces the transmission overhead and bandwidth; it consumes more resources for real-time task leads to deadlock. To solve these problems, this work presents Multilevel Dynamic Feedback Scheduling (MDFS) algorithm. The sensor node classifies the emergency and normal data into three different ready queues named as high, medium and low priority, respectively. The queues are connected with a feedback mechanism; each packet from the sensor node has its own time quantum value based on the deadline. The updated time quantum value is compared with the boundary value of the queues, depends on the updated value the data packets are moved between queues with help of feedback mechanism. The simulation result proves that the projected MDFS outperforms in WSN environment.     

A time efficient aggregation convergecast scheduling algorithm for wireless sensor networks

Wireless Networks - We investigated the aggregation convergecast scheduling problem in wireless sensor networks. In order to reduce the time needed for data collection through aggregation...     

非均匀分布下无线传感器网络节点调度机制

针对传统依赖精确位置信息的计算复杂和无位置信息部署受限性等弊端,从理论上对节点部署方式进行分析,提出一种非均匀分布下的无线传感器网络节点调度NDNS(non-uniform distribution node scheduling)机制,该机制利用节点与邻居节点的距离信息,对节点覆盖冗余进行判别,适应于任意分布下的网络部署方式。通过实验对机制进行了性能分析和验证,结果表明该方案在保证网络覆盖的前提下,有效地延长了网络生存时间。     

Cross‐layer MAC design for location‐aware wireless sensor networks

In this paper, we propose an optimization of MAC protocol design for wireless sensor networks, that accounts for cross‐layering information, in terms of location accuracy for nodes and residual energy levels. In our proposed solution we encode this cross‐layer information within a decreasing backoff function in the MAC. The protocol is optimized by appropriately selecting priority window lengths, and we have shown that accurate cross‐layer information plays a crucial role in achieving an optimal performance at the MAC layer level. The estimation accuracy can be characterized spatially using a location reliability probability distribution function. We show that this distribution function greatly influences the design of the optimal backoff window parameters, and the overall throughput performance of the MAC protocol. Copyright © 2010 John Wiley & Sons, Ltd.     

无线传感器网络传输调度方法综述

针对无线传感器网络的特点,给出了传输调度问题的定义和一般约束条件,归纳了无线传感器网络传输调度算法的设计原则和分类方法,分析了当前典型的各类传输调度算法的主要机制,详细比较了这些算法的特点、性能差异和应用范围.最后总结了无线传感器网络传输调度算法的研究现状,指出了研究挑战和未来的研究重点.     

Performance study of wireless sensor and actuator networks in forest fire scenarios

Wireless sensor and actuator networks (WSANs) for environmental disaster scenarios are considered in this paper. A fully independent and autonomous WSAN system that is able to detect and extinguish a fire in a burning wildland area is proposed. Although forest fire detection is a classical application for sensor networks, in this paper, this research area is extended, taking into account actuators and their ability to put out fire in the presence of measurement inaccuracy and network degradation. A system architecture is proposed, modelled and discussed. An extensive set of computer simulations analysing the system performance is reported. The presented results show the efficiency of fire‐fighting actions depending on the sensors' density and the actuators' mobility. Copyright © 2012 John Wiley & Sons, Ltd.     

A frequency‐aware data‐centric mechanism for wireless sensor networks

Wireless sensor networks (WSNs) are characterized by their low bandwidth, limited energy, and largely distributed deployment. To reduce the flooding overhead raised by transmitting query and data information, several data‐centric storage (DCS) mechanisms are proposed. However, the locations of these data‐centric nodes significantly impact the power consumption and efficiency for information queries and storage capabilities, especially in a multi‐sink environment. This paper proposes a novel dissemination approach, which is namely the dynamic data‐centric routing and storage mechanism (DDCRS), to dynamically determine locations of data‐centric nodes according to sink nodes' location and data collecting rate and automatically construct shared paths from data‐centric nodes to multiple sinks. To save the power consumption, the data‐centric node is changed when new sink nodes participate when the WSNs or some queries change their frequencies. The simulation results reveal that the proposed protocol outperforms existing protocols in terms of power conservation and power balancing. Copyright © 2009 John Wiley & Sons, Ltd.     

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

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

Prolonging lifetime for wireless rechargeable sensor networks through sleeping and charging scheduling

Prolonging network lifetime is a fundamental requirement in wireless sensor network (WSN). Existing charging scheduling algorithms suffer from high node redundancy and energy consumption issues. In this paper, we study WSN charging problem from the perspectives of energy conservation combined with energy replenishment scheduling. Firstly, we detect the redundant nodes whose energy is wasted in the network functionality and develop a K‐covering redundant nodes sleeping scheduling algorithm (KRSS) for reducing energy. Secondly, we employed multiple wireless charging vehicles (WCVs) for energy replenishment and optimize the charging scheduling algorithm to prevent any exhaustion of nodes, and we proposed a distance and energy–oriented charging scheduling algorithm (DECS) with multiple WCVs. Simulation experiments are conducted to show the advantages of the proposed KRSS+DECS, confirming that our scheme is capable of removing redundant nodes, lowering node failures, and prolonging network lifetime.     

Reduced‐frame TDMA protocols for wireless sensor networks

Time‐division multiple‐access (TDMA) is a common medium access control paradigm in wireless sensor networks. However, in its traditional form, the TDMA‐based protocols suffer from low channel utilization and high message delay because of a long frame length needed to provide collision‐free transmissions, which is particularly damaging in dense wireless sensor networks. In this paper, we investigate the performance and the energy efficiency of a class of TDMA‐based protocols, called reduced‐frame TDMA, where every TDMA slot is augmented with a short time period dedicated for carrier sense multiple access‐based contention resolution mechanism. Because of their ability to dynamically resolve collisions caused by conflicting slot assignments, the reduced‐frame TDMA protocols can be configured with any frame length, independently of node density. In addition, we present a distributed heuristic slot assignment algorithm that minimizes interslot interference in the presence of limited number of slots per frame. The simulation results indicate that the reduced‐frame TDMA protocols significantly reduce the message delay and increase the maximum throughput without incurring significant penalty in energy efficiency compared with the traditional TDMA scheme. Copyright © 2012 John Wiley & Sons, Ltd.     

Optimal power‐aware relay placement for cooperative wireless sensor networks

We study the problem of optimizing the symbol error probability (SEP) performance of cluster‐based cooperative wireless sensor networks. Recent studies in literature show that an efficient relay selection protocol based on simple geographical information of the nodes to execute cooperative diversity can significantly improve the SEP performance at the destination of such networks. As well, similar line of research on optimal power allocation (for the source and relay nodes) can be found in literature. However, to achieve the best SEP performance at the destination of a cooperative wireless sensor network, joint optimization of power allocation and relay placement should be accomplished. To this aim, we reformulate the SEP of a multi‐hop cooperative communication in a general form and optimize transmitted power level and relay placement simultaneously. This analysis is developed for both amplify‐and‐forward and decode‐and‐forward relaying protocols. Simulation results demonstrate that the proposed joint optimization can effectively improve the SEP performance of the network. Copyright © 2013 John Wiley & Sons, Ltd.