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.

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.

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.

Decentralized content sharing in mobile ad-hoc networks:A survey

The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range communication capabilities of smart mobile devices,the decentralized content sharing approach has emerged as a suitable and promising alternative.Decentralized content sharing uses a peer-to-peer network among colocated smart mobile device users to fulfil content requests.Several articles have been published to date to address its different aspects including group management,interest extraction,message forwarding,participation incentive,and content replication.This survey paper summarizes and critically analyzes recent advancements in decentralized content sharing and highlights potential research issues that need further consideration.

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.

基于信号方差的Ad-Hoc网络路由算法

为解决Ad-Hoc路由协议查找路径过程中,由于从源节点到目的节点的传输路径会因为某个节点移动而导致整条路径中断,造成最短路径通常不是最稳定路径问题,提出一个以信号方差为基础的路由选择方法。通过侦测到的节点间信号强度,观察其信号变动程度,当信号变动值很小时,表示该节点间的链接处于稳定的状态,较不易断线。这些稳定链接组成的路径将是一条最稳定的路径。通过实验仿真验证,利用该方法所选路由,路径的稳定度明显优于其它算法。

Ad-Hoc传感网络在智慧化露天矿山的应用

阐述了智慧化露天矿山的含义、标准,分析了智慧化露天矿的模块架构;以无线Ad-Hoc技术为载体对模块架构进行设计,利用无线传感网络对矿山进行实时感知、管理及控制。结果表明:无线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.

A Self-Adaptive Back-off Optimization Scheme Based on Beacons Probability Prediction for Vehicle Ad-Hoc Networks

In order to improve the broadcast reception rates of beacon messages in vehicle ad-hoc networks,a conclusion that the relationship between collision probability and minimum contention window size and the relationship between expiration probability and minimum window size was reached by building a Markov model. According to this conclusion, a back-off algorithm based on adjusting the size of minimum contention window called CEB is proposed, and this algorithm is on the basis of the differential size between the number of expiration beacons and preset threshold. Simulations were done to compare the performance of CEB with that of RBEB and BEB, and the results show that the performance of the new proposed algorithm is better than that of RBEB and BEB.

Software Defined Networking Based On-Demand Routing Protocol in Vehicle Ad-Hoc Networks

This paper comes up with a SDN Based Vehicle Ad-Hoc On-Demand Routing Protocol(SVAO),which separates the data forwarding layer and network control layer,as in software defined networking(SDN),to enhance data transmission efficiency within vehicle ad-hoc networks(VANETs).The roadside service unit plays the role of local controller and is in charge of selecting vehicles to forward packets within a road segment.All the vehicles state in the road.Correspondingly,a two-level design is used.The global level is distributed and adopts a ranked query scheme to collect vehicle information and determine the road segments along which a message should be forwarded.On the other hand,the local level is in charge of selecting forwarding vehicles in each road segment determined by the global level.We implement two routing algorithms of SVAO,and compare their performance in our simulation.We compare SVAO with popular ad-hoc network routing protocols,including Optimized Link State Routing(OLSR),Dynamic Source Routing(DSR),Destination Sequence Distance Vector(DSDV),and distance-based routing protocol(DB)via simulations.We consider the impact of vehicle density,speed on data transmission rate and average packet delay.The simulation results show that SVAO performs better than the others in large-scale networks or with high vehicle speeds.

Cognitive Radio Ad-Hoc Networks: Some New Results on Multi-Channel Hidden Terminal Problem

Recently the Cognitive Radio (CR), in particular the CR Ad-Hoc Network (CRAHN) technology appears as a burgeoning area in wireless communication that enables utilization of limited network resources in more efficient and intelligent way;studies indicate that opportunistic utilization of the available radio frequency spectrum, without interfering the licensed primary user (PU) could be made. This paper presents some simulation based performance of the Multi-Channel Hidden Terminal (MCHT) problem on CRAHNs;new observations on the effect of the number of channels on certain PU-activity metrics, e.g., delay and throughput, are described.

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.

Geo-Social Profile Matching Algorithm for Dynamic Interests in Ad-Hoc Social Network

Among mobile users, ad-hoc social network (ASN) is becoming a popular platform to connect and share their interests anytime anywhere. Many researchers and computer scientists investigated ASN architecture, implementation, user experience, and different profile matching algorithms to provide better user experience in ad-hoc social network. We emphasize that strength of an ad-hoc social network depends on a good profile-matching algorithm that provides meaningful friend suggestions in proximity. Keeping browsing history is a good way to determine user’s interest, however, interests change with location. This paper presents a novel profile-matching algorithm for automatically building a user profile based on dynamic GPS (Global Positing System) location and browsing history of users. Building user profile based on GPS location of a user provides benefits to ASN users as this profile represents user’s dynamic interests that keep changing with location e.g. office, home, or some other location. Proposed profile-matching algorithm maintains multiple local profiles based on location of mobile device.

基于动态离散模型的机场ADS-B攻击威胁影响研究

随着航空业信息技术的发展,空中交通管制系统面临着多种网络攻击的威胁。广播式自动相关监视(ADS-B)系统因其明文广播的数据传输方式,存在着被网络攻击的安全问题。依据“等待降落-降落-停泊-排队起飞-起飞”的航班运行全流程,建立了WLPQD动态离散模型,研究机场流量和航班延误。模型引入了系统冗余能力、处理速率等参数,模拟了攻击场景;通过受影响飞机数量和延误时间等指标研究了机场航班延误的传播影响。模型展示了ADS-B消息注入攻击对降落、起飞航班造成的延误,提出了两种攻击缓解方法。结果表明,延误规模的大小与攻击强度呈现正相关,且攻击对起飞航班的延误影响更大;提升对“幽灵飞机”和合法飞机的处理速率都可提升机场系统的抗毁性,但前者对提升机场系统冗余能力的效果更加显著。所做研究为机场系统抵御网络攻击、增强抗毁性提供了决策分析的参考依据。

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.

面向大规模飞行自组网的NBATMAN-ADV路由协议

飞行自组网是当前研究的热点,当无人机节点规模较大时,大量的路由开销可能会导致网络瘫痪,因此路由协议的设计具有挑战性。针对大规模无人机场景,首先提出利用统一连通支配集算法构建虚拟骨干网,目的是减少路由洪泛的节点数;其次在骨干节点上部署和运行NBATMAN-ADV路由协议,利用物理层数据的接收信号强度指标和信噪比评价链路质量,在减少路由开销的同时,能够快速感知链路的变化情况。仿真结果表明,较传统的先验式路由协议如优化链路状态路由和目的节点序列距离矢量,该路由协议在数据包交付率、端到端时延和吞吐量上均有明显的提升。在通信模块上的实验结果表明,该路由协议在多跳时延方面有较好的性能。

基于MPR算法的Ad-Hoc网络多跳语音通信方案设计

针对语音通信的实时性特点,在50 kHz带宽的超短波(Very High Frequency,VHF)通信信道上采用动态时分复用接入、高压缩语音编码方式,基于多点中继(Multipoint Relaying,MPR)广播协议的Ad-Hoc网络,提出一种低延时高覆盖率的多跳语音广播通信方案,以满足应急、户外探险以及军用班排级团队的无线通信需求。

A Two-Step Authentication Framework in Mobile Ad-Hoc Networks

The lack of fixed infrastructure in ad hoc networks causes nodes to rely more heavily on peer nodes for communication.Nevertheless,establishing trust in such a distributed environment is very difficult, since it is not straightforward for a node to determine if its peer nodes can be trusted.An additional concern in such an environment is with whether a peer node is merely relaying a message or if it is the originator of the message.In this paper,we propose an authentication approach for protecting nodes in mobile ad hoc networks.The security requirements for protecting data link and network layers are identified and the design criteria for creating secure ad hoc networks using several authentication protocols are analyzed.Protocols based on zero knowledge and challenge response techniques are presented and their performance is evaluated through analysis and simulation.

Dynamic Encryption Technology in Ad-hoc Networks

A new dynamic encryption application in ad-hoc networks is proposed. The advantages of this method are its being able to use the previous ciphertext as a seed of a new encryption process, rendering the encryption process effective in all communication process by continuous dynamic key generation together with synchronization, and its capability to cut back on system bandages to a greater extent, which is valuable for the ad-hoc circumstance. In addition, the rationality and effectiveness of this novel encryption method have been verified by the test results.

Joint routing and rate allocation for multiple video streams in ad-hoc wireless networks

The support for multiple video streams in an ad-hoc wireless network requires appropriate routing and rate allocation measures ascertaining the set of links for transmitting each stream and the encoding rate of the video to be delivered over the chosen links. The routing and rate allocation procedures impact the sustained quality of each video stream measured as the mean squared error (MSE) distortion at the receiver, and the overall network congestion in terms of queuing delay per link. We study the trade-off between these two competing objectives in a convex optimization formulation, and discuss both centralized and dis- tributed solutions for joint routing and rate allocation for multiple streams. For each stream, the optimal allocated rate strikes a balance between the selfish motive of minimizing video distortion and the global good of minimizing network congestions, while the routes are chosen over the least-congested links in the network. In addition to detailed analysis, network simulation results using ns-2 are presented for studying the optimal choice of parameters and to confirm the effectiveness of the proposed measures.