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.

Component based ant routing protocols analysis over mobile ad hoc networks

To deeply exploit the mechanisms of ant colony optimization （ACO） applied to develop routing in mobile ad hoe networks （MANETS）,some existing representative ant colony routing protocols were analyzed and compared.The analysis results show that every routing protocol has its own characteristics and competitive environment.No routing protocol is better than others in all aspects.Therefore,based on no free lunch theory,ant routing protocols were decomposed into three key components：route discovery,route maintenance （including route refreshing and route failure handling） and data forwarding.Moreover,component based ant routing protocol （CBAR） was proposed.For purpose of analysis,it only maintained basic ant routing process,and it was simple and efficient with a low overhead.Subsequently,different mechanisms used in every component and their effect on performance were analyzed and tested by simulations.Finally,future research strategies and trends were also summarized.

Geographic Drone-based Route Optimization Approach for Emergency Area Ad-Hoc Network

Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,localization,heterogeneous network,self-organization,and self-sufficient operation.In this background,the current study focuses on specially-designed communication link establishment for high connection stability of wireless mobile sensor networks,especially in disaster area network.Existing protocols focus on location-dependent communications and use networks based on typically-used Internet Protocol(IP)architecture.However,IP-based communications have a few limitations such as inefficient bandwidth utilization,high processing,less transfer speeds,and excessive memory intake.To overcome these challenges,the number of neighbors(Node Density)is minimized and high Mobility Nodes(Node Speed)are avoided.The proposed Geographic Drone Based Route Optimization(GDRO)method reduces the entire overhead to a considerable level in an efficient manner and significantly improves the overall performance by identifying the disaster region.This drone communicates with anchor node periodically and shares the information to it so as to introduce a drone-based disaster network in an area.Geographic routing is a promising approach to enhance the routing efficiency in MANET.This algorithm helps in reaching the anchor(target)node with the help of Geographical Graph-Based Mapping(GGM).Global Positioning System(GPS)is enabled on mobile network of the anchor node which regularly broadcasts its location information that helps in finding the location.In first step,the node searches for local and remote anticipated Expected Transmission Count(ETX),thereby calculating the estimated distance.Received Signal Strength Indicator(RSSI)results are stored in the local memory of the node.Then,the node calculates the least remote anticipated ETX,Link Loss Rate,and information to the new location.Freeway Heuristic algorithm improves the data speed,efficiency and determines the path and optimization problem.In comparison with other models,the proposed method yielded an efficient communication,increased the throughput,and reduced the end-to-end delay,energy consumption and packet loss performance in disaster area networks.

Cluster-based Intrusion Detection in Wireless Ad-Hoc Networks

There are inherent vulnerabilities that are not easily preventable in the mobile Ad-Hoc networks.To build a highly secure wireless Ad-Hoc network,intrusion detection and response techniques need to be deployed;The intrusion detection and cluster-based Ad-Hoc networks has been introduced,then,an architecture for better intrusion detection based on cluster using Data Mining in wireless Ad -Hoc networks has been shown.A statistical anomaly detection approach has been used.The anomaly detection and trace analysis have been done locally in each node and possibly through cooperation with clusterhead detection in the network.

车载Ad Hoc网络中基于移动网关的数据传输

由于车载Ad hoc网络拓扑的动态变化及车载节点的快速移动,应用现有传输方法在其上进行Internet接入点向移动车辆(Infrastructure-to-Vehicle,I2V)数据传输时成功率较低,而且传输延迟高、延迟抖动大.为了解决这一问题,文中利用公交车路线固定、运行特征可预测、节点及线路分布稠密等特性,将公交车作为移动网关(Mobile Gateway,MG),提出了一种新的基于MG转发的I2V数据传输方法(Mobile Gateway based Forwarding,MGF).文中首先将公路网模型化为状态-空间图,再运用马尔可夫决策方法建立了一种基于MG转发的I2V数据传输优化模型,然后通过对模型求解得出I2V数据传输的最优转发决策,最优转发决策指的就是每个状态下对应的最优动作序列,最后在目的车辆行驶轨迹上选取满足传输成功率阈值,并使I2V传输延迟最小的路口节点作为数据包与目的车辆的最优汇聚节点,即目标节点.应用MGF方法,MG节点将以最优概率转发序列向目标节点转发数据包.文中利用模拟平台对MGF方法的传输性能进行了评估,结果表明该方法在满足传输成功率阈值前提下,能够获得最小传输延迟期望.理论分析同样也证明了该方法的有效性.

移动Ad Hoc网络中的命名服务与目录服务

命名服务与目录服务属于移动AdHoc网络(MANET)中的基础服务。目前MANET中实现命名服务的一种主要方式是通过设备的硬件地址自动生成,这种方式由于与硬件地址绑定带来了用户不友好、不便记忆、更换设备需要更换名字等缺点。提出了一种分布式的名字自动分配机制,名为NetNeighbor,可以为MANET中的移动主机提供命名服务与目录服务。仿真结果表明,系统运行稳定后NetNeighbor协议命名冲突的概率为0,有效地避免了移动主机名字冲突对数据通讯造成的影响;每个节点中保存的全局信息量达到98%,使局部存储的信息精确地反映了网络全局视图,提高了目录服务的准确率。

一种基于广播和P2P技术的移动Ad Hoc网络文件传输协议

设计可靠高效的移动Ad Hoc网络文件传输协议具有广泛的应用价值。本文综合利用了基于共享树的广播技术与P2P文件传输技术,以可靠的数据重传机制取代复杂的拥塞控制机制,提出了一种新型的文件传输协议,并对协议时延与网络开销进行了性能分析。分析表明,此协议在文件较大、请求节点较多的情况下能很好地减少协议时延,有效地降低网络开销。

Ad Hoc网中的移动数据库应用

传统的移动数据库模型应用到Ad Hoc网中,会带来通信代价增大等问题。为此,对传统的移动数据库模型进行改进,加入本地服务器作为中介,形成由移动主机、本地服务器和主服务器3类结点构成的移动数据库模型,并提出2个算法用来解决模型中本地服务器与主服务器上的数据同步和事务重做问题,从而使移动主机能够高效正确地访问数据库。实验结果证明,该移动数据库模型具有较好的稳定性。

基于自适应定向天线的移动Ad Hoc网络MAC层数据传输机制

针对移动Ad Hoc网络中定向天线引入所带来的隐藏节点、聋节点等问题,提出一种新的MAC协议——AMAC。AMAC在使用定向天线的基础上,能够使得物理层根据环境自适应调整天线参数,克服传统定向天线存在的缺陷,大幅提高网络的吞吐量及空分复用率。与同类协议相比,数据冲突、延迟、丢失等情况将被缩小到可容忍范围。

面向无人机无人船自组网的NDN智能数据转发策略

无人机和无人船组成的移动自组织网络存在通信环境恶劣和网络拓扑结构变化频繁等挑战,导致网络性能变差。针对这一问题,建立以数据为中心的命名数据网络(Named Data Networking, NDN)网络架构,在此基础上提出基于深度强化学习的智能数据转发策略。利用深度强化学习实时感知网络动态变化,优化数据转发策略,设计优先采样和双重Q网络算法,加快深度强化学习收敛速度。实验结果表明,该策略可以有效降低时延并提高兴趣包满足率。

NDMANET中基于内容优先级的缓存策略研究

多数NDMANET缓存策略研究未考虑内容的优先级,从而降低了重要内容在节点移动环境下的可用性。针对该问题,提出一种基于内容优先级的缓存替换策略PFC。根据节点内容对可用性的不同需求划分内容优先级,将其作为缓存替换的参考因子进行缓存替换决策,以提高重要内容的命中率和可用性。在ndnSIM仿真平台上的测试结果表明,相比LRU和FIFO策略,PFC策略在不影响全局命中率和响应时延的情况下,可以明显提高重要内容的缓存占比与可用性。

V2V Online Data Offloading Method Based on Vehicle Mobility

As people are accustomed to getting information in the vehicles,mobile data offloading through Vehicular Ad Hoc Networks(VANETs)becomes prevalent nowadays.However,the impacts caused by the vehicle mobility(such as the relative speed and direction between vehicles)have great effects on mobile data offloading.In this paper,a V2V online data offloading method is proposed based on vehicle mobility.In this mechanism,the network service process was divided into continuous and equal-sized time slots.Data were transmitted in a multicast manner for the sake of fairness.The data offloading problem was formalized to maximize the overall satisfaction of the vehicle users.In each time slot,a genetic algorithm was used to solve the maximizing problem to obtain a mobile data offloading strategy.And then,the performance of the algorithm was enhanced by improving the algorithm.The experiment results show that vehicle mobility has a great effect on mobile data offloading,and the mobile data offloading method proposed in the paper is effective.

移动数据分流研究综述

移动数据分流(Mobile Data Offloading)是近年来一个比较新的研究热点。为了解决用户日益增长的移动数据需求给蜂窝网络运营商造成的流量负载和网络拥塞等问题,移动数据分流被提出来,即将蜂窝网络的数据分流到无处不在的用户间本地机会通信。其基本思想是通过蜂窝网络分发数据对象到一部分订阅用户(称为种子用户),再由种子用户通过本地机会通信(如Bluetooth、WiFi Direct、DSRC、Device-to-Device in LTE等)或基于WiFi AP辅助的方式传送给其他订阅的用户。首先从总体上概述了当前对数据分流研究的背景、意义和具体的研究进展。然后针对当前国内外学术界对这方面的研究内容和趋势,按照形式和技术路线对数据分流的方案进行了归类,并对各种类型的分流方案进行了综述。最后结合现实环境进行总结。

基于移动云服务的车联网数据上传策略

传统的基于专用短程通信(dedicated short range communication,DSRC)的车载网络(vehicular ad hoc network,VANET)通信架构难以满足车联网数据传输的服务质量(quality of service,QoS)需求,通过移动网关将数据上传至服务器,由服务器决策传输给目标车辆,可以扩大数据广播域,极大减少数据远程传输时延.结合移动云服务的思想,提出了一种新的车联网架构和数据传输方法.首先给出了网关服务者(gateway server,GWS)向云端注册服务信息的具体流程;其次提出了一种云端服务网关选取方法,该方法结合云端的历史数据和实时数据,动态决定参与服务的网关服务者及其服务范围,网关消费者(gateway consumer,GWC)在获取服务广播消息后,综合考虑通信负载、链路稳定度、信道质量等性能参数来选出最优的网关服务者,并将数据传输给网关服务者,再由其上传到云端;最后在OMNeT++实验环境下,针对不同的交通场景,对该方法传输性能进行了评估.结果表明该方法获得较低传输延迟的同时,能够保证较高的传输成功率,理论分析也证明了该方法的有效性.

基于命名数据网络的车载自组织网络数据分发机制

车载自组织网络(VANET)是一个高度动态的通信网络,设计稳定的数据分发机制是一个很大的挑战。将关注数据内容的命名数据网络(NDN)应用于车载自组织网络中,能有效缓解网络拓扑频繁变化所带来的问题。首先,优化命名数据网络的消息类型和数据结构;然后,结合车载自组织网络的特性,提出根据路段建立路由的方式,减少数据分发的开销。仿真实验结果表明,所提出的基于命名数据网络的车载自组织网络数据分发机制与应用于车载自组织网络数据分发的传统命名数据网络算法对比,数据转发平均命中率(AHR)提高大约53个百分点,平均转发次数减少大约0.4。因此提出的基于命名数据网络的车联网数据分发机制,采用新的路由方式,能够提高数据分发效率。

面向车载自组织网络路由的轨迹预测算法

在车载自组织网络(vehicular ad hoc network,VANET)(也称车联网)中,基于地理位置的路由协议能够较好地适应网络拓扑的动态性变化和链路质量的不稳定性.由于位置信息需要在邻居节点间采用信标分组进行交互,信标分组间隔内的转发决策可能因车辆节点位置的移动而不准确,需要进行位置预测来修正车辆节点的位置.已有的位置预测算法存在普适性差或预测误差大的问题.针对上述问题,提出了一种新的预测算法,首次通过测量得到车辆加速度服从正态分布的结论,利用线性回归进行预测,并采用反馈机制进行结果修正.利用真实车辆轨迹进行测试,新的预测算法的预测精度大为提高.然后,提出了一种新的基于位置的即时路由协议.在该协议中,发送节点利用邻居节点位置和目的节点位置计算出转发下一跳.将新的位置预测算法加入到即时路由协议中,实时预测和更新车辆的位置.利用SUMO软件生成了基于真实地图道路轨迹的车辆运动模型,结合NS3网络仿真平台进行了仿真实验.实验结果表明:采用新的预测算法后,相比传统的GPSR协议和不带预测的即时路由协议,新方法的收包率提高、延迟下降,并且协议开销显著降低.

MANET中基于延时响应的乱序数据包处理算法

在MANET中,节点的移动性会导致在接收端产生大量的乱序数据包,影响TCP协议的性能.提出了一种改进的TCP协议(TCP-D),通过延时触发拥塞控制算法,来提高TCP协议在MANET中的性能.对延时响应TCP协议的吞吐量分析表明,当网络中不存在乱序数据包时,改进协议可以获得类似于标准TCP协议的吞吐量,保证对标准TCP协议的友好性.仿真实验表明,在网络中存在乱序数据包的情况下,改进后的TCP算法可以获得较标准TCP协议更高的网络吞吐量,而在无乱序数据包的情况下,改进协议仍具有很好的公平性和友好性.

基于多准则决策的VNDN兴趣包转发方法

车辆命名数据网络(VNDN)是将命名数据网络(NDN)与车辆自组织网络(VANETs)有机结合起来的一种新型网络架构,其信息共享方式由传统网络的地址转变为内容.当前的VNDN网络中,车辆查找内容主要通过泛洪兴趣包的方式,会消耗较多的网络资源,造成大量延迟.针对此问题,提出了一种基于多准则决策的兴趣包转发方法,该方法借鉴TOPSIS理论优势,选择特定车辆转发兴趣包,从而有效利用了网络资源.实验结果表明:所提方法在车辆获取特定信息时,在网络时延以及丢包率方面均体现出一定优势.

官渡:一种用于命名数据MANET网络的缓存策略

针对在命名数据自组织移动网络(named data mobile ad hoc network,NDM)中,原命名数据网络(named data networking,NDN)默认的沿路径全缓存策略会占用网络节点上大量缓存空间,因而不适用于NDM中存储空间有限的移动节点问题,设计了一种适用于NDM的缓存算法,取名官渡策略,意在将最有用的内容布置在最合适的节点上响应尽可能多的兴趣包.该算法基于间隔缓存等思路,综合考虑了节点间距离、节点缓存储空间和网络缓存分布等影响因素,并尽可能地简化以便使其具有可用性.实验结果表明:官渡策略可以有效地减少缓存空间,并维持较高的应答率,代价是增加少量的网络流量和承担一部分的网络延迟.官渡缓存策略相对简单,实现开销小,因此,更适合于节点存储空间小、计算能力有限的NDM网络.

基于公交车缓存机制的移动数据分流研究

为了应对爆炸式增长的车辆流量数据和用户日益增长的应用程序需求给蜂窝网络运营商(如3G/LTE)造成的巨大的流量负载和网络拥塞等问题,当前已有很多工作提出将数据通过高容量的用户设备间通信进行分流。通过蜂窝网络分发数据对象到一部分订阅用户(称为种子用户),由种子用户通过本地机会通信的方式传送给其他订阅用户。为了最大化分流的效率,大多数的工作根据分流的对象和意义,提出了多种分流的方案,但是这些工作大都关注于种子用户的选择问题上。为了研究数据的缓存分配对分流的影响,着眼于城区VANET环境下的数据分流,根据城区多种数据异构的特性,提出利用公交车作为种子用户,通过制定数据缓存分配方案来间接完成数据分流的方案。缓存方案越好,用户命中自己想要的数据的概率就越大,分流的数据量就越多。据此,相应制定出几种贪心的缓存方案,一种启发式方案。通过大量的实验验证了启发式分配方案在分流数据量较多的情况下的优势,同时指出影响数据分流效率的几个重要参数。