无线自组织网络时钟同步系统设计研究

根据在时钟同步方面(Wireless Sensor Network,WSN)无线传感器网络和自组织网络具有的相似属性,WSN时钟同步方法可以运用到自组织网络当中。由于影响时钟同步的要素很多,存在抗干扰性弱、同步精度差等问题。根据主从同步的特点,运用脉冲位置测量法,无线传感器与网络时钟之间的关系,构建出一套相对完整的无线自组织网络时钟同步系统,并通过实验成功实现网络时钟数据的同步。     

基于TinyOS的无线传感器网络AODV路由协议的实现与优化

针对无线传感器网络在矿山物联网的应用,本文提出了AODV路由协议在TinyOS操作系统下的实现框架,设计了数据帧、路由表与路由缓存机制。本文针对传统型AODV协议的丢包率与跳数之间呈级数增长的问题,分析了多跳衰减的原因,提出了一种基于RSSI的改进型无线传感器网络RSSI-AODV协议,采用RSSI作为路径选择的依据。实际测试表明：七跳链路总丢包率低至0.3%,优于传统AODV路由协议性能。     

A local-world heterogeneous model of wireless sensor networks with node and link diversity

In this paper, we present a novel local-world model of wireless sensor networks (WSN) with two kinds of nodes: sensor nodes and sink nodes, which is different from other models with identical nodes and links. The model balances energy consumption by limiting the connectivity of sink nodes to prolong the life of the network. How the proportion of sink nodes, different energy distribution and the local-world scale would affect the topological structure and network performance are investigated. We find that, using mean-field theory, the degree distribution is obtained as an integral with respect to the proportion of sink nodes and energy distribution. We also show that, the model exhibits a mixed connectivity correlation which is greatly distinct from general networks. Moreover, from the perspective of the efficiency and the average hops for data processing, we find some suitable range of the proportion p of sink nodes would make the network model have optimal performance for data processing.     

基于Matlab与VC的WSN定位跟踪仿真平台

无线传感器网络(WSN)是目前信息科学和通信技术领域的一个研究热点。目标定位跟踪是WSN的一项基本功能,在军事和民用领域都具有广泛的应用前景。但目前常用基于目标跟踪的实验仿真平台还不够完善,因此,本文主要研究了Matlab与VC的混合编程接口实现,实现在VC环境中的WSN实验仿真平台,为后续WSN定位跟踪研究提供保障。     

The queuing delay analysis at relay node based on cooperative GBN-ARQ protocols

In this paper, a single relay cooperative diversity network model is proposed, analyzing queuing delay of the packets at relay node. Using dynamic radio link adaptation in wireless networks, based on the character of GBN-ARQ protocol and the queuing theory, the paper solves the problem that packets wait to transmit at relay, and presents a relay node to destination node queuing analysis model for GBN-ARQ protocol with fixed feedback delay. The paper establishes Markov model of packet transmission, and the delay statistics at relay node are figured out by using matrix geometric methods.     

An artificial hummingbird algorithm based localization with reduced number of reference nodes for wireless sensor networks

Wireless Sensor Networks (WSN) are widely used in recent years due to the advancements in wireless and sensor technologies. Many of these applications require to know the location information of nodes. This information is useful to understand the collected data and to act on them. Existing localization algorithms make use of a few reference nodes for estimating the locations of sensor nodes. But, the positioning and utilization of reference nodes increase the cost and complexity of the network. To reduce the dependency on reference nodes, in this paper, we have developed a novel optimization based localization method using only two reference nodes for the localization of the entire network. This is achieved by reference nodes identifying a few more nodes as reference nodes by the analysis of the connectivity information. The sensor nodes then use the reference nodes to identify their locations in a distributive manner using Artificial Hummingbird Algorithm (AHA). We have observed that the localization performance of the reported algorithm at a lower reference node ratio is comparable with other algorithms at higher reference node ratios.     

无线传感器网络中继节点布居算法的研究

本文表述的是在该应用背景下引入多约束条件, 并采用枚举法与贪婪寻优算法相结合的方法, 解决了在可以作为中继节点设置位置的预设中继节点位置集合内, 合理选择中继节点设置位置以及既存网络因添加新传感器节点所引起的中继节点追加的问题. 仿真实验表明, 本文提出的中继节点布居与追加优化算法能够保证多约束条件下网络的容错性. 同时提出的基于最小网络距离因子评价标准, 有效提高了中继节点布居算法的能效性.     

用于水声传感器网络自组织的询问式泛洪广播算法

水声传感器网络(Underwater acoustic sensor networks,UASN)通常由随机散布的传感器节点组成。需要通过自组织算法将这些节点组成具有一定功能的网络。目前,已有较多成熟的用于陆地无线传感器网络(Wireless sensor networks,WSN)的自组织算法。但水声通信中存在的严重的传播损失、较高的背景噪声、有限的通信带宽、较长的传播时延、复杂的多途信道等,使得大多数适用于WSN的自组织算法难以适用于UASN。本文提出了一种改进的自组织算法,在简单泛洪广播算法中附加一段询问过程。通过OPNET仿真证明了在相同的条件下,相比于简单泛洪与概率泛洪广播算法,本算法可以在较短的时间内建立起有效路由,降低了水声网络在自组织阶段的能量消耗。     

Multichannel Power Constraints-Based SNR Estimation for the non-cooperative and cooperative scenarios of multi-user Wireless Network

Cooperative communication holds a significant task in Wireless Networks (WNs) by enhancing communication reliability, power, efficiency, and network connectivity. In addition, cooperative communication also enables the progression of a well-organized method for improving the WN quality. Moreover, it facilitates the exploitation of communicating resources by permitting the pathways and nodes in a network to assist in the transmission of data. In this research, a Multi-Channel Power Constraints-Based SNR Estimation (MCPC-SNR Estimation) is considered with source node to destination node and relay node to destination node. Also, three probabilistic models like joint entropy, mutual information, and correlation are considered for SNR parameters. Rather than considering the signals with the current information of signal and channel, we consider signal-to-noise ratio combining the method with static and dynamic Signal to Noise Ratio (SNR) estimation for the non-cooperative and cooperative scenarios. Finally, an assessment of the Multi-Channel Power Constraints-Based SNR Estimation (MCPC-SNR) model shows that the power allocations at the source, as well as relay nodes for transmissions, and the destination and relay nodes, have a notable effect on the Bit Error Rate (BER) performance for power-constrained cooperative communications. The analysis proves that the proposed work ensures a much lower Bit Error Rate (BER) for almost all timing error variations, which probably reaches 0.005.     

Joint Optimization of Data Freshness and Fidelity for Selection Combining-Based Transmissions

Motivated by big data applications in the Internet of Things (IoT), abundant information arrives at the fusion center (FC) waiting to be processed. It is of great significance to ensure data freshness and fidelity simultaneously. We consider a wireless sensor network (WSN) where several sensor nodes observe one metric and then transmit the observations to the FC using a selection combining (SC) scheme. We adopt the age of information (AoI) and minimum mean square error (MMSE) metrics to measure the data freshness and fidelity, respectively. Explicit expressions of average AoI and MMSE are derived. After that, we jointly optimize the two metrics by adjusting the number of sensor nodes. A closed-form sub-optimal number of sensor nodes is proposed to achieve the best freshness and fidelity tradeoff with negligible errors. Numerical results show that using the proposed node number designs can effectively improve the freshness and fidelity of the transmitted data.     

基于最小化平均分组跳的分组交换多跳光网的设计

本文研究了支持分组交换通信的波长路由光网的逻辑拓扑设计问题,并将它表示为混合整数线性规划问题(MILP),其目标函数为最小化平均分组跳数目.在约束条件中同时考虑了分组传输时延和排队时延.我们以6结点的网络为例,对于不同的收发机数目和时延边界,数值结果表明最小化平均分组跳数目等价于最小化网络拥塞.小的平均分组跳数目可以保证网络通信时具有较小的时延.最后,对于不同的通信模式,我们比较分析了网格的优化性能参数,这些结果有助于提出更好的启发式算法.     

A cluster-based barrier construction algorithm in mobile Wireless Sensor Networks

It is important to maximize network lifetime while meeting coverage requirements in Wireless Sensor Networks (WSN). This paper focuses on maximizing the network lifetime of barrier coverage in WSN with mobile sensors. For mobile sensors, movement energy consumption can be much higher than during sensing and communication. Since the battery capacity of the sensor is fixed, more energy can be used for sensing and communication if the movement distance required to build the barrier can be reduced. Therefore, we focus on reducing the movement distance required by the mobile sensors to build the barriers. Also, we can build as many barriers as possible if we use as few mobile sensors as possible to build a barrier. By rotating multiple barriers, we can further extend the lifetime of the network. Based on the above concept, an energy-efficient algorithm is proposed for building barriers in WSNs with mobile sensors. The contribution of this paper are: (1) We find the minimum number of sensors required to construct a barrier for a rectangular region. (2) We explain how to cluster the sensors in the region, and then calculate the linear equations of the barriers based on the results of the clustering. (3) We explain how to set the sojourn points for these linear equations of the barriers, and then assign the mobile sensors to every one of these sojourn points. In short, the proposed algorithm can construct multiple barriers depending on the location of the sensor, with a minimum number of sensors connecting the left and right boundaries of the target field. Finally, the simulation results show that the proposed algorithm has better performance in terms of network lifetime than the previous result.     

基于质心迭代估计的无线传感器网络节点定位算法

针对无线传感器网络非测距定位方法的应用,提出了基于质心迭代估计的节点定位算法.该算法首先计算当前连通信标节点所围成的平面质心的坐标及其与未知节点间的接收信号强度,然后用计算所得质心节点替代距离未知节点最远的连通信标节点,缩小连通信标节点所围成的平面,并通过多次迭代的方法提高节点定位精度.仿真实验结果表明,该算法的各项指标均为良好,适用于无线传感器网络的节点定位.     

An optimal burst assembly approach employing traffic shaping (OBATS) for OBS

Optical burst switching (OBS) aims at combining the strengths of packet and circuit switching and is considered as a promising technology for implementing the next generation optical Internet, required to cope with the rapid growth of Internet traffic and the increased deployment of new services. In this paper, an optimal burst assembly approach employing traffic shaping (OBATS) for OBS networks has been proposed in order to improve network performance in terms of reduced blocking probability, congestion control and better utilization of bandwidth. Particularly, the proposed scheme aims at reducing the average delay experienced by the packets during the burstification process in optical burst switched (OBS) networks, for a given average size of the bursts produced. Reducing the packet burstification delay, for a given average burst size, is essential for real-time applications; correspondingly, increasing the average burst size for a given packet burstification delay is important for reducing the number of bursts injected into the network and the associated overhead imposed on the core nodes. Simulation results show that the proposed burst assembly approach gives better network performance in terms of burst drop, resource contention and delay as compared to conventional burst assembly approaches.     

ECM and SAGE based joint estimation of timing and frequency offset for DMIMO–OFDM system

Distributed multiple-input multiple-output (DMIMO) technology is a key enabler of coverage extension and enhancement of link reliability in wireless networks through distributed spatial diversity. DMIMO employs classic relay channels in between the source and the destination to opportunistically form a virtual antenna array (VAA) for emulating cooperative diversity. Use of multiple antennas at the relays further increases capacity and reliability of the relay–destination channel through multiplexing and diversity of MIMO antennas respectively. In such network, the signal received at the destination is characterized by multiple timing offsets (MTO) due to different propagation delay and multiple carrier frequency offsets (MCFO) due to independent oscillators of the relays. Hence, synchronization becomes a crucial issue in DMIMO in order to realize the distributed coherence. In this paper, we address joint estimation of MCFO and MTO in DMIMO orthogonal frequency division multiplexing (OFDM) with MIMO configuration at the relays for estimate-and-forward (EF) relaying protocol. Two iterative algorithms, based on expectation conditional maximization (ECM) and space alternating generalized expectation–maximization (SAGE) are proposed for joint estimation in presence of inter carrier interference (ICI). The robustness of both the estimators to ICI is evaluated by mathematical analysis and supported by extensive simulations. The performance of the proposed estimators is assessed in terms of mean square error (MSE) and bit error rate (BER). The theoretical Cramer–Rao lower bound (CRLB) of estimator error variance is also derived.     

Mobile sink-based data collection in event-driven wireless sensor networks using a modified ant colony optimization

The hotspot problem is one of the primary challenges in the wireless sensor networks (WSNs) because it isolates the sink node from the remaining part of the WSN. A mobile sink (MS)-based data acquisition strategy mitigates the hotspot problem, but the traditional MS-based data gathering approaches do not resolve the issue. However, the conventional techniques follow a fixed order of visits and static traversal of the MS. In this context, this paper uses a modified version of the ant colony optimization strategy for the data collected through a MS to mitigate the hotspot problem in the WSNs while improving the energy efficiency, network lifetime, throughput by reducing the packet loss and delay. In our work, we initially construct a forwarded load spanning tree to estimate the freight of each node in the WSN. Further, we choose RPs and their path simultaneously using the modified ACO algorithm by considering the forward loads, remaining energy, distance, etc. The proposed work also adopts the virtual RP selection strategy void unnecessary data exchanges between the nodes and RPs. Hence, it reduces the burden on relay nodes and optimize the energy usage among the nodes. We compare our approach with the recent ACO-based algorithms, and our approach outperforms them.     

基于NI WSN的智能家居监控系统设计

随着物联网和计算机技术的不断发展,智能化、网络化、信息化是现代家居系统的必然发展趋势。将NI无线传感器网络(WSN)技术引入到智能家居监控系统的设计中,基于NI WSN系列产品进行了无线智能家居系统的总体框架、硬件型号和软件流程设计。系统的传感器节点分别采集盗情、烟雾、温湿度等参数,以无线形式通过网关将数据传输至上位机PC,在PC端利用Labview软件实现了智能家居防盗系统、火灾报警系统、环境舒适度等参数的实时在线监控,取得了良好的人机交互界面,并具有远程终端监控功能。该智能家居监控系统具备低功耗、实时性好、易扩展及可现实远程监控等优点,在智能家居领域具有广阔的市场前景和推广应用价值。     

Design and characterization of a modified WDM ring network – An analytical approach

The present paper proposes the design of a modified ring network topology with a significant improvement in average delay and blocking probability over the simple ring network. The backbone ring network is modified by connecting the alternate nodes in regions identified statistically as of high traffic density. A mathematical model for the proposed modified network has been developed to investigate the blocking probability and average delay as the data traverses from source to destination. The analysis reports an improvement in the average delay performance with the inception of call priority at the processing node and thus provides a scope to implement the given grade of service.     

A Distributed and Collaborative Beamforming algorithm for a self-organizing Wireless Sensor Network

In this paper the scenario where sensors of a Wireless Sensor Network (WSN) are able to process and transmit monitored data to a far collector is considered. The far collector may be a Base Station (BS) that gathers data from a certain number of deployed WSNs, in applications such as earthquake, tsunami, or pollution monitoring. In this paper, the possible use of Distributed and Collaborative BeaMForming (DC-BMF) technique is analyzed, with the goal of enhancing the capability of a single sensor to communicate its data to the far collector. This technique considers nodes as elements of a phased array, where the phases of the signals at each antenna node are linearly combined in order to adjust the directional gain of the whole array. In particular, a novel self-localization technique for WSNs performing DC-BMF is studied, a closed form solution for beamforming gain degradation is derived and the evaluation of the power consumption of the proposed DC-BMF algorithm is provided.