Packet Drop Battling Mechanism for Energy Aware Detection in Wireless Networks

Network security and energy consumption are deemed to be two important components of wireless and mobile ad hoc networks(WMANets).There are various routing attacks which harm Ad Hoc networks.This is because of the unsecure wireless communication,resource constrained capabilities and dynamic topology.In order to cope with these issues,Ad Hoc On-Demand Distance Vector(AODV)routing protocol can be used to remain the normal networks functionality and to adjust data transmission by defending the networks against black hole attacks.The proposed system,in this work,identifies the optimal route from sender to collector,prioritizing the number of jumps,the battery life,and security,which are fundamental prerequisites.Researches have proposed various plans for detecting the shortest route,as well as ensuring energy conversions and defense against threats and attacks.In this regard,the packet drop attack is one of the most destructive attack against WMANet communication and hence merits special attention.This type of attack may allow the attacker to take control of the attacked hubs,which may lost packets or transmitted information via a wrong route during the packets journey from a source hub to a target one.Hence,a new routing protocol method has been proposed in this study.It applies the concept of energy saving systems to conserve energy that is not required by the system.The proposed method for energy aware detection and prevention of packet drop attacks in mobile ad hoc networks is termed the Ad Hoc On-Demand and Distance Vector–Packet Drop Battling Mechanism(AODV–PDBM).

Observer-based H_∞ control over packet dropping networks

A new controller design problem of networked control systems with packet dropping is proposed. Depending on the place that the observer is put in the system, the network control systems with packet dropping are modeled as stochastic systems with the random variables satisfying the Bernoulli random binary distribution. The observer-based controller is designed to stabilize the networked system in the sense of mean square, and the prescribed H∞ disturbance attenuation level is achieved. The controller design problem is formulated as the feasibility of the convex optimization problem, which can be solved by a linear matrix inequality （LMI） approach. Numerical examples illustrate the effectiveness of the proposed methods.

Compensated methods for networked control system with packet drops based on compressed sensing

Due to unreliable and bandwidth-limited characteristics of communication link in networked control systems,the realtime compensated methods for single-output systems and multioutput systems are proposed in this paper based on the compressed sensing(CS)theory and sliding window technique,by which the estimates of dropping data packets in the feedback channel are obtained and the performance degradation induced by packet drops is reduced.Specifically,in order to reduce the cumulative error caused by the algorithm,the compensated estimates for single-output systems are corrected via the regularization term;considering the process of single-packet transmission,a new sequential CS framework of sensor data streams is introduced to effectively compensate the dropping packet on single-channel of multi-output systems;in presence of the medium access constraints on multi-channel,the communication sequence for scheduling is coupled to the algorithm and the estimates of the multiple sensors for multi-output systems are obtained via the regularization term.Simulation results illustrate that the proposed methods perform well and receive satisfactory performance.

A Mechanism Based on Reputation in P2P Networks to Counter Malicious Packet Dropping

In P2P （Peer-to-Peer） networks, some malicious peers can impact on overall networks performance. One of the malicious behaviors of these peers is malicious packet dropping. In this paper, our focus is to detect and to exclude peers that misbehave by dropping some or all packets. Here, we propose a reputation-based mechanism for solving the problem efficiently. The proposed mechanism uses both direct reputation information and indirect reputation information to compute comprehensive reputation of a peer. At the same time, history reputation information is also taken into account to provide faults tolerance capability and we regulate the imprecision based on the fact that the cause of packet dropping can be complex. Finally, the peers with bad comprehensive reputation can be detected easily and then will be excluded from the network. In this way, our proposed mechanism improves the per- formance of P2P networks without increasing computational overhead.

QoS Guarantees of Multiuser Video Streaming over Wireless Links: Delay Constraint and Packet Priority Drop

To provide a certain level of Quality of Service (QoS) guarantees for multiuser wireless downlink video streaming transmissions, we propose a multiuser scheduling scheme for QoS guarantees. It is based on the classic Queue-Length-Based (QLB)-rate maximum scheduling algorithm and integrated with the delay constraint and the packet priority drop. We use the large deviation principle and the effective capacity theory to construct a new analysis model to find each user's queue length threshold (delay constraint) violation probability. This probability corresponds to the upper bound of the packet drop probability, which indicates a certain level of statistical QoS guarantees. Then, we utilize the priority information of video packets and introduce the packet priority drop to further improve the quality perceived by each user. The simulation results show that the average Peak Signal to Noise Ratio (PSNR) value of the priority drop is 0.8 higher than that of the non-priority drop and the PSNR value of the most badly damaged video frame in the priority drop is on an average 4 higher than that of the non-priority drop.

TCP-R with EPDN: Handling out of Order Packets in Error Prone Satellite Networks

Studies have shown that packet reordering is common, especially in satellite networks where there are link level retransmissions and multipath routing. Moreover, traditional satellite networks exhibit high corruption rates causing packet losses. Reordering and corruption of packets decrease the TCP performance of a network, mainly because it leads to overestimation of the congestion in the network. We consider satellite networks and analyze the performance of such networks when reordering and corruption of packets occurs. We propose a solution that could significantly improve the performance of the network when reordering and corruption of packets occur in a satellite network. We report results of our simulation experiments, which support this claim.

大型露天矿山深孔台阶爆破振动特征与安全控制

为了减少采场附属设施受爆破振动效应的不利影响,对长九露天建材矿爆区进行了爆破振动监测。通过回归分析、小波包分析对采场爆破振动传播规律及能量分布特征进行了研究,使用考虑概率的改进萨道夫斯基公式对安全药量进行了推算。结果表明:三方向峰值振动速度中水平径向和垂向较大,水平切向较小。峰值振动速度总体上与最大单段药量成正比,与爆心距成反比。现场多数测点爆破振动的主频为20 Hz以下的低频。由于采用微差延时起爆,段药量和微差间隔时间是影响峰值振动速度关键因素;通过回归拟合建立了符合现场地质、地貌和爆破条件的爆破振动传播数学模型,其中垂向振动传播的方向性最明晰;采场爆破振动的能量分布在200 Hz以内,且主要集中在90 Hz以下,随着最大单段药量和爆心距增大,主振频带的带宽减小并向低频端移动,低频带能量占比增大;增加雷管段数在爆破近区减振效果不佳,在爆破远区减振效果明显。通过实测数据对比,使用考虑概率的改进萨道夫斯基公式推算的安全药量相较于传统萨道夫斯基公式能更好地控制超出安全振动速度限值的小概率事件发生,有效提高溜井在爆破施工过程中被保护的概率,对控制爆破参数设计有一定的参考意义。

物联网中基于信任抗丢包攻击的安全路由机制

在开放的物联网环境下,节点在路由过程中极易遭到恶意丢包攻击(包括黑洞攻击和灰洞攻击),这将严重影响网络的连通性,并导致网络的数据包投递率下降以及端到端延时增加。为此,在RPL协议的基础上,提出了一种基于信任的安全路由机制。根据节点在数据转发过程中的行为表现,引入惩罚因子来评估节点间的直接信任关系,通过熵为直接信任值和间接信任值分配权重,进而得到被评估节点的综合信任值。利用模糊集合理论对节点间的信任关系进行等级划分,为路由节点选取信任等级较高的邻居节点进行数据转发,而信任等级较低的邻居节点将被隔离出网络。此外,为了避免正常节点由于某些非入侵因素而被当作恶意节点隔离出网络,为这类节点提供一个给定的恢复时间,从而进一步判断是否将其隔离出网络。利用Contiki操作系统及其自带的Cooja网络模拟器对所提方案进行仿真,实验结果表明,在节点数目和恶意节点比例不同时,本方案的恶意节点检测率、误检率、数据包投递率和端到端延时4个指标均有所改善。在安全性方面,本方案的恶意节点检测率和误检率明显优于tRPL协议;在路由性能方面,本方案的数据包投递率和端到端延时明显优于tRPL协议和MRHOF-RPL协议。仿真分析结果充分说明:所提方案不仅能够有效识别恶意节点,而且能够在恶意攻击存在的情况下保持较好的路由性能。

差错信道下无线局域网丢包率性能分析

分析了AWGN(加性高斯白噪声)信道和瑞利衰落信道下无线局域网DCF(分布式协调功能)丢包率性能,推导出差错信道下使得吞吐量最大的最优分组长度闭式解并且证明了最优解的惟一性。研究结果表明,差错信道中不同调制方式和分组长度对丢包率性能有重要影响,根据信道状态调整分组长度能够获得最大的系统吞吐量。

无线传感器网络能效和延时性能分析

为全面评估能效和延时性能并分析网络参数对它们的影响,从通信三要素出发,考虑发送端退避机制、传输信道误码率和接收端碰撞概率,建立了网络参数与性能间的关系模型。通过对能效、延迟性能的理论推导及仿真验证,得出结论:数据包负载长度、误码率、节点数、退避窗口和最大允许重传次数限制会不同程度地影响丢包率,从而影响网络性能。

视频会议中的同步缓冲设计

接收缓冲区对于保证视频流的播放质量起着关键的作用。针对接收实时视频流这种特殊需求,本文提出了一种时间驱动的具有同步功能的缓冲区设计方案。经过实验测试,缓冲区在平滑视频呈现、解决恶劣网络环境下的丢包乱序等问题有良好的效果,已经应用到某大型网通视频直播接收系统中,可以广泛应用于任何接收实时视频流的客户端系统中。

一种基于自相似业务的队列管理算法

在分析业务流自相似特性对队列性能影响的基础上,提出了一种适宜自相似网络环境的队列管理算法,简称SSRED。在SSRED算法的分组丢弃概率函数中引入了自相似参数H,其目标旨在降低自相似特性所造成的影响以提高网络性能。仿真实验与分析表明,使用SSRED算法有利于提高自相似网络环境中的吞吐量、降低丢包率以及减少网络延迟等性能。

基于NS2的TCP性能仿真研究

探讨了目前应用较为广泛的网络仿真软件NS2的结构、功能、仿真原理及仿真方法,在此基础上,深入分析研究了TCP两种吞吐量模型的特性,并运用NS2仿真平台在不同场景下对两种模型进行了仿真验证,最后给出了这两种吞吐量模型的适用范围.

两次随机丢包的被动队列管理算法

主动队列管理算法增加了硬件资源和运算量的开销,并且存在参数设置敏感,响应相对滞后于实际网络状况的缺陷,并没有在实际网络上推广使用。因此对目前使用最多的弃尾被动队列管理进行改进,提出了两次随机丢包的被动队列管理算法。在队列满时,两次随机丢弃队列中的数据包,改善弃尾队列管理的缺陷,提高了网络传输性能;提出了速度公平性的概念,两次随机丢包的被动队列管理算法对占据队列较多的TCP链接有更好的惩罚作用,能有效提高RTT公平性和速度公平性;该算法计算量小;NS2仿真表明该算法的有效性。

多个TCP连接的拥塞丢包模型

本文提出了有关TCP连接的拥塞丢包分析模型 .网络瓶颈一般承载许多TCP连接 ,瓶颈处不可避免的拥塞和缓存溢出 ,是导致网上丢包的主要原因 .网络瓶颈处的行为很大程度上左右了网络性能 .本文的模型估计了存在大量持续TCP连接时 ,网络瓶颈的丢包概率和网络传输中断概率 ,给出了对实际网络的良好近似 .这对于研究TCP对网络性能的影响 ,提出改善网络性能的新算法 ,以及分析 (从长远来看 )TCP还应做哪些改进 ,都是非常有用的 .

多丢包不确定离散系统的鲁棒Kalman滤波

研究了同时具有不确定性和多丢包情况下的离散时变系统的鲁棒滤波问题,其中的不确定性是时变的、范数有界的,且存在于系统的状态矩阵和输出矩阵中.通过把多丢包问题建模成系统模型中的随机参数,在允许的不确定性情况下,给出了估计误差方差的上界,并进一步基于矩阵范数的意义最小化该上界.结果表明,通过求解两个Riccati差分方程,可以设计鲁棒滤波器.最后,提出适合在线计算的鲁棒滤波算法,并通过仿真实例表明所提算法的有效性和实用性.

基于RED分组丢失历史方法的非TCP流鉴别

随机早期检测(RED)是IETF推荐的一种基于路由器的有效的主动队列管理算法,但是在某些情况下,一些数据量很大的高带宽流量会大量占用带宽,从而导致了各流量之间带宽分配的不公平性,甚至产生拥塞崩溃。该文从RED的丢包历史出发,研究了一种在发生拥塞时鉴别出高带宽流量的方法,并通过仿真证实了此方法的有效性。

弃头和随机结合的被动队列管理

主动队列管理算法存在诸多缺陷,并没有在实际网络上推广使用。为了对目前使用最多的弃尾被动队列管理进行改进,提出了随机和弃头相结合的被动队列管理算法。在队列满时,先从队列头部丢弃一个数据包,然后再在队列中随机丢弃一个数据包。NS2仿真表明该算法能有效改善RTT和速度公平性,避免弃尾队列管理的缺陷,提高了网络传输性能。该算法计算量小,适合在Internet上使用。

无线Mesh网络延迟及丢包控制机制研究

在无线Mesh网络中,无线信道的干扰及时延敏感业务过度占用资源等原因均导致了TCP性能的下降.针对该问题,该文建立了数据一跳传输延迟分布以及TCP丢包控制的联合模型.该文先以理论推导及较低的运算代价估算出数据的一跳传输在网络各层的延迟,并分析了无线网络的丢包特征,最后,结合无线网络延迟分布及无线丢包特征,指出了传输层对不同丢包所做的控制方式,并通过仿真实验证明本文控制方式可有效降低丢包率.

不可靠通信的云控场景下网联车辆控制器的设计

鉴于不可靠的网络通信给车辆网联控制带来的隐患,本文研究了考虑时延、丢包等因素的网联车辆控制器设计方法。首先基于马尔可夫跳变线性系统,建立包含随机丢包和时延事件的网络控制系统模型,提出了马尔可夫跳变线性系统稳定的线性矩阵不等式条件,给出了随机丢包的量化控制器设计方法。在此基础上,通过对系统方程矩阵的增广,提出了离散时延的跳变控制器设计方法。最后,分别对网联车辆横向与纵向控制两个典型云控场景进行仿真。结果表明,用本文提出的方法,在时延或丢包概率分布已知的条件下所设计的网联车辆控制系统量化控制器,能保证在不可靠通信情况下系统的稳定性和安全性。