Meeting time aware community routing mechanism in opportunistic network

Making use of the meeting opportunity raised by the movement of nodes, the messages are transmitted with the manner of “store-carry-forward” in opportunistic network. So these networks have a feature of longer delay than conventional ad hoc network. Current routing schemes try their best to deliver packet but leading to definitely network delay and are based on random movement model. According to the social character of nodes in network, the distributed predicting scheme on the expectation of meeting time between nodes is proposed; moreover, according to the estimating results, the relay node can be selected reasonably. With this manner, the message can be forwarded to the destination. Simulations show that the proposed estimating method is accurate; furthermore, comparing with the widely used routing mechanism, the performance on the delay can be improved more than 30%.     

适用于语音业务的MANET机会路由机制

传统路由机制需要在源和目的节点之间预先建立端到端路径,当链路质量较差时,频繁地建立路径会影响业务的服务质量。为支持实时语音业务,提出一种机会路由机制,该机制并不预先建立连接,而利用多个路由请求和路由应答消息建立转发列表,表中的节点利用与其他节点的相遇机会对数据包进行转发,并根据转发节点的优先级对转发数据包的数量进行限制。仿真结果表明：机会路由机制能够减小语音业务的端到端时延,提高分组投递率,可以在不稳定的信道为语音业务提供服务质量保证。     

基于无线传感器网络的农业现场数据采集研究进展

无线传感器网络是一种新兴的获取和处理数字信息的技术,近年来,在农业现场数据采集中的应用日益广泛。尤其是随着精细农业的快速发展,无线传感器网络在应用中的相关技术越来越成为研究热点。本文综述了无线传感器网络的体系结构和特点,以及其在农业生产现场数据采集应用的国内外现状,提出了其在现场数据采集的发展趋势和面临的挑战。     

Multi-target tracking algorithm based on adaptive sampling interval in wireless sensor networks

Multi-target tracking is a hot topic of current research on wireless sensor networks (WSN). Based on adaptive sampling interval, we propose a multi-target tracking algorithm in order to save energy consumption and prevent tracking lost for WSN. We contrast the targets moving model by using the position metadata, and predicte the targets moving status based on extended Kalman filter (EKF).we adopt the probability density function (PDF) of the estimated targets to establish the tracking cluster. By defining the tracking center, we use Markov distance to quantify the election process of the main node (MN). We comput targets impact strength through the targets importance and the distance to MN node, and then use it to build tracking algorithm. We do the simulation experiment based on MATLAB, and the experiment results show that the proposed algorithm can accurate predict the trajectory of the targets, and adjust the sampling interval while the targets were moving. By analyzing the experiments data, we know that the proposed algorithm can improve the tracking precision and save the energy consumption of WSN obviously.     

A multi-parameter weighted clustering algorithm for mobile ad hoc networks

Network clustering can support resource spatial multiplexing and increase the capacity of the wirless networks. Clusterheads constitute the virtual backbone of the network, which reduces the overhead of routing and makes it simpler and easier for network     

Spatio-temporal channel assignment in multi-radio wireless mesh networks

A method of spatio-temporal channel assignment based on graph decomposition was proposed to solve the ripple effect and link failure problem in multi-radio wireless mesh networks. Network topology was decomposed into subgraphs in several time slots to extend channel assignment from spatial domain to time domain. Then, graph coloring algorithm was used to optimize the channel assignment on the basis of the subgraph in each time slot. Each subgraph obtained channel resource dynamically according to the network constraints to improve the channel assignment efficiency. Simulation results show that, compared to static channel assignment scheme, the impact of negative factors, such as the ripple effect and link failure caused by channel switching, are effectively confined with this strategy. The network throughput is increased at least by 30% while satisfying the constraints on the number of radios and the number of network channels.     

无线传感器网络中一种改进的DV-Hop定位算法

针对DV-Hop算法在无线传感器网络节点分布不均匀时定位误差比较大的问题,提出了一种针对DV-Hop的改进定位算法。该改进算法主要是利用RSSI测量技术增加锚节点;在给定约束下引入“可能存在区域”这一概念,并以该可能存在区域的面积作为目标函数,对未知节点的位置利用非线性共轭梯度法进行逼近,从而使节点定位误差达到最小。通过仿真验证了节点通信半径和锚节点比例对定位误差的影响,结果表明,该改进算法将节点定位精度提高了5%~10%。     

Bonding,bridging and linking social networks: A qualitative study of the emergency management of Cyclone Pam,Vanuatu

Cyclone Pam (March 2015) was an unprecedented event in Vanuatu forcing the simultaneous involvement of national and long‐term international actors, well integrated into the national disaster governance system, as well as numerous short‐term international actors, unfamiliar with the geopolitical and cultural disaster context of the country. Cooperation between these three groups of actors evolved through the three scales of bonding, bridging and linking social networking. This paper questions the different drivers and challenges within and across these scales of social networks affecting cooperation among the three different groups of actors during an emergency. Using a mixed methodology based on social network analysis, this paper utilises the case study of Cyclone Pam in Vanuatu to study the strengths and weaknesses of the disaster governance system in place based on bonding and bridging social capital to conduct disaster risk management and to prepare the integration of linking social capital when external support is needed. This paper contributes to the identification of key considerations in the development of resilience‐building strategies: the interactions of diverse actors to address disaster management needs and the reciprocal impacts of these interactions within and across the three different scales of social networks.     

A borrowed address based on efficient distributed address assignment algorithm in ZigBee networks

The borrowed address algorithm can solve the orphan problem made by the restriction of threshold of children when DAAM(distributed address assignment mechanism) assigns the addresses for the nodes in ZigBee networks. The exited borrowed algorithms only can increase the success ratio of address assignment, but their overhead and times spend on founding net cost much. To address the problem, we propose an efficient borrowed address assignment algorithm EDAA BA (efficient distributed address assignment algorithm based on borrowed address). To control the overhead and time spend on founding net, it borrows addresses firstly from the descent nodes in same branch for the orphan router nodes, adds the mechanism of immediate reply of borrowed message, and assigns the remainder addresses unused by DAAM in the 16 bits addresses for the orphan end devices. Theoretical and simulation analyses show that our algorithm outperforms DAAM and two of its present improvement algorithms in terms of the overhead and time spent on forming network, under the premise of better success rate of address assignment.