无线传感网络中的目标分类融合

In wireless sensor networks, target classification differs from that in centralized sensing systems because of the distributed detection, wireless communication and limited resources. We study the classification problem of moving vehicles in wireless sensor networks using acoustic signals emitted from vehicles. Three algorithms including wavelet decomposition, weighted k-nearest-neighbor andDempster-Shafer theory are combined in this paper. Finally, we use real world experimental data to validate the classification methods. The result shows that wavelet based feature extraction method can extract stable features from acoustic signals. By fusion with Dempster's rule, the classification performance is improved.     

Balancing the power consumption speed in flat and hierarchical WSN

A combination of a cluster tree routing protocol and an Ad hoc on demand vector (AODV) routing protocol is used in the latest ZigBee standard wireless sensor networks (WSNs) technology. However, the AODV routing protocol has no means by which to take into consideration the power consumption of the nodes during the routing process. Therefore, a new approach is proposed in this paper to balance the power consumption speed and to distribute the responsibilities of routing among fiat wireless sensor nodes and the three levels of hierarchical wireless sensor nodes. These three levels are based on the three types of devices, which are used in the ZigBee standard: the coordinator, the touters, and the end devices. In this paper, we have compared the original AODV routing protocol with our extension approach for the distribution of power consumption. Based on the simulation results, our new approach has achieved better performance in terms of increasing the lifetime of the fiat wireless sensor network, the personal area network (PAN)coordinator, the touters, and the whole network of the hierarchical wireless sensor network. Additionally, it has better performance in terms of distributing the power consumption among the key nodes of the wireless sensor network.     

Target tracking based on the extended H-infinity filter in wireless sensor networks

In this paper, we propose a new target tracking approach for wireless sensor networks (WSNs) by using the extended H-infinity filter. First, the extended H-infinity filter for nonlinear discrete-time systems is deduced through the Krein space analysis scheme. Then, the proposed extended H-infinity filtering algorithm is applied to target tracking in wireless sensor networks. Finally, experiments are conducted through a small wireless sensor network test-bed. Both experimental and simulation results illustrate that the extended H-infinity filtering algorithm is more accurate to track a moving target in wireless sensor networks than using the extended Kalman filter in the case of having no knowledge of the statistics of the environment and the target to be tracked.     

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.     

A Hyper-Heuristic Framework for Lifetime Maximization in Wireless Sensor Networks With A Mobile Sink

Maximizing the lifetime of wireless sensor networks(WSNs) is an important and challenging research problem. Properly scheduling the movements of mobile sinks to balance the energy consumption of wireless sensor network is one of the most effective approaches to prolong the lifetime of wireless sensor networks. However, the existing mobile sink scheduling methods either require a great amount of computational time or lack effectiveness in finding high-quality scheduling solutions. To address the above issues, this paper proposes a novel hyperheuristic framework, which can automatically construct high-level heuristics to schedule the sink movements and prolong the network lifetime. In the proposed framework, a set of low-level heuristics are defined as building blocks to construct high-level heuristics and a set of random networks with different features are designed for training. Further, a genetic programming algorithm is adopted to automatically evolve promising high-level heuristics based on the building blocks and the training networks. By using the genetic programming to evolve more effective heuristics and applying these heuristics in a greedy scheme, our proposed hyper-heuristic framework can prolong the network lifetime competitively with other methods, with small time consumption. A series of comprehensive experiments, including both static and dynamic networks,are designed. The simulation results have demonstrated that the proposed method can offer a very promising performance in terms of network lifetime and response time.     

Joint routing, scheduling, and power control for multichannel wireless sensor networks with physical interference

Reliability and real-time requirements bring new challenges to the energy-constrained wireless sensor networks, especially to the industrial wireless sensor networks. Meanwhile, the capacity of wireless sensor networks can be substantially increased by operating on multiple nonoverlapping channels. In this context, new routing, scheduling, and power control algorithms are required to achieve reliable and real-time communications and to fully utilize the increased bandwidth in multichannel wireless sensor networks. In this paper, we develop a distributed and online algorithm that jointly solves multipath routing, link scheduling, and power control problem, which can adapt automatically to the changes in the network topology and offered load. We particularly focus on finding the resource allocation that realizes trade-off among energy consumption, end-to-end delay, and network throughput for multichannel networks with physical interference model. Our algorithm jointly considers 1) delay and energy-aware power control for optimal transmission radius and rate with physical interference model, 2) throughput efficient multipath routing based on the given optimal transmission rate between the given source-destination pairs, and 3) reliable-aware and throughput efficient multichannel maximal link scheduling for time slots and channels based on the designated paths, and the new physical interference model that is updated by the optimal transmission radius. By proving and simulation, we show that our algorithm is provably efficient compared with the optimal centralized and offline algorithm and other comparable algorithms.     

Correlations between characteristics of maximum influence and degree distributions in software networks

Software systems can be represented as complex networks and their artificial nature can be investigated with approaches developed in network analysis.Influence maximization has been successfully applied on software networks to identify the important nodes that have the maximum influence on the other parts.However,research is open to study the effects of network fabric on the influence behavior of the highly influential nodes.In this paper,we construct class dependence graph(CDG)networks based on eight practical Java software systems,and apply the procedure of influence maximization to study empirically the correlations between the characteristics of maximum influence and the degree distributions in the software networks.We demonstrate that the artificial nature of CDG networks is reflected partly from the scale free behavior:the in-degree distribution follows power law,and the out-degree distribution is lognormal.For the influence behavior,the expected influence spread of the maximum influence set identified by the greedy method correlates significantly with the degree distributions.In addition,the identified influence set contains influential classes that are complex in both the number of methods and the lines of code(LOC).For the applications in software engineering,the results provide possibilities of new approaches in designing optimization procedures of software systems.     

Delay-Constrained Optimized Packet Aggregation in High-Speed Wireless Networks

High-speed wireless networks such as IEEE 802.11n have been introduced based on IEEE 802.11 to meet the growing demand for high-throughput and multimedia applications. It is known that the medium access control (MAC) efficiency of IEEE 802.11 decreases with increasing the physical rate. To improve efficiency, few solutions have been proposed such as Aggregation to concatenate a number of packets into a larger frame and send it at once to reduce the protocol overhead. Since transmitting larger frames eventuates to dramatic delay and jitter increase in other nodes, bounding the maximum aggregated frame size is important to satisfy delay requirements of especially multimedia applications. In this paper, we propose a scheme called Optimized Packet Aggregation (OPA) which models the network by constrained convex optimization to obtain the optimal aggregation size of each node regarding to delay constraints of other nodes. OPA attains proportionally fair sharing of the channel while satisfying delay constrains. Furthermore, reaching the optimal point is guaranteed in OPA with low complexity. Simulation results show that OPA can successfully bound delay and meet the requirements of nodes with only an insignificant throughput penalty due to limiting the aggregation size even in dynamic conditions.     

A QoS-aware routing algorithm based on ant-cluster in wireless multimedia sensor networks

QoS-aware routing algorithm is important in wireless multimedia sensor networks. This paper formulates a generalized QoS-aware routing model on the basis of multiple routing metrics and priorities of packets. We first introduce a 2D plain-based routing algorithm IPACR which improves the standard ant colony algorithm by optimizing the initial distribution of artificial pheromone in order to accelerate the algorithm convergence rate. Then a clustering-based routing algorithm ICACR is presented which can be well applied in a large scale network. ICACR is a variation of IPACR because it can be suitable for clustering cases to satisfy the larger scale situations. Both the numerical algorithm performance analysis and simulation of IPACR and ICACR are given. The results show that ICACR outperforms IPACR in terms of both network lifetime and QoS-aware routing metrics in large scale wireless multimedia sensor networks. Moreover, the simulation based on the real video traces shows that by extending the multi-path to ICACR for different priorities of video frames better performance can be achieved.     

无线传感网络中安全密钥管理机制

Recent advancements in wireless communication and microchip techniques have accelerated the development of wireless sensor networks (WSN). Key management in WSN is a critical and challenging problem because of the inner characteristics of sensor networks: deployed in hostile environments, limited resource and ad hoc nature. This paper investigates the constraints and special requirements of key management in sensor network environment, and some basic evaluation metrics are introduced. The key pre-distribution scheme is thought as the most suitable solution for key management problem in wireless sensor networks. It can be classified into four classes: pure probabilistic key predistribution, polynomial-based, Blom′s matrix-based, and deterministic key predistribution schemes. In each class of methods, the related research papers are discussed based on the basic evaluation metrics. Finally, the possible research directions in key management are discussed.     

增强安全性的IEEE802.15.4协议研究

IEEE 802.15.4标准因其低速率、低成本、低功耗、高质量,被认为是无线传感器网络和无线个人域网络的理想实现技术。简要介绍了无线传感器网络及其主要特点和问题,及无线传感器网络的安全需求。提出了增强安全性的IEEE802.15.4协议SE-IEEE802.15.4研究,其中使用公钥加密算法ECC来实现IEEE802.15.4协议的数字签名。最后采用NS-2平台对其进行仿真,并进行了性能和安全性的分析。     

Distributed channel assignment algorithms for 802.11n WLANs with heterogeneous clients

As the latest IEEE 802.11 standard, 802.11n applies several new technologies, such as multiple input multiple output (MIMO), channel bonding, and frame aggregation to greatly improve the rate, range and reliability of wireless local area networks (WLANs). In 802.11n WLANs, access points (APs) are often densely deployed to provide satisfactory coverage. Thus nearby APs should operate at non-overlapping channels to avoid mutual interference. It is challenging to assign channels in legacy 802.11a/b/g WLANs due to the limited number of channels. Channel assignment becomes more complex in 802.11n WLANs, as the channel bonding in 802.11n allows WLAN stations (APs and clients) to combine two adjacent, non-overlapping 20MHz channels together for transmission. On the other hand, IEEE 802.11n is backward compatible, such that 802.11n clients will coexist with legacy clients in 802.11n WLANs. Legacy clients may affect the performance of nearby 802.11n clients, and reduce the effectiveness of channel bonding. Based on these observations, in this paper, we study channel assignment in 802.11n WLANs with heterogeneous clients. We first present the network model, interference model, and throughput estimation model to estimate the throughput of each client. We then formulate the channel assignment problem into an optimization problem, with the objective of maximizing overall network throughput. Since the problem is NP-hard, we give a distributed channel assignment algorithm based on the throughput estimation model. We then present another channel assignment algorithm with lower complexity, and aim at minimizing interference experienced by high-rate, 802.11n clients. We have carried out extensive simulations to evaluate the proposed algorithms. Simulation results show that our algorithms can significantly improve the network throughput of 802.11n WLANs, compared with other channel assignment algorithms.     

Time delay characteristic of industrial wireless networks based on IEEE 802.15.4a

The IEEE 802.15.4a standard provides a framework for low-data-rate communication systems, typically sensor networks. In this paper, we established a realistic environment for the time delay characteristic of industrial network based on IEEE 802.15.4a. Several sets of practical experiments are conducted to study its various features, including the effects of 1) numeral wireless nodes, 2) numeral data packets, 3) data transmissions with different upper-layer protocols, 4) physical distance between nodes, and 5) adding and reducing the number of the wireless nodes. The results show that IEEE 802.15.4a is suitable for some industrial applications that have more relaxed throughput requirements and time-delay. Some issues that could degrade the network performance are also discussed.     

基于无线传感器网络的煤矿顶板压力监测系统

设计了煤矿顶板压力监测系统,采用无线传感网络的节点作为顶板压力数据采集的终端,采集顶板的压力变化数据。各节点采用基于IEEE802.15.4和ZigBee协议栈的无线方式将数据传送到汇聚节点,汇聚节点采用有线通信方式将采集到的数据通过USB传输接口传输至地面的管理监控站,实现对矿井顶板压力数据的实时监控。     

增强安全性的IEEE802.15.4协议研究

IEEE 802．15．4标准因其低速率、低成本、低功耗、高质量，被认为是无线传感器网络和无线个人域网络的理想实现技术。简要介绍了无线传感器网络及其主要特点和问题，及无线传感器网络的安全需求。提出了增强安全性的IEEE802．15．4协议SE-IEEE802．15．4研究，其中使用公钥加密算法ECC来实现IEEE802．15．4协议的数字签名。最后采用NS-2平台对其进行仿真，并进行了性能和安全性的分析。     

IEEE 802.15.4协议在矿井无线传感器网络中的改进应用

综合分析了无线传感器网络在煤矿井下的研究发展现状,对无线传感器网络在井下应用的关键问题作了探讨.搭建了无线传感器网络性能分析平台,设计了3种典型的带状井下无线传感器网络仿真场景.仿真结果证明了改进的有效性与必要性.     

IEEE802.15.4/ZigBee协议的MAC层节点能耗分析与研究

能耗是无线传感网络性能的重要参数之一,针对无线传感网络WSNs特点,对无线传感网络的ZigBee技术标准傲了分析研究.围绕网络低功耗运行,从MAC层协议方面研究了无线传感网络的睡眠节能机制,讨论了IEEE802.15.4在低功耗、低数据速率的无线连接领域应用的可行性.     

An Adaptive GTS Allocation Scheme for IEEE 802.15.4

IEEE 802.15.4 is a new standard uniquely designed for low-rate wireless personal area networks. It targets ultralow complexity, cost, and power for low-rate wireless connectivity among inexpensive, portable, and moving devices. IEEE 802.15.4 provides a guaranteed time slot (GTS) mechanism to allocate a specific duration within a superframe for time-critical transmissions. This paper proposes an adaptive GTS allocation (AGA) scheme for IEEE 802.15.4, which considers low latency and fairness. The scheme is designed based on the existing IEEE 802.15.4 medium access control protocol, and IEEE 802.15.4 devices can receive this AGA service without any modification. A simulation model and an analytical model are developed to investigate the performance of our AGA scheme. The numerical results show that the proposed scheme significantly outperforms the existing IEEE 802.15.4 implementation.     

An optimal GTS scheduling algorithm for time-sensitive transactions in IEEE 802.15.4 networks

IEEE 802.15.4 is a new enabling standard for low-rate wireless personal area networks and has been widely accepted as a de facto standard for wireless sensor networking. While primary motivations behind 802.15.4 are low power and low cost wireless communications, the standard also supports time and rate sensitive applications because of its ability to operate in TDMA access modes. The TDMA mode of operation is supported via the Guaranteed Time Slot (GTS) feature of the standard. In a beacon-enabled network topology, the Personal Area Network (PAN) coordinator reserves and assigns the GTS to applications on a first-come-first-served (FCFS) basis in response to requests from wireless sensor nodes. This fixed FCFS scheduling service offered by the standard may not satisfy the time constraints of time-sensitive transactions with delay deadlines. Such operating scenarios often arise in wireless video surveillance and target detection applications running on sensor networks. In this paper, we design an optimal work-conserving scheduling algorithm for meeting the delay constraints of time-sensitive transactions and show that the proposed algorithm outperforms the existing scheduling model specified in IEEE 802.15.4.     

基于IEEE 802.15.4标准技术的无线远程自动监测传感器网络的设计与实现

首先介绍了IEEE 802．15．4/ZigBee标准协议,然后讨论了无线传感器网络的软件与硬件设计原则,进而给出了基于IEEE 802．15．4/ZigBee技术的无线远程自动监测传感器网络的设计实现方案,最后展望了无线传感器网络的发展前景。