水声通信网综述

近年来,由于水下通信技术的发展和应用需求,国内外对水声通信网络进行了大量的研究工作,并且在方案验证、模拟仿真的基础上,开始了水声网络的海上实验.本文从水声通信网的发展过程和特点出发,系统介绍了水声通信网的体系结构和关键技术,并且详细介绍了各层的研究内容和研究现状,最后对水声通信网今后的研究方向和应用前景进行了展望.     

一种节省能量的水声传感器网络组织结构与协议

本文为水声传感器网络提出了一种基于簇间协商的事件报告策略,网络节点以簇的形式组织起来,多址接入协议采用了一种适合水声环境的TDMA/CDMA混合式协议,建立了由簇头与网关组成的用于簇间通信的主干链路。仿真结果表明,基于簇间协商的事件报告策略能有效减少网络中的冗余通信量从而延长网络寿命。     

一种降低复杂度的压缩感知水声信道估计方法

针对浅海的水声信道稀疏特性,提出了一种降低复杂度的前向回溯正交匹配追踪(RC-LABOMP)信道估计方法。首先计算正交匹配追踪和子空间追踪信道估计算法的两类支撑集,接着根据两类支撑集的交集和并集,预处理先验信息,最后利用先验信息完成前向回溯正交匹配追踪信道估计。该算法经过先验信息的预处理,能够减少原LABOMP算法的迭代次数,同时缩小原子的索引范围,因此能够显著降低原LABOMP算法的计算复杂度。此外,将提出的算法与水声Turbo均衡系统相结合,更适用于水声通信系统。仿真结果表明,所提算法在随机信道和水声信道条件下,具有估计精度高、误码率低的特点,同时能够显著降低LABOMP算法的计算复杂度,是一种适用于浅海水声信道的有效估计方法。     

基于OPNET的水声通信网MAC层协议的研究

AC（Multiple Access）协议是水声通信网络的重要研究内容,利用OPNET网络仿真软件对ALOHA协议和MACAW协议下水声通信网络的性能进行仿真研究,分析比较这两种协议在不同业务量下的网络性能。仿真结果表明,在水声通信网络中,MACAW协议的性能优于ALOHA,但两者均可应用于低数据业务量网络中。     

水声通信数据无损压缩方法的对比研究

为了选择适合水声通信数据无损压缩的算法,对哈夫曼压缩算法和LZ77压缩算法进行了对比研究。通过C语言编程实现两种算法的压缩,并利用水声通信数据获得压缩结果。对两种算法的压缩率和压缩效率对比分析之后,得出结论：对于水声信号,使用哈夫曼算法将获得更好的压缩率和压缩速率。尤其是哈夫曼算法的压缩速率远远优于LZ77算法。     

基于自适应噪声抵消的无线传感网络信道优化

无线传感器网络通信技术广泛应用在物联网近场通信、水声通信等领域。无线传感网络通信信道受到多途干扰,导致信道失衡,需要进行信道均衡模型设计。提出一种基于自适应噪声抵消的无线传感器网络通信信道优化技术,首先构建了无线传感器网络通信的信道模型,对无线传感器网络信道传播过程中衰减损失和各条路径的信号进行重组,采用自适应噪声抵消算法进行信道的多途干扰滤波,结合最小二乘（ RLS）准则算法进行无线传感器网络通信信道均衡设计。仿真结果表明,采用该通信信道均衡技术能有效提高无线传感器网络通信的信道质量,降低通信传输失真和误比特率,实现信道自适应均衡,提高通信的抗干扰能力。     

一种基于有限状态机的新型水声网络多址接入协议的实现

本文首先提出了一种新型的水声通信网络的多址接入(UAMA)协议.该协议针对水声信道传播时延长的特点,利用扩频码进行多信道预约;通过适当的控制方法,采用与传统的握手协议不同的机制,当发送方发送request_to_send(RTS)后,在选择的业务信道上立刻传输数据,而不必等收到clear_to_send(CTS)后再传输数据,在时间和空间上大大地提高了信道的利用率,因此极大地提高了网络的吞吐量.通过使用OPNET Modeler/Radio仿真器对UAMA协议进行了基于有限状态机(FSM)的建模和设计.仿真结果表明该协议能在水声环境下取得优良的吞吐性能和较低的分组传输时延.     

An efficient anonymous communication protocol for wireless sensor networks

Anonymous communication is very important for many wireless sensor networks, because it can be used to hide the identity of important nodes, such as the base station and a source node. In sensor networks, anonymous communication includes several important aspects, such as source anonymity, communication relationship anonymity, and base station anonymity. Existing sensor network anonymous schemes either cannot achieve all the anonymities or have large computation, storage, and communication overheads. In this paper, we propose an efficient anonymous communication protocol for sensor networks that can achieve all the anonymities while having small overheads on computation, storage, and communication. We compare our anonymous communication protocol with several existing schemes, and the results show that our protocol provides strong anonymity protection and has low overheads. Copyright © 2011 John Wiley & Sons, Ltd.     

一种有效的水声通信网络中用于半双工信道的ARQ协议

自动重传请求(ARQ)在保证通信网络可靠传输中起着关键的作用。但是，在水声通信网络中，由于水声信道的半双工以及信道的长传播时延特性，使得水声通信网络的吞叶性能受到极大的制约。本文针对水声信道长传播时延这一特点，利用扩频通信技术，将单个信道分成两个子信道；一个用于前向信道(从发送方到接收方)，另一个用于反向信道(从接收方到发送方)，从而使得对每个分组数据的响应时间大大缩短，提出了一种有效的适合于半双工特性的ARQ协议。理论分析和仿真结果表明，相对于传统的SW ARQ协议而言，该协议在水声信道下具有更优的吞吐性能。     

A survey on communication and data management issues in mobile sensor networks

Wireless sensor networks (WSNs) which is proposed in the late 1990s have received unprecedented attention, because of their exciting potential applications in military, industrial, and civilian areas (e.g., environmental and habitat monitoring). Although WSNs have become more and more prospective in human life with the development of hardware and communication technologies, there are some natural limitations of WSNs (e.g., network connectivity, network lifetime) due to the static network style in WSNs. Moreover, more and more application scenarios require the sensors in WSNs to be mobile rather than static so as to make traditional applications in WSNs become smarter and enable some new applications. All this induce the mobile wireless sensor networks (MWSNs) which can greatly promote the development and application of WSNs. However, to the best of our knowledge, there is not a comprehensive survey about the communication and data management issues in MWSNs. In this paper,focusing on researching the communication issues and data management issues in MWSNs, we discuss different research methods regarding communication and data management in MWSNs and propose some further open research areas in MWSNs.Copyright © 2011 John Wiley & Sons, Ltd.     

传感信号在接入网中传输的技术分析

文章提出了光纤通信网与传感网融合的设想,即利用已有光纤接入网的通信信道,让传感网络发出的传感信号在光纤接入网中传输.首先分析了这种设想的可行性,然后提出了按固定帧复用的方式对传感信号和通信信号进行耦合,并根据已有光纤接入网的结构建立了该系统的网络基本结构,重点分析了传感信号与通信信号复用时的时隙及带宽分配问题.     

Detecting and classifying delay Data Exceptions on communication networks using rule based algorithms

Network performance monitoring is essential for managing a network efficiently and for ensuring reliable operation of the network. Monitored network performance changes reflect events in the network, such as faults, significant changes in usage patterns or planned alterations. Network managers are interested in how and when the performance of a network changes; however it is inefficient to analyse all the data resulting from the monitoring operation manually. In this paper a rule based algorithm to automate detection of the changes in one of the network performance parameters, namely delay, is presented and described in detail. The nature of the delay pattern in a commercial communication network was the key issue in developing this algorithm. The approach was tested with monitored delay data generated from three different networks and showed good results. Also, the algorithm was tested with sets of delay data which have been already input to a previously developed detector based on a different approach, and the results between the two detectors are compared. In addition to a noticeable improvement in detection performance, the new approach provides more generality and independency of the source of the delay data, making the approach generally applicable to other networks. Copyright © 2004 John Wiley & Sons, Ltd.     

Spectrally efficient communication for wireless sensor networks using a cooperative MIMO technique

The multi-input multi-output (MIMO) communication framework is adopted for wireless sensor networks by having multiple sensors equipped with single-element antennas cooperate in transmission. A power method-based iterative algorithm is developed that computes the optimal transmit and receive eigen-filters distributively among the sensors while transferring most of the computational burden to the central collector node. Since the proposed algorithm implicitly exploits the channel state information (CSI) both at the receiver and the transmitter, it is expected that the resulting spectral efficiency is higher than what can be achieved by receive CSI-only space-time coding. This intuition is confirmed by employing a variable-rate adaptive modulation scheme for the eigen-transmission and comparing its spectral efficiency with that of orthogonal space time block codes (OSTBCs) at specific target bit error rates. The performance is also evaluated using realistic channel estimation as well as the least mean square (LMS) and recursive least square (RLS) algorithms for iterative eigencoding. This material is based upon work supported by the Air Force Office of Scientific Research under Award No. FA9550-04-C-0074 and Toyon Research Corporation Subcontract No. SC6431-1. Seung-Jun Kim received B.S. and M.S. from Seoul National University in 1996 and 1998, respectively, and Ph.D. from University of California, Santa Barbara in 2005, all in electrical engineering. From 1998 to 2000, he served as a Korea Overseas Volunteer at Chiang Rai Teachers College in Chiang Rai, Thailand. Since 2005, he has been with NEC Laboratories America in Princeton, NJ. His research interests lie in detection/estimation theory, spread-spectrum communications, multiple antenna techniques and cross-layer design. Richard E. Cagley received the B.S. degree in engineering from Harvey Mudd College, Claremont, CA in 1997 and the M.S. and Ph.D. degrees in electrical engineering from the University of California, Santa Barbara in 1999 and 2003 respectively. Dr. Cagley currently holds a position with Toyon Research Corporation, Goleta, CA. Prior to joining Toyon, he held positions with Fujant Incorporated, Jet Propulsion Laboratories, and Qualcomm Corporation. His general research interests are in the areas of physical and MAC layer design for wireless communication. This includes multiuser detection, interference cancellation, space-time processing, spectrum management, and digital receiver design. Ronald A. Iltis received the B.A. (Biophysics) from The Johns Hopkins University in 1978, the M.Sc in Engineering from Brown University in 1980, and the Ph.D. in Electrical Engineering from the University of California, San Diego in 1984. Since 1984, he has been with the University of California, Santa Barbara, where he is currently a Professor in the Department of Electrical and Computer Engineering. His current research interests are in CDMA, software radio, radiolocation, and nonlinear estimation. He has also served as a consultant to government and private industry in the areas of adaptive arrays, neural networks and spread-spectrum communications. Dr. Iltis was previously an Editor for the IEEE Transactions on Communications. In 1990 he received the Fred W. Ellersick award for best paper at the IEEE MILCOM conference.     

基于信息流动力学的通信网络性能可靠性建模与分析

为了分析流量变化对网络性能可靠性的影响,首先基于信息流动力学建立了通信网络流量模型,在此基础上定义了信息流传输时延和分组丢失率表征网络性能可靠性的指标和评估模型,进而分析了某局域网络在泊松流量和突发性约束流量下的网络性能可靠性。结果表明,2种流量模型下的网络性能可靠性都存在明显相变行为,相变点刻画了网络在性能约束下的最大传输能力。     

Secure data aggregation in wireless sensor networks using homomorphic encryption

In a Wireless Sensor Network (WSN), aggregation exploits the correlation between spatially and temporally proximate sensor data to reduce the total data volume to be transmitted to the sink. Mobile agents (MAs) fit into this paradigm, and data can be aggregated and collected by an MA from different sensor nodes using context specific codes. The MA-based data collection suffers due to large size of a typical WSN and is prone to security problems. In this article, homomorphic encryption in a clustered WSN has been proposed for secure and efficient data collection using MAs. The nodes keep encrypted data that are given to an MA for data aggregation tasks. The MA performs all the data aggregation operations upon encrypted data as it migrates between nodes in a tree-like structure in which the nodes are leafs and the cluster head is the root of the tree. It returns and deposits the encrypted aggregated data to the cluster head after traversing through all the intra cluster nodes over a shortest path route. The homomorphic encryption and aggregation processing in encrypted domain makes the data collection process secure. Simulation results confirm the effectiveness of the proposed secure data aggregation mechanism. In addition to security, MA-based mechanism leads to lesser delay and bandwidth requirements.     

传感器网络基于DTW的多小波压缩算法

提出传感器网络环境下基于DTW的多小波数据压缩算法。首先研究汇聚节点中异步数据点—点对的对应关系,设计迭代算法求出具有最大相关性的DTW弯曲路径。接着提出最佳匹配点选择算法,通过DTW弯曲路径中一对一数据点—点对来预测异步数据向量间的函数关系,获取最佳匹配点,得到具有最大相关性的传感数据矩阵。然后设计多小波变换,利用传感数据矩阵的相关性来压缩数据,同时解决数据矩阵的行列不对称问题。实验结果表明,所提出的算法在能量聚集比、重构精度和运行时间等压缩性能指标上优于经典的分布式小波压缩算法。     

Sensor selection for source extraction in heterogeneous wireless sensor networks

A sensor selection scheme for source extraction in heterogeneous wireless sensor networks is proposed. The proposed scheme selects the sensors corresponding to the reconstructed mixtures with the largest signal‐to‐noise‐ratios to transmit their data to a fusion center. It exploits the heterogeneity of the sensor observations and reduces the amount of transmissions. The results demonstrate that the proposed scheme outperforms the full utilization scheme and the random selection scheme. Copyright © 2009 John Wiley & Sons, Ltd.     

Cooperative fault‐detection mechanism with high accuracy and bounded delay for underwater sensor networks

This paper proposes a cooperative fault‐detection mechanism for detecting cluster‐head failures in cluster‐based UnderWater Sensor Networks (UWSNs). The proposed detection mechanism aims to accurately and fast detect the failure of a cluster head in order to avoid unnecessary energy consumption caused by a mistaken detection. For this purpose, it allows each cluster member to independently detect the fault status of its cluster head and then employs a distributed agreement protocol to reach an agreement on the fault status of the cluster head among multiple cluster members. It runs concurrently with normal network operation by periodically performing a detection process at each cluster member. To reduce energy consumption, it uses a time division multiple access medium access control (TDMA MAC) protocol and makes use of the data periodically sent by a cluster head as the heartbeats for fault detection. A couple of forward and backward time‐division‐multiplexing (TDM) frames are specially structured for enabling multiple cluster members to reach an agreement within two frames in each detection process. Moreover, a schedule generation algorithm is also proposed for a cluster head to generate the transmission schedule in the forward and backward frames. Through simulation results, we show that the proposed detection mechanism can achieve high detection accuracy under high packet loss rates in the harsh underwater environment, and can detect a cluster‐head failure faster than a traditional fault‐detection mechanism within a delay bound of two TDM frames. Copyright © 2008 John Wiley & Sons, Ltd.     

A reliable and energy‐efficient routing protocol for underwater wireless sensor networks

Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention to support various applications for pollution monitoring, tsunami warnings, offshore exploration, tactical surveillance, etc. However, because of the peculiar characteristics of UWSNs, designing communication protocols for UWSNs is a challenging task. Particularly, designing a routing protocol is of the most importance for successful data transmissions between sensors and the sink. In this paper, we propose a reliable and energy‐efficient routing protocol, named R‐ERP²R (Reliable Energy‐efficient Routing Protocol based on physical distance and residual energy). The main idea behind R‐ERP²R is to utilize physical distance as a routing metric and to balance energy consumption among sensors. Furthermore, during the selection of forwarding nodes, link quality towards the forwarding nodes is also considered to provide reliability and the residual energy of the forwarding nodes to prolong network lifetime. Using the NS‐2 simulator, R‐ERP²R is compared against a well‐known routing protocol (i.e. depth‐based routing) in terms of network lifetime, energy consumption, end‐to‐end delay and delivery ratio. The simulation results proved that R‐ERP²R performs better in UWSNs.Copyright © 2012 John Wiley & Sons, Ltd.