Energy Efficient Forwarding Algorithm in Opportunistic Networks

In opportunistic networks,a successful message transmission between node pairs depends on the message size,the transmission speed and the connection duration time.This paper proposes a new message forwarding algorithm to improve the message delivery ratio and reduce the energy consumption.Previous encounter characteristics between nodes are used to estimate future connection duration time using a three point estimation method.Furthermore,the buffer utilization of nodes is used as a weight for the likelihoods to meet destinations according to the hop count of messages stored in the buffer.The simulation results show that the proposed forwarding algorithm achieves higher delivery ratio and less overhead ratio than the other four popular routing protocols.In addition,the proposed algorithm gains a better average residual energy performance among all the compared protocols.     

TUDIES ON THE FATTY ACID COMPOSITION OF HOP EXTRACT

Studies on fatty acids composition of hop extract obtained from Vurtenberg hop by extraction with a threecomponent mixture was carried out. It has been established that the content of fatty acids in hop extract is 0.3% ±5%. Fatty acids composition was determined by Gas-chromatographic analysis. The presence of the following unsaturated fatty acids has been proven: C_16:1; C_18:1; C_18:2; C_18:3; C_20:1 which represent about 40% of the general content of fatty acids in the extract.     

基于贝叶斯稀疏学习的多跳频信号频率跟踪方法

以往的跳频信号参数盲估计方法大多难以适应多个信号同时存在的情况,且需要积累一定数量的样本以后才能从中提取所需要的信息.为了稳定实时地跟踪跳频信号的频率,该文提出一种利用贝叶斯稀疏学习的单/多通道跳频信号频率估计和跳变时刻检测方法来实现多跳频信号频率的实时跟踪.首先建立了多跳频信号的稀疏表示模型,然后介绍了多观测贝叶斯稀疏学习算法及跳变时刻实时检测方法,最后仿真结果验证方法的有效性.     

基于多个QoS约束的路径选择算法

寻找同时满足多个独立的QoS 约束的路径是一个NP 完全问题。提出一种解决多约束路径问题的有效算法———多约束最小跳路径算法( MHMCA) , 该算法首先利用Bellman-Ford 最短路径算法进行标记, 并删除图中的无用链路, 在简化后的图中使用基于堆栈的深度优先搜索算法寻找所有满足约束的最小跳可行路径。最坏情况下, 算法的时间复杂度为O( n3) 。仿真结果表明, 该算法寻找具有最小跳可行路径的成功率高, 接近于最优算法。     

Hop Variety Classification Using the Genetic Distance Based on RAPD*

Fifty‐one hop varieties from around the world were subjected to random amplified polymorphic DNA (RAPD) analysis with 10‐mer arbitrary primers. Polymorphism was scored and the genetic distance was calculated as the proportion of shared DNA bands in a pair of varieties for the construction of a dendogram by an unweighted pair‐group method was arithmetical averages. The varieties were roughly classified into 6 clusters, and the similarity between varieties correlated with their breeding history. The result also suggests that at least two populations existed in ancient times and the hops cultivated in England originated from or are related to both populations. Many high alpha varieties have a genetic composition unlike old European hops. This difference is thought to result from the integration of wild American hops.     

Characterizing multi‐hop localization for Internet of things

Deployments over large geographical areas in the Internet of Things (IoT) pose a major challenge for single‐hop localization techniques, giving rise to applications of multi‐hop localizations. And while many proposals have been made on implementations for multi‐hop localization, a close understanding of its characteristics is yet to be established. Such an understanding is necessary, and is inevitable in extending the reliability of location based services in IoT. In this paper, we study the characteristics of multi‐hop localization and propose a new solution to enhance the performance of multi‐hop localization techniques. We first examine popular assumptions made in simulating multi‐hop localization techniques, and offer rectifications facilitating more realistic simulation models. We identify the introduced errors to follow the Gaussian distribution, and the estimated distance follows the Rayleigh distribution. We next use our simulation model to characterize the effect of the number of hops on localization in both dense and sparse deployments. We find that, contrary to common belief, it is better to use long hops in sparse deployments, while short hops are better in dense deployments – despite the traffic overhead. Finally, we propose a new solution that decreases and manages the overhead generated during the localization process. Copyright © 2016 John Wiley & Sons, Ltd.     

一类非对称离散Hopfieid网络的收敛性

讨论了一类特殊的非对称离散Ｈｏｐｆｉｅｌｄ网格在串行和并行两种方式下的收敛性问题。证明了该类网络在串行方式下至多经２ｎ步（ｎ为神经元个数）可收敛到平衡点；在并行方式下或者收敛到一平衡点或者进人２─圈。     

一种用于大规模无线传感器网络的时钟同步算法

针对经典的时钟同步算法在大规模无线传感器网络中存在的同步精度低与能量消耗高等问题,提出一种基于簇-树结构的无线传感器网络时钟同步算法。首先,建立一棵以网关为根节点、簇首为子节点的生成树来减少网络中节点同步时的累计跳数;然后,在该生成树的基础上采用簇间双向的SRS和簇内单向的ROS同步机制进行同步,在保证同步精度的前提下减少网络同步所需的消息数量。实验结果表明,相比传统的RBS和TPSN算法,提出的簇-树结构同步算法可使网络的平均同步精度保持在更高的水平,并有效地降低网络同步时节点的能耗。     

无线传感网络中基于测距修正的定位算法

为了提高DV-Hop算法的定位精度,提出基于测距修正的无迹卡尔曼滤波优化定位算法UKF-DV-Hop(Unscented Kalman Filtering Localization algorithm based on modifying average hop distance).UKF-DV-Hop算法先对信标节点广播的信息包进行改进,然后对跳距误差进行加权处理,进而减少测距误差,再利用最小二乘法估计未知节点位置,最后再利用无迹卡尔曼滤波UKF滤波优化节点位置.实验结果表明,与传统的DV-Hop算法相比,提出的UKF-DV-Hop算法的归一化平均误差率下降了约40%.     

New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller–Tucker–Zemlin constraints

Given an undirected network with positive edge costs and a natural number p, the hop-constrained minimum spanning tree problem (HMST) is the problem of finding a spanning tree with minimum total cost such that each path starting from a specified root node has no more than p hops (edges). In this paper, the new models based on the Miller–Tucker–Zemlin (MTZ) subtour elimination constraints are developed and computational results together with comparisons against MTZ-based, flow-based, and hop-indexed formulations are reported. The first model is obtained by adapting the MTZ-based Asymmetric Traveling Salesman Problem formulation of Sherali and Driscoll [18] and the other two models are obtained by combining topology-enforcing and MTZ-related constraints offered by Akgün and Tansel (submitted for publication) [20] for HMST with the first model appropriately. Computational studies show that the best LP bounds of the MTZ-based models in the literature are improved by the proposed models. The best solution times of the MTZ-based models are not improved for optimally solved instances. However, the results for the harder, large-size instances imply that the proposed models are likely to produce better solution times. The proposed models do not dominate the flow-based and hop-indexed formulations with respect to LP bounds. However, good feasible solutions can be obtained in a reasonable amount of time for problems for which even the LP relaxations of the flow-based and hop-indexed formulations can be solved in about 2 days.