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.

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.

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.

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.

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.

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.

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.

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 quality of service routing protocol based on mobility prediction in mobile ad hoc networks

A QoS routing protocol based on mobility prediction is proposed. The protocol selects the steadiest path based on mobility prediction and QoS requirements on bandwidth, delay, and so forth. The main properties of the protocol as follows. (1) Each node just broadcasts its own information, so the packet is very small and can get to the destination in a very short time. (2) When another path is built for the same QoS requirements, the original path has higher priority. (3) The update messages are reduced by using mobility prediction. (4) Data packets carry the information of link change using piggyback, which is helpful for forecasting the link status more accurately. (5) When source node gets Resource Reserve and reconnect packets at the same time, it selects reconnect packet over Resource Reserve packet. The results of simulation show that the protocol has good network performance with low control overload, and efficiently supports transmitting multimedia with QoS requirements in mobile ad hoc networks.

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.

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.

Anonymous multipath routing protocol based on secret sharing in mobile ad hoc networks

Because the intrinsic characteristics of mobile ad hoc networks（MANETs） cause several vulnerabilities,anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns.Until recently,lots of anonymous routing protocols have been proposed.However,most of them are single path or use one path at a time,and the multipath schemes can not thwart both the passive attacks and active attacks simultaneously.Thus an anonymous multipath routing protocol based on secret sharing is proposed.The protocol provides identity anonymity,location anonymity,data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process.Meanwhile,a hash function is introduced to detect active attacks in the data transmission process.The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks（such as interception and physical destroy attacks）.Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.

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.

Joint channel assignment and cross-layer routing protocol for multi-radio multi-channel Ad Hoc networks

To study multi-radio multi-channel （MR-MC） Ad Hoc networks based on 802.11, an efficient cross-layer routing protocol with the function of joint channel assignment, called joint channel assignment and cross-layer routing （JCACR）, is presented. Firstly, this paper introduces a new concept called channel utilization percentage （CUP）, which is for measuring the contention level of different channels in a node’s neighborhood, and deduces its optimal value for determining whether a channel is overloaded or not. Then, a metric parameter named channel selection metric （CSM） is designed, which actually reffects not only the channel status but also corresponding node’s capacity to seize it. JCACR evaluates channel assignment by CSM, performs a local optimization by assigning each node a channel with the smaller CSM value, and changes the working channel dynamically when the channel is overloaded. Therefore, the network load balancing can be achieved. In addition, simulation shows that, when compared with the protocol of weighted cumulative expected transfer time （WCETT）, the new protocol can improve the network throughput and reduce the end-to-end average delay with fewer overheads.

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.

An Ant Colony Algorithm Based Congestion Elusion Routing Strategy for Mobile Ad Hoc Networks

A critical challenge for mobile ad hoc networks is the design of efficient routing protocols which are able to provide high bandwidth utilization and desired fairness in mobile wireless environment without any fixed communication establishments. Although extensive efforts have already been devoted to providing optimization based distributed congestion elusion strategy for efficient bandwidth utilization and fair allocation in both wired and wireless networks,a common assumption therein is the fixed link capacities,which will unfortunately limit the application scope in mobile ad hoc networks where channels keep changing. In this paper,an effective congestion elusion strategy is presented explicitly based on ant colony algorithm for mobile ad hoc networks, which will explore the optimal route between two nodes promptly,meanwhile forecast congestion state of the link. Accordingly,a new path will be found rapidly to have the flow spread around to relieve the congestion degree. Compared with OLSR,the strategy proposed will greatly reduce the packet loss ratio and the average end-to-end delay at the same time,which illustrate that it will make use of networking resource effectively.

An Energy Based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks

In recent years,with the rapid development of the Internet and wireless communication technology,wireless Ad hoc networks have received more attention.Due to the limited transmission range and energy of nodes in Ad hoc networks,it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks.This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol,which has the following two aspects of improvement:(1)In the route discovery process,a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a“Mark”bit that representing remaining energy of a node.(2)Based on(1),a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively.Simulation results demonstrate that compared with AODV and other existing routing protocols,proposed algorithm can reduce network energy consumption and balance node energy,thus extending the network lifetime.

Relay movement control for maintaining connectivity in aeronautical ad hoc networks

As a new sort of mobile ad hoc network(MANET), aeronautical ad hoc network(AANET) has fleet-moving airborne nodes(ANs) and suffers from frequent network partitioning due to the rapid-changing topology. In this work, the additional relay nodes(RNs) is employed to repair the network and maintain connectivity in AANET. As ANs move, RNs need to move as well in order to re-establish the topology as quickly as possible. The network model and problem definition are firstly given, and then an online approach for RNs' movement control is presented to make ANs achieve certain connectivity requirement during run time. By defining the minimum cost feasible moving matrix(MCFM), a fast algorithm is proposed for RNs' movement control problem. Simulations demonstrate that the proposed algorithm outperforms other control approaches in the highly-dynamic environment and is of great potential to be applied in AANET.