基于信誉值维护的机会网络自私节点检测机制

机会网络中自私节点的存在严重影响路由转发的性能。为在路由时避开此类节点、消除其对网络性能的影响,提出了一种基于信誉值维护的自私节点检测机制,通过两跳ACK消息来监测节点行为,利用监测信息计算节点的信誉值,并将其作为判断节点是否自私的依据。在多种路由算法上加载该检测机制进行仿真实验,结果表明该检测机制可准确识别机会网络中的自私节点,提高消息投递的成功率,并能有效控制消息副本数和网络开销。     

基于博弈论的移动机会网络节点的自私行为的分析与研究

移动机会网络具有多跳性,其中的数据传输需要借助中介节点的转发。信息共享中也存在节点的数据传输。但是由于资源的有限性易造成节点自私行为的产生,文章针对自私节点,提出了一种基于博弈论的移动机会网络自私节点的检测算法,并提供一定有效的惩戒手段,鼓励自私节点传递数据,在一定程度上解决了节点的自私行为,更好地维护网络环境。     

基于多方议价博弈的机会网络高吞吐量低开销概率路由算法

针对含自私节点的机会网络中现有基于议价博弈的概率路由算法存在的消息单向传递影响转发概率提高、依赖虚拟货币进行交易削弱节点购买力以及消息交易过程有冗余交互的问题,提出一种基于多方议价博弈的高吞吐量低开销概率路由算法——HLPR-MG。HLPR-MG算法通过将节点两两博弈扩展为多方博弈以加快消息转发概率的提升,引入“以物易物”方式增强节点购买力,并且改进现有交互机制以减少博弈次数,从而达到提高网络吞吐量的和减小控制开销的效果。理论分析验证了HLPR-MG算法设计的有效性。仿真结果表明,与基于议价博弈的现有典型路由算法GSCP和BG相比,HLPR-MG算法的吞吐量和消息传送成功率至少提高了3.63%,而控制开销和平均端到端消息时延则分别降低超17.76%和4.03%。     

机会网络中自私行为影响的分析与调节

以往针对机会网络中节点自私性影响评估的研究,建立了多种分析模型,然而并未考虑如何应用这些理论模型.本文分别在网络无TTL限制和有TTL限制两种情况下,利用评估模型对自私节点的影响进行分析,并提出一种基于消息分类的自私模型,评估了自私节点对延迟和消息投递率的影响.分析表明,机会网络受自私节点的影响不仅与自私节点的数目有关,而且与节点的移动速度,消息传输范围有关.因此,可以通过调节这些参数提高网络的性能,减少自私节点的影响.首先,通过理论推导分别得出了2-hop路由和传染病路由在延迟保证下的合作节点数目和消息传输范围以及传染病路由在消息投递率保证下消息的TTL.随后,通过ONE仿真平台对自私节点影响的评估,证明自私行为影响下网络性能的理论值与实验值近似,并且证明了通过理论分析获得的参数值也与实验值近似.     

协作重传的动态TDMA时隙分配算法

协作通信可以有效地降低衰落信道中数据传输的中断概率,从而提高数据的传输速率。但是在TDMA系统中采用协作通信必然引入额外的带宽开销,为了提高传输速率而采用协作通信,是否能克服因此而产生的不利因素并不明确。在提出的CD-TDMA时隙算法中,在传统TDMA帧的前部增加了一个侦听和动态分配时隙的预约阶段。所有节点在每个数据帧的开始如果没有新产生的数据,则有义务协作转发其他节点在上个时隙帧中发送失败的数据。该算法提高了数据重传的成功概率,提高了整个网络的吞吐量。仿真结果表明,尽管该算法引入了额外的时隙开销,和传统的TDMA接入方式相比,该算法可以有效地提高整个网络的吞吐量。     

移动P2P网络中能量有效数据查询处理

在移动P2P网络环境中能量有效数据查询是一个基本应用问题。现有研究只关注数据广播,没有考虑到移动主机有限的资源,还没有研究在数据广播和索引中考虑查询节点位置特性和时间特性。文中提出了基于最小边界矩形的分布式空间索引(DMBR)结构,设计了一种有选择的监听广播信道的查询算法。所有提出的新算法机能最小化通信开销,减少访问时间,提高查询效率,移动客户机电量,节省能量消耗。仿真结果表明DMBR索引结构的查询算法范围查询、访问时间和能力消耗方面具有更好的性能。     

基于全网休眠的ZigBee网络节能算法

无线传感器网络节点一般由电池供电而且部署后需要长时间工作,这就导致节点的能量成为网络运行的瓶颈。针对无线传感器网络节点能量受限的问题,提出了一种基于全网休眠的节能新算法。该算法使终端节点、路由节点和汇聚节点都能得到休眠,从而为网络中每一种节点节约能量;同时,为路由节点设计了长、短两种休眠策略,在不影响数据收发的前提下减少能耗。基于CC2630芯片的实验结果表明:与现有相关算法相比,该新算法使节点能耗降低10%。     

水下光无线传感器网络的连接性分析与定位技术

针对水下光无线传感器网络(UOWSN)节点的传输范围受限和间歇性连接的问题,利用多跳通信扩大传输范围来增强网络连接性,提出一种网络节点定位算法。首先,将UOWSN建模为三维(3D)随机缩放模型图,并根据网络节点数、通信范围以及光发散角推导了该模型下网络节点的连接性概率表达式;然后,利用接收信号强度(RSS)定位算法修正距离矢量跳数(DV-Hop)定位算法来解决网络节点的定位问题,并与现有方案进行分析对比。仿真结果表明提出的定位算法的性能明显优于标准的DV-Hop算法和Hybrid DV-Hop算法。     

无人机编队中无线紫外光隐秘通信的能耗均衡算法

针对强电磁干扰环境下无人机之间的隐秘通信,该文提出了无人机编队中无线紫外光隐秘通信的能耗均衡算法。该算法能够结合紫外光非直视、低窃听等优点,克服传统无线电易被监听的缺点,在均衡能耗的同时为长机收集僚机信息提供可靠保证。通过引入考虑距离和剩余能量的优先级函数,提出基于分簇机制的改进算法BEAD-LEACH,并采用改进算法对无人机随机部署和呈圆形编队部署时进行仿真。仿真结果表明,在两种部署方式下,网络中50%节点出现死亡经历的时间分别延长了12%, 16%,改进算法能够有效地均衡网络的通信能耗,延长无人机网络的生存时间。     

一种简单的适合无线Mesh网络的机会协作MAC机制

针对IEEE802．11MAC（medium access control）协议中通信模式的缺陷,提出了一种新的协作MAC机制。该机制重点研究了分布式中继节点的选择算法,并定义了一种新的控制帧（retran）。目的节点通过发送retran帧启动协作机制,收到该帧的节点根据中继选择算法设置自身定时器,从而竞争产生“机会中继”,使其在源节点与目的节点之间搭建通信桥梁,该方法简单可行。仿真表明,随着网络中节点数的增加,新的机制对网络吞吐量和误比特性能的改善效果明显,从而提高了通信质量。     

ZBFR: zone based failure recovery in WSNs by utilizing mobility and coverage overlapping

Wireless sensor networks are more prone to failures as compared to other traditional networks. The frequent faults and failures sometime create large holes causing loss of sensing and connectivity coverage in the network. In present work, a zone based failure detection and recovery scheme is presented to reliably handle such node failures. We first propose a consensus and agreement based approach to elect a suitable monitor node called as zone monitor (ZM). ZM is responsible for coordinating failure recovery activities and maintaining desired coverage within a zone. In order to overcome failure overhead due to false failure detection, a consensus is carried out amongst neighboring nodes of a suspicious node to confirm the correct status with high accuracy. On confirmation of a node failure, the impact of resulting hole on coverage is analyzed and if impact exceeds beyond a particular threshold, a recovery process is initiated. The recovery process utilizes backup nodes having overlapping sensing coverage with failed node and may also relocate some nodes. Firstly a backup node is probed and activated if available. If no backup node is found, the solution strives to recover coverage jointly by recursively relocating some mobile nodes and probing backup nodes. The proposed scheme is analyzed and validated through NS-2 based simulation experiments.     

Ranging error‐tolerable localization in wireless sensor networks with inaccurately positioned anchor nodes

Localization is essential for wireless sensor networks (WSNs). It is to determine the positions of sensor nodes based on incomplete mutual distance measurements. In this paper, to measure the accuracy of localization algorithms, a ranging error model for time of arrival (TOA) estimation is given, and the Cramer—Rao Bound (CRB) for the model is derived. Then an algorithm is proposed to deal with the case where (1) ranging error accumulation exists, and (2) some anchor nodes broadcast inaccurate/wrong location information. Specifically, we first present a ranging error‐tolerable topology reconstruction method without knowledge of anchor node locations. Then we propose a method to detect anchor nodes whose location information is inaccurate/wrong. Simulations demonstrate the effectiveness of our algorithm. Copyright © 2008 John Wiley & Sons, Ltd.     

Information Propagation through Opportunistic Communication in Mobile Social Networks

At present, people can communicate with each other through short range communication technologies (Bluetooth, WiFi, etc.) installed in their smart terminals. Due to limited communication range, communication is opportunistic, and mobile social networks formed by such technologies can be seen as delay tolerant networks (DTN). This paper presents a theoretical framework to evaluate the performance of information propagation in such network based on ODE equations. This framework can evaluate the impact of peoples?? many behaviors. For example, people may not want to help others because of their selfish nature. In addition, peoples who are not interested in the message may not receive the message at all, but they become to be interested in the message later. On the other hand, people may discard the message after they used it. We check the accuracy of our model through simulations based on both synthetic and real motion traces (the average deviation is not bigger than 5.09?%). Numerical results show that peoples?? behaviors really have certain impact on the performance of information propagation. For example, if the selfish level is bigger, some persons cannot obtain message at all. If peoples discard message with bigger probability, above result may also appear.     

Addressing space‐constraint driven selfishness in smart opportunistic environment

A smart opportunistic environment is a physical space, which allows the smart physical objects to communicate in the presence of disruption in connectivity. Because, the objects in such an environment are buffer constrained, some of the objects will not participate in data forwarding, when there is scarcity of storage (buffer) space. In this paper, we focus on such selfish behavior of objects triggered by space constraints in a smart opportunistic environment. We propose a novel data forwarding algorithm, selfishness and buffer‐aware routing (SBR), in which a node is chosen as a relay, based on its capability, which is a function of its available buffer space and past encounter history (delivery predictability) with the destination. SBR can efficiently utilize the limited buffer space in a node with a buffer management scheme, WSD. It can also detect space constraint driven selfish behavior of nodes and resolve it using a reputation‐based technique, MSD. We have conducted simulation using both synthetic and real‐world traces for evaluating our proposed SBR algorithm. For analyzing the performance of the algorithm in real‐time, a smart vehicular test‐bed is developed. Simulation results and test‐bed implementation show that our algorithm performs better in terms of higher delivery ratio, lower overhead ratio, and lower delivery delay, compared with existing opportunistic data forwarding algorithms.     

机会网络中基于有权社团结构图的路由协议研究

基于社团检测的机会网络路由算法大多采用无权重网络拓扑划分社团,仅将节点间的关系抽象为一条简单的无权重的边,忽略了节点关系的强弱程度。本文通过引入权重策略改进了QCA社团更新算法,提出了一种基于有权社团结构的路由算法,该算法解决了社团关系定量化单一的问题,更能真实反映出社团成员之间的关系。算法中,节点间的交互信息转化为权重,根据不同的网络环境选择不同的权重转化方案———归一化权重（normalized weight）和非归一化权重（non-normalized weight）。路由算法在检测到周围网络环境变化时自动切换权重计算方案以适应网络环境的变化。通过在仿真环境和真实数据集上测试和分析,该算法能够将网络中的节点划分出合理的社团结构,并在保证较高的传输成功率的情况下降低网络开销。     

A Fast Model for Evaluating the Detection of Selfish Nodes Using a Collaborative Approach in MANETs

Mobile ad-hoc networks (MANETs) rely on network cooperation schemes to work properly. Nevertheless, if nodes have a selfish behaviour and are unwilling to cooperate, the overall network performance could be seriously affected. The use of watchdogs is a well-known mechanism to detect selfish nodes. In this paper we propose a collaborative watchdog approach, which is based on the fast diffusion of selfish nodes awareness. Then, we introduce an analytical model to evaluate the time of detection and the overhead (number of messages) of our collaborative watchdog approach for detecting one selfish node. This model is extended for the case of several selfish nodes, including a mean–max approximation for a feasible computation when the number of selfish nodes is high. The results show that a collaborative watchdog is a very efficient approach since the detection time of selfish nodes is reduced, and the overall overhead is very low.     

Energy‐Efficient Adaptive Dynamic Sensor Scheduling for Target Monitoring in Wireless Sensor Networks

Due to uncertainties in target motion and randomness of deployed sensor nodes, the problem of imbalance of energy consumption arises from sensor scheduling. This paper presents an energy‐efficient adaptive sensor scheduling for a target monitoring algorithm in a local monitoring region of wireless sensor networks. Owing to excessive scheduling of an individual node, one node with a high value generated by a decision function is preferentially selected as a tasking node to balance the local energy consumption of a dynamic clustering, and the node with the highest value is chosen as the cluster head. Others with lower ones are in reserve. In addition, an optimization problem is derived to satisfy the problem of sensor scheduling subject to the joint detection probability for tasking sensors. Particles of the target in particle filter algorithm are resampled for a higher tracking accuracy. Simulation results show this algorithm can improve the required tracking accuracy, and nodes are efficiently scheduled. Hence, there is a 41.67% savings in energy consumption.     

基于压缩感知和最小二乘的分布式协作频谱感知

针对认知无线电(CR)集中式频谱感知算法对融合中心要求高,而且对节点失效的容忍性也不高等缺点,提出了一种基于压缩感知的分布式多节点协作算法.认知无线电网络中每个CR节点在接收信号频谱后,首先根据压缩采样理论在本地获取压缩采样测量值,然后利用l1范数约束的最小二乘算法在本节点估计频谱,把在此节点估计的频谱传给下一相邻节点,以此进行迭代优化直到算法收敛.理论分析和仿真结果表明,所提算法不仅计算复杂度低,收敛速度快,而且精确重构性能好,可靠性较高.