Caching Strategies in NDN Based Wireless Ad Hoc Network:A Survey

Wireless Ad Hoc Networks consist of devices that are wirelessly connected.Mobile Ad Hoc Networks(MANETs),Internet of Things(IoT),and Vehicular Ad Hoc Networks(VANETs)are the main domains of wireless ad hoc network.Internet is used in wireless ad hoc network.Internet is based on Transmission Control Protocol(TCP)/Internet Protocol(IP)network where clients and servers interact with each other with the help of IP in a pre-defined environment.Internet fetches data from a fixed location.Data redundancy,mobility,and location dependency are the main issues of the IP network paradigm.All these factors result in poor performance of wireless ad hoc networks.The main disadvantage of IP is that,it does not provide in-network caching.Therefore,there is a need to move towards a new network that overcomes these limitations.Named Data Network(NDN)is a network that overcomes these limitations.NDN is a project of Information-centric Network(ICN).NDN provides in-network caching which helps in fast response to user queries.Implementing NDN in wireless ad hoc network provides many benefits such as caching,mobility,scalability,security,and privacy.By considering the certainty,in this survey paper,we present a comprehensive survey on Caching Strategies in NDN-based Wireless AdHocNetwork.Various cachingmechanism-based results are also described.In the last,we also shed light on the challenges and future directions of this promising field to provide a clear understanding of what caching-related problems exist in NDN-based wireless ad hoc networks.

情境目标和Ad hoc关联影响言语产生的语义效应

干扰词与目标词之间的语义关联性是影响言语产生中语义效应性质的关键因素。相比其他语义关联类型,Ad hoc关联是一种较为特殊的概念联系类型。考察情境目标和Ad hoc关联对语义效应的影响,结果表明:与其他语义关联性相比,Ad hoc关联对语义效应的影响既有共性,又有差异。共性表现在:Ad hoc关联抑制图片命名,产生语义干扰效应,这种效应发生在图片命名早期(SOA从-200ms至0ms)。差异表现在:Ad hoc关联的语义干扰效应的产生要以情境目标提示为前提,有情境目标提示时,Ad hoc关联效应非常显著;无情境目标提示时,Ad hoc关联效应消失。不同语义关联类型产生不同语义效应的根源在于类别概念结点是否得到激活。

Trust-based co-operative routing for secure communication in mobile ad hoc networks

The working of a Mobile Ad hoc NETwork(MANET)relies on the supportive cooperation among the network nodes.But due to its intrinsic features,a misbehaving node can easily lead to a routing disorder.This paper presents two trust-based routing schemes,namely Trust-based Self-Detection Routing(TSDR)and Trust-based Cooperative Routing(TCOR)designed with an Ad hoc On-demand Distance Vector(AODV)protocol.The proposed work covers a wide range of security challenges,including malicious node identification and prevention,accurate trust quantification,secure trust data sharing,and trusted route maintenance.This brings a prominent solution for mitigating misbehaving nodes and establishing efficient communication in MANET.It is empirically validated based on a performance comparison with the current Evolutionary Self-Cooperative Trust(ESCT)scheme,Generalized Trust Model(GTM),and the conventional AODV protocol.The extensive simulations are conducted against three different varying network scenarios.The results affirm the improved values of eight popular performance metrics overcoming the existing routing schemes.Among the two proposed works,TCOR is more suitable for highly scalable networks;TSDR suits,however,the MANET application better with its small size.This work thus makes a significant contribution to the research community,in contrast to many previous works focusing solely on specific security aspects,and results in a trade-off in the expected values of evaluation parameters and asserts their efficiency.

Message Verification Protocol Based on Bilinear Pairings and Elliptic Curves for Enhanced Security in Vehicular Ad Hoc Networks

Vehicular ad hoc networks(VANETs)provide intelligent navigation and efficient route management,resulting in time savings and cost reductions in the transportation sector.However,the exchange of beacons and messages over public channels among vehicles and roadside units renders these networks vulnerable to numerous attacks and privacy violations.To address these challenges,several privacy and security preservation protocols based on blockchain and public key cryptography have been proposed recently.However,most of these schemes are limited by a long execution time and massive communication costs,which make them inefficient for on-board units(OBUs).Additionally,some of them are still susceptible to many attacks.As such,this study presents a novel protocol based on the fusion of elliptic curve cryptography(ECC)and bilinear pairing(BP)operations.The formal security analysis is accomplished using the Burrows–Abadi–Needham(BAN)logic,demonstrating that our scheme is verifiably secure.The proposed scheme’s informal security assessment also shows that it provides salient security features,such as non-repudiation,anonymity,and unlinkability.Moreover,the scheme is shown to be resilient against attacks,such as packet replays,forgeries,message falsifications,and impersonations.From the performance perspective,this protocol yields a 37.88%reduction in communication overheads and a 44.44%improvement in the supported security features.Therefore,the proposed scheme can be deployed in VANETs to provide robust security at low overheads.

A Multi-Token Sector Antenna Neighbor Discovery Protocol for Directional Ad Hoc Networks

In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work involves maintaining multiple tokens across the network.To prevent mutual interference among multi-token holders,we introduce the time and space non-interference theorems.Furthermore,we propose a master-slave strategy between tokens.When the master token holder(MTH)performs the neighbor discovery,it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders(STHs).Using this approach,the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other.Building on this foundation,we provide a comprehensive procedure for the M-SAND protocol.We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability.Finally,simulation results demonstrate the time efficiency of the M-SAND protocol.When compared to the QSAND protocol,which uses only one token,the total neighbor discovery time is reduced by 28% when 6beams and 112 nodes are employed.

Ad Hoc网络SPMA接入协议研究

为了解决现有介质访问控制子层(Media Access Control,MAC)协议无法较好地满足Ad Hoc网络资源接入的需求,提出了一种统计优先级多址接入(Statistic Priority-based Multiple Access,SPMA)协议,该协议是一种无中心节点控制的随机接入协议,适合节点移动性强、拓扑频繁变化的场景。首先介绍了SPMA协议的运行机制,重点研究了SPMA协议的信道负载统计方法,提出了MAC层信道负载统计方法,与物理层脉冲统计方法相比实现更简单;其次分析了在多跳场景下存在的问题,提出了多跳信道负载统计方法,同时为了克服周期性统计方法带来的滞后性问题,引入了基于长短期记忆网络(Long Short-Term Memory,LSTM)的时间序列预测模型。实验结果表明,所提方法能够准确反映信道真实状态,提高网内节点信息传输的实时性和可靠性。

Ad Hoc网络AODV协议的黑洞攻击防御研究

Ad Hoc网络,又名多跳网、无基础设施网或自组织网,是一种没有核心、独立运作的WiFi。目前,Ad Hoc路由协议的主要种类包括DSDV、WRR、DSR、DODV和TORA等。AODV在Ad Hoc网络里被广泛应用,这是一种根据需求、迅速调整、成本较低并能够实现多次传输的路由算法。Ad Hoc网络遭受的关键安全威胁有被盗听、DoS入侵、“睡眠”攻击、数据伪造、反向传输以及黑客入侵等。本文对Zapata、Hongmei Deng等学者的下游节点验证算法进行详细的阐述,并且提出一种基于反馈ACK的OSAODV算法,该算法能够有效地对抗黑洞的威胁。

基于认知无线电的AD HOC网络智能选频技术研究

传统的电台设计以高速跳频体制来应对复杂电磁环境,但该体制灵活性差,实际的通信效果和抗干扰能力不如预期,针对此情况提出传统跳频+智能选频跳频的MIX链路传输机制解决方案。设计基于认知无线电的智能选频技术,使得网络节点设备始终工作于当前最佳的信道条件下,达到任何时间任何地点的高度可靠通信和对频谱的有效利用的目的。对其中的基于网络的电磁环境快速认知、本地频谱感知、主动波形感知、网络频率资源规划自适应选频互干扰问题解决等关键技术进行了分析和研究。

移动Ad Hoc云中基于能量收集的分布式卸载方案研究

在物联网快速发展的驱动下,移动Ad Hoc云计算和能量收集(EH)技术通过共享邻近设备的闲置资源满足数据处理等需求,实现绿色通信。然而,由于Ad Hoc云网络的时变性以及EH的随机不稳定性,合理的任务卸载方案研究面临着严峻的挑战。针对以上问题,该文运用Lyapunov优化理论和博弈论,提出一种分布式动态卸载方案。理性的终端设备不可能无偿地为其他终端设备服务,为了鼓励终端设备积极参与计算卸载过程,提出一种基于动态报价的激励机制。相比于现有方案,仿真结果表明所提方案可以有效提升系统收益,稳定电池能量和减少任务队列积压。

Ad hoc网络中基于区块链技术的多路径路由算法研究

本文在Ad hoc网络中提出了一种基于区块链技术的多路径QoS(quantity of service)路由算法(BMQR)。该算法依据网络内节点的移动性、连通性和通信距离组建类似区块群,在群内通过QoS约束寻找由主节点和备选节点组成的多路径路由。通过实验仿真,BMQR算法较传统的AODV(Ad hoc on-demand distance vector routing)算法在路由的稳定性和投包率方面展示出了巨大的优越性。

基于HTTP协议的Ad hoc网络信息泄露点快速检测

由于Ad hoc网络遭受攻击后,网络信息存在泄露问题,难以准确分析出网络流量,并且泄露点检测速度较慢,在检测后用户的攻击效率仍然较高,为此,基于HTTP协议研究了一种新的Ad hoc网络信息泄露点快速检测方法。在信息与节点属性检测下,通过信息传输模型分析信息泄露状况,计算两个节点之间信息泄露概率,确定Ad hoc网络信息泄露链路,获取信息可能泄露的途径。并通过HTTP协议连接客户端,将泄露链路数据指令传输给客户端,客户端再通过接收的指令,对信息泄露链路中的泄露点进行检测,采用小波重构对网络信息泄露时的网络信号进行重构,将重构后的信号与正常信号进行对比,设定阈值,通过阈值判定的形式,完成Ad hoc网络信息泄露点快速检测。实验结果表明,所提方法能够精准地分析出网络流量变化状况,提升泄露点检测速度,降低用户攻击效率,保证网络安全。

An aerial ammunition ad hoc network collaborative localization algorithm based on relative ranging and velocity measurement in a highly-dynamic topographic structure

In the internet of battlefield things, ammunition is becoming networked and intelligent, which depends on location information. Therefore, this paper focuses on the self-organized network collaborative localization of munitions with an aerial three-dimensional(3D) highly-dynamic topographic structure under a satellite denied environment. As for aerial networked munitions, the measurement of munitions is objectively incomplete due to the degenerated and interrupted link of munitions. For this reason, a cluster-oriented collaborative localization method is put forward in this paper. Multidimensional scaling(MDS) was first integrated with a trilateration localization method(TLM) to construct a relative localization algorithm for determining the relative location of a mobile cluster network. The information related to relative velocity was then combined into a collaborative localization framework to devise a TLM-vMDS algorithm. Finally, an iterative refinement algorithm based on scaling by majorizing a complicated function(SMACOF) was employed to effectively eliminate the influence of incomplete link observation on localization accuracy. Compared with the currently available advanced algorithms, the proposed TLM-vMDS algorithm achieves higher localization accuracy and faster convergence for a cluster of extensively networked munitions, and also offers better numerical stability and robustness for highspeed motion models.

无线Ad hoc网络路由技术研究与应用分析

给出Ad hoc网络路由协议的分类,分析经典的路由算法在不同场景中的应用,并进行了性能比较,开展Ad hoc网络路由接口技术研究和分析。

Critical Nodes Identification: A Non-Cooperative Method for Unknown Topology Information in Ad Hoc Networks

The foundation of ad hoc networks lies in the guarantee of continuous connectivity.However,critical nodes,whose failure can easily destroy network connectivity,will influence the ad hoc network connectivity significantly.To protect the network efficiently,critical nodes should be identified accurately and rapidly.Unlike existing critical node identification methods for unknown topology that identify critical nodes according to historical information,this paper develops a critical node identification method to relax the prior topology information condition about critical nodes.Specifically,we first deduce a theorem about the minimum communication range for a node through the number of nodes and deployment ranges,and prove the universality of the theorem in a realistic two-dimensional scenario.After that,we analyze the relationship between communication range and degree value for each node and prove that the greater number of nodes within the communication range of a node,the greater degree value of nodes with high probability.Moreover,we develop a novel strategy to improve the accuracy of critical node identification without topology information.Finally,simulation results indicate the proposed strategy can achieve high accuracy and low redundancy while ensuring low time consumption in the scenarios with unknown topology information in ad hoc networks.

Mobility Aware Zone-Based Routing in Vehicle Ad hoc Networks Using Hybrid Metaheuristic Algorithm

Vehicle Ad hoc Networks(VANETs)have high mobility and a rando-mized connection structure,resulting in extremely dynamic behavior.Several challenges,such as frequent connection failures,sustainability,multi-hop data transfer,and data loss,affect the effectiveness of Transmission Control Protocols(TCP)on such wireless ad hoc networks.To avoid the problem,in this paper,mobility-aware zone-based routing in VANET is proposed.To achieve this con-cept,in this paper hybrid optimization algorithm is presented.The hybrid algo-rithm is a combination of Ant colony optimization(ACO)and artificial bee colony optimization(ABC).The proposed hybrid algorithm is designed for the routing process which is transmitting the information from one place to another.The optimal routing process is used to avoid traffic and link failure.Thefitness function is designed based on Link stability and Residual energy.The validation of the proposed algorithm takes solution encoding,fitness calculation,and updat-ing functions.To perform simulation experiments,NS2 simulator software is used.The performance of the proposed approach is analyzed based on different metrics namely,delivery ratio,delay time,throughput,and overhead.The effec-tiveness of the proposed method compared with different algorithms.Compared to other existing VANET algorithms,the hybrid algorithm has proven to be very efficient in terms of packet delivery ratio and delay.

基于中继节点的多跳CR Ad Hoc网络广播算法

针对避免广播冲突的CR Ad Hoc网络的分布式广播协议广播成功率低和基于选择性广播信道集的低延迟广播算法广播冲突率高的问题,提出基于中继节点选择的多跳CR Ad Hoc网络广播算法。根据节点可用信道集的大小和基于邻居度的转发概率选取中继节点,并对相应中继节点的可用信道集随机左移,在保证一定广播成功率、广播时延和广播冲突率的前提下,降低节点转发率,减少网络中的冗余信息;建立综合评价函数对广播算法的综合性能进行了定量分析;给出广播冲突概率推导。仿真结果表明,该算法与分布式广播协议相比,提高了广播成功率,降低了广播时延;与低延迟广播算法相比,降低了节点转发率和广播冲突概率。根据综合评价函数,该广播算法的综合性能更好。

Ad hoc网络体系结构研究

Adhoc网络是一种有特殊用途的对等式网络,具有无中心、自组织、可快速展开、可移动等特点,这些特点使得它在战场、救灾等特殊场合的应用日渐受到人们的重视。本文首先分析了Adhoc网络的特点和对协议的特殊需求 ,然后对网络结构和路由协议作了详细的分析和讨论 ,并得出了网络分级化趋势的论断和使用混合式路由协议的建议。

基于现场可编程逻辑门阵列的多优先级改进型载波感知多址协议在Ad Hoc网络中的实现和性能

Ad Hoc网络因为无需架设网络设施、抗毁性强等特点,常用于军事领域和一些极端自然环境中。媒体访问控制层的随机多址协议在Ad Hoc网络中有着重要的应用,而多址协议的时延和可靠性是制约Ad Hoc网络传输质量的关键性因素。针对这两个关键性因素,改进传统的随机多址接入控制协议,设计改进型三维概率载波感知多址(CSMA)协议模型,可保证在到达率较高情况下依然具有较好的吞吐量,并进一步改善协议可靠性。为不同的发送节点设定不同的优先级,实现区分服务,进而增强信道资源的有效利用。结果表明:与传统的1坚持CSMA协议比较,改进型三维概率CSMA协议减少了时延且吞吐量最大值增长24.34%;根据协议原理设计基于现场可编程逻辑门阵列的多优先级改进型三维概率CSMA协议的硬件系统,可以提高Ad Hoc网络传输的可靠性。

基于马尔可夫链的军用Ad hoc网络可用性建模

军用通信网络的规模和复杂程度日益扩大,迫切需要一种高可用性网络来满足用户对高可靠服务的需求,而网络可用性的定量研究,对战术通信网络可靠性能评估具有重要意义。针对战术Ad hoc网络的移动和故障因素,建立了基于马尔可夫链的网络可用性模型,通过分析带有冲突避免的载波侦听多路访问传输机制,研究影响网络业务主要因素的延时模型。在此模型基础上,根据统计学原理,提出一种基于故障的移动Ad hoc网络业务可用性定量评估模型。以某典型陆军战术分队通信网为例,分析了网络可用度与节点个数、传输速率、报文长度等核心指标的关系,通过仿真验证了分析结果的有效性。

一种基于深度Q学习的移动Ad Hoc路由协议

针对认知无线电-移动Ad Hoc网络,提出基于深度Q学习的移动Ad Hoc路由协议(DQRM)。DQRM路由先利用节点的剩余能量以及移动速度计算成本,再利用深度Q学习计算节点的Q值。在发现路由阶段时,源节点从邻居节点中选择具有最低Q值的节点传输RREQ包;利用单播方式传输RREQ包发现路由,降低了控制开销;目的节点收到RREQ包,沿着传输RREQ包的路径向源节点回复RREP包。仿真结果表明,提出的DQRM路由降低了控制开销,并提高了数据包传递率。