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.

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.

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.

A distributed on-demand bandwidth-constrained multicast routing protocol for wireless ad hoc networks

To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.

Mobile Ad Hoc Network与Internet互联的技术研究

分析了移动IP和AODV协议的工作机理,对MANET与Internet互联的关键技术,包括协议转换、地址分配、网关发现、路由发现与数据传输等问题进行了详细的讨论,并对今后的研究工作进行了展望。

Adaptive and distance-driven power control scheme in mobile ad hoc networks

In order to save the energy and reduce the latency of the end-to-end transmission in mobile ad hoc networks an adaptive and distance-driven power control ADPC scheme is proposed by means of distance research in random geometrics. Through mathematical proof the optimal number of relay nodes and the optimal location of each node for data transmission can be obtained when a distance is given.In the ADPC first the source node computes the optimal number and the sites of the relay nodes between the source and the destination nodes.Then it searches feasible relay nodes around the optimal virtual relay-sites and selects one link with the minimal total transmission energy consumption for data transmission.Simulation results show that the ADPC can reduce both the energy dissipation and the end-to-end latency of the transmission.

Wireless ad hoc video transmission:a Bayesian network-based scheme

A novel bandwidth prediction and control scheme is proposed for video transmission over an ad boc network. The scheme is based on cross-layer, feedback, and Bayesian network techniques. The impacts of video quality are formulized and deduced. The relevant factors are obtained by a cross-layer mechanism or Feedback method. According to these relevant factors, the variable set and the Bayesian network topology are determined. Then a Bayesian network prediction model is constructed. The results of the prediction can be used as the bandwidth of the mobile ad hoc network （MANET）. According to the bandwidth, the video encoder is controlled to dynamically adjust and encode the right bit rates of a real-time video stream. Integrated simulation of a video streaming communication system is implemented to validate the proposed solution. In contrast to the conventional transfer scheme, the results of the experiment indicate that the proposed scheme can make the best use of the network bandwidth; there are considerable improvements in the packet loss and the visual quality of real-time video.K

Improved approach to enhanced Internet connectivity for mobile ad hoc networks

An improved internetworking approach is proposed to enhance the Internet connectivity which is deteriorated due to unidirectional links and blind rebroadcasting of gateway discovery packets for mobile ad hoc networks. The hybrid gateway discovery scheme that combined the advantages of a proactive and reactive gateway discovery approach is used to achieve high connectivity while keeping overhead costs low. By exchanging ad hoc on-demand distance vector （AODV） hello packet which includes additional fields named symmetric neighbor list and asymmetric neighbor list, unidirectional links are removed from route computation and broadcast storm can also be relieved simultaneously. Performance results using ns-2 simulations, under varying numbers of unidirectional links and node speeds, show that this improved Internet connectivity approach can provide better performance than others.

Performance analysis in 3G/ad hoc integrated network

An analytical approach to evaluate the performance of the 3G/ad hoc integrated network is presented. A channel model capturing both path loss and shadowing is applied to the analysis so as to characterize power falloff vs. distance. The 3G/ad hoc integrated network scenario model is introduced briefly. Based on this model, several performances of the 3G/ ad hoc integrated network in terms of outage probability, call dropping probability and new call blocking probability are evaluated. The corresponding performance formulae are deduced in accordance with the analytical models. Meanwhile, the formula of the 3G/ad hoc integrated network capacity is deduced on the basis of the formula of the outage probability. It is observed from extensive simulation and numerical analysis that the 3G/ad hoc integrated network remarkably outperforms the 3G network with regards to the network performance. This derived evaluation approach can be applied into planning and optimization of the 3G/ad hoc network.

On-demand QoS routing protocol based on energy and bandwidth requirement in Ad Hoc networks

Along with the emergence of real-time multi-media,interactive service,real-time voice and other services calling for high quality of service,there should be a good network to support those services.Most present route algo- rithms with computational complexity hardly consider the restriction of node energy,so it degrades the whole capabil- ity of network.Bandwidth guarantee is one of the most crucial factors in real-time application,and this paper brings forward a distributed on-demand QoS routing protocol based on energy and bandwidth requirement.This QoS routing protocol makes use of bandwidth calculation algorithm and analyzes its route mechanism.The simulation results veri- fy its validity.The QoS routing protocol improves the packet delivery fraction and average end-to-end delay,prolongs the network lifetime,enhances the network performance and satisfies the route requirement for ad hoc networks.

面向Ad-Hoc协作的局部观测重建方法

在多智能体强化学习的研究中,如何进行Ad-Hoc协作,也就是说如何适应种类和数量变化的队友,是一个关键问题。现有方法或者有很强的先验知识假设,或者使用硬编码的规则进行合作,缺乏通用性,无法泛化到更一般的Ad-Hoc协作场景。为解决该问题,提出一种面向Ad-Hoc协作的局部观测重建算法,利用注意力机制和采样网络对局部观测进行重建,使得算法认识到并充分利用不同局面中的高维状态表征,实现了在Ad-Hoc协作场景下的零样本泛化。在星际争霸微操环境和Ad-Hoc协作场景上与代表性算法的性能进行对比与分析,验证了算法的有效性。

Distributed intrusion detection for mobile ad hoc networks

Mobile ad hoc networking （MANET） has become an exciting and important technology in recent years, because of the rapid proliferation of wireless devices. Mobile ad hoc networks is highly vulnerable to attacks due to the open medium, dynamically changing network topology, cooperative algorithms, and lack of centralized monitoring and management point. The traditional way of protecting networks with firewalls and encryption software is no longer sufficient and effective for those features. A distributed intrusion detection approach based on timed automata is given. A cluster-based detection scheme is presented, where periodically a node is elected as the monitor node for a cluster. These monitor nodes can not only make local intrusion detection decisions, but also cooperatively take part in global intrusion detection. And then the timed automata is constructed by the way of manually abstracting the correct behaviours of the node according to the routing protocol of dynamic source routing （DSR）. The monitor nodes can verify the behaviour of every nodes by timed automata, and validly detect real-time attacks without signatures of intrusion or trained data. Compared with the architecture where each node is its own IDS agent, the approach is much more efficient while maintaining the same level of effectiveness. Finally, the intrusion detection method is evaluated through simulation experiments.

Self-Organized Public-Key Management for Mobile Ad Hoc Networks Based on a Bidirectional Trust Model

In traditional networks , the authentication is performed by certificate authoritys（CA）,which can＇t be built in distributed mobile Ad Hoc Networks however. In this pa per, we propose a fully self-organized public key management based on bidirectional trust model without any centralized authority that allows users to generate their public-private key pairs, to issue certificates, and the trust relation spreads rationally according to the truly human relations. In contrast with the traditional self-organized public-key management, the average certificates paths get more short, the authentication passing rate gets more high and the most important is that the bidirectional trust based model satisfys the trust re quirement of hosts better.

Secure and efficient multi-message and multi-receiver ID-based signcryption for rekeying in ad hoc networks

In this paper, the security technology of ad hoc networks is studied.To improve the previous multi-receiver signcryption schemes, an ID-based multi-message and multi-receiver signcryption scheme for rekeying in ad hoc networks is proposed.In this scheme, a sender can simultaneously signcrypt n messeges for n receivers, and a receiver can unsigncrypt the ciphertext to get his message with his own private key.An analysis of this scheme indicates that it achieves authenticity and confidentiality in the random oracle model while being of lower computation and communication overhead.Finally, for the application of our scheme in ad hoc, a threshold key updating protocol for ad hoc networks is given.

Performance of beacon safety message dissemination in Vehicular Ad hoc NETworks (VANETs)

Currently, there is a growing belief that putting an IEEE 802.11-like radio into road vehicles can help the drivers to travel more safely. Message dissemination protocols are primordial for safety vehicular applications. There are two types of safety messages which may be exchanged between vehicles: alarm and beacon. In this paper we investigate the feasibility of deploying safety applications based on beacon message dissemination through extensive simulation study and pay special attention to the safety requirements. Vehicles are supposed to issue these messages periodically to announce to other vehicles their current situation and use received messages for preventing possible unsafe situations. We evaluate the performance of a single-hop dissemination protocol while taking into account the quality of service (QoS) metrics like delivery rate and delay. We realize that reliability is the main concern in beacon message dissemination. Thus, a new metric named effective range is defined which gives us more accurate facility for evaluating QoS in safety applications specifically. Then, in order to improve the performance, the effects of three parameters including vehicle's transmission range, message transmission's interval time and message payload size are studied. Due to special characteristics of the safety applications, we model the relationship between communication-level QoS and application-level QoS and evaluate them for different classes of safety applications. As a conclusion, the current technology of IEEE 802.11 MAC layer has still some challenges for automatic safety applications but it can provide acceptable QoS to driver assistance safety applications.

Energy Based Ultra-Wideband Multipath Routing Algorithm in Ad Hoc Sensor Networks

The Energy based Ultra-Wideband Multipath Routing(EUMR) algorithm for Ad hoc sensor network is proposed. It utilizes the function of UWB positioning to reduce the network communication delay and route overhead. Furthermore,the algorithm considers energy consumption,the residual energy and node hops of communication paths to make energy consumption more balanced and extend the network lifetime. Then routing which is stable,energy-saving and low-delay is realized. Simulation results show that the algorithm has better performance on saving energy,route overhead,stability and extending network lifetime.

A Dynamic Protocol Stack Structure for Diversified QoS Requirements in Ad Hoc Network

A dynamic protocol stack(DPS) for ad hoc networks, together with a protocol stack construction scheme that is modeled as a multiconstrained knapsack problem is proposed. Compared to the traditional static protocol stack, DPS operates in a dynamic and adaptive manner and is scalable to network condition changes. In addition, a protocol construction algorithm is proposed to dynamically construct of the protocol stack each network node. Simulation results show that, the processing and forwarding performance of our scheme is close to 1 Gb/s, and the performance of our algorithm is close to that of the classical algorithms with much lower complexity.

An Adaptive Scheme for Neighbor Discovery in Mobile Ad Hoc Networks

The neighbor knowledge in mobile ad hoc networks is important information. However, the accuracy of neighbor knowledge is paid in terms of energy consumption. In traditional schemes for neighbor discovery, a mobile node uses fixed period to send HELLO messages to notify its existence. An adaptive scheme was proposed. The objective is that when mobile nodes are distributed sparsely or move slowly, fewer HELLO messages are needed to achieve reasonable accuracy, while in a mutable network where nodes are dense or move quickly, they can adaptively send more HELLO messages to ensure the accuracy. Simulation results show that the adaptive scheme achieves the objective and performs effectively.

Reliable adaptive multicast protocol in wireless Ad hoc networks

In wireless ad hoe network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multicast in wireless ad hoe network is a difficult issue. It is a major challenge to transmission delays and packet losses due to link changes of a multicast tree at the provision of high delivery ratio for each packet transmission in wireless ad hoe network environment. In this paler, we propose and evaluate Reliable Adaptive Multicast Protocol （RAMP） based on a relay node concept. Relay nodes are placed along the multieast tree. Data recovery is done between relay nodes. RAMP supports a reliable multicasting suitable for mobile ad hoe network by reducing the number of packet retransmissions. We compare RAMP with SRM （Scalable Reliable Multicast）. Simulation results show that the RAMP has high delivery ratio and low end-to-end delay for packet transmsission.

Flooding attack and defence in Ad hoc networks

Mobile ad hoc networks are particularly vulnerable to denial of service （DOS） attacks launched through compromised nodes or intruders. In this paper, we present a new DOS attack and its defense in ad hoc networks. The new DOS attack, called AA hoc Flooding Attack（AHFA）, is that intruder broadcasts mass Route Request packets to exhaust the communication bandwidth and node resource so that the valid communication can not be kept. After analyzed AM hoc Flooding Attack, we develop Flooding Attack Prevention （FAP）, a genetic defense against the AM hoc Flooding Attack. When the intruder broadcasts exceeding packets of Route Request, the immediate neighbors of the intruder record the rate of Route Request. Once the threshold is exceeded, nodes deny any future request packets from the intruder. The results of our implementation show FAP can prevent the AM hoe Flooding attack efficiently.